The full text of this article:

Load-balancing contention resolution in OBS networks based on GMPLS
by Haibo Wen, Huan Song, Lemin Li, Sheng Wang
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 3, No. 1, 2005
Abstract: Contention resolution (CR) in optical burst switching (OBS) networks is a hot topic in the academia. However, most previous research was done within the local core switching node. In this paper, we investigate an integrated CR technique in OBS networks based on generalised multi-protocol label switching (GMPLS). At first, a new network model is proposed, in which a label switched path (LSP) is just composed of a series of links and not assigned with any wavelength, and the wavelengths are decided when core switches process the control packets. Then, we propose a novel technique, i.e., load-balancing contention resolution (LBCR), which is divided into two parts: within the network layer, CR is done with load-balancing technology; within the node layer, local CR algorithms can be employed. Simulations show that LBCR can reduce burst contention and burst loss probability.

is only available to individual subscribers or to users at subscribing institutions.

Pay per view: If you are not a Subscriber and you just want to read the full contents of this article, please click here to purchase online access to the full-text of this article. Please allow 3 days + mailing time. Current price for article is Thirty Euros (€30)

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN) journal, that have been redirected here, please check if you have a registered username/password subscription with Inderscience. If that is the case, please Login:

If you are not yet a Subscriber to International Journal of High Performance Computing and Networking (IJHPCN) journal, you can subscribe by following a few simple and quick steps. A subscription will give you complete access to all articles in the current issue, as well as to all articles in the previous three years, where applicable. Click here to subscribe.

Should you experience further difficulties or have any enquiries, please email subs@inderscience.com