By Topic

A new analytical model for computing blocking probability in optical burst switching 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

3 Author(s)
Kaheel, A.M. ; Cairo Technol. Dev. Center, IBM Egypt, Cairo ; Alnuweiri, H. ; Gebali, F.

This paper presents a new analytical model for calculating the blocking probability in Just-Enough-Time (JET)-based optical burst switching networks. Relationship to the problem of calculating the reservation probability in advance reservation systems is also discussed. The proposed analytical model takes into consideration the effects of the burst offset time and the burst length on the blocking probability. We use a (M+1)-state non-homogenous Markov chain to describe the state of an output link carrying M wavelength channels. In addition, we model each wavelength channel by a 2-state Markov chain. The offset time is drawn from a specified distribution so that wavelength reservation requests, made before a given time, build up to be a workload whose mean value declines with the reservation starting time. Furthermore, we express the blocking probability in terms of first passage time distributions to account for the burst length. To verify its accuracy, the model results are compared with the results of a sophisticated discrete-event simulation model. The model results were found to be in satisfactory agreement with simulation results.

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:24 ,  Issue: 12 )