Loop-freeness in multipath BGP through propagating the longest path

Van Beijnum, Iljitsch; Crowcroft, Jon; Valera Pintor, Francisco; Bagnulo Braun, Marcelo Gabriel

e-Archivo Principal
→
Investigación
→
Departamentos
→
Departamento de Ingeniería Telemática
→
DIT - Comunicaciones en Conferencias Internacionales / International Conferences
→
Ver ítem

Loop-freeness in multipath BGP through propagating the longest path

Autor(es): Van Beijnum, Iljitsch; Crowcroft, Jon; Valera Pintor, Francisco; Bagnulo Braun, Marcelo Gabriel

Editorial: IEEE

Fecha de edición: 2009-08-18

Cita: International Workshop on the Network of the Future, IEEE International Conference on Communications Workshops, 2009. ICC Workshops 2009. Proceedings. IEEE, 2009

ISBN: 978-1-4244-3437-4

DOI: 10.1109/ICCW.2009.5207968

Agradecimientos: This work has been partly funded by Trilogy, a research project (ICT-216372) supported by the European Community under its Seventh Framework Programme.
European Community's Seventh Framework Program

Revisado: PeerReviewed

Versión del editor: http://dx.doi.org/10.1109/ICCW.2009.5207968

Proyecto: info:eu-repo/grantAgreement/EC/FP7/216372

Palabras clave: Routing , BGP , Multipath , Loop-freeness

URI: http://hdl.handle.net/10016/10794

Derechos: © IEEE

Resumen:

The concurrent use of multiple paths through a communications network has the potential to provide many benefits, including better utilisation of the network and increased robustness. A key part of a multipath network architecture is the ability for routing pr [+]

Nota:

Proceeding of: International Workshop on the Network of the Future (FUT-NET 2009), In: IEEE International Conference on Communications Workshops, 2009. ICC Workshops 2009, Dresden, Germany, 14-18 June 2009

Mostrar el registro completo del ítem