The Design of an Allo-Optical Packet Switching Network

Recent advances in the all-optical signal processing domain report high-speed and nontrivial functionality directly implemented in the optical layer. These developments mean that the all- optical processing of packet headers has a future. In this article we address various important control plane issues that must be resolved when designing networks based on all-optical packet-switched nodes.     

Adaptive alternate routing in WDM networks and its performance tradeoffs in the presence of wavelength converters

Routing in wavelength-routed all-optical WDM networks has received much attention in the past decade, for which fixed and dynamic routing methods have been proposed. Taking into account the observation that wavelength-routed all-optical WDM networks are similar to circuit-switched voice networks, except with regard to wavelength conversion, we propose an adaptive alternate routing (AAR) scheme for wavelength-routed all-optical WDM networks. A major benefit of AAR is that it can operate and adapt without requiring an exchange of network status, i.e., it is an information-less adaptive routing scheme. The scope of this work is to understand this scheme in its own right since no other dynamic routing schemes are known to have the information-less property. In this paper, we conduct a systematic study of AAR with regard to factors such as the number of converters, load conditions, traffic patterns, network topologies, and the number of alternate paths considered. We observe that the routing scheme with multiple alternate routes provides more gain at a lower load instead of requiring any nodes to be equipped with wavelength converters. On the other hand, the availability of wavelength converters at some nodes, along with adaptive routing, is beneficial at a moderate to high load without requiring all nodes to be equipped with wavelength converters. We also observed that a small number of alternate routes considered in a network without wavelength converters gives a much better performance than a network with full wavelength converters and fewer alternate routes. Throughout this study, we observed that the proposed adaptive alternate routing scheme adapts well to the network traffic condition.     

100 Gb/s optical time-division multiplexed networks

We present ultrafast slotted optical time-division multiplexed networks as a viable means of implementing a highly capable next-generation all-optical packet-switched network. Such a network is capable of providing simple network management, the ability to support variable quality-of-service, self-routing of packets, scalability in the number of users, and the use of digital regeneration, buffering, and encryption. We review all-optical switch and Boolean logic gate implementations using an ultrafast nonlinear interferometers (UNIs) that are capable of stable, pattern-independent operation at speeds in excess of 100 Gb/s. We expand the capability provided by the UNI beyond switching and logic demonstrations to include system-level functions such as packet synchronization, address comparison, and rate conversion. We use these advanced all-optical signal processing capabilities to demonstrate a slotted OTDM multiaccess network testbed operating at 112.5 Gb/s line rates with inherent scalability in the number of users and system line rates. We also report on long-haul propagation of short optical pulses in fiber and all-optical 3R regeneration as a viable cost-effective means of extending the long-haul distance of our OTDM network to distances much greater than 100 km.     

All-optical routing using wavelength recognizing switches

This paper presents system considerations for optical packet-switched network using a wavelength recognizing switch (WRS) device for all-optical control and routing. Networks with the WRS device are capable of truly all-optical routing; the packet header is processed in the optical domain. This unique feature allows the self-routing of optical packets in a flexible and dynamically reconfigurable way, but introduces new challenges for the network architect. Our novel architecture combines the use of the WRS with arrayed waveguide devices in a powerful addressing mode. In this paper we explore some of the system issues, including crosstalk, noise performance, cascadability. We present experimental data on a broad-area WRS device we fabricated and assess the feasibility of an integrated version of the device     

Computing approximate blocking probabilities for a class ofall-optical networks

We study a class of all-optical networks using wavelength-division multiplexing (WDM) and wavelength routing, in which a connection between a pair of nodes in the network is assigned a path and a wavelength on that path. Moreover, on the links of that path no other connection can share the assigned wavelength. Using a generalized reduced load approximation scheme we calculate the blocking probabilities for the optical network model for two routing schemes: fixed routing and least loaded routing     

Deflection routing in slotted self-routing networks with arbitrary topology

A deflection routing scheme for small to medium size future all-optical networks with arbitrary topologies is proposed. The proposed scheme assumes only single-bit all-optical processing and no buffers. The primary output selection and the alternate output choices by a packet at each node are encoded in the packet header in order to reduce the signal processing requirement. Additional features such as priority and time-to-live fields have also been defined. The performance of the deflection routing scheme is studied using the AT&T North America OC-48 optical fiber network topology.     

An Optical Packet Addressing Scheme for Optical Packet Switched Networks Using RF Frequency Carrier Assignment

We propose an efficient optical packet addressing technique for optical packet-switched networks, where the pre-assigned RF frequency carriers are used to represent the packet addresses. It can simplify the control process of optical packet switching so that it results in reduced address processing time and smaller complexity of the packet address processor due to simple extraction of address information. We also analyze the performance of the proposed packet addressing scheme in the transmission aspect taking into account packet address wavelength beating and laser nonlinearity.     

All-optical address recognition for optically-assisted routing in next-generation optical networks

