Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - routing table
Search - routing table - List
本附录介绍一些新的A P I函数,有了这些函数,便可在自己的计算机上对I P协议统计情况 进行查询和管理。它们有助于获得下面的能力: ■ I p c o n f i g . e x e(或适用于微软Windows 95的Wi n i p c f g . e x e):显示I P配置信息,允许释放 和更新D H C P分配的I P地址。 ■ N e t s t a t . e x e:显示T C P连接表、U D P监听者表以及I P协议统计情况。 ■ R o u t e . e x e:显示并处理网络路由表。 ■ A r p . e x e:显示并修改供“地址解析协议”(A R P)使用的I P到物理地址翻译表。-This appendix to introduce some new API functions, these functions can be on your computer to the IP protocol statistics query and management. Their ability to contribute to the acquisition of the following: ■ I pconfig. Exe (or apply to Microsoft Windows 95 s Wi nipcfg. Exe): display IP configuration information, allowing the release and update DHCP allocated IP address. ■ N etstat. Exe: show TCP connection table, UDP Listener Table, as well as IP protocol statistics. ■ R oute. Exe: display and handle the network routing table. ■ A rp. Exe: display and modify for ARP (ARP) to use the IP to physical address translation table.
Date : Size : 417kb User : 楼洛阳

DL : 0
这个文档介绍了在企业网连接中怎样获得优先级高的路由BGP-This document illustrates how to achieve a high degree of optimal routing in an enterprise network connected to multiple Internet service providers (ISPs), while minimizing the memory requirements of the Border Gateway Protocol (BGP) routers. This is achieved by using AS_PATH filters for accepting only routes originated from an ISP and its directly connected autonomous systems, instead of receiving the full BGP routing table from an ISP.
Date : Size : 17kb User : topgemwang

DL : 0
基于SNMP的网络拓扑发现技术资料:基于SNMP 的网络拓扑发现算法,本文通 过对网络设备的路由表和ARP 表的分析,描述了一种基于SNMP 的网络拓扑发现方法,该 方法能够较快速准确的计算出被管网络的二层和三层拓扑关系,并且广泛适用于支持SNMP 协议的网络设备。-SNMP-based network topology discovery technology information: SNMP-based network topology discovery algorithm, the paper routing table of network devices and the analysis of ARP table describes the SNMP-based network topology discovery method that can more quickly and accurately calculated by the second floor and three pipe network topology, and support for SNMP protocol is widely used in network equipment.
Date : Size : 279kb User : lele

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.
Date : Size : 12kb User : wavelet

OSPF路由协议是用于网际协议(IP)网络的链路状态路由协议。作种链路状态路由协议OSPF链路状态广播数据包LSA(Link State Advertisement)传送给某区域内所有路由器点与距离矢量路由协议同运行距离矢量路由协议路由器部分或全部路由表传递给与其相邻路由器-OSPF routing protocol is used for Internet Protocol (IP) network link-state routing protocol. As a kind of link-state routing protocol OSPF link state broadcast packets LSA (Link State Advertisement) sent to all routers point and distance vector routing protocols with distance vector routing protocol router running part or all of the routing table is passed to a region adjacent to the router
Date : Size : 3.33mb User : tongyimingzi

OSPF路由协议种典型链路状态(Link-state)路由协议般用于同路由域内里路由域指自治系统(Autonomous System)即AS指组通过统路由政策或路由协议互相交换路由信息网络AS所有OSPF路由器都维护相同描述AS结构数据库该数据库存放路由域相应链路状态信息OSPF路由器正通过数据库计算出其OSPF路由表-OSPF link state routing protocol typical (Link-state) routing protocol generally used in the same routing domain routing domain refers to the autonomous system (Autonomous System) that refers to the group AS AS network to exchange routing information to each other through the system all the OSPF routing protocol routing policy or Description AS router maintains the same structure of the database stored in the database field corresponding link-state routing information database OSPF routers are calculated by its OSPF routing table
Date : Size : 194kb User : tongyimingzi

DL : 0
本研究开发一种混合自动进化模糊学习算法 决定了最优路径旅行附近大规模旅行商问题 (LSTSPs)。LSTSPs识别解决方案是一种最复杂的主题 全球的组合优化问题。提出的混合进化模糊 学习计划的优点结合自适应模糊c均值(FCM),简单 不等式性质合并的概念,模拟退火(SA)算法和一种有效的学习 表transform-based粒子群优化(TPSO)。本研究使用 方法来处理大型TSP路由系统。 应用进化TPSO学习算法-This study develops a hybrid evolutionary fuzzy learning algorithm that automatically determines the near optimal traveling path in large-scale traveling salesman problems (LSTSPs). Identifying solutions for LSTSPs is one of the most complicated topics in the field of global combinatorial optimization problems. The proposed hybrid evolutionary fuzzy learning scheme combines the advantages of the adaptive fuzzy C-means (FCM), simple MAX–MIN merging concept, simulated annealing (SA) learning algorithm and an efficient table transform-based particle swarm optimization (TPSO). This study uses the proposed method to deal with the large-size TSP routing system.
Date : Size : 1.87mb User : qi
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.