An Interior Path Vector Routing Protocol

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.

• Type: Conference
• Year: 2006
• Where: LCN
• Authors: Conor Creagh, Cormac J. Sreenan
• Keywords: LCN 2006, Path Vectors, Shortest Path Trees, Today’s Intra-domain Protocols