Benefits of label stripping compared to label swapping from the point of node dimensioning

All-Optical Label Swapping (AOLS) is a promising packet-switching technology to accomplish the gap between router forwarding speed and fibre transmission speed. The hardware requirements from the node however are unarguable a big disadvantage of these kinds of nodes. In this paper, we present two all-optical label switching nodes. One is based on the MPLS technology and one is an alternative switching strategy for packet-switching: label stripping. We compare both node architectures in terms of hardware requirements for different switching strategies and network parameters (such as topology and number of nodes).     

A Novel All-Optical Routing Architecture for Optical Packet Switched Networks

Increasing bandwidth demand, mostly driven by the Internet Protocol (IP), has made researchers consider to deploy all-optical devices into packet switched networks. Despite huge bandwidth of the optical communication links (optical fiber) the usable capacity is limited due to bottlenecks (congestions) at the switching nodes. In this paper, a novel all-optical routing architecture is proposed for optical packet switched networks. In the design, practical optical devices (gratings, threshold elements, optical delays, and couplers) have been improved and exploited in order to integrate into an all-optical routing device. The system has been implemented and simulated by using an photonics simulation package (VPI-Virtual Photonics). The packets conveying a three-bit routing information tag at the bit rate of 10 Gbps have been successfully routed between two links. Some of the components are standard tools of the simulation package and some needed to be designed using the transfer function or theory developed in the literature. Noise and losses associated to the nonideal nature of the components are considered in the simulation as well.     

Label swapping versus label preserving in packet switched networks: Impact on the label space size

In recent years, switching and networking solutions exploiting all-optical nodes are gaining increasing interest to achieve the target of ultrawide-bandwidth and low-latency packet or burst processing. On the one hand, many prototypes, validated by experimental demonstration of all-optical label processing solutions, have been developed. On the other hand, the primitive available technology for performing label processing poses several constraints on the label structures; this in turn significantly impacts the traffic engineering aspects of such a network.In this paper, the label assignment problem is studied in a network that makes forwarding decision based on optical packet labels and formulated independently of any technology. Specifically, the problem of assigning labels to identify the label switched path (LSP) packets in a unique and disjoint way is defined, with the objective of optimally minimizing the label space size (i.e. number of labels, or bits, required to uniquely identify the LSPs). The network scenarios where (i) labels have local point-to-point significance (i.e. the label is swapped when traversing each node), and (ii) labels have end-to-end significance (i.e. the label is preserved along the LSP traversing multiple nodes) are both investigated. For both scenarios, labels can be uniquely identified at each node or at each node-port. The label assignment strategies for all the possible scenarios are investigated.Both theoretical and practical methods, i.e. integer linear programming formulations and heuristics, respectively, are used to assess the efficiency of the proposed label preserving solution. Numerical results show that, for a significant set of network topologies, the label space size increase experienced by networks with label preserving capabilities is limited or negligible in both per-node and per-port label identification.     

Multiple attack localization and identification in all-optical networks

The security characteristics of currently emerging all-optical networks display many unique features compared to traditional communication networks. In particular, network transparency raises many security vulnerabilities that differ substantially from conventional failures and should therefore be treated differently. One of the serious problems related to transparency lies in the fact that optical crosstalk is additive and can be exploited to perform service disruption attacks upon the network. Since these attacks can spread rapidly through the network, causing additional problems and triggering multiple alarms, they must be detected and identified at any point in the network where they may occur. However, to monitor all wavelength channels at several detection points into any node is likely to be very expensive. In this paper we provide formal specifications for optical crosstalk that can arise in optical cross-connect nodes. Based on these specifications, we propose an algorithm for localizing the sources of multiple attacks and identifying their nature in all-optical networks.     

Experimental demonstration and analysis of all-optical label swapping based on RZ-DQPSK/IRZ-ASK modulation format

A novel optical return zero differential quadrature phase shifted keying/inverse return zero amplitude shifted keying(RZ-DQPSK/IRZ-ASK) orthogonal modulation format scheme for all-optical label swapping is analyzed theoretically and experimentally.The transmission characteristics of RZ-DQPSK/IRZ-ASK modulation format transmission system are demonstrated.Results show that high extinction ratio is obtained for IRZ-ASK label signal while at the same time the all-optical label swapping,differential quadrature p...     

基于ASON全光通信方案实现

针对目前ASON网络的智能优势和电控不足,给出了智能化全光网络设计方案。介绍了基于ASON的全光通信技术要求,并给出了实现全光交换的节点部件即智能化OXC的结构。对方案中采用的协议、接口、组网方式以及通信实现过程进行了描述,最后对方案的优势进行了分析。     

Binary quadratic programming formulation for routing and wavelength assignment problem in all-optical WDM networks

