Cart (Loading....) | Create Account
Close category search window
 

Random early blocking routing in VP-based ATM 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

2 Author(s)
Shun-Ping Chung ; Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Chi-Ming Tsai

With the advent of stored program control and common channel signaling, more network state information is available in a real-time fashion, and dynamically choosing route with real-time network state information becomes a popular topic. We focus on dynamic routing of virtual path (VP)-based ATM networks. First, the effective bandwidth is used to simplify call admission control (CAC) of VP-based ATM networks, while maintaining a certain level of multiplexing gain. We propose a novel dynamic routing random early blocking routing (REBR) as CAC for virtual connections. Further we derive approximation methods to calculate the call-level related performance measures, e.g., call blocking probability and expected revenue loss. It is shown that approximation results are close to simulation results for most cases considered. It is shown via approximation and/or simulation that REBR performs better than least loaded routing (LLR) under light and moderate traffic loads, while performs similar to LLR under heavy traffic loads. We also compare REBR and other routing schemes, and similar conclusions can be drawn. We consider 2-rate heterogeneous traffic cases. Last but not least, various dynamic routing schemes are compared under non-stationary traffic

Published in:

Information Networking, 2001. Proceedings. 15th International Conference on

Date of Conference:

2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.