Advertisement

On routing and performance analysis of the doubly connected networks for MANs & LANs

  • Tein Y. Chung
  • Suresh Rai
  • Dharma P. Agrawal
Conference paper
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 130)

Keywords

Local Area Network Node Pair Average Path Length Average Response Time Dimensional Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. [1]
    C. S. Raghavendra, M. Gerla, A. Avizienis, "Reliable loop topologies for large local computer networks", IEEE Trans. on computers, vol. c-34, Jan. 1985, pp. 46–55.Google Scholar
  2. [2]
    T. Y. Chung, S. Rai, and D. P. Agrawal, "Doubly connected Multi-dimensional networks for LANs and MANs", in Proc. 1988 INFOCOM, pp. 551–557.Google Scholar
  3. [3]
    W. J. Dally and C. L. Seitz, "Deadlock-free message routing in multiprocessor interconnection networks", IEEE Trans. Computers, vol. c-36, May 1987, pp. 547–553.Google Scholar
  4. [4]
    N. F. Maxemchuk, "The manhattan street network", Globecom '85, Dec. 2–5, 1985, New Orleans, Louisiana, pp. 252–261.Google Scholar
  5. [5]
    R. R. Boorstyn and A. Livne, "A technique for adaptive routing in networks", IEEE Trans. on Communications, vol COM-29, April 1981, pp. 474–480.Google Scholar
  6. [6]
    N. F. Maxemchuk, "Regular mesh topologies in local and metropolitan area networks", AT&T Technical Journal vol. 64, Sept. 1985, pp. 1659–1685.Google Scholar
  7. [7]
    J. A. Silvester and C. S. Raghavendra, "Analysis and simulation of a class of double loop network architecture", in Proc. of 1984 INFOCOM, pp. 30–35.Google Scholar
  8. [8]
    N. F. Maxemchuk, "Routing in the Manhattan Street Network", IEEE Trans. on Communications, vol. COM-35, May 1987, pp. 503–512.Google Scholar
  9. [9]
    W. Hilal, J. F. Chiu, and M. T. Liu, "A study of register-insertion rings", in Proc. of 1987 INFOCOM, pp. 479–491.Google Scholar
  10. [10]
    L. Kleinrock, Queueing Systems Vol. II: Computer Applications, Wiley Interscience, New York, 1976 (book).Google Scholar
  11. [11]
    P. Kermani and L. Kleinrock, "Virtual Cut Through: A new computer communication switching technique", Computer Networks and ISDN system, vol. 3, 1979, pp. 267–286.Google Scholar
  12. [12]
    M. Ilyas and H. T. Mouftah, "Quasi Cut Through: New hybrid switching technique for computer communication networks", IEE Proceedings, vol. 131, Pt. E, no. 1, Jan. 1984, pp. 1–9.Google Scholar
  13. [13]
    W. Bux and M. Schlatter, "An approximate method for the performance analysis of buffer insertion rings", IEEE Trans. on Communications, vol. COM-31, Jan. 1983, pp. 50–55.Google Scholar
  14. [14]
    I. Rubin, "An approximate time-delay analysis for packet-switching communication networks", IEEE Trans. Communications, vol. COM-24, Feb. 1976, pp. 210–222.Google Scholar
  15. [15]
    C. S. Raghavendra and J. A. Silvester, "Doubly loop network architecture-A performance study," IEEE Trans. on Communications, vol. COM-33, Feb. 1985, pp 185–187.Google Scholar

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Tein Y. Chung
    • 1
  • Suresh Rai
    • 2
  • Dharma P. Agrawal
    • 1
  1. 1.North Carolina State UniversityUSA
  2. 2.Louisiana State UniversityUSA

Personalised recommendations