On network characterization of and optimal broadcasting in the Manhattan Street Network

The authors introduce the tilted-tree concept to obtain a closed-form solution for the average distance and diameter. A simple distributed algorithm for optimal broadcasting in Manhattan Street Networks (MSNs) is also presented. Simulation results are compared with the analytical results to substantiate the optimality of the proposed algorithm.<<ETX>>

[1]  Nicholas F. Maxemchuk,et al.  Routing in the Manhattan Street Network , 1987, IEEE Trans. Commun..

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

[3]  T.Y. Chung,et al.  A routing scheme for datagram and virtual circuit services in the MSN , 1989, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.

[4]  N. F. Maxemchuk,et al.  Regular mesh topologies in local and metropolitan area networks , 1985, AT&T Technical Journal.

[5]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[6]  Suresh Rai,et al.  Doubly connected multi-dimensional regular topologies for MANs and LANs , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.