Optical fiber communication technology enabled high-speed, long-distance capacity in today's networks. The packet switching functions such as address recognition and routing are performed in the electrical domain after optical-to-electrical conversion. As more real-time applications come online, demand for bandwidth increases, and electronic processing may potentially become a bottleneck at the intermediate nodes along the network. We introduce some optical address recognition schemes for optically-assisted routing that may decrease the processing delay at these nodes.     

Internetworking connectionless and connection oriented networks

The use of connection-oriented (CO) networks for the transport of IP traffic is seen to have value to both users and service providers. Given the expectation that most endpoint-generated traffic will be in the form of connectionless (CL) IP datagrams, we address the problem of how to internetwork a CL (IP) network with a CO network. CO networks can be packet-switched or circuit-switched. Examples of packet-switched CO networks include ATM and MPLS networks, in which resource reservations are made at the ATM or shim layer, and IP-switch-based networks, in which resource reservations are made at the IP layer. Examples of circuit-switched networks include SONET/SDH and WDM networks that consist of programmable optical crossconnects. We consider the internetworking problem for two modes of operation of CO networks: provisioned, in which connections are set up a priori, and switched, in which connections are set up on demand. The main focus of this article is on the more complex problem: the internetworking of CL IP networks with CO networks operated in a switched mode. Our solution consists of (i) interworking user plane protocols with protocol conversion in some cases instead of always using protocol encapsulation, (ii) interworking routing protocols by either simply having gateways know routing information of both networks or having all nodes know routing information of both networks, and (iii) interworking signaling protocols by using application- or transport-layer end-to-end handshakes to trigger connection setups through the CO network. We demonstrate throughput improvements with our integrated routing interworking scheme over the MPOA IP-ATM internetworking solution for two example networks     

Routing and time-slot assignment in optical TDM networks

Optical time-division multiplexing (O-TDM) networks can provide a finer bandwidth granularity than wavelength-division multiplexing networks, and will play an important role in future all-optical networks. Since optical buffers are expensive, a small buffer size will be the characteristic of O-TDM systems. This paper analyzes the problem of routing and time-slot assignment in O-TDM networks. The results lead to the proposal of a Dijkstra-like shortest-path routing scheme that intends to maximize the performance of an optical network with a small number of optical buffers. Performance evaluation of the proposed scheme is also presented.     

Preconfiguring IP-over-Optical Networks to Handle Router Failures and Unpredictable Traffic

We consider the realization of traffic-oblivious routing in IP-over-optical networks where routers are interconnected over a switched optical backbone. The traffic-oblivious routing we consider is a scheme where incoming traffic is first distributed in a preset manner to a set of intermediate nodes. The traffic is then routed from the intermediate nodes to the final destination. This splitting of the routing into two phases simplifies network configuration significantly. In implementing this scheme, the first and second phase paths are realized at the optical layer with router packet grooming at a single intermediate node only. Given this unreliability of routers, we consider how two-phase routing in IP-over-optical networks can be made resilient against router node failures. We propose two different schemes for provisioning the optical layer to handle router node failures-one that is failure node independent and static, and the other that is failure node dependent and dynamic We develop linear programming formulations for both schemes and a fast combinatorial algorithm for the second scheme so as to maximize network throughput. In each case, we determine (i) the optimal distribution of traffic to various intermediate routers for both normal (no-failure) and failure conditions, and (ii) provisioning of optical layer circuits to provide the needed inter-router links. We evaluate the performance of the two router failure protection schemes and compare it with that of unprotected routing     

Binary addressing and routing schemes in the Manhattan StreetNetwork

In this paper, a simple addressing methodology called binary address scheme (BAS) is presented for the Manhattan Street Networks. It overcomes some of the deficiencies of other previously proposed schemes. It allows new nodes to be inserted into the network without changing the addresses of any existing nodes. In addition, it also reduces the computational complexity of routing. BAS provides a simple distributed routing rule that can be easily implemented by hardware in each node to achieve better performance. BAS can also be used in other networks which have strong dependence on the sequential order of node addressing     

IDSDDIP: a secure distributed dynamic IP configuration scheme for mobile ad hoc networks

In IP‐based networks, IP address uniqueness is one of the most important requirements since a node has to participate in unicast communications and routing. Often nodes are assumed to have unique IP addresses configured a priori. However, this is not the case and cannot be achieved easily in mobile ad hoc networks (MANETs). Most of the existing dynamic address allocation schemes of MANET rely on network‐wide flooding for address solicitation and/or duplicate address detection. As a result, several types of security threats can be seen at the time of address allocation. In this paper, we present an ID‐based distributed dynamic IP configuration scheme that securely allocates IP addresses to the authorized nodes without flooding the entire network. Here each node acquires capability of generating unique IP addresses from its own IP address and can assign those addresses to the new nodes. The proposed scheme provides security against the associated threats with dynamic IP allocation protocol without the help of a trusted third party. It also efficiently handles the network partitioning and merging and reduces the chance of address conflicts. Performance analysis and simulation results are present to show that the proposed addressing scheme has low communication overhead and fairly low addressing latency with added security mechanisms compared to the similar existing dynamic address allocation schemes. Copyright © 2013 John Wiley & Sons, Ltd.     

大规模异构光网络智能组网技术与实验演示环境(英文)

