Finding Complex Cycles through a Set of Nodes

Somani, Arun K.; Lastine, David; Sankaran, Suresh

doi:10.1109/glocom.2011.6134446

Cited by 9 publications

(22 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This section uses a similar experiment setup as Section V. We used the same four common networks (Fig. 2) and an implementation of the ECBRA heuristic [9] to perform the cycle routing. We also are using just a single cycle based on R redundant quorums sets.…”

Section: B Greedy Missing Pairs Heuristic Resultsmentioning

confidence: 99%

“…Light-trails were proposed [6] as a solution to the challenges facing lightpaths and could be built using commercial off-the-shelf technology. Significant contributions have been made to enable adoption and advance the light-trail architecture [7]- [9]. Light-trail communication is all optical and uses the same wavelength(s) from start to end node; Light-trails enable fast, dynamic creation of a unidirectional optical sharable communication channel.…”

Section: A Light-trailsmentioning

confidence: 99%

“…The multi-point cycle routing algorithm (MCRA) uses bidirectional cycles for fault tolerance and is capable of supporting SONET rings and p-cycles [1]. ECBRA is a significant improvement of MCRA and outperforms the OCR heuristic [9]. ECBRA heuristic balances optimality and speed, taking O |E| |C| 3 steps to find a close to optimal cycle.…”

Section: Light-trails Cycle Routing and Fault Tolerancementioning

confidence: 99%

“…We used four common networks ( Fig. 2) and an implementation of the ECBRA heuristic [9] to perform the cycle routing. ECBRA is sensitive to node and edge numbering that a total of 100 variations on the inputs were considered, each being a oneto-one mapping with the respective network.…”

Section: Network Routing Efficiency and Fault Tolerancementioning

confidence: 99%

See 3 more Smart Citations

Unidirectional Quorum-Based Cycle Planning for Efficient Resource Utilization and Fault-Tolerance

Kleinheksel

Somani

2016

2016 25th International Conference on Computer Communication and Networks (ICCCN)

View full text Add to dashboard Cite

Abstract-In this paper, we propose a greedy cycle direction heuristic to improve the generalized R redundancy quorum cycle technique. When applied using only single cycles rather than the standard paired cycles, the generalized R redundancy technique has been shown to almost halve the necessary light-trail resources in the network. Our greedy heuristic improves this cycle-based routing technique's fault-tolerance and dependability.For efficiency and distributed control, it is common in distributed systems and algorithms to group nodes into intersecting sets referred to as quorum sets. Optimal communication quorum sets forming optical cycles based on light-trails have been shown to flexibly and efficiently route both point-to-point and multipoint-to-multipoint traffic requests. Commonly cycle routing techniques will use pairs of cycles to achieve both routing and fault-tolerance, which uses substantial resources and creates the potential for underutilization. Instead, we use a single cycle and intentionally utilize R redundancy within the quorum cycles such that every point-to-point communication pairs occur in at least R cycles. Without the paired cycles the direction of the quorum cycles becomes critical to the fault tolerance performance. For this we developed a greedy cycle direction heuristic and our single fault network simulations show a reduction of missing pairs by greater than 30%, which translates to significant improvements in fault coverage.

show abstract

Section: B Greedy Missing Pairs Heuristic Resultsmentioning

confidence: 99%

Section: A Light-trailsmentioning

confidence: 99%

Section: Light-trails Cycle Routing and Fault Tolerancementioning

confidence: 99%

Section: Network Routing Efficiency and Fault Tolerancementioning

confidence: 99%

See 2 more Smart Citations

Unidirectional Quorum-Based Cycle Planning for Efficient Resource Utilization and Fault-Tolerance

Kleinheksel

Somani

2016

2016 25th International Conference on Computer Communication and Networks (ICCCN)

View full text Add to dashboard Cite

show abstract

“…Light-trails were proposed in [4,5] as a solution to the challenges facing lightpaths and could be built using commercial off-theshelf technology. In the years since the introduction of light-trails, significant contributions have been made to enable adoption and advance the architecture [1,6,7,8,9].…”

Section: Light-trailsmentioning

confidence: 99%

Optical quorum cycles for efficient communication

Kleinheksel

Somani

2015

Photon Netw Commun

View full text Add to dashboard Cite

Many optical networks face heterogeneous communication requests requiring topologies to be efficient and fault tolerant. For efficiency and distributed control, it is common in distributed systems and algorithms to group nodes into intersecting sets referred to as quorum sets. We show efficiency and distributed control can also be accomplished in optical network routing by applying the same established quorum set theory.Cycle-based optical network routing, whether using SONET rings or p-cycles, provides the sufficient reliability in the network. Light-trails forming a cycle allow broadcasts within a cycle to be used for efficient multicasts. Cyclic quorum sets also have all pairs of nodes occurring in one or more quorums, so efficient, arbitrary unicast communication can occur between any two nodes. Efficient broadcasts to all network nodes are possible by a node broadcasting to all quorum cycles to which it belongs (O( √ N )). In this paper, we propose applying the distributed efficiency of the quorum sets to routing optical cycles based on light-trails. With this new method of topology construction, unicast and multicast communication requests do not need to be known or even modeled a priori. Additionally, in the presence of network link faults, greater than 99% average coverage enables the continued operation of nearly all arbitrary unicast and multicast requests in the network. Finally, to further improve the fault coverage, an augmentation to the ECBRA cycle finding algorithm is proposed.

show abstract

Optical paths supporting quorums for efficient communication

Somani

Lastine

2014

2014 13th International Conference on Optical Communications and Networks (ICOCN)

View full text Add to dashboard Cite

Finding Complex Cycles through a Set of Nodes

Cited by 9 publications

References 3 publications

Unidirectional Quorum-Based Cycle Planning for Efficient Resource Utilization and Fault-Tolerance

Unidirectional Quorum-Based Cycle Planning for Efficient Resource Utilization and Fault-Tolerance

Optical quorum cycles for efficient communication

Optical paths supporting quorums for efficient communication

Contact Info

Product

Resources

About