Two processes communicate with another process through its UDP socket: (1) Upon receiving any distance vector entries from any neighboring router or detecting a new neighbor or the link cost change to a neighbor, the router will use the Bellman-Ford Equation to update its distance vector (2) Then for any change in its distance vector, the router will broadcast the changed distance vector entries to its neighboring routers through a UDP socket and print out the changed entries to the console. Each router is assigned with a unique router ID (English letter). Events We will use the running processes to simulate routers. Its neighboring routers’ distance vectors.For each entry, the five columns are source router ID, destination router ID, distance, number of hops, the router ID for the next router in routing, respectively. It shall display as follows: AB 71B A C 10 2 B There are two entries in this distance vector. All link cost information to all active neighbors.1 Design Data Each router needs to maintain three different data: In this assignment, you will be asked to build a distance vector routing protocol that implements the distributed Bellman-Ford algorithm. The purpose of this project is to learn how distributed dynamic routing protocols like distance vector accomplish routing in practice.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |