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
Web Server
Browser Client
Ftp Server
Ftp Client
Browser Plugins
Proxy Server
Email Server
Email Client
WEB Mail
Firewall-Security
Telnet Server
Telnet Client
ICQ-IM-Chat
Search Engine
Sniffer Package capture
xml-soap-webservice
Remote Control
P2P
TCP/IP stack
SNMP
Grid Computing
CloudComputing
Search - routing table - List
[
SNMP
]
SNMP
DL : 0
SNMP简单网络管理程序,可以获取网络上计算机的网卡,路由表等信息,附带相应的MIB库-SNMP Simple Network Management program, you can access computers on the network card, routing table and other information, with the corresponding MIB Library
Date
:
Size
: 92kb
User
:
文文凯
[
SNMP
]
snmp_manager_get_route_table
DL : 0
基于winsnmp api实现的获取路由器路由表的程序 snmp功能的实现封装在一个类中 其他程序需要此功能只要添加此类即可。-Based winsnmp api implementation procedures for the router routing table implementation of snmp functions encapsulated in a class as long as other programs require this functionality can be added such.
Date
:
Size
: 3.57mb
User
:
king
[
Internet-Network
]
patch_Olsr_n2.34.tar
DL : 0
Optimazed Link State Protocol (OLSR) is one of protocol routing in MANET. OLSR is protocol proactive when the table routing is update automaticlly.
Date
:
Size
: 36kb
User
:
ichal
[
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
[
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
:
顺口溜
[
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
:
独家记忆
[
Sniffer Package capture
]
textDv
DL : 0
根据已知的网络拓扑图,输入信息,用DV算法更新各路由器的路由表-Network topology based on the known, enter the router s routing table information, updated with the DV algorithm
Date
:
Size
: 1kb
User
:
胡淼
[
Internet-Network
]
AdslDialup
DL : 0
以前在游戏工作室上班时写的一个小工具,功能:在虚拟机上同时拨10条adsl获得10个不同的IP,同时设置路由表,然后把10个IP发送到指定的数据库中。每个IP的跃点数设置成一样,这样就是10个不同的IP出口,然后做成s5代理给挂机的电脑使用。-A small tool, written in the previous game studio to work function: on the same virtual machine to allocate 10 adsl 10 different IP, set the routing table at the same time 10 IP, and then sent to the specified database. Each IP metric set to the same, so that 10 different IP exports, then made the s5 agent to hang up the computer use.
Date
:
Size
: 56kb
User
:
王俊
[
TCP/IP stack
]
Router
DL : 0
这是一个模仿路由算法的java程序。 实现关于路由器的简单功能。 实现距离矢量路由算法。 所实现的路由器模拟Internet上的IP路由器。它能确定网络的最短路由,并在这些利用上传输分组 实现功能简介 1) 编写一个称为“Router”的程序 2) 利用距离向量算法更新路由表 3) 该程序的多个实例(进程或线程)可以以运行在一台机器 4) 实例之间利用UDP交换路由表 5) 假设结点与其邻居结点的都为距离为1。 6) 为了指明实例及其邻居,程序启动时必须能接收以下参数: 7) router ID, myport, port1, port2, port3… 8) 程序必须能处理以下命令: a) N-打印活动的邻居列表。 b) T-输出路由表。 c) 0,1,… 9-发送分组 9) 关于时间定时 a) 每个路由器每2秒钟发出它们的路由表 b) 每个路由器根据收到的路由表更新它们自己的路由表 c) 路由器必须具备检测邻居是否活动的能力。如果路由器在6秒钟没有收到邻居发来的更新,则认为邻居不可达 10) 关于拓扑结构 a) 路由器必须具备路由器故障和恢复的能力 b) 这里假设链路不会出现故障,分组不会丢失和出错 c) 如果路由器在给定时间内未运行,表示路由器故障。如果重启运行,则认为路由器故障恢复 d)当然,假设通信是双向的 -This is a parody routing algorithm java program. Achieve a simple function on the router. Implement distance vector routing algorithm. Internet router simulation achieved the IP router. It can determine the shortest route network, and in these transmission packet utilization Achieve Features A) preparation of a group called "Router" program 2) the use of distance vector algorithm updates the routing table 3) multiple instances of the program (processes or threads) can be run on a single machine 4) between instances using UDP exchange routing table 5) Assuming that node and its neighbor nodes are distance of 1. 6) In order to specify the instance and its neighbors, the program must be able to start receiving the following parameters: 7) router ID, myport, port1, port2, port3 ... 8) program must be able to deal with the following command: a) N-printing activities neighbor list. b) T-output routing table. c) 0,1, ... 9- to send the packet 9) About Time Timing a) given eve
Date
:
Size
: 72kb
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
:
fellpe
[
Internet-Network
]
textDv
DL : 0
根据已知的网络拓扑图,输入信息,用DV算法更新各路由器的路由表-Network topology based on the known, enter the router s routing table information, updated with the DV algorithm
Date
:
Size
: 1kb
User
:
romMay
[
Internet-Network
]
rip
DL : 0
该算法主要实现了RIP协议路由表调整过程。-The algorithm is mainly the RIP routing table tuning process.
Date
:
Size
: 2kb
User
:
毕亚辉
«
1
2
3
4
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.