Power Communication Optical Network Traffic Grooming Algorithm Based on Differentiated Services
- DOI
- 10.2991/cnct-16.2017.7How to use a DOI?
- Keywords
- Power Communication Optical Network, Differentiated Services, Traffic Grooming.
- Abstract
With the development of smart grid, the data service of large particle and IP in power communication network has been increasing, which has put forward a great challenge to the existing power communication optical network based on MSTP (Multi-Service Transfer Platform) technology and WDM (Wavelength Division Multiplexing) technology. Considering the difference of services in the power communication optical network, this paper proposed a traffic grooming algorithm based on differentiated services. The algorithm is based on the layered exchange virtual topology model, and dynamically updates the link cost according to the current available resources of the network. According to the level of groomed service, we use the K shortest path algorithm based on the O/E/O (Optical/Electrical/Optical) conversion limit to determine the alternative path set and select optimization factors through the traffic grooming path. Under the condition of satisfying the O/E/O conversion restrictions, guide the service to the path which meets its transmission delay requirements and has smaller number of O/E/O transitions, coordinate the distribution of network resources among different levels of service.
- Copyright
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Zhong-miao KANG AU - Xi-jie DONG AU - Hui-tong LIU AU - Liang-rui TANG PY - 2016/12 DA - 2016/12 TI - Power Communication Optical Network Traffic Grooming Algorithm Based on Differentiated Services BT - Proceedings of the International Conference on Computer Networks and Communication Technology (CNCT 2016) PB - Atlantis Press SP - 47 EP - 55 SN - 2352-538X UR - https://doi.org/10.2991/cnct-16.2017.7 DO - 10.2991/cnct-16.2017.7 ID - KANG2016/12 ER -