The Distributed Double-Loop Computer Network (DDLCN)

Liu, Ming T. (Mike); Mamrak, Sandra A.; Ramanathan, Jayshree

doi:10.1145/800176.809964

Cited by 16 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The other association (made only when full connectivity cannot be achieved on either loop) is called loopback. Nodes making a loopback association are referred to as loopback nodes A standard token passing scheme governs the access to the network [3][4] [5]. Only a node that "owns" the token may transmits a packet of information.…”

Section: Modelmentioning

confidence: 99%

See 1 more Smart Citation

A reconfiguration algorithm for a double-loop token ring local area network

Rom

Shacham

1988

IEEE Trans. Comput.

View full text Add to dashboard Cite

An algorithm to reconfigure a fault-tolerant double-loop token-ring local area network following topological changes is presented. The algorithm guarantees that at all operational times the network is organized to provide maximum possible connectivity among the nodes-either one loop that encompasses all nodes in the network or several subloops each of which operates as a separate token ring network. Tokens are generated or eliminated as necessary to result in one and only one token in each (sub)loop. The algorithm is formally specified and its properties are verified.

show abstract

Section: Modelmentioning

confidence: 99%

“…Other schemes enhance the ring's reliability by adding more cables to it. Two famous architectures --the daisy chain [2] and the double loop [3]--have each node connected to four unidirectional links, two incoming and two outgoing. Thus when one loop is broken the nodes can use the other one for transmission.…”

Section: Introductionmentioning

confidence: 99%

A reconfiguration algorithm for a double-loop token ring local area network

Rom

Shacham

1988

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

“…As a result, there has been considerable research i n to methods of enhancing the fault tolerance of a loop network, where fault tolerance is some measure of the likelihood that connectivity among nodes is maintained despite failures. Liu et al 2 proposed the Distributed Double Loop Computer Network DDLCN which consists of two counter-rotating loops. FDDI, DQDB, and SONET are examples of a pair of counter-rotating loops.…”

Section: Introductionmentioning

confidence: 99%

Analyzing the fault tolerance of double-loop networks

Peha

Tobagi

1994

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

This paper analyzes the fault tolerance of a class of double-loop networks referred to as forwardloop backward-hop FLBH, in which each node is connected via unidirectional links to the node one hop in front of it and to the node S hops in back of it for some S. A new measure of fault tolerance is described, along with techniques based on Markov c hains to calculate upper and lower bounds on the fault tolerance of this network topology quickly and e ciently. The results of these calculations provide a more precise description of network fault tolerance than has been achieved with previously published techniques.

show abstract