Dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network

  • PDF / 2,093,557 Bytes
  • 7 Pages / 595.22 x 842 pts (A4) Page_size
  • 18 Downloads / 184 Views

DOWNLOAD

REPORT


Vol.16 No.6, 1 November 2020

Dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network* WU Qi-wu (吴启武)1**, CHEN Hao (陈浩)2, JIANG Ling-zhi (姜灵芝)2, and ZHOU Yang (周阳)2 1. College of Equipment Management and Support, Engineering University of PAP, Xi’an 710086, China1 2. College of Information Engineering, Engineering University of PAP, Xi’an 710086, China2 (Received 13 January 2020; Revised 28 February 2020) ©Tianjin University of Technology and Springer-Verlag GmbH Germany, part of Springer Nature 2020 Aiming at the problem of dynamic multicast service protection in multi-domain optical network, this paper proposes a dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network. The algorithm uses the minimum cost spanning tree strategy and fuzzy game theory. First, it virtualizes two planes to calculate the multicast tree and the multicast protection tree respectively. Then, it performs a fuzzy game to form a cooperative alliance to optimize the path composition of each multicast tree. Finally, it generates a pair of optimal multicast work tree and multicast protection tree for dynamic multicast services. The time complexity of the algorithm is O(k3m2n), where n represents the number of nodes in the networks, k represents the number of dynamic multicast requests, and m represents the number of destination nodes for each multicast request. The experimental results show that the proposed algorithm reduces significantly the blocking rate of dynamic multicast services, and improves the utilization of optical network resources within a certain number of dynamic multicast request ranges. Document code: A Article ID: 1673-1905(2020)06-0455-7 DOI https://doi.org/10.1007/s11801-020-0006-1

Large-capacity and long-distance transmission has always been a basic development direction of optical communication. As an important branch, multicast communication is developing towards the trend of multi-operator intelligence[1]. The survivability requirements of multicast communication are getting more and more attention. Hence, how to implement dynamic multicast service protection becomes a challenge[2,3]. For the dynamic multicast service based on multi-domain optical network, random multicast requests are real-time and have certain requirements on protection capabilities during the duration of the request. Usually, the protection configuration is requested one by one[4]. The network sharing protection mechanism refers to a protection mechanism, which configures one or more backup paths for multi-service paths on an optical network. When a certain service path fails, the protection path can be started, which greatly improves the utilization of network resources compared to the dedicated protection mechanism[5]. Aiming at the problem of single-domain multicast sharing protection, Ref.[6] proposed a level protection (LP) algorithm based on segment protection. This algorithm combines the structure of a multicast tree to apply the concept of ‘layer’ to segmen