Bifurcation Multi-Path Grooming Algorithm in Multi-Granularity Transport Network

Authors

Guangwei Lei, 1. School of Computer Science and Engineering, Northeastern University, Shenyang 110819, China;;
Xingwei Wang, 1. School of Computer Science and Engineering, Northeastern University, Shenyang 110819, China;;2. College of Software, Northeastern University, Shenyang 110819, China;;
Huang Min, 3. School of Information Science and Engineering, Northeastern University, Shenyang 110819, China;;
Zhao Yue, 4. Information Center, Liaoning University, Shenyang 110036, China;

Abstract

Abstract: Recent years, with the rapid development and wide use of multi-granularity transport network, the pressure of backbone transmission network has been alleviated to some extent. However, the growing user demands to the Internet make network power consumption and bandwidth still face severe challenge. To deal with it, a bifurcation multi-path grooming algorithm was proposed and its associated bandwidth allocation strategy was devised to reduce power consumption and blocking rate. The proposed algorithm has been implemented by simulation and the evaluation results show that its performance is better than that of the benchmark.

Recommended Citation

Lei, Guangwei; Wang, Xingwei; Min, Huang; and Yue, Zhao (2020) "Bifurcation Multi-Path Grooming Algorithm in Multi-Granularity Transport Network," Journal of System Simulation: Vol. 28: Iss. 3, Article 33.
Available at: https://dc-china-simulation.researchcommons.org/journal/vol28/iss3/33

First Page

749

Revised Date

2014-10-24

DOI Link

https://doi.org/

Last Page

755

CLC

TP393

Recommended Citation

Lei Guangwei, Wang Xingwei, Huang Min, Zhao Yue. Bifurcation Multi-Path Grooming Algorithm in Multi-Granularity Transport Network[J]. Journal of System Simulation, 2016, 28(3): 749-755.