Composite burst assembly with high-priority packets in the middle of burst

In optical burst-switched (OBS) networks, packets are aggregated into bursts that are sent an offset time after the corresponding control packet. The process of aggregating high and low-priority traffic in the same burst is known as composite burst assembly, where high-priority and low-priority packets are placed at the head and the tail end of the burst, respectively. Such composite bursts are beneficial in order to resolve the contention by dropping low-priority packets when preemptive minimum overlap channel (P-MOC) scheduling algorithms are used. For non-preemptive minimum overlap channel with void-filling (NP-MOC-VF) scheduling algorithm, we propose that high-priority packets should be placed in the middle of a burst and low-priority packets at the head and tail ends of a burst. That allows dropping of low-priority packets from the head and the tail of a burst when it contends with two other bursts where the head of the burst contends with one burst and the tail contends with another. The simulation results show that high-priority traffic faces reduced loss at the cost of increased loss of low-priority traffic. In this paper, the effect of varying the proportion of high-priority packets in the middle of the burst has been studied.

[1]  Hyun Ha Hong Hong,et al.  A Data Burst Assembly Algorithm in Optical Burst Switching Networks , 2002 .

[2]  Chunming Qiao,et al.  Just-Enough-Time (JET): a high speed protocol for bursty traffic in optical networks , 1997, 1997 Digest of the IEEE/LEOS Summer Topical Meeting: Vertical-Cavity Lasers/Technologies for a Global Information Infrastructure/WDM Components Technology/Advanced Semiconductor Lasers and Application.

[3]  Jason P. Jue,et al.  Segmentation-Based Non-Preemptive Scheduling Algorithms for Optical Burst-Switched Networks , 2003 .

[4]  Vinod Vokkarane,et al.  Burst segmentation: an approach for reducing packet loss in optical burst switched networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[5]  Vinod Vokkarane,et al.  Prioritized burst segmentation and composite burst-assembly techniques for QoS support in optical burst-switched networks , 2003, IEEE J. Sel. Areas Commun..

[6]  L. Tancevski,et al.  A new scheduling algorithm for asynchronous variable length IP traffic incorporating void filling , 1999, OFC/IOOC . Technical Digest. Optical Fiber Communication Conference, 1999, and the International Conference on Integrated Optics and Optical Fiber Communication.

[7]  J.P. Jue,et al.  Segmentation-based nonpreemptive channel scheduling algorithms for optical burst-switched networks , 2005, Journal of Lightwave Technology.

[8]  Yijun Xiong,et al.  Control architecture in optical burst-switched WDM networks , 2000, IEEE Journal on Selected Areas in Communications.

[9]  Vinod Vokkarane,et al.  Generalized burst assembly and scheduling techniques for QoS support in optical burst-switched networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[10]  An Ge,et al.  On optical burst switching and self-similar traffic , 2000, IEEE Communications Letters.

[11]  Jason P. Jue,et al.  Threshold-based burst assembly policies for QoS support in optical burst-switched networks , 2002, SPIE ITCom.

[12]  Chunming Qiao,et al.  Study of traffic statistics of assembled burst traffic in optical burst-switched networks , 2002, SPIE ITCom.

[13]  Se-yoon Oh,et al.  A burst assembly algorithm in optical burst switching networks , 2002, Optical Fiber Communication Conference and Exhibit.

[14]  Tarek S. El-Bawab,et al.  A preemptive scheduling technique for OBS networks with service differentiation , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[15]  Vinod Vokkarane,et al.  Channel scheduling algorithms using burst segmentation and FDLs for optical burst-switched networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..