You are free to design the format and structure of the routing table kept locally by each node and exchanged among neighboring nodes.

1. Upon the activation of the program, each node should construct the initial routing table and keep it locally.

2. Once the link and distance information for all the nodes are specified, the routing table information will be exchanged among network neighbors. Each node should send its routing table information to its neighbors at least once. (See the command syntax section for more detail on how the process starts.)

3. Using the Bellman-Ford algorithm, each node will keep updating its routing table as long as neighboring nodes send their updated routing tables information.

4. If there is any change in the routing table, a node should send the updated information to its neighbors.

Due to the nature of the UDP protocol, packets may be lost or delivered out of order to the application. Thus you may consider to add some kind of time stamp or sequence information to each packet (i.e. each routing table), so that each node can update its own routing table accordingly. Note that if the process is implemented properly, the routing information exchange should converge (stop) as soon as all nodes in the network obtain the routing tables with the shortest pathes information.

 

Posted Date: 2/20/2013 4:16:03 AM | Location : United States

Ask an Expert

Related Discussions:- routing information exchange and bellman-ford algorithm, Assignment Help, Ask Question on routing information exchange and bellman-ford algorithm, Get Answer, Expert's Help, routing information exchange and bellman-ford algorithm Discussions

Write discussion on routing information exchange and bellman-ford algorithm
Your posts are moderated

Write your message here..

Related Questions

Documenting the results of risk assessment, Documenting the Results of Risk... Documenting the Results of Risk Assessment The goal of this process is to recognize the information assets, list them, and rank according to those most required protection. The

Distinguish between passive and active attacks, Problem (a) Distinguis... Problem (a) Distinguish between passive and active attacks. (b) Give two reasons why it is important to organise security awareness programs for users. (c) Describe how

Tree decomposition, (a) Define what you understand by the following terms ... (a) Define what you understand by the following terms in Network Flows: i) UnDirected Path ii) Directed Path iii) Directed Cycle. iv) Tree In each of the above, expla

Distinguish between a mobile agent state and code, Question: (a) Disti... Question: (a) Distinguish between a mobile agent "state" and "code". (b) Differentiate between "weak" and "strong" mobility. (c) Mobile agent systems are known to have

Md Fayzul karim, How can I get help for Linux automotion configuration (... How can I get help for Linux automotion configuration (Network, virtualization, security and Firewal etc) with bash scrip. What is the charge for.

Star topology, STAR TOPOLOGY In this topology, all devices are attache... STAR TOPOLOGY In this topology, all devices are attached to a central point, which is sometimes known as the "Hub" as given in the diagram below.   Figure: An ideal

Corresponding access control matrix, Consider a computer system with three ... Consider a computer system with three users: Alice, Bob and Cindy. Alice owns the file alicerc, and Bob and Cindy can read it. Cindy can read and write the file bobrc, which Bob ow

Minimum cost flow problem, QUESTION (a) A convex flow problem is a no... QUESTION (a) A convex flow problem is a non linear network flow problem. Explain how a convex flow problem could be transformed into a Minimum Cost Flow problem. (b) Exp

Packet filtering firewall-dynamic packet filtering, Dynamic Packet Filterin... Dynamic Packet Filtering Dynamic Packet Filtering is also referred to as stateful firewalling. Here the firewall maintains the status of connections as well. When a connection

Hacking, what is hacking what is hacking