Global bandwidth scheduling algorithm for complex IP over OTN network

Panke Qin, Jiawei Wang, Jingru Wu and Shangya Han

Physica A: Statistical Mechanics and its Applications, 2020, vol. 540, issue C

Abstract: This paper presents a global paths planning in IP over OTN uniform control inter-datacenter network and designs algorithm based on fairness, in order to due with big traffic flow paths planning problem. By this algorithm, apps are allocated bandwidth in a fair way on the premise of trying to meet the bandwidth demand. Simulation results reveal that, compared with algorithm based on priority, global paths planning improves fairness by up to 0.2 on premise of not reducing satisfaction degree. Compared with algorithm in IP controlled network, number of router ports is saved by up to more than 65% in IP over OTN uniform controlled network.

Keywords: IP over OTN; Global path planning; Fairness (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437119317510
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:540:y:2020:i:c:s0378437119317510

DOI: 10.1016/j.physa.2019.123104

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().