By Topic

An investigation of inter-domain control aggregation procedures

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

3 Author(s)
R. Sofia ; ESE, Pennsylvania Univ., Philadelphia, PA, USA ; R. Guerin ; P. Veiga

Current quality of service models such as those embodied in the differentiated services proposal, rely on data path aggregation to achieve scalability. Data path aggregation bundles into a single aggregate multiple flows with the same quality requirements, hence decreasing the amount of state to be kept. A similar scalability concern exists on the control path, where the state required to account for individual reservations needs to be minimized. There have been several proposals aimed at control path aggregation, and the goal of the paper is to expand on these works in an attempt to gain a better understanding of the various parameters that influence the efficiency of different approaches. In particular, we focus on inter-domain control aggregation, and compare an autonomous system (AS) sink-tree based approach with two examples of a shared AS segment based approach, in terms of the amount of state kept, both per AS and per edge router Our main contributions are in providing a greater understanding into the design of efficient control path aggregation methods.

Published in:

Network Protocols, 2002. Proceedings. 10th IEEE International Conference on

Date of Conference:

12-15 Nov. 2002