Optical Communication Technology, Volume. 47, Issue 7, 41(2021)

Resource allocation algorithm based on graph coloring theory in elastic optical network

WU Runze... QIN Yuhao and FAN Bing |Show fewer author(s)
Author Affiliations
  • [in Chinese]
  • show less

    The traditional WDM network uses fixed grid, which can not meet the network requirements. An improved graph coloring based routing spectrum allocation(GT-RSA) algorithm is proposed. Firstly, the first k shortest path algorithm is used to determine the candidate route set, and the candidate route graph is established according to each candidate route set. Then, the mixed integer linear programming model of graph coloring theory is used to select the route, and the optimal solution is obtained according to the maximum saturation priority algorithm of branch boundary. At the same time, the coloring partition allocation of spectrum is completed. Finally, partition first-last-fit(PAR-FLF) algorithm is used to allocate spectrum resources. The simulation results show that GT-RSA algorithm has lower spectrum resource consumption, lower blocking rate and higher average link continuity rate.

    Tools

    Get Citation

    Copy Citation Text

    WU Runze, QIN Yuhao, FAN Bing. Resource allocation algorithm based on graph coloring theory in elastic optical network[J]. Optical Communication Technology, 2021, 47(7): 41

    Download Citation

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

    Category:

    Received: Nov. 11, 2020

    Accepted: --

    Published Online: Sep. 2, 2021

    The Author Email:

    DOI:10.13921/j.cnki.issn1002-5561.2021.07.010

    Topics