Routing Multipoint Connections in Packet-Switched Computer Networks  

作　　者：孙文生 刘泽民 

出　　处：《High Technology Letters》1999年第1期22-25,共4页高技术通讯（英文版）

摘　　要：The problem of constructing minimum cost multicast trees with end to end delay and delay variation constraints to meet the quality of service requirements in high speed packet switched environments is studied in this paper. The routing problem of the bounded delay along the paths from the source to each destination and the bounded variation among the delays along these paths is disussed, and then a new algorithm based on Hopfield neural networks to optimize the multicast tree with delay and variation constraints is presented. The simulations show that the proposed algorithm achieves its best performance in high speed computer networks.１．ＩｎｔｒｏｄｕｃｔｉｏｎＩｎｈｉｇｈ－ｓｐｅｅｄｃｏｍｐｕｔｅｒｎｅｔｗｏｒｋｓ，ｍｕｌｔｉｐｏｉｎｔｃｏｎｎｅｃｔｉｏｎ（ｍｕｌｔｉｃａｓｔ）ｉｓｂｅｃｏｍ－ｉｎｇａｎｉｍｐｏｒｔａｎｔｒｅｑｕｉｒｅｍｅｎｔｔｏｓｕｐｐｏｒｔｍｕｌｔｉｍｅｄｉ...

关 键 词：MULTICAST ROUTING NEURAL network Delay CONSTRAINT 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]