Description: 实现简单的模拟路由算法,使学习者通过程序,对该算法有更深更新的了解-achieve a simple routing algorithm simulation, learners through the process, this algorithm has a deeper understanding Update Platform: |
Size: 1024 |
Author:刘圣其 |
Hits:
Description: 这个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bellman-Ford algorithm, the use of java programming. Platform: |
Size: 16384 |
Author:cwh |
Hits:
Description: 个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bellman-Ford algorithm Platform: |
Size: 18432 |
Author:xiao |
Hits:
Description: 个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bellman-Ford algorithm Platform: |
Size: 68608 |
Author:xiao |
Hits:
Description: 实现了Distance-Vector 算法了源码，能够模拟路由器之间交换路由的情况-Distance-Vector algorithm implements the source code, to simulate the situation between routers to exchange routing Platform: |
Size: 20480 |
Author:秋兔子 |
Hits:
Description: 距离矢量路由和链路状态路由算法的模拟，用java实现-Distance vector routing and link state routing algorithm simulation, with the java implementation
Platform: |
Size: 548864 |
Author:suosuma |
Hits:
Description: java语言模拟的路由选择算法，链路状态和距离矢量-java language simulation of routing algorithm, link state and distance vector Platform: |
Size: 26624 |
Author:stanley |
Hits:
Description: 这是一个模仿路由算法的java程序。
实现关于路由器的简单功能。
实现距离矢量路由算法。
所实现的路由器模拟Internet上的IP路由器。它能确定网络的最短路由，并在这些利用上传输分组
实现功能简介
1) 编写一个称为“Router”的程序
2) 利用距离向量算法更新路由表
3) 该程序的多个实例（进程或线程）可以以运行在一台机器
4) 实例之间利用UDP交换路由表
5) 假设结点与其邻居结点的都为距离为1。
6) 为了指明实例及其邻居，程序启动时必须能接收以下参数：
7) router ID, myport, port1, port2, port3…
8) 程序必须能处理以下命令：
a) N－打印活动的邻居列表。
b) T－输出路由表。
c) 0，1，… 9－发送分组
9) 关于时间定时
a) 每个路由器每2秒钟发出它们的路由表
b) 每个路由器根据收到的路由表更新它们自己的路由表
c) 路由器必须具备检测邻居是否活动的能力。如果路由器在6秒钟没有收到邻居发来的更新，则认为邻居不可达
10) 关于拓扑结构
a) 路由器必须具备路由器故障和恢复的能力
b) 这里假设链路不会出现故障，分组不会丢失和出错
c) 如果路由器在给定时间内未运行，表示路由器故障。如果重启运行，则认为路由器故障恢复
d)当然，假设通信是双向的
-This is a parody routing algorithm java program.
Achieve a simple function on the router.
Implement distance vector routing algorithm.
Internet router simulation achieved the IP router. It can determine the shortest route network, and in these transmission packet utilization
Achieve Features
A) preparation of a group called "Router" program
2) the use of distance vector algorithm updates the routing table
3) multiple instances of the program (processes or threads) can be run on a single machine
4) between instances using UDP exchange routing table
5) Assuming that node and its neighbor nodes are distance of 1.
6) In order to specify the instance and its neighbors, the program must be able to start receiving the following parameters:
7) router ID, myport, port1, port2, port3 ...
8) program must be able to deal with the following command:
a) N-printing activities neighbor list.
b) T-output routing table.
c) 0,1, ... 9- to send the packet
9) About Time Timing
a) given eve Platform: |
Size: 73728 |
Author:张天扬 |
Hits:
Search - DISTANCE VECTOR ROUTING java