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

Load-balanced path provisioning for guaranteeing end-to-end QoS in inter-domain 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)
Suksomboon, K. ; Dept. of Electr. Eng., Chulalongkorn Univ., Bangkok, Thailand ; Yusheng Ji ; Pongpaibool, P. ; Chaodit Aswakul

Although new applications and services in next-generation networks will lead to the offering of end-to-end QoS guarantees, relatively few studies have explicitly considered the concept of load balancing under the condition of guaranteed end-to-end QoS in an inter-domain network. The load-balanced path-classification (LBPC) scheme described in this paper provides end-to-end QoS guarantees across inter-domain networks and dynamically balances the load in an intra-domain. This scheme extends the path-classification scheme by combining a technique for balancing the load with one for assigning responsibility for ensuring that the guaranteed QoS is provided. Because the interaction between Internet service providers in a non-cooperative environment is considered, non-cooperative game theory is used to identify the optimal operating point of the LBPC scheme. Evaluation of the scheme's performance by applying it to three concatenated network domains showed that the optimal LBPC, “LBPC with Nash equilibrium,” provides the best performance in terms of call blocking probability and utility compared with the most-effort, least-effort, equal-distribution, and Path-Classification scheme with Nash equilibrium policies.

Published in:

Communications and Information Technologies (ISCIT), 2010 International Symposium on

Date of Conference:

26-29 Oct. 2010

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.