By Topic

QoS routing computation with path caching: a framework and network performance

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

1 Author(s)
D. Medhi ; Missouri Univ., Kansas City, MO, USA

We present a framework for QoS routing computation with path caching. The framework has three phases to allow different levels of information to be processed at different timescales to effectively meet QoS requirement of a newly arrived flow. Path caching is introduced in the first phase to allow selection and filtering in subsequent phases. We describe several routing schemes that can fit into this framework. Through simulation results, we show where and how the benefit of path caching can be exploited depending on the number of paths cached, and when to invoke other controls. Our results show that QoS routing by itself cannot improve the network and/or service performance unless controls such as trunk reservation and source-based admission control are also activated. The invocation of these functions can also allow maximum benefit from the path caching framework.

Published in:

IEEE Communications Magazine  (Volume:40 ,  Issue: 12 )