By Topic

A slotted dynamic traffic scheduling algorithm in time-domain wavelength interleaved 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

3 Author(s)
Daojun Xue ; Sch. of Electron. & Electric. Eng., Nanyang Technol. Univ., Singapore ; Yang Qin ; Chee Kheong Siew

We consider the scheduling problem in a new optical transport network called time-domain wavelength interleaved networks (TWIN). Due to the innovative architecture of TWIN, four issues are essential in the designing of scheduling schemes: there are no transmitting/receiving conflicts; propagation delays are observed; throughput is maximized; queueing delay and delay variance are kept as small as possible. We formulate the scheduling problem into an integer linear programming (ILP) problem and present a novel heuristic algorithm - the destination slot set (DSS) algorithm. We compare the performance of DSS with an existing algorithm in TWIN - dynamic scheduling (DS), and show that while achieving the maximum throughput, DSS introduces much smaller queueing delay and delay variance than DS. We highlight that this is a requisite for providing QoS in TWIN, which was overlooked by previous works. We also show that DSS has a smaller computing complexity than DS, which makes it feasible for real-time scheduling.

Published in:

Networks, 2005. Jointly held with the 2005 IEEE 7th Malaysia International Conference on Communication., 2005 13th IEEE International Conference on  (Volume:2 )

Date of Conference:

16-18 Nov. 2005