Performance Issues in Optical Burst/Packet Switching
Towards Digital Optical Networks
A flexible contention resolution scheme for QoS provisioning in optical burst switching networks
Computer Communications
Fair scheduling in optical burst switching networks
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Service differentiation by preemptive wavelength conversion in optical burst switched networks
Proceedings of the 7th International Conference on Frontiers of Information Technology
A new size-based burst assembly scheme for OBS switches
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
A novel scheme to reduce burst-loss and provide qos in optical burst switching networks
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Research in optical burst switching within the e-Photon/ONe network of excellence
Optical Switching and Networking
The study of QoS guarantee in the optical burst switching internet backbone
Optical Switching and Networking
Optical Switching and Networking
A performance comparison of OPS with variable-size packets and OBS
Optical Switching and Networking
| Hi-index | 0.00 |
Classical approaches to quality-of-service (QoS) provisioningin IP networks are difficult to apply in all-opticalnetworks. This is mainly because there is no optical counterpartto the store-and-forward model that mandates theuse of buffers for queuing packets during contention forbandwidth in electronic packet switches. Since plain IP assumesa best effort service model, there is a need to devisemechanisms for QoS provisioning in IP over wavelength-division-multiplexing, or IP-over-WDM, networks. In thispaper we propose a new scheme, called Preemptive PrioritizedJust Enough Time (PPJET), for QoS provisioningin buffer-less optical burst switching (OBS) networks. PP-JETprovides strict priority for high priority traffic by droppingreservations belonging to lower priority traffic using anew channel scheduling algorithm called Preemptive LatestAvailable Unused Channel with Void Filling (PLAUC-VF).Furthermore, we study the performance of PPJET throughsimulation experiments, and we show that PPJET outperformsPrioritized Just Enough Time (PJET) in terms ofdropping probability and end-to-end delay.