Implementation of Routing Protocols Using the P4 Language

November 15, 2022

DSDV is a distributed distance vector protocol that came to address the looping issues of the RIP protocol. Essentially, in DSDV, each node maintains its routing table, which includes, for all reachable destinations, their length, next hop, and sequence number. Each node updates its routing table by receiving advertisements from its neighbours. Unfortunately, the DSDV update procedure leads to route fluctuation due to its criteria on electing attributes. This means that, in some situations, a node may change routes back and forth between different neighbours, even though there were no changes in the topology. In this thesis we propose an extension to this protocol which we call “promise”. Its main novelty is that each node will not only elect its preferred routes, but will also keep other fallback routes (promise routes). A promise is a more recent route than the elected one, but with a worse metric (e.g., longer path length). The promise can thus be thought as a backup route which will be elected when there are changes in the topology.

Authors in the community:

• 

  J

  João Rodrigues Felício

  ist187542

Supervisors of this institution:

• 

  F

  Fernando Manuel Valente Ramos

  ist428757

• 

  J

  João Luís Da Costa Campos Gonçalves Sobrinho

  ist13908

electrical-engineering-electronic-engineering-information-engineering - Electrical engineering, electronic engineering, information engineering

eng - English

Instituto Superior Técnico