SHARP APPROXIMATE MODELS OF DEFLECTION ROUTING IN MESH NETWORKS

Deflection routing is a simple, decentralized, and adaptive method for routing data packets in communication networks. In this paper we focu s on deflection routing in the Manhattan street network (a two-dimensi onal directed mesh), though our analytic approach should apply to any regular network. We present two approximate performance models that gi ve sharp estimates of the steady state throughput and the average pack et delay for packets admitted to the network. The results of extensive simulation experiments are reported, which corroborate the models' pr edictions. 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 diame ter and deflection index are near the optimal values.