1 / 9
文档名称:

【资料】How routing algorithms work.pdf

格式:pdf   页数:9
下载后只包含 1 个 PDF 格式的文档,没有任何的图纸或源代码,查看文件列表

如果您已付费下载过本站文档,您可以点这里二次下载

【资料】How routing algorithms work.pdf

上传人:紫岑旖旎 2012/7/19 文件大小:0 KB

下载得到文件列表

【资料】How routing algorithms work.pdf

文档介绍

文档介绍:How Routing Algorithms Work
by Roozbeh Razavi
If you have read the HowStuffWorks article How Routers Work, then you know that a router is
used to work traffic and find the best route for sending packets. But have you ever
thought about how routers do this? Routers need to have some information work status
in order to make decisions regarding how and where to send packets. But how do they gather this
information?
In this edition of HowStuffWorks, we'll find out precisely what information is used by routers in
determining where to send a packet.
The Basics
Routers use routing algorithms to find the best route to a destination. When we say "best
route," we consider parameters like the number of hops (the trip a packet takes from one router
or intermediate point to another in work), time delay munication cost of packet
transmission.

Based on how routers gather information about the structure of work and their analysis of
information to specify the best route, we have two major routing algorithms: global routing
algorithms and decentralized routing algorithms. In decentralized routing algorithms, each
router has information about the routers it is directly connected to -- it doesn't know about every
router in work. These algorithms are also known as DV (distance vector) algorithms. In
global routing algorithms, every router plete information