By Topic

An Interior Path Vector Routing Protocol

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)
Creagh, C. ; Dept. of Comput. Sci., Coll. Cork Univ. ; Sreenan, C.

Today's intra-domain protocols are limited in their scalability. We examine these limitations and propose an alternative in the form of an IGP based on path vectors. Taking advantage of the recent research interest in BGP's performance, we are able to develop a protocol that converges quickly, produces a relatively low level of control-plane traffic and promises to scale to very large networks, while still producing shortest path trees based on minimising latency or maximising bandwidth. We show that such a protocol converges and present results of its simulation

Published in:

Local Computer Networks, Proceedings 2006 31st IEEE Conference on

Date of Conference:

14-16 Nov. 2006