DocumentCode
2987032
Title
Routing in TAC-a triangularly-arranged network
Author
Myers, G.E. ; El Zarki, M.
Author_Institution
Bellcore, Red Bank, NJ, USA
fYear
1990
fDate
3-7 Jun 1990
Firstpage
481
Abstract
An investigation is conducted of a metropolitan area network that is an extension to the Manhattan street network (MSN) and features a three-connected, regular mesh topology. The design of a triangularly arranged connection (TAC) node is discussed, and the basic layout of the network is examined. The underlying routing approach of the network is explored and explained through a routing example. It is established through simulation that the increased interconnectivity of the TAC gives a significant boost in performance over the MSN at a cost of more physical links and node complexity
Keywords
computer networks; packet switching; Manhattan street network; TAC; interconnectivity; layout; metropolitan area network; packet switching; routing; triangularly arranged connection node; triangularly-arranged network; Computational modeling; Computer graphics; Costs; Intelligent networks; Local area networks; Metropolitan area networks; Network topology; Routing; Throughput; Workstations;
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.91285
Filename
91285
Link To Document