By Topic

Sharp approximate models of deflection routing in mesh networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Greenberg, A.G. ; AT&T Bell Lab., Murray Hill, NJ, USA ; Goodman, J.

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

Published in:

Communications, IEEE Transactions on  (Volume:41 ,  Issue: 1 )