Performance analysis of a novel traffic scheduling algorithm in slotted optical networks

Authors:
Daojun Xue;Yang Qin;Chee Kheong Siew
Affiliations:
School of EEE, Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore;School of EEE, Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore;School of EEE, Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore
Venue:
Computer Communications
Year:
2007

Citing 9
Cited 1

Virtual clock: a new traffic control algorithm for packet switching networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks—the single node case

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
The iSLIP scheduling algorithm for input-queued switches

IEEE/ACM Transactions on Networking (TON)
Optical burst switching (OBS) - a new paradigm for an optical Internet

Journal of High Speed Networks - Special issue on optical networking
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Advances in photonic packet switching: an overview

IEEE Communications Magazine
Light core and intelligent edge for a flexible, thin-layered, and cost-effective optical transport network

IEEE Communications Magazine
Providing deterministic quality-of-service guarantees on WDM optical networks

IEEE Journal on Selected Areas in Communications
Scheduling bursts in time-domain wavelength interleaved networks

IEEE Journal on Selected Areas in Communications

On modeling optical burst switching networks with fiber delay lines: A novel approach

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper considers the scheduling problem in a new slotted optical network called Time-Domain Wavelength Interleaved network (TWIN). The TWIN architecture possesses interesting properties, which may offer solutions for next-generation optical networks. Besides, better Quality of Service (QoS) could be achieved in TWIN by minimizing two parameters: queueing delay and delay variance. However, to the best of our knowledge, most of the existing scheduling algorithms in TWIN ignored consideration of QoS and focused mainly on maximizing the throughput. In this paper, we formulate the scheduling problem into an Integer Linear Programming (ILP) problem and propose a novel heuristic - Destination Slot Set (DSS) algorithm to solve it fast and efficiently. Besides, we derive an analytical model for TWIN and investigate the performance of DSS in it. By means of simulations, we demonstrate that our analytical model approximates the TWIN network very well; moreover, DSS incurs smaller queueing delay and delay variance, which ensures better QoS.