Laser & Optoelectronics Progress, Volume. 62, Issue 5, 0506007(2025)

Enhancing Virtual Multicast Blocking Performance in Light-Trail Network through Adaptive Modulation and Partial Path Sharing Technique

Anliang Cai*, Peng Han, and Haoyang Zhang
Author Affiliations
  • School of Communications and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210009, Jiangsu , China
  • show less
    Figures & Tables(11)
    Schematic diagram of flexible sharing for light-trails
    Example of two light-trails
    Auxiliary graph of virtual multicast with source node mapped to node C
    Auxiliary graph of virtual multicast with source node mapped to node B
    Request blocking performance of the NSFNET network for different algorithms
    Request blocking performance of the USNET network for different algorithms
    Number of sub-light-trail used in the NSFNET network
    Number of sub-light-trail with improved modulation efficiency in the NSFNET network
    • Table 0. [in Chinese]

      View table

      Table 0. [in Chinese]

      Algorithm 1 VMG_FLTS

      Input

      A virtual multicast request r=s,D,b and the related mapping options, sS and dDddD, and a set of light-trails T=T1,T2,,Tm.

      Output

      The accommodation or blocking of r.

      1

      For each node i in S do.

      2

        Find for each node j in i=1nDi a light-trail Tx whose sub-light-trail from i to j can provide a data rate of b. // Light-trail sharing methods differ here.

      3

        Create for each of the found light-trails auxiliary nodes corresponding to nodes i and d' in i=1nDi along the trail before the case that the sub-light-trail from i to d' cannot achieve a data rate of b. // Light-trail sharing methods differ here.

      4

        Sequentially connect node i, the auxiliary node created for the light-trail, the auxiliary nodes corresponding to node i and to those in i=1nDi and connect each of the latter auxiliary destination nodes, the physical destination, and the virtual destination.

      5

        Set the cost of the links.

      6

        Run a modified algorithm of the minimum-cost path heuristic (MPH) to obtain a multicast tree, where each time a path is found, replace the previously found path if the auxiliary destinations are covered by the new light-trail/sub-light-trail.

      7

      end for

      8

      Block the request if no tree is found; otherwise, accommodate the request by the multicast tree with the least links and update the resource usage of the light-trails.

    • Table 1. Simulation parameters

      View table

      Table 1. Simulation parameters

      ParameterValue
      Maximum transmission distance /kmBPSK4000
      QPSK2000
      8QAM1000
      16QAM500
      32QAM250
      64QAM125
      Light-trail capacity /unit100
      Data rate /unit1,100]
      Destination count5
      Number of physical nodes for virtual node mapping3
      Simulation length100000
    • Table 2. Increase ratio of traffic load capacity for different algorithms with different number of physical nodes for virtual node mapping in the NSFNET network

      View table

      Table 2. Increase ratio of traffic load capacity for different algorithms with different number of physical nodes for virtual node mapping in the NSFNET network

      Number of physical nodeImprovement of VMG_ANS_AM over VMG_ANS_FMImprovement of VMG_ANS_AM over VMG_FTS
      1<167
      21262
      32245
      42839
    Tools

    Get Citation

    Copy Citation Text

    Anliang Cai, Peng Han, Haoyang Zhang. Enhancing Virtual Multicast Blocking Performance in Light-Trail Network through Adaptive Modulation and Partial Path Sharing Technique[J]. Laser & Optoelectronics Progress, 2025, 62(5): 0506007

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category: Fiber Optics and Optical Communications

    Received: Jun. 3, 2024

    Accepted: Aug. 26, 2024

    Published Online: Feb. 20, 2025

    The Author Email:

    DOI:10.3788/LOP241408

    CSTR:32186.14.LOP241408

    Topics