Pre-estimate burst scheduling (PEBS): an efficient architecture with low realization complexity for burst scheduling disciplines

Sascha Junghans

2nd International ICST Conference on Broadband Networks

Research Article

Pre-estimate burst scheduling (PEBS): an efficient architecture with low realization complexity for burst scheduling disciplines

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/ICBN.2005.1589733,
    author={Sascha Junghans},
    title={Pre-estimate burst scheduling (PEBS): an efficient architecture with low realization complexity for burst scheduling disciplines},
    proceedings={2nd International ICST Conference on Broadband Networks},
    publisher={IEEE},
    proceedings_a={BROADNETS},
    year={2006},
    month={2},
    keywords={},
    doi={10.1109/ICBN.2005.1589733}
}

Sascha Junghans
Year: 2006
Pre-estimate burst scheduling (PEBS): an efficient architecture with low realization complexity for burst scheduling disciplines
BROADNETS
IEEE
DOI: 10.1109/ICBN.2005.1589733

Sascha Junghans¹^,*

1: Institute of Communication Networks and Computer Engineering (IKR), Stuttgart, Germany, Telephone:+49711/685-7974, Fax:+49711/685-7983

*Contact email: junghans@ikr.uni-stuttgart.de

Abstract

Optical burst switching (OBS) (C. Qiao and M. Yoo, 1999) is a promising candidate for a more dynamic optical network layer. The scheduling of bursts in OBS core nodes is an important task for achieving good network performance. A lot of scheduling algorithms were published, but so far only few work was done on analyzing the realization complexity and on building prototypes for scheduling modules. In this paper we present for the first time the new scheduling scheme pre-estimate burst scheduling (PEBS) which reduces the realization complexity of scheduling modules by precalculating parts of the scheduling decisions

Published: 2006-02-13
Publisher: IEEE

: http://dx.doi.org/10.1109/ICBN.2005.1589733