z-logo
open-access-imgOpen Access
The Stochastic-Learning-Based Deployment Scheme for Service Function Chain in Access Network
Author(s) -
Youchao Yang,
Qianbin Chen,
Guofan Zhao,
Peipei Zhao,
Lun Tang
Publication year - 2018
Publication title -
ieee access
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.587
H-Index - 127
ISSN - 2169-3536
DOI - 10.1109/access.2018.2870129
Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation
The research on topology-aware deployment for service function chain (SFC) is very important to a network slice technique. Nevertheless, most of the existing schemes on topology-aware deployment assume that the network topology information (NTI) is completely observed, which is unrealistic, considering the topology observation errors in practical network environment. In this paper, we consider the SFC deployment based on realistic topology sensing in fifth-generation cloud-radio access network (C-RAN). Due to the unavoidable errors, the realistic topology observation results merely represent partial NTI. Therefore, the partial observation Markov decision process (POMDP) is used in this paper to estimate the whole real topology condition. Then, a POMDP-based SFC deployment scheme is proposed. In this scheme, considering the particularity of SFC deployment in C-RAN, the SFC deployment problem is defined as a series of deployment decisions, including repair decisions, selection decisions, and resource allocation decisions. Our objective is to maximize the utility associated with the total delay and server-repair cost. And the POMDP scheme, according to the queue state information and partially observable NTI, makes deployment policies to maximize the utility by Bellman iteration. To reduce the iteration complexity, a point-based mingled heuristic value iteration algorithm is formulated in this paper. The simulation results show that the performance of C-RAN in terms of the system total delay and throughput can be significantly improved by using the proposed POMDP scheme.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom