By Topic

Circular arc graph based algorithms for routing scheduled lightpath demands in WDM optical networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Saradhi, C.V. ; Inst. for Infocomm Res., Nat. Univ. of Singapore, Singapore ; Wei, C.J. ; Shujing, M. ; Gurusamy, M.

In WDM optical networks, depending on the offered services the service provider will have precise information for some traffic demands such as the number of required lightpaths and the instants at which these lightpaths must be set-up and torn-down, known as scheduled lightpath demands (SLDs). It may so happen that in a given set of SLDs, some of the demands are not simultaneous in time, and hence the same network resource could be used to satisfy several demands at different times. In this paper we develop two complementary algorithms-independent sets algorithm (ISA) and time window algorithm (TWA), based on circular arc graph theory, which respectively capture time-disjointness or time-overlap that could exist among SLDs. We compare and evaluate the algorithms based on the number of wavelengths required, number of reused wavelengths, average call acceptance ratio, and the reuse factor. The numerical results obtained from simulation experiments indicate that TWA reuses significant number of wavelengths (reuse factor up to 53%) followed by ISA (reuse factor up to 14%).

Published in:

Broadband Networks, 2005. BroadNets 2005. 2nd International Conference on

Date of Conference:

3-7 Oct. 2005