By Topic

Link State Information Approximation for Hierarchical QoS Routing

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

2 Author(s)
Sora Kwon ; Dept. of Comput. Sci. & Eng., Hanyang Univ., Ansan, South Korea ; Changho Jeon

In this paper, Service Boundary Line approximation method is proposed to improve the accuracy of aggregated link state information in transport networks that conduct hierarchical QoS routing. This method selects the main link state information in the network and transports the data to the external networks together with the aggregation information, reducing information distortion caused from the loss of some link state information during link aggregation process. The proposed method is especially useful for aggregating links that have both delay and bandwidth as their QoS parameters. Simulation results show that our approximation method requires a storage space that is 1.5-2 times larger than those in other known techniques, depending on the main line state information selection method, but that information accuracy is 2-5 times higher.

Published in:

2011 International Conference on Information Science and Applications

Date of Conference:

26-29 April 2011