TY - GEN
T1 - An interior path vector routing protocol
AU - Creagh, Conor
AU - Sreenan, Cormac
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/46149121536
U2 - 10.1109/LCN.2006.322096
DO - 10.1109/LCN.2006.322096
M3 - Conference proceeding
AN - SCOPUS:46149121536
SN - 1424404185
SN - 9781424404186
T3 - Proceedings - Conference on Local Computer Networks, LCN
SP - 169
EP - 176
BT - Proceedings - The 31st IEEE Conference on Local Computer Networks, LCN 2006
T2 - 31st Annual IEEE Conference on Local Computer Networks, LCN 2006
Y2 - 14 November 2006 through 16 November 2006
ER -