用OPNET仿真RIP协议实现路由仿真
需积分: 50 137 浏览量
2013-12-16
21:49:55
上传
评论 2
收藏 394KB PDF 举报
Laboratory
6
RIP: Routing Information Protocol
A Routing Protocol Based on the Distance-Vector Algorithm
Objective
The objective of this lab is to configure and analyze the performance of the Routing
Information Protocol (RIP) model.
Overview
A router in the network needs to be able to look at a packet’s destination address and then
determine which of the output ports is the best choice to get the packet to that address.
The router makes this decision by consulting a forwarding table. The fundamental problem
of routing is: How do routers acquire the information in their forwarding tables?
Routing algorithms are required to build the routing tables and hence forwarding tables.
The basic problem of routing is to find the lowest-cost path between any two nodes, where
the cost of a path equals the sum of the costs of all the edges that make up the path.
Routing is achieved in most practical networks by running routing protocols among the
nodes. The protocols provide a distributed, dynamic way to solve the problem of finding
the lowest-cost path in the presence of link and node failures and changing edge costs.
One of the main classes of routing algorithms is the distance-vector algorithm. Each node
constructs a vector containing the distances (costs) to all other nodes and distributes that
vector to its immediate neighbors. RIP is the canonical example of a routing protocol built
on the distance-vector algorithm. Routers running RIP send their advertisements regularly
(e.g., every 30 seconds). A router also sends an update message whenever a triggered
update from another router causes it to change its routing table.
In this lab you will set up a network that utilizes RIP as its routing protocol. You will analyze
the routing tables generated in the routers, and you will observe how RIP is affected by
link failures.
剩余10页未读，继续阅读
资源评论
-沧海横流-
- 粉丝: 5
- 资源: 9
最新资源
- mongodb数据库基本操作.pdf
- C#，布尔可满足性问题（Boolean Satisfiability Problem）算法与源代码
- C#，回文分割问题（Palindrome Partitioning Problem）算法与源代码
- C#，煎饼排序问题（Pancake Sorting Problem）算法与源代码
- C#，排列组合的堆生成法（Heap’s Algorithm for generating permutations）算法与源代码
- C#，老鼠迷宫问题的回溯法求解（Rat in a Maze）算法与源代码
- 6693eeb8d683458a07938615fba9e68f.apk
- C#，数值计算，解微分方程的龙格-库塔二阶方法与源代码
- C#，数值计算，用割线法（Secant Method）求方程根的算法与源代码
- C#，子集和问题（Subset Sum Problem）的算法与源代码
资源上传下载、课程学习等过程中有任何疑问或建议，欢迎提出宝贵意见哦~我们会及时处理！
点击此处反馈
