Computing approximate blocking probability in hierarchical wavelength routing optical networks

Feng Zhang; Xiaoping Zheng; Hanyi Zhang

doi:10.1117/12.572533

8 February 2005 Computing approximate blocking probability in hierarchical wavelength routing optical networks

Feng Zhang, Xiaoping Zheng, Hanyi Zhang

Proceedings Volume 5626, Network Architectures, Management, and Applications II; (2005) https://doi.org/10.1117/12.572533
Event: Asia-Pacific Optical Communications, 2004, Beijing, China

Abstract

Rapid development of optical communication techniques has made possible large scale wavelength routing optical networks. Nowadays, these networks are deployed worldwide. Large scale networks have natural hierarchies due to either geographical reasons or administrative consideration and are therefore managed in a hierarchical way correspondingly. That is, networks are composed of several subnetworks, which are themselves composed of other even smaller subnetworks. Erlang fixed point approximation (reduced load approximation) has been extensively used in performance evaluation of end to end call blocking probability in traditional circuit switching networks, which are also called loss networks. This method has also been extended for hierarchical loss networks. However, performance evaluation of call blocking probability in hierarchical wavelength routing optical networks has not yet been presented. In this paper, a kind of approximation method is developed for analyzing end to end call blocking probability in hierarchical wavelength routing optical networks. By iteratively running processes combining a top-down load distribution and a bottom-up calculation of node-pair blocking in the network hierarchy, a steady state will be reached and approximate end to end call blocking probability in hierarchical wavelength routing optical network is obtained. Both the link independent model and the link correlation model are used in our analysis. By comparing theoretical results derived from our approximation method and results obtained from discrete event simulation, we illustrate that our method gives reasonable estimate of end to end call blocking probability in hierarchical wavelength routing optical networks, with the correlation model giving much more accurate estimate than the independent model.

Citation Download Citation

Feng Zhang, Xiaoping Zheng, and Hanyi Zhang "Computing approximate blocking probability in hierarchical wavelength routing optical networks", Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); https://doi.org/10.1117/12.572533

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
9 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Optical networks

Optical communications

Lithium

Performance modeling

Network security

Circuit switching

Computer simulations

Show All Keywords

Keywords/Phrases

Search In:

Publication Years