0% found this document useful (0 votes)
7 views

Distributed Routing

The document discusses distributed routing in networks with multiple routers, emphasizing the use of routing tables to determine the most cost-effective path for packet forwarding. It outlines various methods for calculating link costs and routing algorithms, including considerations for minimizing communication costs and improving throughput through load distribution. Additionally, it describes different routing selection methods such as round robin, random election, and mixed methods for optimizing route selection.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views

Distributed Routing

The document discusses distributed routing in networks with multiple routers, emphasizing the use of routing tables to determine the most cost-effective path for packet forwarding. It outlines various methods for calculating link costs and routing algorithms, including considerations for minimizing communication costs and improving throughput through load distribution. Additionally, it describes different routing selection methods such as round robin, random election, and mixed methods for optimizing route selection.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

HOME COMPUTER FUNDAMENTAL NETWORKING C LANGUAGE JAVA TUTORIAL C PROGRAMMING

MANAGEMENT

Home Computer Networking Routing

Distributed Routing
Related Articles Basic Courses
BY DINESH THAKUR Category: Routing

For routing in a network having two or more routers, routing tables are used to determine the destination to which HDLC Protocol - High-level Computer Fundamental
a packet is to be forwarded. If two or m9re routes are available, the route that requires the least possible cost (link
Data Link Control Computer Networking
cost) should be selected so that the packet can be sent to the destination more quickly and more reliably. Cost can
be generally considered as the number of routers via which the packet is to be sent. If changes are made to this Routing Algorithms
Computer Network
network configuration, there are two methods to update the contents of routing tables, which will be described Distance Vector routing
Comm. Networks
next. Protocol- What is Distance
Network Tech.
Link Cost Vector routing ?
Multiple Access
IGMP - What is Internet
Link cost can be defined in a variety of ways. Routing algorithm, on the other hand, functions regardless of the Switching
Group Management
intention with which link cost has been specified. If there is no specific intention, the cost for a single link is usually
Protocol (IGMP)? IP Address Sys
set at 1. In this case, only the number of hops is taken into consideration. Calculations for determining the route
are made on the assumption that the route with the minimum number of hops is the optimum route. If response Hierarchical Routing Routing
time is important, the route with the minimum delay will be the best choice. For example, if there are two routes, SDLC Protocol - Services / App.
one in which packets are sent over a single 9600 bps line, and the other in which packets are sent over two 100
Synchronous Data Link Security
Mbps FDDI lines, the latter route is better because there is less delay although there are more hops. To ensure that
Control Structured Query (SQL)
route calculations are performed in this way, the cost should be smaller for a link with smaller delay, and the cost
should be larger for a link with larger delay. Routing Protocols
Java Script
Also, the user may wish to minimize the communication cost. For example, if user has a choice between two routes, What is ICMP (Internet
HTML Language
i.e. packet switching network in which he is billed for the amount of communication made and leased line in which Control Message
the cost is fixed; the latter route will not result in additional cost. Therefore, leased line is better from the point of Cascading Style Sheet
Protocol)?
view of cost. In ·this case, link cost must be proportional to cost arising from use of that link. C Programming (Theory)
What is Serial Line Internet

Load Distribution Methods Protocol (SLIP)?


C Programming (Pratical)

DVMRP - What is DVMRP Visual Basic


If there are two or more routes to reach the same destination at the same cost, throughput can improve because
load is distributed. In addition, delay can be reduced because traffic per route is reduced. Therefore, it is useful to (Distance Vector Multicast C++ Programming
be able to perform multipath routing when two or more routes are available at the same cost. Multipath routing Routing Protocol)? Java Programming
can be achieved in both distance-vector type and link-state type. If there are two or more routes to reach the same What is Routing? Type of Java Servlet
destination at the same cost, one of the following methods is applicable to determine which of these routes is to be Routing.
used and how to select this route. Java Server Pages
User Datagram Protocol
Round robin method Sequentially selects each of the routes Computer Graphics
(UDP)
Electronic Commerce
Address Resolution
Random election method With the round robin method, there will be a difference in traffic between routes Management (MIS)
Protocol ARP and RARP
because packet lengths are different. To solve this problem, random numbers and, so on are used to randomly Data Structures
Link-State Protocol
select the route
Distributed Routing Software Engineering
Mixed method Mixture of the above two methods, with also route availability taken into consideration and
selects the route that b comparatively less busy. ARP (Address Resolution Digital Electronics

The mixed method seems superior to other methods in that the availability routes are taken into consideration. In Protocol) Table C# Programming
the mixed method, however, the router must check in real-time whether routes are available. Therefore, this Data Routing Database System
method remains ineffective for the amount of processing required. Network Using Wan and
If you liked this article, you can also catch us on facebook and Google+ Network Services Advance Courses
What is IP forwarding?
Related Articles (You May Also Like) What is RTP (Real-time Website Developement
Transport Protocol)?
Struts 2 Tutorial
What is NHRP (Next Hop
PHP
Resolution Protocol) ?
About Dinesh Thakur How to
What is address aging?
python
Dinesh Thakur holds an B.C.A, MCSE, MCDBA, CCNA, CCNP, A+, SCJP certifications. Dinesh Algorithm CR (Constraint-
authors the hugely popular Computer Notes blog. Where he writes how-to guides around Computer based Routing) AngularJS Tutorial
fundamental , computer software, Computer programming, and web apps. For any type of query or Compiler Design
something that you think is missing, please feel free to Contact us.
Troubleshooting

Advance Courses Basic Courses Top Category

Website Developement Computer Fundamental Basic Computer


Struts 2 Tutorial Computer Networking Networking
PHP (Hypertext Preprocessor) Structured Query (SQL) C Programming
How to C Programming C++ Programming
Python C++ Programming Java Programming
AngularJS Tutorial Java Programming Management (MIS)
Compiler Design Computer Graphics Computer Graphics

Sitemap | Contact Us | About Us | Privacy Policy


Dinesh Thakur is a Technology Columinist and founder of Computer Notes and Technology Motivation. Mail Me At (@Computer Notes)

You might also like