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
Protocols for Secure Communications Securing Internet Communication by using S-HTTP and SSL Secure Socket Layer (SSL) protocol is a protocol that uses public key encryption t

Question: a) Explain what you understand by the term brute force attack, giving an example of such an attack b) Briefly outline the concept of Caesar cipher and identify a

Stateless Packet Filtering Stateless or static packet filtering is the most straightforward kind of packet filtering that allows or disallows data transfer based on the addres

QUESTION a) Compare and contrast between static and dynamic routing. b) What are the merits (five merits) and limitations (3 limitations) of using Open Shortest Path First

RISK ASSESSMENT Risk assessment is a step in a risk management technique. Risk assessment is the determination of quantitative or qualitative value of risk related to a concrete

Question 1 a) Explain how CSMA/CD works. b) Describe the term "exponential back-off". c) Describe the differences between "circuit switching" and "packet switching". d) Th

WFABilling project in Java:  Project Title: WFABilling   Role                      : Developer Domain                 : Tele-Com Environment          : Java, J2EE, S

IP DATAGRAM SIZE:  Datagrams may have different sizes i.e. Header area is generally fixed (20 octets) but can have various options. Data area may contain between 1 octet and 6


With explain the encryption model the help of diagram. Symmetric cipher model uses the secret-key or a single-key for encryption/decryption purposes. It employs a symmetric encr