Description: 具有图形化界面的一个路由模拟程序。路由算法为Dijkstra算法。具有求出图中任意节点间所有最短路径以及最短路径子图的功能。这是一个点对点(S-T)Dijkstra算法的改进。用于求两点间的所有最短路径。-graphical interface with the simulation of a routing procedures. Routing algorithm Dijkstra algorithm. With map obtained arbitrary nodes all the shortest paths and shortest path graph of the function. This is a peer-to-peer (S-T) Dijkstra algorithm improvements. Seeking 2:00 for all the shortest path. Platform: |
Size: 3072 |
Author:阎一 |
Hits:
Description: 实现简单的模拟路由算法,使学习者通过程序,对该算法有更深更新的了解-achieve a simple routing algorithm simulation, learners through the process, this algorithm has a deeper understanding Update Platform: |
Size: 1024 |
Author:刘圣其 |
Hits:
Description: 一个基于JAVA的Dijkstra算法程序,可用于仿真中作为路由算法的一个组件.包含网络拓扑及使用方法的代码.-JAVA based on the Dijkstra algorithm procedure can be used for simulation as a component of routing algorithm. Contains network topology and how to use the code. Platform: |
Size: 2048 |
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: 使用Java语言编写模拟路由器程序，通过不同的IP端口（port），使用多线程模拟不同的路由器，路由器之间通过UDP协议交换路由信息，根据Bellman-ford算法确定下一条的路由节点。-The use of Java language router simulation procedures, through different IP port (port), the use of multi-threaded simulation of different routers, through the UDP protocol between routers exchange routing information, according to Bellman-ford algorithm to determine the next a routing node. Platform: |
Size: 43008 |
Author:邓瑞龙 |
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: 用Java语言写的移动通信网络（ad hoc）中很多经典的路由协议所用到的Bellman-Ford算法，使用到多线程和UDP协议来进行数据传输-Written using Java language for mobile communications network (ad hoc), many of the classical routing protocols used by the Bellman-Ford algorithm, using the multi-threaded and UDP protocols for data transfer Platform: |
Size: 3072 |
Author:唐叶 |
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图形界面的动态路由算法，比VC更生动形象，更易于理解。让人清楚理解路由器之间的选路原则，绝对原创。-java graphical interface of the dynamic routing algorithm is more vivid than the VC image, easier to understand. Gave a clear understanding between routers routing principles, is absolutely original. Platform: |
Size: 676864 |
Author:李远川 |
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:
Description: 就网络层中的路由选择算法进行了归纳和总结 ,并使用JAVA语言编写出最短通路路由选择算法的具体程序。
-On network layer routing algorithms and summarized, and the use of JAVA language shortest path routing algorithm specific procedures. Platform: |
Size: 77824 |
Author:杜晓寒 |
Hits:
Search - Routing Algorithm java