CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - routing table
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
Windows Develop
Internet-Network
OS program
Communication-Mobile
Game Program
Multimedia program
Embeded-SCM Develop
Graph program
Mathimatics-Numerical algorithms
Applications
Database system
Other
Search - routing table - List
[
TCP/IP stack
]
RIP
DL : 0
实现RIP协议的分组接收和发送流程,以及路由表的维护-RIP protocol to achieve packet receive and transmit processes, and maintenance of routing table
Date
:
Size
: 1kb
User
:
张栋
[
Sniffer Package capture
]
rip
DL : 0
基于rip协议的距离向量算法 收到相邻路由器(地址为X)的每一个rip报文 1,先修改此报文中的所有项目:将“下一跳”字段中的地址都改为X,并将所有的“距离”字段的值加1 2,对修改后的报文中的每一个项目,重复以下步骤 若项目中的目的网络不在路由表中,则将该项目添加到路由表中 否则,若下一跳字段给的路由器地址是同样的,则将收到的项目替换原路由表中的项目 否则,若收到的项目中的距离小于路由表中的距离,则进行更新 否则,设么也不做-Rip protocol based on distance vector algorithm receives the adjacent router (address X) rip each packet 1, the first to modify this message to all projects: the " next hop" address fields are replaced by X, and all of the " distance" field value plus 1 2, the modified packets of each item, repeat the following steps if the project is not the purpose of network routing table, then add the item to the routing table in or, if the field to the next hop router address is the same, you will receive the items in the routing table to replace the original item or, if the item received is less than the distance from the routing table, then the Updated Otherwise, do not set Mody
Date
:
Size
: 2kb
User
:
唐栋
[
Internet-Network
]
Experiencia-2
DL : 0
Simulation Castalia valuePropagation routing table for algorithm for wireless sensor networks, WSN
Date
:
Size
: 120kb
User
:
mich
[
Internet-Network
]
Experiencia-3
DL : 0
Simulation Castalia AODV routing table for algorithm for wireless sensor networks, WSN AODV
Date
:
Size
: 264kb
User
:
mich
[
Data structs
]
OSPF
DL : 0
利用OSPF协议构造路由表,采用Dijkstra算法-Construct the routing table using OSPF protocol, using the Dijkstra algorithm
Date
:
Size
: 1kb
User
:
张会会
[
Internet-Network
]
router(WFQ-P-token)
DL : 0
优化的路由查找算法的实现。 可以动态创建、更新路由表,并能根据目标地址(Destination Address)找到相应的下一跳(Next Hop)。-Optimized route lookup algorithm. Can dynamically create, update routing table, and according to the target address to find the corresponding next hop.
Date
:
Size
: 972kb
User
:
Daisy
[
Internet-Network
]
WhoisIp
DL : 0
中国路由表整理工具源代码,能从APNIC上获取ip注册信息,以分离出中国电信、中国联通等运营商ip地址段-Chinese routing table finishing tool source code to get ip from the APNIC registration information on to isolate China Telecom, China Unicom and other operators ip addresses
Date
:
Size
: 25kb
User
:
顺口溜
[
Data structs
]
Network-node-shortest-path
DL : 0
此代码实现了网络结点之中最短路径的计算,并输出了各个网络结点的路由表 ,路由表包括:目的网络,下一跳,代价,详细地址。此代码的原理是Dijstra算法。在代码的注释中有测试用例,用户测试时只需将程序运行后再将测试用例复制到DOS黑框中即可。测试用例中有详细的用例解释。-This code implements the network nodes being the shortest path calculation, and output of each network node routing table, routing table, including: the destination network, the next hop, the cost, full address. The principle of this code is Dijstra algorithm. There are comments in the code test cases, users only need to run test after test cases can be copied to the DOS black borders. Test use cases in detail to explain.
Date
:
Size
: 1kb
User
:
刘伟强
[
Sniffer Package capture
]
RoutLookupSim
DL : 0
该程序模拟路由器中路由查找的过程。对每一个IP包,路由器都必须在路由表中进行一次最长前缀匹配查找,继而将IP包逐跳转发到其目的地址。该程序集中模拟最长前缀匹配(Longest Prefix Matching)这个过程。-The program simulated router routing lookup process. For each IP packet, the router must be conducted in the routing table to find the longest prefix match, then the IP packet-by-hop to its destination address. The program focused on modeling the longest prefix match (Longest Prefix Matching) in this process.
Date
:
Size
: 2.12mb
User
:
张峰
[
Internet-Network
]
myRIP
DL : 0
实现了RIP动态路由协议 1. 对客户端收到的RIP报文进行合法性检查,丢弃错误报文并指出错误原因 2. 处理Request报文,根据报文内容及本地路由表信息组成Response报文,实现水平分割 3. 处理Response报文,正确解析其中信息,更新本地路由表 4. 路由表项超时删除 5. 路由表项定时发送,实现水平分割,与2相似。-Implementation of the RIP dynamic routing protocol 1 on the client receives the RIP message for validity check, discarding the error message and pointed out that the causes of error The 2 processing Request message according to the message content, and the local routing table information consists of Response message, to achieve the level of segmentation The 3 processing Response message, the correct analysis of the information, to update the local routing table 4 routing table entry timeout remove 5 routing table entry timing transmission, to achieve the level of segmentation, and 2 similar.
Date
:
Size
: 2kb
User
:
潘春雨
[
Internet-Network
]
20111212.aodv.tar
DL : 0
NS2环境下,添加路由表打印以及邻居列表选择的AODV路由协议源代码。-NS2 environment, add the routing table and neighbor list, select the print AODV routing protocol source code.
Date
:
Size
: 44kb
User
:
CheeWii
[
Sniffer Package capture
]
Whois
DL : 0
windows 获取 电信联通路由表批处理-windows batch routing table for Telecom
Date
:
Size
: 364kb
User
:
zdgs
[
Internet-Network
]
DistanceVectorAlgorithmSimulation
DL : 0
1、 对地址为X的相邻的路由器发来的RIP报文,先修改此报文中的所有项目;把“下一跳”字段中地址都改为X,并把所有距离都加1。 2、 对修改后的报文的每一个项目,进行以下步骤:若原路由器没有该目的网络,就直接加在路由表中;不然,再看下一跳路由器地址,若是X,则用收到的项目替换原来的;若下一跳地址不同,,收到的项目的距离小于原来的距离,则替换,否则什么都不用做。 3、 若3分钟没有收到相邻路由器的更新路由表,则把此相邻路由器记为不可达的路由器,即把距离设为16 4、 返回 -In 1, the address for the X neighbor routers send RIP message, to modify this message in all project " the next hop address" field is changed to X, and put all distances are plus 1. 2, on the modified message to every project, the following steps: if the router is not the destination network, just add in the routing table otherwise, go on to the next hop router address, if X, using the received the item to replace the original if the next-hop address different,, received project a distance less than the original distance, it is replaced, or do nothing. 3, if 3 minutes received no neighboring routers to update the routing table, while the adjacent router recorded as unreachable router, namely the distance was set to 16 4, return
Date
:
Size
: 1kb
User
:
独家记忆
[
Communication-Mobile
]
all_wbs
DL : 0
Use openet network simulation. Function: initialize the entire network release path Dijkstra algorithm implementation query node routing table creation route selection order routing updates to establish a connection.-Use openet network simulation. Function: initialize the entire network release path Dijkstra algorithm implementation query node routing table creation route selection order routing updates to establish a connection.
Date
:
Size
: 1.69mb
User
:
lcl
[
Shell api
]
sc-RO
DL : 0
运行sc-RO.bat后 1.程序会按照系统时间,将"copyfile" 复制一份并重命名为当前日期格式的文件夹,日期格式为"YYYYMMDD"。 2.如果新文件夹已复制,程序会监测是否存在"finish"的文件,如果不存在,则进行路由表获取,(获取完成后,获取窗口会停留在当前状态,点击一下便可消失)获取完成后生成"finish"文件。 3.返还sc-RO.bat窗口,会提示"请按任意键继续. . ." 程序后台运行文件对比程序,完成后弹出对比结果文件"fccheck.log"。-Run sc-RO.bat Program in accordance with the system time "copyfile a copy and rename the folder for the current date format, date format in YYYYMMDD. If the new folder has been copied, the program will monitor whether there is "finish" the file, if it does not exist, then the routing table to obtain (access is completed, get the window will stay in the current state, one click can disappear) to obtain generate the "finish" finished file. . Return sc-RO.bat window will be prompted to "Press any key to continue ..." pop-up comparative results file "fccheck.log," the program running in the background file comparison program, completed.
Date
:
Size
: 1kb
User
:
caiweicheng
[
Linux-Unix
]
Eigrp
DL : 0
eigrp模拟器。实现了发包构建拓扑图的功能。有邻居表,路由表,拓扑表。spf算法-The eigrp simulator. Contract to build a topology map. Neighbor table, routing table, topology table. spf algorithm
Date
:
Size
: 571kb
User
:
王伟超
[
Windows Develop
]
Wsimple_routei
DL : 0
利用WinPcap编制简单的路由程序,实现路由功能。简单单的路由程序分为静态路由表的维护和IP数据报的处理两大部分。 -Use WinPcap to prepare a simple routing procedures to achieve the routing functions. Simple single routing process is divided into two parts of the static routing table maintenance and processing of the IP datagram.
Date
:
Size
: 51kb
User
:
分界线
[
Windows Develop
]
llibbdnet-110i
DL : 0
libdnet 为若干个低层的网络例程提供了一个简单易懂的可移植的接口,包含网络地址处理,内核arp 缓冲与路由表查找与管理,网络防火墙(IP filter, ipfw, ipchains,, pf, PkktFilter, ...),网络接口查找与管理,IP 隧道(BSD/Linux tun, Universal TUN/TAP device),未加工的IP 包与以太网帧的传输。 -the libdnet as a number of low-level network routines provide an easy-to-understand interface portable, contains the network address processing, the kernel arp buffer the routing table lookup and management, network firewall (IP filter, ipfw, ipchains, pf, PkktFilter , ...), network interface lookup and management, IP tunneling (BSD/Linux tun, Universal TUN/TAP device), raw IP packet and Ethernet frame transmission.
Date
:
Size
: 390kb
User
:
明白的
[
Windows Develop
]
TStaticRouterh
DL : 0
实现路由器的基本功能,掌握路由器的工作原理,进而深入了解网络互联层的工作原理。要求实现一个简单的路由处理程序,应该包括的功能如下:静态路由表的维护,IP数据报的处理,处理IP数据报TTL域中的数值,重重新计算IP数据报的头部校验和,生成和处理ICMP报文,显示本机的网络接口、IP数据报的接收情况、IP数据报的选路情况、IP数据报的发送情况。程序学要和Winpcap3.1一起使用,具体说明见"程序说明 -The basic functionality of the router, the the master router works, works-depth understanding of network interconnection layer. To implement a simple routing handler function that should be included are as follows: static routing table maintenance, the IP datagram processing, processing IP datagrams TTL domain numerical weight to recalculate the IP datagram header checksum generation and processing of ICMP packets, and display the network interface, the IP datagram receiver, IP datagram routing, IP datagram sent situation. Program learn and Winpcap3.1 details, see the description of the procedures
Date
:
Size
: 400kb
User
:
兴奋
[
Windows CE
]
WinceRouter
DL : 0
WINCE下路由查询及修改路由表,多网卡时有用-Query and Modify routing table in Windows CE
Date
:
Size
: 14kb
User
:
Guobg
«
1
2
3
4
5
6
7
8
9
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.