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

Abstract

<p>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.</p>