Performance Analysis of Scheduling Algorithms in Optical Burst Switching (OBS) Networks

Author

Zheng, Hongyun ; Chen, Changjia

Author_Institution

Beijing Jiaotong Univ., Beijing

fYear

2007

fDate

5-7 Sept. 2007

Firstpage

557

Lastpage

557

Abstract

OBS is an efficient paradigm that transporting traffic directly over optical links, and has received considerable attention. It seems a challenge to analyze scheduling problem. In this paper we model and analyze channel utilization performance of IAUC, OBS-GS and MWIS-OS algorithms. The scheduling is modeled as a random graph space on grouping scheduling basis. Performance comparison of the three scheduling algorithms is measured with the number of independent sets, maximum independent sets and weight maximum independent sets. The lower and upper bound of gain obtained by MWIS-OS are presented. Numerical results are shown as well.

Keywords

channel allocation; graph theory; optical fibre networks; scheduling; set theory; telecommunication switching; telecommunication traffic; LAUC; MWIS-OS algorithms; OBS networks; channel utilization performance; grouping scheduling; maximum independent sets; optical burst switching networks; optical links; random graph space; scheduling algorithms; transporting traffic; weight maximum independent sets; Algorithm design and analysis; Bandwidth; Filling; Optical burst switching; Performance analysis; Scheduling algorithm; Telecommunication traffic; Traffic control; Upper bound; Wavelength division multiplexing;

fLanguage

English

Publisher

ieee

Conference_Titel

Innovative Computing, Information and Control, 2007. ICICIC '07. Second International Conference on

Conference_Location

Kumamoto

Print_ISBN

0-7695-2882-1

Type

conf

DOI

10.1109/ICICIC.2007.448

Filename

4428199