By Topic

OPNp1-3: Contention-Free l-Planes in Optically Burst-Switched WDM Networks

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

4 Author(s)
Hirata, K. ; Grad. Sch. of Eng., Osaka Univ., Suita ; Matsuda, T. ; Nagamochi, H. ; Takine, T.

This paper proposes a contention-free burst scheduling scheme in optically burst-switched WDM networks. We construct contention-free wavelength planes (lambda-planes) by assigning dedicated wavelengths to each ingress node. Bursts are transmitted to their egress nodes on lambda-planes, along routes forming a spanning tree. As a result, contention at intermediate core nodes is completely eliminated, and contention at ingress nodes is resolved by means of electric buffer. This paper develops a spanning tree construction algorithm, aiming at balancing input loads among output ports at each ingress node. Further a wavelength assignment algorithm is proposed, which is based on the amount of traffic lost at ingress nodes. We show that the proposed scheme can decrease the burst loss probability drastically, even if traffic intensities at ingress nodes are different.

Published in:

Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE

Date of Conference:

Nov. 27 2006-Dec. 1 2006