A novel routing architecture named DREAMSCAPE is presented to solve the problem of path computation in multi-layer, multi-domain and multi-constraints scenarios, which includes Group Engine (GE) and Unit Engine (UE). GE, UE and their cooperation relationship form the main feature of DREAMSCAPE, i.e. Dual Routing Engine (DRE). Based on DRE, two routing schemes are proposed, which are DRE Forward Path Computation (DRE-FPC) and Hierarchical DRE Backward Recursive PCE-based Computation (HDRE-BRPC). In order to ...     

Optimal cluster-based routing scheme using node mobility in ad hoc networks

Ad hoc networks have a scalability problem. When the nodes of an ad hoc network increase in number or mobility, the amount of control traffic for routing increases and could cause traffic congestion. Cluster-based routing schemes have been proposed as a solution to this problem. Typical cluster-based ad hoc networks use a proactive routing scheme for intra-cluster routes and a reactive routing scheme for inter-cluster routes. In this study, we propose a new cluster-based routing scheme for ad hoc networks which makes use of the mobility of nodes. Nodes are divided into two groups on the basis of their mobility. For a route search within a cluster, a proactive routing scheme is used for low-mobility nodes and a flooding-based reactive routing scheme is used for high-mobility nodes. The required control traffic of the proposed scheme is analyzed and optimal parameters of the proposed scheme are derived from the analysis. The numerical results show that the proposed scheme produces far less control traffic than a typical cluster-based routing scheme.     

Very-high-speed fibre-optic networks for broadband communications

Single-mode optical fibres have an enormous transmission bandwidth which can support ultra-high-speed digital transmission and networking. The use of electrical signal-processing, however, ultimately limits the network capacity. To eliminate the throughput bottleneck, all-optical processing techniques should be employed in a fibre-optic network. This paper discusses several schemes for implementing optical time division multiple access (OTDMA) networks with the emphasis on optical clock distribution, synchronisation and all-optical detection. The use of a fast-switching bistable laser diode as an all-optical threshold detector and data regenerator is suggested. A dual-wavelength OTDMA technique is investigated, which can be used for digital TV or future HDTV distributions. Moreover, an efficient multiple access scheme, called wavelength division multiple access with optical time division multiplexing (WDMA-OTDM), is proposed for broadband communication services. It is shown that WDMA-OTDM has all the advantages possessed by the individual OTDMA and WDMA schemes but offers improved flexibility and capacity     

Hierarchical routing and traffic grooming in IP/MPLS-based ASON/GMPLS multi-domain networks

Routing, connection setup, and path computation are well-known problems in multi-domain networks, which have been largely analyzed in pure IP (packet) networks. In circuit-switched optical multi-domain networks, there remain, however, a number of routing and path computation challenges. Traffic grooming means combining a number of low-speed traffic streams so that the high capacity of each lightpath may be used as efficiently as possible, as path computation implements the core of the grooming function, it is obvious that solutions for the traffic grooming problem in optical multi-domain networks are still not sufficiently investigated. In this study we propose a methodology to address the problems of routing, connection setup, and traffic grooming in optical multi-domain networks, which adapts a two-level hierarchical routing scheme and full-mesh topology abstraction algorithm to improve routing scalability and lower inter-domain blocking probabilities; additionally our proposed methodology adapts a scheme for traffic grooming in DWDM multi-domain networks to improve the resources usage. To test our proposed methodology we propose a detailed IP/MPLS-based ASON/GMPLS multi-domain multilayer test framework.     

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.     

A hierarchical scheme on achieving all-IP communication between WSN and IPv6 networks

The paper proposes a hierarchical scheme on implementing all-IP communication between wireless sensor networks and IPv6 networks. The paper proposes the cluster-tree architecture for all-IP wireless sensor networks which is consistent with the IPv6 Internet architecture. Based on the cluster-tree architecture, the paper proposes the hierarchical IPv6 address configuration algorithm where the IPv6 configuration for cluster members in different clusters can be performed simultaneously, so the IPv6 configuration delay is shortened. Based on the proposed cluster-tree architecture and the IPv6 address configuration algorithm, the paper proposes the hierarchical routing scheme in the link layer where the intermediate nodes only need to deal with the frame header in the link layer without processing the headers in the above layers, so the routing delay is shortened and the power consumption is reduced. From both theoretical perspective and simulative perspectives, the paper analyze the performance parameters of the proposed scheme. And the data results show that the performance of the proposed scheme is better.     

Dynamic lightpath establishment in wavelength routed WDM networks

In wavelength-routed WDM networks, a control mechanism is required to set up and take down all-optical connections. Upon the arrival of a connection request, this mechanism must be able to select a route, assign a wavelength to the connection, and configure the appropriate optical switches in the network. The mechanism must also be able to provide updates to reflect which wavelengths are currently being used on each link so that nodes may make informed routing decisions. In this work, we review control mechanisms proposed in the literature. We also investigate and compare two different distributed control mechanisms for establishing all-optical connections in a wavelength-routed WDM network: an approach based on link-state routing, and one based on distance-vector routing