By Topic

Service provisioning under a scheduled traffic model using light-trails 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

2 Author(s)
XuBin Luo ; Department of Computer Science and Engineering, Wright State University, Dayton, OH 45435 USA ; Bin Wang

In this work, we study the problem of efficient service provisioning in light-trail WDM optical networks under a scheduled traffic model. In this model, a set of demands is given, and the setup time, teardown time, and the requested bandwidth of a demand are known in advance. When constructing light-trails to accommodate scheduled demands, we consider two cases: static light-trail case and dynamic light-trail case. In the static light-trail case, a light-trail will not be torn down once it is set up. In the dynamic light-trail case, a light-trail can be torn down when it is not used by any scheduled demand, so that the resources for that light-trail can be re-allocated for other light-trails. We present Integer Linear Programming (ILP) formulations for this problem while considering the instantiation of static light-trails as well as dynamic light-trails to provision scheduled services. The optimization objective is to minimize the resources used in terms of the total wavelength-links used to accommodate a set of demands. Time efficient heuristic algorithms are then proposed for both cases. The solutions to the ILP formulations and the extensive simulation of the heuristic algorithms show that the use of dynamic light-trails significantly reduces the required resources to accommodate the same demand set. The resource reduction becomes more significant as the size of demand sets increases and the time correlation among demands becomes weaker. The heuristic algorithms for both cases are also shown to be very time efficient.

Published in:

Broadband Communications, Networks and Systems, 2007. BROADNETS 2007. Fourth International Conference on

Date of Conference:

10-14 Sept. 2007