Description: 在分析传统的链路——状态算法的基础上，提出了一种优化的卫星通信星际路由算法。
该算法能够找出任意两颗卫星间通信的最佳路径集合，同时能够在链路质量容许的情况下，尽量
避免通信链路切换的发生，从而较大地提高了系统性能。-the analysis of the traditional link -- state of the algorithm, based on the optimization of an interplanetary satellite communications routing algorithm. The algorithm can find arbitrary two inter-satellite communications set the best path, the link quality to allow circumstances to minimize communication link switching occurred, thereby greatly improved system performance. Platform: |
Size: 46139 |
Author:吴佳泽 |
Hits:
Description: 在分析传统的链路——状态算法的基础上，提出了一种优化的卫星通信星际路由算法。
该算法能够找出任意两颗卫星间通信的最佳路径集合，同时能够在链路质量容许的情况下，尽量
避免通信链路切换的发生，从而较大地提高了系统性能。-the analysis of the traditional link-- state of the algorithm, based on the optimization of an interplanetary satellite communications routing algorithm. The algorithm can find arbitrary two inter-satellite communications set the best path, the link quality to allow circumstances to minimize communication link switching occurred, thereby greatly improved system performance. Platform: |
Size: 46080 |
Author:吴佳泽 |
Hits:
Description: 编写一程序实现动态路由算法动态路由算法分为: 距离矢量路由算法和链路状态路由算法，-Procedures for the preparation of a dynamic routing algorithm to achieve dynamic routing algorithm as follows: distance vector routing algorithm and link state routing algorithm, Platform: |
Size: 2048 |
Author:bluerain |
Hits:
Description: 链路状态路由算法实现。链路状态算法又叫最短路径优先SPF（Short Path First）算法。按照SPF的要求，路由器中路由表依赖于一张能表示整个个网络拓扑结构的无向图G（V，E）。-Link state routing algorithm. Link State algorithm called the shortest path first SPF (Short Path First) algorithm. In accordance with the requirements of SPF, the router relies on a routing table can be said that the entire network topology undirected graph G (V, E). Platform: |
Size: 2048 |
Author:yiyi |
Hits:
Description: 链路状态路由算法的实现，典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径。-Link state routing algorithm, a typical shortest path routing algorithm for calculating a node to all other nodes of the shortest path. Platform: |
Size: 2048 |
Author:shangyong |
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: 本文在阐述网络发展的现状和趋势的基础上，着重分析了两种内
部网关路由选择协议砒P和OSPF协议的实现机制和性能特点。对P
协议是基于距离矢量算法的。OSPF协议是基于链路状态算法的。本
文的工作重点是对上述两种协议分别从类型，封装，路径特征，邻居
发现和支持，路由选择数据的分发，对变化的响应，路由表计算，健
壮性／可靠性以及安全性等方面进行了对比分析，并对它们存在的安
全漏洞进行了初步的分析说明。根据以上的分析，通过On忸T软件，
本文设计了一个10km×10km规模大小的网络仿真模型，配置了相应
的流量和IP地址，并选取了路由协议网络收敛性，协议开销，网络
延时以及链路修复四个仿真性能参数进行仿真，最后通过对仿真结果
的分析得出以下结论：对P协议适合于网络规模较小、拓扑结构比较
简单、性能要求不严格和易用性要求较高的环境，而OSPF则适合于
网络规模大、拓扑结构复杂和性能要求高的环境，因此要根据网络特
点合理的选择路由协议。-This paper described the status and trends of network development on the basis of analyzes of two
Ministry gateway routing select the protocol arsenic P and OSPF protocol implementation mechanism and performance characteristics. P
The protocol is based on the distance vector algorithm. The OSPF protocol is based on link-state algorithms. This
The text s focus is on these two agreements, respectively, from the type of package, the path characteristics, neighbors
Discovery and route choice of data distribution, changes in response, the routing table calculation, and health
Zhuang/reliability, and security aspects of a comparative analysis, and they are safety
The full loopholes in the preliminary analysis shows. According to the above analysis, On to blush T software
Designed a 10km x 10km scale the size of the network simulation model, configuration, corresponding
Traffic and IP address, and select the routing protocol convergence, protocol overhead, network
Delay and link repa Platform: |
Size: 9182208 |
Author:哲 |
Hits:
Description: 链路状态算法（也称最短路径算法）发送路由信息到互联网上所有的结点，然而对于每个路由器，仅发送它的路由表中描述了其自身链路状态的那一部分,其算法思想是每一个路由算法必须完成以下的工作，发现它的邻居节点，并知道其网络地址，测量到各邻居节点的延迟或者开销，构造一个分组，分组中包含所有它刚刚知道的信息，将这个分组发送给所有其他的路由器，计算出到每一个其他路由器的最短路径-Link state algorithm (also known as the shortest path algorithm) to send routing information to the Internet on all nodes, but for each router, it only sends the routing table describing its link state that part, its algorithm is a routing algorithm is required to complete the following work, found its neighbor nodes, and know the network address, measuring to the neighbor node delay or overhead, constructs a packet, packet contains all the information it had just know, the packet is sent to all other routers, calculated to every other router shortest path Platform: |
Size: 70656 |
Author:蒋宇 |
Hits:
Description: 该代码简单实现了路由选择的链路状态算法。通过输入节点数，再输入节点间的开销后自动找出最少开销路径-The code implements a simple link-state routing algorithm. Automatically find the least cost path through the input nodes, and then enter the cost of inter-node Platform: |
Size: 1024 |
Author:huihui |
Hits:
Search - Link State routing algorithm