Enhancing Fault Tolerance and Resource Utilization in Unidirectional Quorum-Based Cycle Routing

Kleinheksel, Cory J.; Somani, Arun K.

doi:10.1109/tnet.2018.2811386

Cited by 3 publications

(3 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2. Any source node could have traffic to pass on to any other node through pre-established paths [3]. As there are 91 possible node pairs yet only 22 direct links, to support all-to-all communication, it requires over 200 links adopting traditional point-to-point connections.…”

Section: Cycle Routing Using Cyclic Quorum Setsmentioning

confidence: 99%

“…Applying CQS routing, specifically with the base set S 0 = {0, 1, 2, 3, 7}, it requires only 120 links to enable all-to-all communication as proved in [3]. We wonder if applying other base sets will result in performance difference.…”

Section: Cycle Routing Using Cyclic Quorum Setsmentioning

confidence: 99%

“…They extended the cycle-based routing to provide redundant paths between each-source destination pair using unidirectional cycles using redundant. They proved that 96.6% − 99.37% fault coverage can be achieved for any single physical link failure and redundant cycle use 42.9% − 47.18% fewer resources in [3]. They showed that cyclic quorums sets have all-pairs property and there can be more than one cyclic quorum set for a given set of nodes.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Establishing Efficient All One-to-One Paths by Exploring Cyclic Quorum Sets

Bian

Somani

2021

2021 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)

Self Cite

View full text Add to dashboard Cite

Cycle-based routing is an efficient routing mechanism widely used to achieve fault-tolerant, reliable, and robust network routing. To meet all-to-all source-destination pairs traffic requirements using cycle-based routing, one efficient method is to use quorum sets to establish cycles to serve each source and destination pair on one of the cycles. Quorum-based cycle routing significantly reduces the total number of direct links to be used in the network compared to establishing all point-to-point communication routes. Adopting different quorum sets provides similar flexibility and reliability yet yields significant differences in resource utilization. We compare multiple quorum sets to establish cycle-based routing paths. We then adopt average cycle length (ACL), standard deviation of cycle length (SDCL), and longest cycle length (LCL) of different configurations of cyclic quorum sets as performance metrics. Using NSFnet topology, we conclude that there is no perfect cyclic quorum set that yields optimal performance for all metrics, and trade-offs need to be made based on the most significant network design requirement when choosing a solution.

show abstract

Section: Cycle Routing Using Cyclic Quorum Setsmentioning

confidence: 99%

Section: Cycle Routing Using Cyclic Quorum Setsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation