This paper addresses the problem of selecting a route for every pair of communicating nodes in a virtual circuit data network in order to minimize the average delay encountered by messages. The problem was previously modeled as a network of M/M/1 queues. Agenetic algorithm to solve this problem is presented. Extensive computational results across a variety of networks are reported. These results indicate that the presented solution procedure outperforms the other methods in the literature and is effective for a wide range of traffic loads.
展开▼
机译:本文解决了虚拟电路数据网络中每对通信节点选择路径的问题,以便最小化消息遇到的平均延迟。此问题先前被建模为M / M / 1队列的网络。提出了解决此问题的agenicatic算法。报告了各种网络的广泛计算结果。这些结果表明,所提出的解决方案程序优于文献中的其他方法,对各种交通负荷有效。
展开▼