DocumentCode :
892639
Title :
Sharp approximate models of deflection routing in mesh networks
Author :
Greenberg, Albert G. ; Goodman, Jonathan
Author_Institution :
AT&T Bell Lab., Murray Hill, NJ, USA
Volume :
41
Issue :
1
fYear :
1993
fDate :
1/1/1993 12:00:00 AM
Firstpage :
210
Lastpage :
223
Abstract :
Deflection routing is a simple, decentralized, and adaptive method for routing data packets in communication networks. The focus of this work is on deflection routing in the Manhattan street network (a two-dimensional directed mesh), although the analytic approach should apply to any regular network. Two approximate performance models that give sharp estimates of the steady-state throughput and the average packet delay for packets admitted to the network are presented. 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
Keywords :
packet switching; telecommunication network routing; Manhattan street network; adaptive method; average packet delay; communication networks; decentralised method; deflection index; deflection routing; diameter; mesh networks; sharp approximate models; steady-state throughput; two-dimensional directed mesh; Communication networks; Computer networks; Delay estimation; Intelligent networks; Mesh networks; Performance analysis; Predictive models; Routing; State estimation; Throughput;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/26.212380
Filename :
212380
Link To Document :
بازگشت