Geography-based Service Function Path (SFP) provisioning in inter-datacenter elastic optical networks

Boyuan Yan; Yongli Zhao; Ying Wang; Xiaosong Yu; Wei Wang; Jie Zhang

doi:10.1117/12.2505463

12 December 2018 Geography-based Service Function Path (SFP) provisioning in inter-datacenter elastic optical networks

Boyuan Yan, Yongli Zhao, Ying Wang, Xiaosong Yu, Wei Wang, Jie Zhang

Proceedings Volume 10849, Fiber Optic Sensing and Optical Communication; 108490X (2018) https://doi.org/10.1117/12.2505463
Event: International Symposium on Optoelectronic Technology and Application 2018, 2018, Beijing, China

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.

Citation Download Citation

Boyuan Yan, Yongli Zhao, Ying Wang, Xiaosong Yu, Wei Wang, and Jie Zhang "Geography-based Service Function Path (SFP) provisioning in inter-datacenter elastic optical networks", Proc. SPIE 10849, Fiber Optic Sensing and Optical Communication, 108490X (12 December 2018); https://doi.org/10.1117/12.2505463

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
5 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Optical networks

Information technology

Computer simulations

Gadolinium

Geography

Associative arrays

Optical communications

Show All Keywords

Keywords/Phrases

Search In:

Publication Years