Location:
Search - edge router
Search list
Description: 题 目 ：最短路由计算
题目描述：INTERNET中通过路由器在多个网络中进行数据报的转发，在研究路由问题的时候，可以把每一个路由器、局域网或者广域网都抽象为一个结点，每条链路则用带有方向的边表示，边上的权值表示相邻结点的代价值。于是可以根据最短路径算法得出最佳的路由表。
-Title: Calculation of the shortest route subject description: INTERNET by routers in a number of network datagram forwarding, routing problems in the study, they can each router, LAN or WAN are abstracted as a node point, each link is used with the express direction of the edge, the edge of the right to express the value of adjacent nodes in lieu of value. It could thus be the basis of the shortest path algorithm to draw the best routing table.
Platform: |
Size: 64512 |
Author: lipeng |
Hits:
Description: 在网络的边缘路由器中并不能完全接受所到的包，所以需要用接入算法进行选择，此代码就是仿真网络中的接入控制算法，-The edge of the network router and can not be fully accepted by the package, so it is necessary to use access algorithm selection, this code is the simulation of network access control algorithm,
Platform: |
Size: 56320 |
Author: mengman |
Hits:
Description: six -one 新型路由器的简要介绍！- A widely
discussed approach to mitigate this problem is through a new
layer of indire ction between provider-independent addresses at
the edge and aggregatable, provider-allocated addresses in the
core of the Internet.
Platform: |
Size: 1043456 |
Author: mary |
Hits: