Description: 所实现的路由器采用距离矢量算法，模拟Internet上的IP路由器，它能确定网络的最短路由，并在其上传输分组-router achieved by the application of the distance vector algorithm simulation on the Internet IP routers, it can determine the shortest route network, and in its previous packet transmission Platform: |
Size: 145115 |
Author:agang |
Hits:
Description: 可运行于linux平台的自组织网络协议，kernel版本的按需距离矢量协议源代码-can run on the Linux platform of self-organizing network agreement kernel version of the on-demand distance vector source code agreement Platform: |
Size: 54616 |
Author:安德里周 |
Hits:
Description: 1RIP路由协议
——RIP协议最初是为Xerox网络系统的Xeroxparc通用协议而设计的，是Internet中常用的路由协议。RIP采用距离向量算法，即路由器根据距离选择路由，所以也称为距离向量协议。路由器收集所有可到达目的地的不同路径，并且保存有关到达每个目的地的最少站点数的路径信息，除到达目的地的最佳路径外，任何其它信息均予以丢弃。同时路由器也把所收集的路由信息用RIP协议通知相邻的其它路由器。这样，正确的路由信息逐渐扩散到了全网。
——RIP使用非常广泛，它简单、可靠，便于配置。但是RIP只适用于小型的同构网络，因为它允许的最大-1RIP routing protocol -- RIP agreement was initially for Xerox Network System Xeroxpa rc definitive agreement and the design is widely used in the Internet routing protocols. RIP application of the distance vector algorithm, routers routing choice based on distance, also known as Distance Vector agreement. Router collect all destinations can be reached by the different paths and the preservation of the arrival of each destination site for at least the path information, in addition to their destinations on the best path, Any other information is to be discarded. Router while also turning the routing information collected with neighboring RIP notify the other routers. Thus, the correct routing information gradually spread to the entire network. -- RIP is widely used, it is simple, reliable a Platform: |
Size: 344347 |
Author:李微 |
Hits:
Description: 所实现的路由器采用距离矢量算法，模拟Internet上的IP路由器，它能确定网络的最短路由，并在其上传输分组-router achieved by the application of the distance vector algorithm simulation on the Internet IP routers, it can determine the shortest route network, and in its previous packet transmission Platform: |
Size: 181248 |
Author:agang |
Hits:
Description: 可运行于linux平台的自组织网络协议，kernel版本的按需距离矢量协议源代码-can run on the Linux platform of self-organizing network agreement kernel version of the on-demand distance vector source code agreement Platform: |
Size: 54272 |
Author:安德里周 |
Hits:
Description: 1RIP路由协议
——RIP协议最初是为Xerox网络系统的Xeroxparc通用协议而设计的，是Internet中常用的路由协议。RIP采用距离向量算法，即路由器根据距离选择路由，所以也称为距离向量协议。路由器收集所有可到达目的地的不同路径，并且保存有关到达每个目的地的最少站点数的路径信息，除到达目的地的最佳路径外，任何其它信息均予以丢弃。同时路由器也把所收集的路由信息用RIP协议通知相邻的其它路由器。这样，正确的路由信息逐渐扩散到了全网。
——RIP使用非常广泛，它简单、可靠，便于配置。但是RIP只适用于小型的同构网络，因为它允许的最大-1RIP routing protocol-- RIP agreement was initially for Xerox Network System Xeroxpa rc definitive agreement and the design is widely used in the Internet routing protocols. RIP application of the distance vector algorithm, routers routing choice based on distance, also known as Distance Vector agreement. Router collect all destinations can be reached by the different paths and the preservation of the arrival of each destination site for at least the path information, in addition to their destinations on the best path, Any other information is to be discarded. Router while also turning the routing information collected with neighboring RIP notify the other routers. Thus, the correct routing information gradually spread to the entire network.-- RIP is widely used, it is simple, reliable a Platform: |
Size: 344064 |
Author:李微 |
Hits:
Description: 计算机网络课程设计实验，距离矢量路由算法。在运行前须在c磁盘下建立文档data.txt。并且输入49个数字 1~9或- 用逗号分开。-Computer network curriculum design experiments, distance vector routing algorithm. Before running in the establishment of documents c disk data.txt. 49 digital input and 1 ~ 9 or- separated by commas. Platform: |
Size: 2048 |
Author:daniel |
Hits:
Description: 计算机网络路由算法中的距离向量算法方法,这是源程序,学计算机网络的应该都知道!-Computer network routing algorithm of distance vector algorithm method, which is the source code, learning the computer network should all know! Platform: |
Size: 1024 |
Author:kon |
Hits:
Description: zigbee路由算法采用AODV(Ad hoc On Demand Distance Vetor)算法。每个路由器维护一张路由表，并定期与其邻居路由器交换路由信息，根据最小路由矢量更新自己的路由表。应用层框架定义监护网络节点协议。
-zigbee routing algorithm uses AODV (Ad hoc On Demand Distance Vetor) algorithm. Each router maintaining a routing table, and regularly with its neighbor routers exchange routing information, according to the smallest vector routing update their routing table. Application-layer framework for the definition of guardianship agreement network nodes. Platform: |
Size: 11264 |
Author:ww |
Hits:
Description: An IEEE 802.15.4-based Wireless Sensor Network
is considered, and the relationship between the IEEE 802.15.4 topology formation mechanism and possible routing strategies at the network layer is studied. Two alternative routing schemes proposed in the framework of the ZigBee Alliance are analyzed.The first is the well-known Ad-hoc On demand Distance Vector
(AODV) routing protocol, which was designed for highly dynamic application scenarios in wireless ad-hoc networks. The second is
a tree-based routing scheme based on a hierarchical structure established among nodes during the network formation phase. This latter approach, referred to as HERA (HiErarchical Routing Algorithm) in the paper, routes packets from sensors to sink based on the parent-child relationships Platform: |
Size: 173056 |
Author:HArry |
Hits:
Search - distance vector network