Architectures and techniques for all-optical networks

Some recent results on all-optical packet-switching and broadcasting networks are presented. The performance evaluation problem of packet-switching transparent optical networks with deflection routing is addressed. Transmission error arguments show how, for a given optical bit rate, the size of an all-optical nonregenerative multishop network is limited by the accumulation of noise and distortion in the optical fiber channel. Time-domain multiple access techniques are exploited in novel architectures based on recently proposed all-optical sampling gates to realize the matching of the ultrahigh optical speed allowed by the large bandwidth of the fiber with the lower speed of the electronic components needed at the user ends. These architectures allow great simplification of the node structure in the considered all-optical multihop and broadcast networks.     

High Speed All-Optical Data Distribution Network

This article describes the performance and capabilities of an all-optical network featuring low latency, high speed file transfer between serially connected optical nodes. A basic component of the network is a network interface card (NIC) implemented through a unique planar lightwave circuit (PLC) that performs add/drop data and optical signal amplification. The network uses a linear bus topology with nodes in a “T” configuration, as described in the text. The signal is sent optically (hence, no latency) to all nodes via wavelength division multiplexing (WDM), with each node receiver tuned to wavelength of choice via an optical de-multiplexer. Each “T” node routes a portion of the signal to/from the bus through optical couplers, embedded in the network interface card (NIC), to each of the 1 through n computers.     

Architectures and techniques for all-optical networks

Abstract

Some recent results on all-optical packet-switching and broadcasting networks are presented. The performance evaluation problem of packet-switching transparent optical networks with deflection routing is addressed. Transmission error arguments show how, for a given optical bit rate, the size of an all-optical nonregenerative multishop network is limited by the accumulation of noise and distortion in the optical fiber channel. Time-domain multiple access techniques are exploited in novel architectures based on recently proposed all-optical sampling gates to realize the matching of the ultrahigh optical speed allowed by the large bandwidth of the fiber with the lower speed of the electronic components needed at the user ends. These architectures allow great simplification of the node structure in the considered all-optical multihop and broadcast networks.     

Enhancement of Node-Induced Crosstalk by Nonlinear Effects in Nonzero Dispersion-Shifted Fiber Rings with Optical Add/Drop Multiplexers

Wavelength division multiplexed metropolitan networks have been attracting increasing attention in the networking research community. We discuss an issue that is pertinent to node design and transmission systems in these networks. The problem of node-induced crosstalk and its interaction with fiber nonlinearities is investigated. In this respect, we consider transmission systems that are based on nonzero dispersion-shifted fiber rings with simple optical add/drop multiplexing nodes. The system power penalty due to the crosstalk/nonlinear interaction phenomenon is calculated for several cases. Dependence of this penalty on the frequency difference between signal and crosstalk carriers, input-signal power, and extinction ratio is investigated. It is shown that the design of regional and metropolitan networks or links with physical spans in excess of 200 km has to take this crosstalk/nonlinear interaction phenomenon into consideration.     

Ring-based PON supporting multiple optical private networks using OCDMA technique

This work is a novel attempt to provide local communications for multiple optical private networks (PNs) within ring-based passive optical network (PON). In order to improve network throughput performance, PNs traffic is decentralized from PON traffic let no extra traffic management into optical line terminal (OLT). To achieve multiple secure optical private networking over ring-based PON layout, optical code division multiple access (OCDMA) technique is applied. This technique leads to interconnect optical network units (ONUs) in the same PN sharing the same codeword while other PNs benefiting from different codewords. This scheme can be used in access networks to establish discrete communications between different sites in an enterprise or a university campus or even a residential accommodation. The proposed network architecture is then set up and its bit error rate performance is experimentally demonstrated. Finally, the network scalability and throughput performance of the proposed scheme are analyzed.     

An efficient algorithm for optimal manycast routing problem over WDM networks

In this paper, we discuss the problem of supporting resource optimization of manycasting service over wavelength division multiplexing (WDM) optical networks. Manycast is a novel group communication paradigm wherein the source is required to send data packets to a certain number of a set of pre-specified group members. Since it integrates the characteristic of multicast and anycast, manycast is attracting increasing interest from researchers over wavelength division multiplexing (WDM) optical networks. Splitter, cost, wavelength channel are three parameters which are taken into consideration for the first time in WDM. Finding a manycast tree which span the resource and selected nodes with minimum number of splitter, cost and wavelength channel is an NP-complete problem, and therefore we propose a simple and efficient heuristic solution: based-frequency manycast routing (BFM) algorithm to construct manycast trees with the aim of reducing the use of network resources. For a set of manycast requests, the simulation result shows BFM builds manycast trees with the smallest number of resources than other algorithms.     

All-optical code routing in interconnected optical CDMA and WDM ring networks

