Search - routing table

[Internet-Network] iproute

Description: This sample demonstrates the use of IP Helper API functions to manipulate the routing table.
Platform: | Size: 8192 | Author: 梅恒 | Hits:

[Internet-Network] DistanceVector_Routing

Description: Distance Vector Routing，也称为Bellman-Ford shortest path algorithm。基本思想是：每个路由器（路由结点）都维持一张路由表，包括路由的目的地(V)和路由的距离(D)。每个路由器都定期与相邻结点交换路由表信息，据此更新它们自己的路由表。所有结点都监听从其它结点传来的路由表，并按照下列规则更新其路由表： -发现了一条到达某目的结点的新路由，而该路由在原来的路由表中不存在（即发现了一条新路由），则在路由表中增加该路由。 -发现了一条到达某目的结点的、距离更短的新路由，则用该路由替换原有的路由。 -到达某目的结点的一条路由，其后继结点到达该目的地的距离发生了变化，则需要更新该路由的距离。本文件中包含详细的源代码和注释，以实现利用距离向量算法更新路由表的功能。-Distance Vector Routing, also known as the Bellman-Ford shortest path algorithm. The basic idea is : Each router (routing nodes) has maintained a routing table, the destinations include routing (V) and the routing of distance (D). Each router regularly with neighboring nodes to exchange routing table information, updated accordingly their own routing table. All nodes are monitored from other nodes sent a routing table, and in accordance with the following rules to update its routing table :- found a purpose to reach a node of the new routing, The routing of the original routing table does not exist (that is, found a new routing), the routing table to increase the routing.- Found a purpose to reach an end point, the short distance between the new routing, the router can be used to replace
Platform: | Size: 3072 | Author: agang | Hits:

[SCM] wincs

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:

[Internet-Network] 15

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:

[Internet-Network] distanceVectorRouter(c)

Description: 利用距离向量算法更新路由表。该程序的多个实例（进程或线程）可以以运行在一台机器一个实例代表一个路由器(结点)。实例之间利用UDP交换路由表。能够打印出邻居列表和输出路由表！(c语言实现)-The use of distance vector algorithm to update the routing table. Multiple instances of the program (process or thread) can be run on a machine on behalf of an example of a router (node). Examples of exchange between the use of UDP routing table. Be able to print out a list of neighbors and output routing table! (c language)
Platform: | Size: 31744 | Author: 冷冰 | Hits:

[Algorithm] router_calc

Description: 根据一个有权的无向图生成指定结点（路由器）的路由表设有结点N，N的路由表由若干个路由项组成，路由项是<目的结点，下一跳>的二元组，其中目的结点是以N结点为源结点，通过N结点可以直接到达（目的结点是N结点的邻居）或通过N结点的邻居可间接到达的结点，其中下一跳即N结点的某领居，通过该邻居可间接到达目的结点，且到达目的结点的路径为最小代价路径.-According to a right of the undirected graph to generate the specified node (router) routing table with nodes N, N' s routing table routing by a number of components, routing is < the purpose of nodes, next hop> dual group node is one of the purpose of node N as the source node by node N can arrive (the purpose of node N are neighbor nodes) or through a neighbor node N can be indirectly Get the nodes, that is one of the next hop of a node N from home, the adoption of the neighbor may be an indirect purpose of node arrival and arrival at the destination node for the smallest cost of the path path.
Platform: | Size: 1024 | Author: luowen | Hits:

[Internet-Network] RIP

Description: 模拟实现rip路由协议，创建新的路由表并由新发来的路由表信息对其进行更改-Rip routing protocol simulation, create a new routing table made by the new information to the routing table changes
Platform: | Size: 1024 | Author: 王琛 | Hits:

[Linux-Unix] frequency-set

Description: routing table in ns2
Platform: | Size: 29696 | Author: ilayaraja | Hits:

[ELanguage] rttable.cc

Description: This a routing table protocol-This is a routing table protocol
Platform: | Size: 2048 | Author: shyam sundar | Hits:

[Other] linkStateRouting

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:

[Program doc] report

Description: 现代交换原理，ATM路由表查询实验的实验报告-Modern exchange theory, ATM routing table query experiments are reported
Platform: | Size: 9216 | Author: greatabc | Hits:

[Embeded-SCM Develop] TCL

Description: AODV Simulation using ns-2, its just the source file. you need to write tcl and other files like routing table etc
Platform: | Size: 8776704 | Author: Bishal | Hits:

[Internet-Network] dynamic-routing

Description: 了解路由及路由器的概念，路由器的功能，工作原理，路由表，路由算法分类等。学习使用距离矢量算法的动态路由。并附上tcl源码-Understand the concept of routing and routers, the router function, working principle, the routing table, routing algorithm classification. Learn to use dynamic routing distance vector algorithm. Tcl source code along with
Platform: | Size: 153600 | Author: 刘刘 | Hits:

[Internet-Network] adhoc

Description: 经典的路由表协议有：DSDV（序列目的节点距离矢量路由协议），CGSR（群首信关切换路由协议），WRP（无线路由协议）等。经典的源始发的按需路由协议有：DSR（自适应源路由协议）、AODV（自组织网按需距离矢量路由协议），TORA（临时排序路由算法）等，这里实现Adhoc网络路由协议性能的比较-Classical routing table agreement: DSDV (destination sequence distance vector routing protocols), CGSR (group Capitel off switch routing protocol), WRP (Wireless Routing Protocol) and so on. The classic source of origin of the on-demand routing protocols: DSR (Adaptive Source Routing Protocol), AODV (Ad hoc networks on-demand distance vector routing protocols), TORA (Temporary Ordered Routing Algorithm), etc., where the performance achieved Adhoc Network Routing Protocols Comparison
Platform: | Size: 4252672 | Author: 曲景峰 | Hits:

[Internet-Network] dsr.tcl

Description: Dynamic Source Routing - is a routing protocol for wireless mesh networks. It is similar to AODV in that it forms a route on-demand when a transmitting computer requests one. However, it uses source routing instead of relying on the routing table at each intermediate device. Use of network simulation tool NS2, TCL coding.
Platform: | Size: 3072 | Author: Mahendran | Hits:

[Data structs] routing

Description: 模拟距离向量路由算法的路由表交换过程，演示每轮交换后路由表的变化-Simulated distance vector routing algorithm routing table exchange, presentation after each round of exchange of routing table changes
Platform: | Size: 2048 | Author: wulin | Hits:

[Other] Dynamic-Source-Routing

Description: Dynamic Source Routing (DSR) is a routing protocol for wireless mesh networks. It forms a route on-demand when a transmitting computer requests one. It uses source routing instead of relying on the routing table at each intermediate device.
Platform: | Size: 12288 | Author: wavelet | Hits:

Category

Source Code

Web/Internet

Develop Tools

Document

Other

Search in results

OS

Platform

Language

File Type

Search list