cisco ss7 book pdf
cinema 4d r16 bookCisco Ss7 Book Pdf
CLICK HERE TO CONTINUE
>quake live aim bot download
>Adobe flash player for nokia c3 00 mobile free >bloody trapland Full Download
>reviewer on philippine commercial law pdf
>Prototype V1 001 Plus 5 Trainer By Kelsat.rar
>tuna rukega kabhi agneepath dailogue-adds
>[Most popular] Download Hey shanaya student of the >HDR Light Studio Pro 2 0 Crack 2011 771 13 MBReUp 07 >�o �� tn � d+��� av ����jg�w av on
>Vaastav The Reality (1999) DvDRip x264 hindi old is
>chemistry 8th edition zumdahl pdf.rar
>wedding book tv level broadcast effects project.rar
>hindi sexy beast film video.rar
solution manual of telecommunication switching >traffic and networks by j e flood
>[FULL] dil de diya hai 320kbps-adds
>Megamind dvdrip full movie in 3gp download for mobile >bagger simulator 2009 torrent download
>Utility Vehicles Simulator 2012 DEMO.rar
>/forum/viewthread/11938572/p >age/1/m/13162381" >cwcheat latest download for >ica msi corel draw free download-adds
>/86588/7.html" >Crack Ailt >Word to PowerPoint Converter 5 7
>math 4 today worksheet grade 3 pdf-adds
>TalkEnglish Offline Version Full Download.rar
>Pakistani Couple Doing Sex in a Cottage 1 Hr Videostanag 7085 pdf .pdf
>visual boy advance free download windows xp
>Fifa 10 Crack FiX NoGRP
>50 shades of grey ebook download free
>bianco celibe e vampiro pdf.rar
>/161375/427.html" >youtube >grabber 4.1 free download
>web acappella 4 v 4.3.32.full.rar
>an introduction to language 9th edition answer key >japanese demystified pdf download rar. Notice: Copies of your message may remain on this and other systems on internet. < Switches, Routers, Bridges and LANs |
Routing is the process of moving information across an internetwork from source to destination. At least one intermediate node must be encountered along the way. Routing and bridging look similar but the primary difference between the two is that bridging occurs at Layer 2 (the link layer) of the OSI reference model, whereas routing occurs at Layer 3 (network layer). One important difference between routing and bridging is that the layer 3 addresses are allocated hierarchically, so it is possible for a router to have a single rule allowing it to route to an entire address range of thousands or millions of addresses.
Output port forwards the packets coming from switching fabric to the corresponding output line. It performs exact reverse physical and data link functionality than the input port. Output port also performs queuing of packets which comes from switching fabric. Routing processor executes routing protocols. It maintains routing information and forwarding table. It also performs network management functions within the router. The job of moving the packets to particular ports is performed by switching fabrics. Switching can be accomplished in number of ways: The incoming packets to the input port are stored in queue to wait for processing. As the processing begins, the IP header is processed first. The error checksum is performed to identify the errors in transmission. If it does not contain error then the destination IP address field is check. If it is for the local host then taking into account the protocol UDP, TCP or ICMP etc. the data field is passed to the corresponding module.
If the destination IP address is not for local host then it will check for the destination IP address in its routing table. Routing table consist of the address of next router to which the packet should be forwarded. Then the output operation are performed on the outgoing packet such as its TTL field must be decrease by one and checksum bits are again calculated and the packet is forwarded to the output port which leads to the corresponding destination. If the output port is busy then packet has to wait in output queue. Packet scheduler at the output port must choose the packet from the queue for transmission. The selection of packet may be on the basis of First-come-first-serve (FCFS) or priority or waited fair queuing (WFQ), which shares the outgoing link “fairly” among the different end-to-end connections that have packets queued for transmission. For quality-of-service packet scheduling plays very crucial role. If the incoming datagram contains the routing information then the packet is send to the routing protocol which will modify the routing table entry accordingly.
Now we will take into consideration different routing algorithms. There are two types of protocol for transferring information form source to destination. Routed protocols are used to direct user traffic such as IP or IPX between routers. Routed packet contains enough information to enable router to direct the traffic. Routed protocol defines the fields and how to use those fields. Routing protocol allow routers to gather and share the routing information to maintain and update routing table which in turn used to find the most efficient route to destination. Routing algorithms have one or more of the following design goals: Routing algorithms are mainly are of two types The first classification is based on where a protocol is intended to be used: between your network and another's network, or within your network: this is the distinction between interior and exterior. The second classification has to do with the kind of information the protocol carries and the way each router makes its decision about how to fill in its routing table which is link-state vs. distance vector.
In a link-state protocol, a router provides information about the topology of the network in its immediate vicinity and does not provide information about destinations it knows how to reach. This information consists of a list of the network segments, or links, to which it is attached, and the state of those links (functioning or not functioning). This information is then broadcasted throughout the network. Every router can build its own picture of the current state of all of the links in the network because of the information broadcast throughout the network. As every router sees the same information, all of these pictures should be the same. From this picture, each router computes its best path to all destinations, and populates its routing table with this information. Now we will see the link state algorithm known as Dijkstra’s algorithm. The notation and there meanings are as follows: In practice each router maintins two lists, known as Tentative and Confirmed. Each of these lists contains a set of entries of the form (Destination, Cost, Nexthop).
The algorithm works as follows: list with the lowest cost, move it to the Confirmed list, and return to step 2. [algorithm from Computer Networks a system approach – Peterson and Davie.] Now lets look at example : Consider the Network depicted below. Steps for building routing table for A is as follows: Distance vector algorithm is iterative, asynchronous, and distributed. In distance vector each node receives some information from one or more of its directly attached neighbors. It then performs some calculation and may then distribute the result of calculation to its neighbors. Hence it is distributive. It is inteactive because this process of exchanging information continues until no more information is exchanged between the neighbors. Let be the cost of the least-cost path from node to node y. The least cost are related by Bellman-Ford equation: where min v in the equation is taken over all of x’s neighbors. After traveling from x to v , then we take the shortest path from v to y, the shortest path from x to y will be C(x, V) + dv(y).