We propose an all-optical hybrid network composed of optical code division multiple access (CDMA) rings interconnecting through a reconfigurable wavelength division multiplexing (WDM) metro area ring. This network retains the advantages of both the optical CDMA and WDM techniques, including asynchronous access and differentiated quality of service, while removing the hard limit on the number of subscribers and increasing network flexibility. The all-optical network is enabled by using nonlinear optical loop mirrors in an add/drop router (ADR) that performs code conversion, dropping, and switching asynchronously. We experimentally demonstrate the functionalities of the ADR in the proposed scheme asynchronously and obtain error-free performance. The bit-error rate measurements show acceptable power penalties for different code routes.     

Fairness and throughput performance of infrastructure IEEE 802.11 networks with hidden-nodes

The fairness behavior and throughput performance of IEEE 802.11 distributed coordination function and request-to-send/clear-to-send channel access scheme in the presence of hidden nodes are investigated. A mathematical model which accurately predicts a user’s throughput performance and packet collision probability in non-saturated traffic and asymmetric hidden node environments is developed. The model allows us to see many interesting results in networks with hidden nodes. In an asymmetric hidden node network environment, the network fairness performance depends on the traffic load. In low traffic conditions, users get their fair share of the resources. However, in moderate-to-high traffic conditions, users that experience less number of hidden nodes dominate the network, causing badly located stations in a network to starve. In addition, the performance of request-to-send/clear-to-send channel access scheme, which is developed as a solution to hidden node problem, in networks with hidden nodes, is also estimated. It is shown that request-to-send/clear-to-send contention resolution scheme greatly improves the network fairness performance in hidden node scenarios. The developed model enables us to more accurately estimate the performance of practical wireless local area networks, where hidden node occurrence is common. Theoretical analysis presented in the paper is validated with simulation results.     

Multiplexing Techniques for Noninterferometric Optical Point-Sensor Networks: A Review

This article presents a review of the strategies that have been both demonstrated and proposed for the multiplexing of multiple noninterferometric optical fiber point sensors to form a sensor network. The focus, which avoids consideration of interferometric sensor types, enables discussion of conventional multiplexing tech niques, namely, spatial, time division, frequency division, and wavelength division prior to dealing with combined or hybrid schemes, which exhibit the potential for increased multiplexing gain. Specific advantages and potential drawbacks of the different strategies are provided together with an indication of the number of point sensors that each multiplexing scheme can support.     

Temporally orthogonalized distance-multiplexed passive optical network

A new method, called temporal orthogonalization, for the cancellation of multiple reflections in distance-multiplexed all-optical passive tree networks is presented. The main advantage of this method over an existing method with Faraday rotators is its relatively simple implementation in the network nodes.     

Multiaccess in all-optical networks with wavelength and code concurrency

A major obstacle in realizing fast packet switching in all-optical networks is the large tuning delays of tunable optical devices. This article proposes a multiaccess scheme for all-optical local area networks that employs both wavelength and code concurrency. In this scheme, several users share a wavelength channel through code multiplexing. The delay performance of hybrid wavelength/code division multiaccess is obtained under a simple, suboptimal access protocol based on cyclic search. Due to the reduction in the number of wavelength channels without an associated reduction in transmission concurrency, hybrid multiaccess is robust against tuning delays. At a given network throughput, the hybrid scheme achieves considerably lower delays than that of Wavelength Division Multiple Access even with a small amount of code concurrency. Conversely, the hybrid network can support a higher load when there is a maximum allowable value for the average packet delay.     

Proposal of Rip up & Re allocate Algorithm for Optical Layer 2 Switch Network

We are developing an optical layer-2s witch network that uses both wavelength-division multiplexing and time-division multiplexing technologies for efficient traffic aggregation in metro networks.For efficient traffic aggregation,path bandwidth control is key because it strongly affects bandwidth efficiency.For this paper,we propose a dynamic time-slot allocation method that uses periodic information of difference values of traffic variation.This method can derive near-optimal allocation with lower computational cost,which enlarges the maximum available network size compared with conventional time-slot allocation methods.Numerical results show that the proposed method enables dynamic path control in 1K-node-scale optical layer-2s witch network,which leads to cost-effective metro networks.     

Role of connectivity in congestion and decongestion in a communication network

We study network traffic dynamics in a two dimensional communication network with regular nodes and hubs. If the network experiences heavy message traffic, congestion occurs due to finite capacity of the nodes. We discuss strategies to manipulate hub capacity and hub connections to relieve congestion and define a coefficient of betweenness centrality (CBC), a direct measure of network traffic, which is useful for identifying hubs which are most likely to cause congestion. The addition of assortative connections to hubs of high CBC relieves congestion very efficiently. An erratum to this article is available at .     

Transport between multiple users in complex networks

