A Reconfiguration Algorithm for a Double-Loop Token-Ring Local Area Network

IEEE Transactions on Computers

Volumn 37, Issue 2, 1988, Pages 182-189

  Rom, Raphael ^a   Shacham, Nachum ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b SRI INTERNATIONAL   (United States)

Author keywords

Distributed algorithms; fail safe protocols; local area networks; survivable networks; token passing ring

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

DISTRIBUTED ALGORITHM; DOUBLE-LOOP TOKEN-RING LOCAL AREA NETWORK; RECONFIGURATION ALGORITHM;

COMPUTER NETWORKS;

EID: 0023961356     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.2147     Document Type: Article

References (7)

1. J. H. Saltzer and K. T. Pogran, “A star shaped ring network with high maintainability” in Proc. Local Area Network Symp., May 1979, pp. 179-189
2. C. S. Raghvendra, M. Gerla, and A. Avizienis, “Reliable loop topologies for large local computer networks,” IEEE Trans. Comput., vol. C-34, pp. 46–55, Jan. 1985.
3. M. T. Liu, D. P. Tsay, C. P. Chou, and C. M. Li, “Design of the distributed double loop computer network (DDLCN),” J. Digital Syst., vol. 5, pp. 3–37, Spring 1981.
4. Y. J. Tang and S. G. Zaky, “A survey of ring networks: Topology and protocols,” in Proc. IEEE Infocom 85, Washington, DC, Mar. 1985, pp. 318–325.
5. J. R Pierce, “Network for block switching data,” Bell Syst. Tech. J., vol. 51, pp. 1133–1145, July/Aug. 1972.
6. A. Itai and M. Rodeh, “Symmetry breaking in distributed networks,” in Proc. 22nd Annu. Symp. Foundations Comput. Sci., IEEE, Nashville, TN, Oct. 1981, pp. 150–158.
7. J. J. Wolf, “Analysis of distributed double-loop computer network,” Ph.D. dissertation, Ohio State Univ., 1979.