Welcome![Sign In][Sign Up]
Location:
Search - ospf algorithm

Search list

[Mathimatics-Numerical algorithmsA GENETIC ALGORITHM FOR THE WEIGHT SETTING PROBLEM IN OSPF ROUTING.rar

Description: 遗传算法的文章
Platform: | Size: 248650 | Author: | Hits:

[Other resource20063110945971

Description: SPF算法 ospf协议dijkstra-SPF algorithm OSPF agreement -
Platform: | Size: 15951 | Author: 啊彪 | Hits:

[Data structs20063110945971

Description: SPF算法 ospf协议dijkstra-SPF algorithm OSPF agreement-
Platform: | Size: 15360 | Author: 啊彪 | Hits:

[Communicationcbrp.tar

Description: cbrp协议ns2实现,ns2平台下实现,基于簇的路由协议算法 经典!-ns2 realize cbrp agreement, ns2 platform realize, based on the cluster routing protocol algorithm classic!
Platform: | Size: 70656 | Author: ludelai | Hits:

[Internet-Network15

Description: OSPF是一种路由选择协议。路由选择算法和路由选择协议在概念上是不同的。网络上的主机、路由器通过路由选择算法形成路由表,以确定发送分组的传输路径。而路由选择协议是路由器用来建立路由表和更新路由信息的通信协议。 开放最短路径优先协议(Open Shortest Path First,OSPF)是目前最主要的内部网关协议之一。通过本课程设计,学生可以对路由表的建立和路由信息的更新等有更直观和清晰的认识。 -OSPF is a routing protocol. Routing algorithm and routing protocol in the concept is different. Network hosts, routers, routing algorithm, through the formation of routing table to determine the sending packet transmission path. The routing protocol is a router used to create routing tables and update the routing information of the communication protocol. Open Shortest Path First protocol (Open Shortest Path First, OSPF) is the most important one of the internal gateway protocol. Through the curriculum design, students can establish a routing table and routing information updates such as more intuitive and clear understanding.
Platform: | Size: 1024 | Author: 猪八戒 | Hits:

[CSharpOSPF

Description: C#实现计算机网络OSPF算法的模拟实现-C# to achieve the simulation of computer networks, OSPF algorithm to achieve
Platform: | Size: 70656 | Author: yph | Hits:

[TCP/IP stackdijkstra

Description: 用Dijkstra algorithm 算法实现的路由协议,适用链路状态矢量协议ospf等, (matlab 源码)-This program uses the Dijkstra algorithm to find the lowest cost paths from every node to every other node.
Platform: | Size: 1024 | Author: denver | Hits:

[Data structsOSPF

Description: 利用OSPF协议构造路由表,采用Dijkstra算法-Construct the routing table using OSPF protocol, using the Dijkstra algorithm
Platform: | Size: 1024 | Author: 张会会 | Hits:

[Data structsyu

Description: 最短路径 ----因特网最短路径优先(OSPF)路由算法的实现 ----- Internet shortest path shortest path first (OSPF) routing algorithm to achieve
Platform: | Size: 159744 | Author: 乔伟 | Hits:

[Data structsShortest-path

Description: 因特网最短路径优先(OSPF)路由算法的实现:根据给定的网络拓扑图求某路由器到其它路由器的最短路径,并生成路由表-Internet Shortest Path First (OSPF) routing algorithm to achieve: given the network topology of a router to other routers find the shortest path, and generate routing tables
Platform: | Size: 10240 | Author: 孙彭 | Hits:

[matlabdijikstra

Description: For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).-For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
Platform: | Size: 1024 | Author: yashika | Hits:

[Industry researchOPNET-of-the-router-capability

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:

[AI-NN-PRhyb_h50148

Description: hybrid algorithms(genetic algorithm + local search) for optimizing OSPF routing weigth.-hybrid algorithms(genetic algorithm + local search) for optimizing OSPF routing weigth.
Platform: | Size: 185344 | Author: Rahmani Mohamed | Hits:

[matlabospf_djk

Description: OPNET中ospf的djkstra算法-OPNET' s djkstra algorithm in ospf
Platform: | Size: 24576 | Author: 李寒冰 | Hits:

[Windows Developrouting

Description: 利用数据结构中有关图的知识,实现路由表生成算法OSPF和RIP,并根据图的结构生成路由表。-Using the data structure knowledge map to achieve the routing table generation algorithm OSPF and RIP, and generates a routing table based on the structure chart.
Platform: | Size: 188416 | Author: 张豪 | Hits:

CodeBus www.codebus.net