Routing and wavelength assignment (RWA) is the most concern in wavelength routed optical networks. This paper proposes a novel binary quadratic programming (BQP) formulation for the static RWA problem in order to balance traffic load among a network links more fairly. Subsequently, a greedy heuristic algorithm namely variable-weight routing and wavelength assignment (VW-RWA) is proposed to solve the developed BQP problem. In this method, the weight of a link is proportional to the link congestion. Performance evaluation results for different practical network topologies show that our proposed algorithm can decrease the number of required wavelengths in the network, blocking rate and variance of used wavelengths in each link. Besides, it is shown that the number of required wavelengths to establish call requests for a given network topology can be reduced at lower cost compared to other heuristics.     

Optical networks—the electro-optic reality

A general overview of the current status and future trends in optical networking is given. Special attention is given to the coexistence of optical and electronic technologies in telecommunications networks. After reviewing the advantages of both technologies, their use in different network areas is discussed. A critical survey of current and new transport technologies in optical core and metropolitan networks is given, including SDH/SONET and its enhancements, OTN, RPR, and Ethernet. The current status and prospects for photonic switching are briefly presented. The paper is concluded with an overview of the control plane for optical transport networks.     

Scalable architectures for real-time hyperspectral unmixing

Hyperspectral imaging instruments capture and collect hundreds of different wavelength data corresponding to the same surface. As a result, tons of information must be stored, processed and transmitted to ground. However, the downlink bandwidth is limited, and transmitting all data from the satellite to ground is a slow task that jeopardizes the use of this information for applications under real-time or near real-time constraints. This is the reason why most of the research activity is moving towards developing solutions which are able to process this data on-board, sending back to ground only relevant information.     

Paris: An approach to integrated high-speed private networks

This paper describes a design of a high-speed packet switching system for integrated voice, video and data communications. The system makes use of a simplified network architecture in order to achieve the low packet delay and high nodal throughput necessary for the transport of voice and video. A prototype of this system has been implemented and is now being tested under a variety of packet traffic loads. We have demonstrated that this system provides a cost-effective solution for private integrated networks.     

一种新的用于全光网的光交换技术

介绍了一种新的没有运动部件的光交换技术的原理、结构、性能、长期可靠性及其在未来全光网中的应用。     

窄带综合业务数字网建设探讨

论述了城市窄带综合业务数字网（Ｎ＿ＩＳＤＮ）建设的一般思路，包括Ｎ＿ＩＳＤＮ建设的前提、组网方案，技术标准、业务种类及用户构成、网络互联、网管等等。     

Node dimensioning in optical burst switching networks

Network dimensioning should be progressed for pursuing the ultimate efficiency of network system resources in order to satisfy target performance. This article studies node dimensioning as a method of resource optimization in optical burst switching (OBS) networks. OBS is a new switching technology for pursuing bufferless transparent optical networks by sending control packets prior to data burst in order to provision resources for the burst. However, the basic assumption of a bufferless node implies burst contention at a core node when more than two bursts attempt to move forward the same output simultaneously. Thus, burst contention is a critical performance metric and this article takes it into account as a constraint on node dimensioning and target performance. In this article, we first present node dimensioning issues for OBS networks. Two constraints from the transport plane and the control plane which affect burst contention are then introduced. The effect of the burst assembly process on node dimensioning is also presented. From numerical analysis, the optimal number of wavelengths in a link, which provides the lowest blocking probability, is obtained to suggest a guideline for node dimensioning.     

All-optical OFDM network coding scheme for all-optical virtual private communication in PON

A novel optical orthogonal frequency division multiplexing (OFDM) network coding scheme is proposed over passive optical network (PON) system. The proposed scheme for all-optical virtual private network (VPN) does not only improve transmission efficiency, but also realize full-duplex communication mode in a single fiber. Compared with the traditional all-optical VPN architectures, the all-optical OFDM network coding scheme can support higher speed, more flexible bandwidth allocation, and higher spectrum efficiency. In order to reduce the difficulty of alignment for encoding operation between inter-communication traffic, the width of OFDM subcarrier pulse is stretched in our proposed scheme. The feasibility of all-optical OFDM network coding scheme for VPN is verified, and the relevant simulation results show that the full-duplex inter-communication traffic stream can be transmitted successfully. Furthermore, the tolerance of misalignment existing in inter-ONUs traffic is investigated and analyzed for all-optical encoding operation, and the difficulty of pulse alignment is proved to be lower.     

光网络中的光交换技术

在对光交换技术深入研究的基础上，对光网络中的关键器件，声光可调滤波器及光缓存器作了详细介绍，最后对光交换的发展前景作了展望。     

基于帧填补的MMM Clos网络按序分组交换算法

