摘要
本文讨论了在通信网的路由算法中应用二人零和对策理论的问题,提出了对策算法(GA)。GA以使网络平均分组时延最小为优化目标,给出了排队迟延和传播迟延间的解析结果。文中推导了有关GA的定理。业已证明,GA不仅能用作孤立路由算法,也可以用作分布路由算法。 借助于一个简单的网络模型,本文介绍了GA的使用例子,并将GA与最短路算法及热土豆算法的性能作了比较。
The routing algorithm in communication networks applying two- person zero- sum game theory is discussed. The Game Algorithm (GA) is put forward in which the analytic trad - offs between queueing delay and propagation delay are given. It is proved that GA may be used as not only an isolated routing algorithm, but a distributed one.With the help of a network model, this paper also introduces an example using the GA, and compares these with performances of the shortest- path and Hot Potato algorithm.
出处
《通信学报》
EI
CSCD
北大核心
1993年第3期13-21,共9页
Journal on Communications
