Dynamic load balancing in IP-over-WDM optical burst switching networks

In this paper, we consider the problem of dynamic load balancing in wavelength division multiplexing (WDM)-based optical burst switching (OBS) networks. We propose a load balancing scheme based on adaptive alternate routing aimed at reducing burst loss. The key idea of adaptive alternate routing is...

Full description

Saved in:
Bibliographic Details
Published in:Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2005-02, Vol.47 (3), p.393-408
Main Authors: Li, J., Mohan, G., Chua, K.C.
Format: Article
Language:English
Subjects:
Advantages
Applied sciences
Congestion control
Exact sciences and technology
Internet Protocol
Load balancing
Network switching
Networks
Optical burst switching
Optical systems
Routing
Studies
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teletraffic
Traffic congestion
Traffic engineering
Traffic flow
Transmission and modulation (techniques and equipments)
Wave division multiplexing
Wavelength division multiplexing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we consider the problem of dynamic load balancing in wavelength division multiplexing (WDM)-based optical burst switching (OBS) networks. We propose a load balancing scheme based on adaptive alternate routing aimed at reducing burst loss. The key idea of adaptive alternate routing is to reduce network congestion by adaptively distributing the load between two pre-determined link-disjoint alternative paths based on the measurement of the impact of traffic load on each of them. We develop two alternative-path selection schemes to select link-disjoint alternative paths to be used by adaptive alternate routing. The path selection schemes differ in the way the cost of a path is defined and in the assumption made about the knowledge of the traffic demands. Through extensive simulation experiments for different traffic scenarios, we show that the proposed dynamic load balancing algorithm outperforms the shortest path routing and static alternate routing algorithms.
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2004.07.019