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

Assignment Help:

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.

 


Related Discussions:- routing information exchange and bellman-ford algorithm

Network simplex method, QUESTION: (a) Briefly explain the steps invol...

QUESTION: (a) Briefly explain the steps involved in Network Simplex Method. (b) What data structures you would expect in the Network Simplex Method. Show the data struct

TCP / IP, Let me know the details of protocol tcp/ip

Let me know the details of protocol tcp/ip

Explain how the diffie-hellman key agreement protocol works, (a) Using Fer...

(a) Using Fermat's theorem, find 3 201 mod 11. (b) Explain how the Diffie-Hellman key agreement protocol works and what its purpose and main properties are. Consider a Dif

routing information exchange and bellman-ford algorithm, You are free to d...

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

Identify possible controls-information security, Identify Possible Controls...

Identify Possible Controls For each threat and linked vulnerabilities which have residual risk, create primary list of control ideas. Residual risk is the risk which remains to

What is information-information security, What is information Informatio...

What is information Information comprises the meanings and interpretations which people place upon the facts, or data. The value of information springs from the ways it can be i

Benchmarking-information security, Benchmarking An alternative approach to...

Benchmarking An alternative approach to risk management is Benchmarking. It is process of seeking out and studying practices in other organizations which one’s own organization de

Udp- datagram transport service, UDP- DATAGRAM TRANSPORT SERVICE INT...

UDP- DATAGRAM TRANSPORT SERVICE INTRODUCTION:  UDP is the one of the transport protocols in TCP/IP protocol suite. UDP protocol accepts applications on the computers to

Innovative nature of triple key management, Innovative nature of triple key...

Innovative nature of triple key management The triple key management scheme provides secure services by combining different techniques whic contribute to the security and priv

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd