TY - GEN
T1 - A strict priority scheme for quality-of-service provisioning in optical burst switching networks
AU - Kaheel, Ayman
AU - Alnuweiri, Hussein
PY - 2003
Y1 - 2003
N2 - Classical approaches to quality-of-service (QoS) provisioning in IP networks are difficult to apply in all-optical networks. This is mainly because there is no optical counterpart to the store-and-forward model that mandates the use of buffers for queuing packets during contention for bandwidth in electronic packet switches. Since plain IP assumes a best effort service model, there is a need to devise mechanisms for QoS provisioning in IP over wavelength-division-multiplexing, or IP-over-WDM, networks. In this paper, we propose a new scheme; called preemptive prioritized just enough time (PPJET), for QoS provisioning in buffer-less optical burst switching (OBS) networks. PPJET provides strict priority for high priority traffic by dropping reservations belonging to lower priority traffic using a new channel scheduling algorithm called preemptive latest available unused channel with void filling (PLAUC-VF). Furthermore, we study the performance of PPJET through simulation experiments, and we show that PPJET outperforms prioritized just enough time (PJET) in terms of dropping probability and end-to-end delay.
AB - Classical approaches to quality-of-service (QoS) provisioning in IP networks are difficult to apply in all-optical networks. This is mainly because there is no optical counterpart to the store-and-forward model that mandates the use of buffers for queuing packets during contention for bandwidth in electronic packet switches. Since plain IP assumes a best effort service model, there is a need to devise mechanisms for QoS provisioning in IP over wavelength-division-multiplexing, or IP-over-WDM, networks. In this paper, we propose a new scheme; called preemptive prioritized just enough time (PPJET), for QoS provisioning in buffer-less optical burst switching (OBS) networks. PPJET provides strict priority for high priority traffic by dropping reservations belonging to lower priority traffic using a new channel scheduling algorithm called preemptive latest available unused channel with void filling (PLAUC-VF). Furthermore, we study the performance of PPJET through simulation experiments, and we show that PPJET outperforms prioritized just enough time (PJET) in terms of dropping probability and end-to-end delay.
UR - http://www.scopus.com/inward/record.url?scp=84883883145&partnerID=8YFLogxK
U2 - 10.1109/ISCC.2003.1214095
DO - 10.1109/ISCC.2003.1214095
M3 - Conference contribution
AN - SCOPUS:84883883145
SN - 076951961X
SN - 9780769519616
T3 - Proceedings - IEEE Symposium on Computers and Communications
SP - 16
EP - 21
BT - Proceedings - 8th IEEE International Symposium on Computers and Communication, ISCC 2003
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 8th IEEE International Symposium on Computers and Communication, ISCC 2003
Y2 - 30 June 2003 through 3 July 2003
ER -