Near‐Optimal Algorithm for Group Scheduling in OBS Networks

• Published in: ETRI journal Vol. 37; no. 5; pp. 888 - 897
• Main Authors: Nhat, Vo Viet Minh, Quoc, Nguyen Hong, Son, Nguyen Hoang
• Format: Journal Article
• Language: English
• Published: Electronics and Telecommunications Research Institute (ETRI) 01.10.2015; 한국전자통신연구원
• Subjects: group scheduling; interval graph; maximum‐weight clique; OBS networks; optimization; 전자/정보통신공학
• ISSN: 1225-6463; 2233-7326; 2233-7326
• DOI: 10.4218/etrij.15.2415.0019

Group scheduling is an operation whereby control packets arriving in a time slot schedule their bursts simultaneously. Normally, those bursts that are of the same wavelength are scheduled on the same channel. In cases where the support of full wavelength converters is available, such scheduling can be performed on multiple channels for those bursts that are of an arbitrary wavelength. This paper presents a new algorithm for group scheduling on multiple channels. In our approach, to reach a near‐optimal schedule, a maximum‐weight clique needs to be determined; thus, we propose an additional algorithm for this purpose. Analysis and simulation results indicate that an optimal schedule is almost attainable, while the complexity of computation and that of implementation are reduced.