By Topic

Link selection schemes for avoiding channel contention

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Yu, F. ; Dept. of EECS, California Univ., Berkeley, CA, USA ; Sinha, R.K. ; Doverspike, R. ; Cortez, B.
more authors

This paper describes methods to reduce channel contention during distributed setup of high-speed connections in a mesh network of Cross-Connects (XCs) (R.D. Doverspike et al., 1999). A particular aspect of contention addressed here is when two different connection requests arrive on a pair of adjacent XCs and they choose the same restoration channels from spare inventory. Such a contention problem is often referred to as "glare". This paper gives channel selection methods that considerably reduce glare, while at the same time maintaining large groups of channels (for future high speed connections) across multiple, parallel links. We establish the benefit of our approach in a typical intercity backbone network. As shown in the simulation results, our channel selection mechanism can eliminate almost all the glare compared to the previously known algorithms, "Best-fit" and "Hi-Lo".

Published in:

Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings. Fourth International Workshop on

Date of Conference:

19-22 Oct. 2003