Joint Congestion Control and Burst Contention Resolution in Optical Burst Switching Networks

Abstract

This paper revisits burst contention resolution problems in optical burst switching (OBS) networks from the viewpoint of network utility maximization. Burst collision occurs when two or more bursts access the same wavelength simultaneously, and the occurrence becomes more frequent as the offered load increases. In particular, when the network is overloaded, no contention resolution scheme would effectively avoid the collision without the help of congestion control. We formulate a joint optimization problem where two variables, the length and the time at which each burst is injected into the network, are jointly optimized in order to maximize aggregate utility while minimizing burst loss. A distributed algorithm is also developed, which explicitly reveals how burst contention resolution and congestion control must interact. The simulation results show that the joint control decouples throughput performance from burst loss performance so that burst loss ratio does not increase as network throughput increases. This is not the case in conventional contention resolution schemes where burst loss ratio increases as network throughput increases so that achievable network throughput is limited. Our work is the first attempt to the joint design of congestion and contention control and might lead to an interesting development in OBS research.1930-529X/07/$25.00 © 2007 IEEE This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE GLOBECOM 2007 proceedings.

Pre-Deflection Routing with Blocking Probability Estimation Scheme in Optical Burst Switch Networks

“…When the burst is deflected onto an alternate route the preference is given to shorter routes. A burst is considered blocked if it arrives at a given node where all output links are busy or while trying alternate trunks, the burst reaches the maximum allowable number of deflections [11,12].…”

Survey of QoS issues for TCP connections in Optical Burst Switched Networks

“…Representative of Horizon algorithms are: First Fit Unscheduled Channel (FFUC) [7,6,8], Latest Available Unused Channel (LAUC) [8,9] and that of void filling algorithms are: First Fit Unscheduled Channel with Void Filling (FFUC-VF) [7], Latest Available Unused Channel with Void Filling (LAUC-VF) [9,10,11] and Minimum End Void (Min-EV) [11].…”

“…Those which consider voids within channels are called void filling algorithm. According to scheduling strategy used scheduling algorithms can be classified as Horizon or without void filling [5] and with void filling [6].…”

Congestion Control Strategy in Optical Burst Switching Networks

“…Due to bandwidth efficiency & implementation simplicity, Optical Burst switching networks (OBS) is considered as a up and coming improvement for data transfer in optical networks [1]. Optical Burst Switching is a high-speed switching technology that combines the advantages of optical circuit switching and optical packet switching.…”