routing information exchange and bellman-ford algorithm, Computer Network Security

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







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
Related Questions
QUESTION (a) Hashing and salting is commonly used as password storage techniques for most applications. Describe how hashing and salting enable secure storage of password (b

QUESTION (a) Describe the two possible configurations for 3DES (b) What is the main disadvantage of 3DES? (c) Why are most modern symmetric algorithm block ciphers? (d

(a) Illustrate what you understand by Nyquist Capacity Theorem? (b) Consider we wish to transmit at a rate of 64 kbps over a 4 kHz noisy but error-free channel. What is the mini


POINT-TO-POINT: In Point-to-Point topology there are two kind of topologies. 1) STAR topology 2) TREE topology In star topology each and every computer is connect

Q. Explain the random key distribution? The triple key management mechanisms ensure a better and complete security solution using the random key distribution mechanism. In this

Ask question #Minimum.. 100 words accepted#

(a) Cost allocation mechanisms are important when it comes to establishing other aspects of inter-firm compensations and how these are transferred to the users. There are two pri

types of firewall and backup

Problem (a) Below is a capture of an Ethernet II frame which contains an IPv4 packet and a TCP segment. The second screen capture is from the data portion of the frame.