Share Email Print
cover

Proceedings Paper • new

Geography-based Service Function Path (SFP) provisioning in inter-datacenter elastic optical networks
Author(s): Boyuan Yan; Yongli Zhao; Ying Wang; Xiaosong Yu; Wei Wang; Jie Zhang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Inside a service function chain (SFC), traffic flow follows a certain route, namely a service function path (SFP), to travel through each service function (SF) entity. A SFP consists of several end-to-end segments, whose source and destination are named anchor node (AN). SFs are located in multiple datacenters (DCs), and inter-DC light-paths need to be provisioned between separated SFs. In this paper, we introduce geography information of optical nodes and DCs, define special geographic distance between ANs in inter-DC elastic optical networks (EONs). Then following minimal geographic distance principle, we propose a geography-based SFP provisioning solution, which contains two heuristic algorithms, named geography-based shortest path and first-fit algorithm (GSP-FF) and geography-based k-shortest paths and first-fit algorithm (GK-FF). These algorithms can compress AN selection procedure extremely in fixed time, which cost little time for the AN selection of resource allocation. And benchmark algorithm use Dijkstra shortest path calculation and first-fit FS selection to allocate IT resources in DCs and FS resources in EONs. Then GSP-FF and GKFF are proposed to provision SFPs efficiently. In our simulation, we compare our proposed algorithms with benchmark algorithm deeply on blocking probability, running time, average hops, average geographic distance, et al. under different traffic load and other simulation environment. We also analyze the trend and reason for the performance difference among these algorithms. According detailed evaluation, simulation proves that the proposed algorithms in this paper could use geographic information efficiently, and achieve lower blocking probability with lower running time compared with the benchmark algorithm.

Paper Details

Date Published: 12 December 2018
PDF: 5 pages
Proc. SPIE 10849, Fiber Optic Sensing and Optical Communication, 108490X (12 December 2018); doi: 10.1117/12.2505463
Show Author Affiliations
Boyuan Yan, Beijing Univ. of Posts and Telecommunications (China)
Yongli Zhao, Beijing Univ. of Posts and Telecommunications (China)
Ying Wang, State Grid Information and Telecommunication Branch (China)
Xiaosong Yu, Beijing Univ. of Posts and Telecommunications (China)
Wei Wang, Beijing Univ. of Posts and Telecommunications (China)
Jie Zhang, Beijing Univ. of Posts and Telecommunications (China)


Published in SPIE Proceedings Vol. 10849:
Fiber Optic Sensing and Optical Communication
Jie Zhang; Songnian Fu; Qunbi Zhuge; Ming Tang; Tuan Guo, Editor(s)

© SPIE. Terms of Use
Back to Top