| dc.contributor.advisor | Bagnulo Braun, Marcelo | |
| dc.contributor.advisor | Azcorra, Arturo | |
| dc.contributor.author | Van Beijnum, Iljitsch | |
| dc.date.accessioned | 2021-07-13T09:53:13Z | |
| dc.date.available | 2021-07-13T09:53:13Z | |
| dc.date.issued | 2008-07 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.12761/1042 | |
| dc.description.abstract | The concurrent use of multiple paths through a
communications network has the potential to provide many benefits, including better utilization of the network and increased robustness. A key part of a multipath network architecture is the ability for routing protocols to install multiple routes over multiple paths in the routing table. In this paper we propose changes to local BGP processing that allow a BGP router to use multiple paths concurrently without
compromising loop-freeness. | |
| dc.language.iso | eng | |
| dc.subject.lcc | Q Science::Q Science (General) | |
| dc.subject.lcc | Q Science::QA Mathematics::QA75 Electronic computers. Computer science | |
| dc.subject.lcc | T Technology::T Technology (General) | |
| dc.subject.lcc | T Technology::TA Engineering (General). Civil engineering (General) | |
| dc.subject.lcc | T Technology::TK Electrical engineering. Electronics Nuclear engineering | |
| dc.title | Loop-freeness in multipath BGP through propagating the longest path | en |
| dc.type | master thesis | |
| dc.type.hasVersion | VoR | |
| dc.rights.accessRights | open access | |
| dc.description.department | Telematics Engineering | |
| dc.description.institution | Universidad Carlos III de Madrid, Spain | |
| dc.subject.keyword | Routing | |
| dc.subject.keyword | BGP | |
| dc.subject.keyword | multipath | |
| dc.subject.keyword | loop-freeness | |
| dc.description.status | pub | |
| dc.eprint.id | http://eprints.networks.imdea.org/id/eprint/301 | |