We study the transport properties of model networks such as scale-free and Erd?s-Rényi networks as well as a real network. We consider few possibilities for the trnasport problem. We start by studying the conductance G between two arbitrarily chosen nodes where each link has the same unit resistance. Our theoretical analysis for scale-free networks predicts a broad range of values of G, with a power-law tail distribution $\Phi_{\rm SF}(G)\sim G^{-g_G}$ , where g_G=2λ-1, and λ is the decay exponent for the scale-free network degree distribution. The power-law tail in Φ_SF(G) leads to large values of G, thereby significantly improving the transport in scale-free networks, compared to Erd?s-Rényi networks where the tail of the conductivity distribution decays exponentially. We develop a simple physical picture of the transport to account for the results. The other model for transport is the max-flow model, where conductance is defined as the number of link-independent paths between the two nodes, and find that a similar picture holds. The effects of distance on the value of conductance are considered for both models, and some differences emerge. We then extend our study to the case of multiple sources ans sinks, where the transport is defined between two groups of nodes. We find a fundamental difference between the two forms of flow when considering the quality of the transport with respect to the number of sources, and find an optimal number of sources, or users, for the max-flow case. A qualitative (and partially quantitative) explanation is also given.     

A Survivable Wavelength Division Multiplexing Passive Optical Network with Both Point-to-Point Service and Broadcast Service Delivery

Abstract

A survivable wavelength division multiplexing passive optical network enabling both point-to-point service and broadcast service is presented and demonstrated. This architecture provides an automatic traffic recovery against feeder and distribution fiber link failure, respectively. In addition, it also simplifies the protection design for multiple services transmission in wavelength division multiplexing passive optical networks.     

Designing an all-optical packet filtering module for WDM broadcast-and-select star networks

An all-optical packet filtering module for WDM broadcast-and-select star networks is introduced. At each time instant, only one packet per wavelength is allowed to pass to the star coupler. Therefore, collisions are avoided and the network performance is improved. The proposed module is based on the use of optical logic circuits for controlling the passing of the transmitted packets to the star coupler, without the need of optical to electronic translation or electronic processing of the network feedback information. In this way, the processing time is drastically reduced, while the need for slowly tunable optical filters is eliminated. Furthermore, due to the all-optical nature of the network hub, the reliability of the system is improved.     

An efficient approach of controlling traffic congestion in scale-free networks

We propose and study a model of traffic in communication networks. The underlying network has a structure that is tunable between a scale-free growing network with preferential attachments and a random growing network. To model realistic situations where different nodes in a network may have different capabilities, the message or packet creation and delivering rates at a node are assumed to depend on the degree of the node. Noting that congestions are more likely to take place at the nodes with high degrees in networks with scale-free character, an efficient approach of selectively enhancing the message-processing capability of a small fraction (e.g. 3%) of the nodes is shown to perform just as good as enhancing the capability of all nodes. The interplay between the creation rate and the delivering rate in determining non-congested or congested traffic in a network is studied more numerically and analytically.     

Capacity enhancement in packet switched slotted ring wavelength division multiplexed transport networks

In this paper, all-optical WDM networks based on a slotted multichannel ring topology have been investigated. The nodes are equipped with one fixed-wavelength receiver, wavelength-tunable transmitter and provide packet-mode transport in WDM network. The topology provides one logical channel to be associated with each destination node. Each channel is shared in statistical time division by all nodes transmitting to a given destination. The capacity enhancement has been demonstrated by comparing all optical WDM network by increasing the number of nodes. It is concluded that by increasing the number of nodes in the topology, the token queue length capacity, the token arrival rate are increased and the token arrival period is decreased which results in overall increase in the performance and capacity of the logical WDM network.     

Emerging Trends in Fiber Optic Networks

We propose a novel scheme for interconnection of multiple high-speed (2.5 10 Gbit s) asynchronous transfer mode (ATM) streams through an optical wavelength division multiplexing (WDM) network with a total network capacity of up to 4 Tbit/s. The proposed architecture is based on placing the optical WDM portion of the network in a physically small area, i.e., one central office or in a single rack. This helps to avoid technological obstacles such as power budget, dispersion, and synchronization limitations as well as optical output buffering. The interconnection is an ATM packet switched network and provides optical contention resolution. We show that the implementation of such a network is possible using currently available optoelectronic technology. An optional extension of the network is proposed by a combination of WDM and space division multiplexing (SDM) technology. Simulation results are presented, indicating network throughput of up to 100 %.     

Blocking in wavelength-routed all-optical WDM network with or without wavelength conversion

The blocking probability in wavelength-routed all-optical networks is a very important measure of performance of the network. This blocking probability can be affected by many factors such as network topology, traffic load, number of links, algorithms employed and whether wavelength conversion is available or not. In this paper we have proposed a mathematical model to reduce the blocking probability of the WDM optical network for both wavelength convertible networks as well as for wavelength non-convertible networks. The model is can be used to evaluate the blocking performance of any network topology also it can be useful to improve its performance of the given network topology.