Nonuniform Traffic in the Manhattan Street Network

Abstract The Manhattan Street Network is a toroidal network proposed for application as a Metropolitan Area Network. The network uses deflection routing, an adaptive routing scheme where nodes attempt to send packets along shortest paths to their destinations. Contention for communication link access is resolved by forcing packets to travel longer paths. We consider a network operating with deflection routing and nonuniform traffic. In addition, each communication link may be characterized by an arbitrary but known propagation delay. We study a contention resolution rule giving priority to packets in the network longest. Independence approximations are used to describe the distribution of packet arrivals at each node, and we derive approximate steady-state packet delay distributions. Examples are presented and compared to simulation results, and the independence assumption is discussed.

[1]  Oj Onno Boxma,et al.  Teletraffic Analysis and Computer Performance Evaluation , 1988 .

[2]  Maxemchuk.  The Manhattan street network , 1985 .

[3]  Flaminio Borgonovo,et al.  A procedure to evaluate the mean transport time in multibuffer deflection-routing networks with nonuniform traffic , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[4]  Albert G. Greenberg,et al.  Sharp approximate models of deflection routing in mesh networks , 1993, IEEE Trans. Commun..

[5]  Bruce E. Hajek,et al.  Performance of shuffle-like switching networks with deflection , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[6]  Nicholas F. Maxemchuk,et al.  Effect of a finite reassembly buffer on the performance of deflection routing , 1991, ICC 91 International Conference on Communications Conference Record.

[7]  Nicholas F. Maxemchuk,et al.  Problems Arising from Deflection Routing: Live-lock, Lockout, Congestion and Message Reassembly , 1991 .