Skip to main content
SpringerLink
Log in

Optical quorum cycles for efficient communication

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

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(\sqrt{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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Lastine, D., Sankaran, S., Somani, A.K.: A fault-tolerant multipoint cycle routing algorithm (mcra), In: Tomkos, I., Bouras, C.J., Ellinas, G., Demestichas, P., Sinha,P. (eds.) Broadband Communications, Networks, and Systems, pp. 341–360. Springer, Berlin, Heidelberg (2012)

  2. Grover W.D., Shen, G.: Extending the p-cycle concept to path-segment protection. In: Communications, 2003 ICC’03 IEEE International Conference on IEEE, vol. 2, pp. 1314–1319, (2003)

  3. Somani, A.K., Lastine, D.: Optical paths supporting quorums for efficient communication. In: Optical Communications and Networks (ICOCN) 2014 13th International Conference on IEEE (2014)

  4. Gumaste, A., Chlamtac, I.: Light-trails: a novel conceptual framework for conducting optical communications. In: High Performance Switching and Routing 2003 HPSR Workshop on IEEE pp. 251–256, (2003)

  5. Chlamtac, I., Gumaste, A.: Light-trails: A solution to ip centric communication in the optical domain. In: Marsan, M.A., Corazza, G., Listanti, M., Roveri, A. (eds.) Quality of Service in Multiservice IP Networks, pp. 634–644. Springer, Berlin, Heidelberg (2003)

  6. Fang, J., He, W., Somani, A.K.: Optimal light trail design in wdm optical networks. In: Communications, 2004 IEEE International Conference on IEEE vol. 3, pp. 1699–1703, (2004)

  7. Li, Y., Wang, J., Gumaste, A., Xu, Y., Xu, Y.: Multicast routing in light-trail wdm networks. In: Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008, pp. 1–5, (2008)

  8. Zhang, W., Kandah, F., Wang, C., Li, H.: Dynamic light trail routing in wdm optical networks. Photon. Netw. Commun. 21(1), 78–89 (2011)

    Article  Google Scholar 

  9. Somani, A., Lastine, D., Sankaran, S.: Finding complex cycles through a set of nodes. In: Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE, pp. 1–5, (2011)

  10. Ji, P.N., Aono, Y.: Colorless and directionless multi-degree reconfigurable optical add/drop multiplexers. In: Wireless and Optical Communications Conference (WOCC), 2010 19th Annual. IEEE, pp. 1–5, (2010)

  11. Agrawal, G.P.: Nonlinear Fiber Optics. Academic press, Newyork (2007)

    MATH  Google Scholar 

  12. Zhang, F., Zhong, W.-D.: Performance evaluation of p-cycle based protection methods for provisioning of dynamic multicast sessions in mesh wdm networks. Photon. Netw. Commun. 16(2), 127–138 (2008)

    Article  Google Scholar 

  13. Zhang, F., Zhong, W.-D., Jin, Y.: Optimizations of p-cycle-based protection of optical multicast sessions. Lightwave Technol. J. 26(19), 3298–3306 (2008)

    Article  Google Scholar 

  14. Ramamurthy, S., Sahasrabuddhe, L., Mukherjee, B.: Survivable wdm mesh networks. J. Lightwave Technol. 21(4), 870 (2003)

    Article  Google Scholar 

  15. Singhal, N.K., Sahasrabuddhe, L.H., Mukherjee, B.: Provisioning of survivable multicast sessions against single link failures in optical wdm mesh networks. J. Lightwave Technol. 21(11), 2587 (2003)

    Article  Google Scholar 

  16. Qing, Y., Ning, G.: Protecting dynamic multicast sessions in optical wdm mesh networks. In: Information, Communications and Signal Processing, 2005 Fifth International Conference on IEEE, pp. 1187–1190, (2005)

  17. Luo, H., Yu, H., Li, L., Wang, S.: On protecting dynamic multicast sessions in survivable mesh wdm networks. In: Communications, 2006. ICC’06. IEEE International Conference on IEEE, vol. 2, pp. 835–840 (2006)

  18. Zhang, F., Zhong, W.-D.: Applying p-cycles in dynamic provisioning of survivable multicast sessions in optical wdm networks. In: Optical Fiber Communication Conference. Optical Society of America, p. JWA74, (2007)

  19. Feng, T., Ruan, L., Zhang, W.: Intelligent p-cycle protection for multicast sessions in wdm networks. In Communications, 2008. ICC’08 IEEE International Conference on IEEE, pp. 5165–5169, (2008)

  20. Khalil, A., Hadjiantonis, A., Ellinas, G., Ali, M.: Pre-planned multicast protection approaches in wdm mesh networks. In: Optical Communication, 2005. ECOC 2005. 31st European Conference on IET, pp. 25–26, (2005)

  21. Maekawa, M.: An algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3(2), 145–159 (1985)

    Article  Google Scholar 

  22. Luk, W.-S., Wong, T.-T.: Two new quorum based algorithms for distributed mutual exclusion. In: Distributed Computing Systems, 1997, Proceedings of the 17th International Conference on IEEE, pp. 100–106, (1997)

  23. Lastine, D.: Efficient communication using multiple cycles and multiple channels. Ph.D. dissertation, Iowa State University (2014)

  24. Tang, L., Huang, W., Razo, M., Sivasankaran, A., Tacca, M., Fumagalli, A., Multicast tree computation in networks with multicast incapable nodes. In: High Performance Switching and Routing (HPSR), 2011 IEEE 12th International Conference on IEEE, pp. 95–100, (2011)

Download references

Acknowledgments

The authors would like to acknowledge and thank Dr. David Lastine for his thoughtful discussion and his contributions and results presented in a conference paper [3] that are adapted in our presentation in Sects. 5.2.1, 5.2.2, 6, and 7.

Author information

Authors and Affiliations

  1. Iowa State University, Ames, IA, 50011, USA

    Cory J. Kleinheksel & Arun K. Somani

Authors
  1. Cory J. Kleinheksel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arun K. Somani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cory J. Kleinheksel.

Additional information

Research funded in part by NSF Graduate Research Fellowship Program, IBM Ph.D. Fellowship Program, Symbi GK-12 Fellowship at Iowa State University, and the Jerry R. Junkins Endowment at Iowa State University. The research reported in this paper is partially supported by the HPC@ISU equipment at Iowa State University, some of which has been purchased through funding provided by NSF under MRI Grant number CNS 1229081 and CRI Grant number 1205413. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the funding agencies.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kleinheksel, C.J., Somani, A.K. Optical quorum cycles for efficient communication. Photon Netw Commun 31, 196–205 (2016). https://doi.org/10.1007/s11107-015-0561-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-015-0561-8

Keywords

Search

Navigation