Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
While calculating shortest path, first we assume graph presentation of network at every node then we use Djikstra's algorithm to calculate shortest path from every node to other one. Then extract next hop information from giving path information and add next hop information into routing tables.
WEIGHTED GRAPH
Djikstra's algorithm will add weights on edges in graph. The shortest path is then the path with minimum total weight. It could be noticed that the shortest path is not necessarily with fewest edges. For example as given in the figure below:
The minimum path in the diagram from node 2 to node 6 is 2 to 3 and 3 to 6 as this way has the minimum weight so it is the shortest path.
DISTANCE MATRICS
Weights on graph nodes denote cost of traversing edge. This cost can be in time, hop or dollars counting (weight == 1). The resulting shortest path can not have fewest hops.
Given the address 172.16.2.120 and the subnet mask of 255.255.255.0. How many hosts are available? Ans) 172.16.2 120 is a standard Class B address with a subnet mask that permit
How is load balancing acoomplish in IGRP?
Question 1 Write a note on a) Internet layer b) strict source routing Question 2 Explain the routing table of Solaris system Question 3 Explain following concepts a) MIM
Communication, Resource sharing and Media (When many host share their resources with every other OR when many devices connect with each other for resource sharing )
Configure the Host Computers Step 1: Configure host computers. Configure the static IP address, subnet mask, and gateway for every host computer based on the configuration
Clos network This network was organized by Clos (1953). It is a non-blocking network and gives full connectivity like crossbar network but it also requires significantly minim
how can i learn it?
FCS= Frame Check Sequence CRC (Cyclic Redundancy Check) algorithm runs in switch that known as FCS (Frame Check Sequence)
Path Overhead It is part of SPE and contain followings information: Performance monitor of synchronous transport , signal , path , track ,parity ,checks, and path status.
Time out Timers are used to protect against lost packet. Each packet must have its own logical timers since only a single packet will be retransmitted after timeou
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd