DocumentCode :
2036496
Title :
Continuous time performance analysis for a hierarchical routing algorithm in Manhattan street networks
Author :
Zheng Chen ; Berger, T.
Author_Institution :
Bell Commun. Res., Morristown, NJ, USA
Volume :
1
fYear :
1993
fDate :
19-21 Oct. 1993
Firstpage :
250
Abstract :
The Manhattan street network (MSN) is a directed network with a link topology that resembles the one-way system of streets and avenues in midtown Manhattan. It is designed for packet communications in a local or metropolitan area. In order to improve on the delay-throughput performance of the random routing algorithm yet keep its properties of simplicity and flexibility, a hierarchical deflection routing algorithm is proposed. We conduct theoretical analyses of this routing algorithm in continuous time for both the store and forward model and the virtual cut-through model, and compare the results for both models.<>
Keywords :
metropolitan area networks; multiprocessor interconnection networks; packet switching; performance evaluation; telecommunication network routing; Manhattan street networks; continuous time; continuous time performance analysis; delay-throughput performance; directed network; hierarchical deflection routing algorithm; hierarchical routing algorithm; link topology; metropolitan area; packet communications; random routing algorithm; store and forward model; theoretical analyses; virtual cut-through model; Buffer storage; Cities and towns; Intelligent networks; Network topology; Performance analysis; Propagation delay; Routing; Telecommunication traffic; Traffic control; Urban areas;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on
Conference_Location :
Beijing, China
Print_ISBN :
0-7803-1233-3
Type :
conf
DOI :
10.1109/TENCON.1993.319975
Filename :
319975
Link To Document :
بازگشت