DocumentCode
2986649
Title
On network characterization of and optimal broadcasting in the Manhattan Street Network
Author
Chung, Tein Y. ; Agrawal, Dharma P.
Author_Institution
Comput. Syst. Lab., North Carolina State Univ., Raleigh, NC, USA
fYear
1990
fDate
3-7 Jun 1990
Firstpage
465
Abstract
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
Keywords
broadcasting; computer networks; optimisation; trees (mathematics); MSN; Manhattan Street Network; average distance; closed-form solution; diameter; distributed algorithm; network characterization; optimal broadcasting; tilted-tree concept; Algorithm design and analysis; Broadcasting; Closed-form solution; Communication switching; Computational modeling; Computer networks; Computer simulation; Intelligent networks; Switches; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM '90, Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration. Proceedings, IEEE
Conference_Location
San Francisco, CA
Print_ISBN
0-8186-2049-8
Type
conf
DOI
10.1109/INFCOM.1990.91283
Filename
91283
Link To Document