A reconfiguration algorithm for a double-loop token ring local area network
作者： R. Rom , N. Shacham
DOI: 10.1109/12.2147
关键词:
摘要: A distributed algorithm to reconfigure a double-loop token-ring local area network following topological changes is presented. Each node, upon detection of broken link, attempts use another and when this not possible it connects its input output lines form loopback. The nodes communicate only with their neighbors base actions on the messages they receive observations. guarantees that at all times organized provide maximum connectivity among nodes-either one loop encompasses in or several subloops, each which operates as separate network. Tokens are generated eliminated necessary result token (sub)loop. formally specified properties verified. >
computer.org
sci-hub.se 参考文章(7)
Raghavendra, Gerla, Avizienis, Reliable Loop Topologies for Large Local Computer Networks IEEE Transactions on Computers. ,vol. 34, pp. 46- 55 ,(1985) , 10.1109/TC.1985.1676514
Alon Itai, Michael Rodeh, Symmetry breaking in distributive networks 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981). pp. 150- 158 ,(1981) , 10.1109/SFCS.1981.41
Duen-Ping Tsay, M.T. Liu, MIKE: A Network Operating System for the Distributed Double-Loop Computer Network IEEE Transactions on Software Engineering. ,vol. 9, pp. 143- 154 ,(1983) , 10.1109/TSE.1983.236459
J. R. Pierce, Network for Block Switching of Data Bell System Technical Journal. ,vol. 51, pp. 1133- 1145 ,(1972) , 10.1002/J.1538-7305.1972.TB02646.X
Jerome H. Saltzer, Kenneth T. Pogran, A star-shaped ring network with high maintainability Computer Networks. ,vol. 4, pp. 239- 244 ,(1980) , 10.1016/0376-5075(80)90013-6
Jacob John Wolf, Design and analysis of the distributed double-loop computer network (ddlcn) The Ohio State University. ,(1979)
A. Itai, Symmetry breaking in distributed networks Proc. ACM Smposium on Theory of Computing. pp. 150- 158 ,(1981)