By Topic

Computing loss probability for dynamic traffic grooming in optical networks with wavelength conversion

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
$33 $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)
Chunsheng Xin ; Dept. of Comput. Sci., Norfolk State Univ., VA, USA ; Jikai Li ; Xiaojun Cao ; Bin Wang

With the huge capacity, wavelength division multiplexing (WDM) optical networks are predominantly used as the transport infrastructure to carry inter-domain traffic for client networks. Traffic grooming refers to the aggregation of low-speed client traffic flows onto high-capacity optical connections, to achieve cost-effective traffic transport. In this paper, we propose a route segment technique to efficiently compute the client traffic blocking probability in dynamic traffic grooming, where client traffic randomly arrives/departs. In our experiments, the blocking probabilities computed by this technique closely match the results obtained by simulations.

Published in:

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.  (Volume:1 )

Date of Conference:

28 Nov.-2 Dec. 2005