Search - routing table

Search - routing table - List

[Internet-Network] pimd-2.1.0 DL : 0: 支持PIM-SM组播路由，支持组播路由表，稍微修改即可构建组播路由器-support PIM-SM Multicast routing, multicast support multicast routing table, can be modified slightly Construction multicast routers
Date : 2008-10-13 Size : 243.32kb User : 朱伟光
[Internet-Network] bgp DL : 0: 网络路由震荡模拟器，模拟当路由表存在回路时的网络路由震荡现象-network routing simulator shocks, simulated routing table there when the circuit network routing concussion phenomenon
Date : 2008-10-13 Size : 4.87kb User : 紫荆
[Internet-Network] bgp DL : 0: 网络路由震荡模拟器，模拟当路由表存在回路时的网络路由震荡现象-network routing simulator shocks, simulated routing table there when the circuit network routing concussion phenomenon
Date : Size : 5kb User : 紫荆
[Internet-Network] iproute DL : 0: This sample demonstrates the use of IP Helper API functions to manipulate the routing table.
Date : Size : 8kb User : 梅恒
[Internet-Network] DistanceVector_Routing DL : 0: 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
Date : Size : 3kb User : agang
[Internet-Network] pimd-2.1.0 DL : 0: 支持PIM-SM组播路由，支持组播路由表，稍微修改即可构建组播路由器-support PIM-SM Multicast routing, multicast support multicast routing table, can be modified slightly Construction multicast routers
Date : Size : 243kb User : 朱伟光
[Internet-Network] iprout-hash DL : 0: 一种基于hash表的IP路由表搜索技术,在WINDOWS下VC++实现-a hash table based on the IP routing table search technology, under the VC WINDOWS
Date : Size : 1.1mb User : 张文宾
[SNMP] Soft20060210105931891 DL : 0: 基于WinSNMP的网管程序. 基于WinSNMP的网管程序，可以得到路由表等信息-WinSNMP based network management procedures. Based on the WinSNMP Management procedures, be routing table information
Date : Size : 52kb User : 鲁文明
[SNMP] source_1.4.2 DL : 0: 如何利用java 使用SNMP 功能，這個是完整的class，還有詳細範例.-How to use java to use SNMP features, this is a complete class, there are detailed examples.
Date : Size : 117kb User : rain
[SNMP] GetRT DL : 0: 基于winanmp,通过路由表及fping探测网络结构，功能还不完全（毕设的一小部分，fping还没搞完）。稍后更新-Based on winanmp, through the routing table and network fping probe structure, function is not completely (complete set up a small part, fping not engage in end). Later update
Date : Size : 56kb User : ll
[Internet-Network] 15 DL : 0: 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.
Date : Size : 1kb User : 猪八戒
[Internet-Network] distanceVectorRouter(c) DL : 0: 利用距离向量算法更新路由表。该程序的多个实例（进程或线程）可以以运行在一台机器一个实例代表一个路由器(结点)。实例之间利用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)
Date : Size : 31kb User : 冷冰
[Internet-Network] RIP DL : 0: 模拟实现rip路由协议，创建新的路由表并由新发来的路由表信息对其进行更改-Rip routing protocol simulation, create a new routing table made by the new information to the routing table changes
Date : Size : 1kb User : 王琛
[Internet-Network] dynamic-routing DL : 0: 了解路由及路由器的概念，路由器的功能，工作原理，路由表，路由算法分类等。学习使用距离矢量算法的动态路由。并附上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
Date : Size : 150kb User : 刘刘
[Internet-Network] adhoc DL : 0: 经典的路由表协议有：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
Date : Size : 4.06mb User : 曲景峰
[Internet-Network] dsr.tcl DL : 0: 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.
Date : Size : 3kb User : Mahendran
[Internet-Network] culster-table DL : 0: 通过Dijkstra算法求出路由表中的最短路径和最小跳数。-Dijkstra' s algorithm to find the shortest path and the minimum number of hops in the routing table.
Date : Size : 7kb User : luochen
[Internet-Network] Routing-table-structure DL : 0: 网络编程，C-C++实现路由算法，显示相应路由表。-Network programming, C-C++ routing algorithm, to display the corresponding routing table.
Date : Size : 428kb User : 李
[Internet-Network] Routing DL : 0: 用于初学者学习网络路由原理，如何根据包含路由信息的txt类型文件生成路由表。-Generate a Routing table txt file
Date : Size : 195kb User : 陈璇
[Internet-Network] prototest DL : 0: a routing table used for ns2
Date : Size : 3kb User : hpm2022

« 12 3 4 »