Initialization - network layer and routing , Computer Networking


Imagine that  all routers in our  sample internetwork  comes up  at the  same time. Each router sends a greeting packet to its  neighbours to find  out the  state  of each link. It then  prepares an LSP based on  results of these greeting  and floods the network  with it. Figure  shows this  process  for router. The same step are performed  by ever  router  in the router  in the network  as each come up.

Posted Date: 3/16/2013 3:16:47 AM | Location : United States

Related Discussions:- Initialization - network layer and routing , Assignment Help, Ask Question on Initialization - network layer and routing , Get Answer, Expert's Help, Initialization - network layer and routing Discussions

Write discussion on Initialization - network layer and routing
Your posts are moderated
Related Questions

What is Frequency borrowing In the simplest case, frequencies are taken from adjacent cells by congested cells. The frequencies can also be assigned to cells dynamically.

How does EIGRP protocol update route information to its neighbors

Virtual Private Network (VPN) adds the features of both public and private  networks. It is fixed to single organization and needs public network for connectivity. These connect

Thicknet Characteristics It Supports transmission rates up to 10 Mbps in Baseband mode Less expensive in comparison of fiber-optic cable however more expensive than ot

Q. Show a simplex Stop and Wait automatic repeat request? A simplex Stop and Wait ARQ - Normal Operation - Frame lost - Acknowledgement lost - Acknowledgement de

PVM (Parallel Virtual Machine) is a portable message-passing programming system, designed to link divide heterogeneous host machines to form a "virtual machine" which is a one, man

What is backbone network? A backbone network is a centralized infrastructure that is intended to distribute dissimilar routes and data to various networks. It also handles mana

discuss the communication model from the source to the destination including the detailed account of the task that must be performed in data communication system

Vector-Distance algorithm illustrated in more detail below: Packet switches wait for next update message and they goes by entries in packet. If entry has least path to destinat