摘要
在基于Internet的通信子网中实现数据传输最根本的问题就是根据某种路由算法选择合适的通信信道,路由算法的目的就是试图使网络流量最大,且使网络的平均分组时延最小。为便于模拟实现路由选择,本文采用改进的Dijkstra最短路由算法,以时间片为单位推进时钟的策略实现了一个典型互联网络模型通信过程的仿真。
The most basic problem of data communication in sub-network based on internet is to select suitable communicating channels according to a kind of routing algorithm. The aim of routing algorithm is just to make network traffic largest and network average packet delay least . In order to emulate routing chioce conveniently, this paper adopt improved Dijkstra Shortest-Path Routing Algorithm and the strategy of pushing foreword the clock by the unit of timeslice to emulate the communication process of a typed n...
出处
《微计算机信息》
北大核心
2008年第4期197-198,共2页
Control & Automation