skip to main content
10.1145/3375998.3376035acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicnccConference Proceedingsconference-collections
research-article

A P-Cycle Protection Algorithm Based on Capacity Balance for Power Optical Communication Multicast Service

Authors Info & Claims
Published:28 January 2020Publication History

ABSTRACT

Aiming at the protection problem of single link/node in the existing power optical communication network multicast service, a p-cycle protection algorithm is proposed. The protection algorithm firstly uses the optimized prim algorithm to generate a multicast tree, and then generates a p-cycle to protect the entire multicast tree through a heuristic shortest P-cycle construction algorithm, and uses a capacity balancing mechanism in the simulation of the protection algorithm to reduce the blocking rate. The simulation results show that the proposed algorithm's resource redundancy and network blocking rate is lower than the existing Hamiltonian ring protection algorithm. It has practical significance for improving the survivability and stability of optical communication networks.

References

  1. Qi bing, liu Lin, li bin, sun yi, zhu chaoyang, xue jinsong. Protection optimization of power communication backbone network based on equipotential p-loop. Chinese journal of electrical engineering: 1-9[2019-06-24].Google ScholarGoogle Scholar
  2. Qi hongpeng, wu runze, tang liangrui. Survivability routing algorithm based on DiR protection loop in new generation power ICT network. Power system protection and control, 2011, 39(16):25--29.Google ScholarGoogle Scholar
  3. Brigitte Jaumard, Hai Anh Hoang, Do Trung Kien. Robust FIPP p -cycles against dual link failures. Telecommunication Systems, 2014, 56(1).Google ScholarGoogle Scholar
  4. Kiaei MS, Assi C, Jaumard B. A survey on the p-cycle protection method. IEEE Commun Surv Tut 2009;11(3):53--70.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Wu R, Hu X, Li B. A link failure protection algorithm applying to power automatic switched optical network based on p-cycle with completely separated SRLG. Power Syst Prot Control 2013;5:119--25.Google ScholarGoogle Scholar
  6. Li B, Yang J, Qi B. Application of p-cycle protection for the substation communication network under SRLG constraints. IEEE Trans Power Del 2014;29(6):2510--8.Google ScholarGoogle Scholar
  7. Li B, Qi B, Sun Y, et al. Applications of forecasting based dynamic p-cycle reconfiguration under reliable optical network in smart grid. Comput Commun 2014;49(8):48--59.Google ScholarGoogle Scholar
  8. Yu qing, ge ning, dong zhiwang. Link-based dynamic multicast Shared protection algorithm in WDM optical network. Acta electronica sinica, 2007(01):73--77.Google ScholarGoogle Scholar
  9. W.D. Grover, D. Stamatelakis. Cycle-Oriented Distributed Preconfiguration: Ring-like Speed with Mesh-like Capacity for Self-planning Network Restoration.IEEE ICC, 1998(1): 537--543Google ScholarGoogle Scholar
  10. R.C. Prim. Shortest connection networks and some generalizations. Bell Labs Tech J 1957;36(6):1389--401.Google ScholarGoogle Scholar
  11. Pradhan AK, Ghose S, De T. Multicast protection and grooming scheme in survivable WDM optical networks. Opt Swit Netw 2016;19:42--57.Google ScholarGoogle Scholar
  12. Zhang F, Zhong WD. Performance evaluation of optical multicast protection approaches for combined node and link failure recovery. J Lightw Technol 2009;27(18):4017--25.Google ScholarGoogle Scholar
  13. Wang X, Guo L, Cao J, et al. Multicast protection scheme based on Hamiltonian cycle in fault-tolerant optical mesh networks. Opti Fiber Technol 2010;16(5):292--8.Google ScholarGoogle Scholar

Index Terms

  1. A P-Cycle Protection Algorithm Based on Capacity Balance for Power Optical Communication Multicast Service

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      ICNCC '19: Proceedings of the 2019 8th International Conference on Networks, Communication and Computing
      December 2019
      263 pages
      ISBN:9781450377027
      DOI:10.1145/3375998

      Copyright © 2019 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 28 January 2020

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited
    • Article Metrics

      • Downloads (Last 12 months)2
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader