Abstract
ANALYSIS OF TRAFFIC CONTROL IN WAVELENGTH DIVISION MULTIPLEXING (WDM) ROUTING
Sourabh Pathak*
ABSTRACT
In WDM routing we analyze the all self-routing and optical traffic control of WDM optical packets in a cascaded two-node all-optical Data Vortex switching node. In the experiment, WDM optical packets are successfully routed while maintaining a BER of 10-10 or better. The WDM optical networks give reliability and unprecedented for message transfer among the nodes. All-to-all routing is a fundamental routing problem in such networks and has been well studied on single hop WDM networks. The number of wavelengths to optimize the all-to-all routing on the single hop structure typically is very large. One way to reduce the number of wavelengths is to use -hop routing, in which each routing path consists of segments and each segment is assigned a different wavelength, where usually is a small constant. Because of the complexity of design and analysis for such a routing problem, only few papers discussed and proposed all-to-all routing by 2 hops. However, the proposed algorithms are usually exceeding complicated even for ring topologies. Often, an ad hoc approach is employed to deal with each individual Topology. The system reliability of a connection is determined by the number of different risks associated with the path. We study the most reliable routing for WDM networks with arbitrary risk distribution in this paper. Firstly we consider on the minimum risk single path (MRSP) problem, in which a single most reliable path is to be established between a given source-destination pair. To solve MRSP, a simple label-setting (Simple-LS) algorithm is proposed by iteratively setting every node with a diminishing path-risk set (i.e. the label of a node). We then extend Simple-LS to find up to K lowest risk paths in each iteration, called K-path LS algorithm.
[Full Text Article] [Download Certificate]