|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| T.Y. Chung, N. Sharma, D.P. Agrawal, "Cost-Performance Trade-Offs in Manhattan Street Network Versus 2-D Torus," IEEE Transactions on Computers, vol. 43, no. 2, pp. 240-243, February, 1994. | |||
| BibTex | x | ||
| @article{ 10.1109/12.262131, author = {T.Y. Chung and N. Sharma and D.P. Agrawal}, title = {Cost-Performance Trade-Offs in Manhattan Street Network Versus 2-D Torus}, journal ={IEEE Transactions on Computers}, volume = {43}, number = {2}, issn = {0018-9340}, year = {1994}, pages = {240-243}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.262131}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Cost-Performance Trade-Offs in Manhattan Street Network Versus 2-D Torus IS - 2 SN - 0018-9340 SP240 EP243 EPD - 240-243 A1 - T.Y. Chung, A1 - N. Sharma, A1 - D.P. Agrawal, PY - 1994 KW - metropolitan area networks; network topology; performance evaluation; Manhattan street network; 2D torus; MSN; HR/sup 4/-Net; metropolitan areas; mesh connected networks; average distance; diameter; terminal reliability; cost-performance ratio; reliability routing distribution. VL - 43 JA - IEEE Transactions on Computers ER - | |||
Two recent topologies-Manhattan Street Network (MSN) and HR/sup 4/-Net (or 2-D Torus)-proposed for metropolitan areas are primarily mesh connected networks. The authors compare the average distance, the diameter, the terminal reliability, and the cost. Simulation results indicate that they are fairly close in performance, while the MSN is observed to be more cost-effective than the HR/sup 4/-Net.
[1] F. Borgonovo and E. Cadorin, "HR4-Net: A hierarchial random-routing reliable and reconfigurable network for metropolitan area," inProc. INFOCOM, 1987, pp. 320-326.
[2] C. Chou and D. H. C. Du, "Hierarchial uni-directional hypercubes," inProc. 1991 Int. Conf. Parallel Processing, vol. I, pp. 530-533.
[3] T.Y. Chung and D.P. Agrawal, "On network characterization and optimal broadcasting for the MSN," inProc. IEEE INFOCOM 1990, San Francisco, CA, June 5-7, 1990, pp. 465-472.
[4] T. Y. Chung, S. Rai, and D. P. Agrawal, "A routing scheme for datagram and virtue circuit services in MSN," presented at the Int. Phoenix Conf. Comput. and Commun., Phoenix, AZ, Mar. 1989, pp. 214-218.
[5] W.J. Dally and C.L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[6] S. P. Dandamudi and D. L. Eager, "Hierarchial interconnection networks for multicomputer systems,"IEEE Trans. Comput., vol. C-39, pp. 786-797, June 1990.
[7] P. W. Dowd and K. Jabbour, "A unified approach to local area network interconnection,"IEEE J. Select. Areas Commun., vol. SAC-5, pp. 1418-1425, Dec. 1987.
[8] N. Kini, A. Kumar, and D. P. Agrawal, "Quantative reliability analysis of redundant multistage interconnection networks," in Amer. Math. Soc./ACM DIMACS series,Reliability of Computer and Communication Networks, vol. 5, 1991, pp. 153-170.
[9] N. F. Maxemchuk, "Routing in the Manhattan Street Network,"IEEE Trans. Commun., vol. Com-35, no. 5, May 1987, pp. 503-512.
[10] D. A. Reed and D. C. Grunwald, "The performance of multicomputer interconnection networks,"IEEE Comput. Mag., vol. 20, pp. 63-73, June 1987.