Nonuniform traffic in the Manhattan Street network

Abstract

A network operating with deflection routing and nonuniform traffic is considered. In addition, each communication link may be characterized by an arbitrary but known propagation delay. A study is made of three distinct contention resolution rules, focusing on one which gives priority to those packets that have been in the network longest. Independence approximations are used to describe the distribution of packet arrivals at each node. A recursive equation is written for each node and used to derive approximate steady-state packet delay distributions. Examples are presented and the independence assumption is discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>