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

Zheng, Hongyun; Chen, Changjia

doi:10.1109/icicic.2007.448

Cited by 4 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The group scheduling of LGS also becomes the problem of finding the longest path in this graph. However, the complexity of LGS which is proven in [5] is only linear.…”

Section: Introductionmentioning

confidence: 99%

“…The typical representatives of this kind of scheduling algorithms are LAUC [2] and LAUC-VF [3] In the case of group scheduling; the BHPs arriving in each timeslot will schedule their following bursts simultaneously. OBS-GS [4], MWIS-OS [5] and LGS [6] are the proposals for group scheduling.…”

Section: Introductionmentioning

confidence: 99%

“…In [4] and [5], the set of arriving bursts are mapped into an interval graph in which each burst corresponding to a vertex and two vertices are adjacent (having a connecting edge) if the corresponding bursts overlap together. In the case of MWIS-OS, each vertex is added one more weight which represent the burst length.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Group Scheduling for MultiChannel in OBS Networks

Quoc

Sơn

2014

REV-JEC

View full text Add to dashboard Cite

Abstract-Group scheduling is a scheduling operation of optical burst switching networks in which the burst header packets arriving in each timeslot will schedule their following bursts simultaneously. There have been many proposals for group scheduling (such as OBS-GS, MWIS-OS and LGS), but they consider mainly to schedule the arriving bursts which have the same wavelength on an output data channel. Another suggestion is GreedyOPT which considers the group scheduling for multichannel with the support of full wavelength converters, but it is not optimal. This article proposes another approach of group scheduling which is more optimal and has a linear complexity.

show abstract

“…The group scheduling of LGS also becomes the problem of finding the longest path in this graph. However, the complexity of LGS which is proven in [5] is only linear.…”

Section: Introductionmentioning

confidence: 99%