Search

Light trail is a unidirectional optical bus between the source and the destination node of a WDM network. In this paper, a novel algorithm is proposed for dynamic light trail assignment, which competently works for unicast dynamic connection requests. The routing is based on Hoffman k-shortest path algorithm. The proposed algorithm is solvable in polynomial time complexity and generates better results when compared with other existing algorithms. The existing algorithms are either dependent on the complex auxiliary graph, or they have a huge run time complexity. This motivated us to lay down our research work, which is free from the complex auxiliary graph and works in lesser time complexity. The aim of the paper is to satisfy the dynamic connection requests by assigning minimum number of dynamic light trails with the objective of minimizing the blocking probability, while maximizing the capacity utilization of each dynamic light trail assigned. [ABSTRACT FROM AUTHOR]

For the last few decades, fiber optic cables not only replaced copper cables but also made drastic evolution in the technology to overcome the optoelectronic bandwidth mismatch. Light trail concept is such an attempt to minimize the optoelectronic bandwidth gap between actual WDM bandwidth and end user access bandwidth. A light trail is an optical bus that connects two nodes of an all optical WDM network. In this paper, we studied the concept of split light trail and proposed an algorithm namely Static Multi-Hop Split Light Trail Assignment (SMSLTA), which aims to minimize blocking probability, the number of static split light trails assigned and also the number of network resources used, at the same time maximizing the network throughput. Our proposed algorithm works competently with the existing algorithms and generates better performance in polynomial time complexity. [ABSTRACT FROM AUTHOR]