SHARP APPROXIMATE MODELS OF DEFLECTION ROUTING IN MESH NETWORKS

被引：28

作者：

GREENBERG, AG ^{[1
]}

GOODMAN, J ^{[1
]}

机构：

[1] NYU,COURANT INST MATH SCI,NEW YORK,NY 10012

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 1993年 / 41卷 / 01期

关键词：

D O I：

10.1109/26.212380

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Deflection routing is a simple, decentralized, and adaptive method for routing data packets in communication networks. In this paper we focus on deflection routing in the Manhattan street network (a two-dimensional directed mesh), though our analytic approach should apply to any regular network. We present two approximate performance models that give sharp estimates of the steady state throughput and the average packet delay for packets admitted to the network. The results of extensive simulation experiments are reported, which corroborate the models' predictions. The results show that deflection routing is very effective. Two measures of the merit of a network for deflection routing are its diameter and its deflection index. Networks are presented whose diameter and deflection index are near the optimal values.

引用

页码：210 / 223

页数：14