与其它类型的Clos网络相比,各级带缓存的MMM(Memory-Memory-Memory)Clos网络使得交换网络的配置时间最小化,但是MMM交换中间级缓存的存在会引起输出端口的信元乱序。该文提出了一种满帧填补扩展算法(EPF),采用逐帧转发的方式来避免MMM Clos网络中的乱序问题。新算法在输入级和输出级采用固定周期轮转方式,中间级采用最早信元优先输出调度,具有复杂度低,可分布式控制,以及不需要缓存加速的特点。分析和仿真结果表明该算法是稳定的,即输入输出为可允许业务时,算法可达100%吞吐率。     

Selective reject ALOHA/FCFS: An advanced VSAT channel access protocol

This paper proposes and evaluates selective reject (SREJ) ALOHA/FCFS, a highly efficient, flexible and robust multiaccess protocol for very small aperture terminal (VSAT) applications. SREJ-ALOHA with locally synchronous FCFS retransmission scheduling is a ‘semi-compatible’ enhancement of asynchronous SREJ-ALOHA, which has earlier been shown to be an attractive satellite channel sharing protocol for low volume bursty terminals with variable length messages. The FCFS retransmission scheduling policy proposed here broadens the applicability of SREJ-ALOHA by providing higher maximum throughput, particularly in the important source traffic scenario with bimodal message length distributions. Improved channel-sharing efficiency and delay are achieved by exploiting time-of-arrival feedback naturally embedded in an unslotted SREJ-ALOHA channel to develop an implicit time-of-arrival based (FCFS) ordering for conflict-free, locally synchronous retransmission of most contending messages. An analytical procedure for evaluation of stability, throughput and delay for a general finite source, variable message length traffic model is described. The model is used to demonstrate that random access SREJ-ALOHA/FCFS typically achieves a maximum throughput in the region of 0·4–0·45 along with excellent stability and delay properties. In addition, a natural extension of the protocol which supports implicit reservation for long messages is described and shown to offer a high maximum throughput (>0·6), comparable to that achieved by highly co-ordinated slotted systems, for example mixed interactive/file-transfer traffic scenarios.     

Regenerative all-optical wavelength multicast for next generation WDM network and system applications

We experimentally demonstrate regenerative all-optical wavelength multicast by simultaneous multi-wavelength conversion of 10 Gb/s non-return-to-zero signals to four ITU 100 GHz spaced channels with a receiver sensitivity improvement of 1.84 dB and less than 0.14 dB difference among all the multicast channels, using a single commercial monolithically integrated SOA-MZI. The multicast device also exhibited about 22 dB optical signal-to-noise ratio enhancement for all the converted channels compared to the original signal channel without wavelength conversion. Our experiment for the first time revealed the regeneration properties of a SOA-MZI device for WDM wavelength multicast purposes, and proved the excellent performance of a simple scheme for various future network and system applications, such as all-optical wavelength routing and grid networking.     

PERFORMANCE COMPARISON OF CELL－BASED AND PACKET－BASED SWITCHING SCHEMES FOR SHARED MEMORY SWITCHES

Shared Memory (SM) switches are widely used for its high throughput,low delay and efficient use of memory.This paper compares the performance of two prominent switching schemes of SM packet switches:Cell-Based Switching (CBS) and Packet-Based Switching (PBS).Theoretical analysis is carried out to draw qualitative conclusion on the memory requirement,throughput and packet delay of the two schemes.Furthermore,simulations are carried out to get quantitative results of the performance comparison under various system load,traffic patterns,and memory sizes.Simulation results show that PBS has the advantage of shorter time delay while CBS has lower memory requirement and outperforms in throughput when the memory size is limited.The comparison can be used for tradeoff between performance and complexity in switch design.     

The variant cycle-cover problem in fault detection and localization for mesh all-optical networks

With the soaring channel speed and density in all-optical networks (AONs), the risk of high data loss upon network faults increases quickly. To manage network faults efficiently, an m-cycle based fault detection and localization (MFDL) scheme has been introduced recently. This paper verifies the necessary and sufficient condition for achieving the complete fault localization (CFL) in MFDL, which is defined as the case that every single network fault can be located to a unique link. We model the m-cycle construction as a new mathematical problem: the variant version of the constrained cycle-cover problem (vCCCP) and explore its formal expression. The model includes the consideration of the cycle-length limit, cycle number, and wavelength cost, while also keeps the CFL achievable. A two-phase branch-and-bound (B&B) algorithm was developed for solving the vCCCP, which guarantees to find near-optimal solutions. This algorithm is then applied to four typical and four random network examples to validate and assess the performance. The results are analyzed and compared with some previously reported algorithms, in terms of fault localization degree, cycle number, wavelength overhead, and cost reduction. The performance evaluation and comparison reveal that the new model and algorithm could significantly reduce the MFDL cost, including both the cost of monitoring devices and reserved wavelengths.