About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
Communications and Networking. 16th EAI International Conference, ChinaCom 2021, Virtual Event, November 21-22, 2021, Proceedings

Research Article

Routing and Resource Allocation for Service Function Chain in Service-Oriented Network

Download(Requires a free EAI acccount)
5 downloads
Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1007/978-3-030-99200-2_35,
        author={Ziyu Liu and Zeming Li and Chengchao Liang and Zhanjun Liu},
        title={Routing and Resource Allocation for Service Function Chain in Service-Oriented Network},
        proceedings={Communications and Networking. 16th EAI International Conference, ChinaCom 2021, Virtual Event, November 21-22, 2021, Proceedings},
        proceedings_a={CHINACOM},
        year={2022},
        month={4},
        keywords={Service function chain In-network computing Resource allocation Traffic engineering},
        doi={10.1007/978-3-030-99200-2_35}
    }
    
  • Ziyu Liu
    Zeming Li
    Chengchao Liang
    Zhanjun Liu
    Year: 2022
    Routing and Resource Allocation for Service Function Chain in Service-Oriented Network
    CHINACOM
    Springer
    DOI: 10.1007/978-3-030-99200-2_35
Ziyu Liu1,*, Zeming Li1, Chengchao Liang1, Zhanjun Liu1
  • 1: School of Communication and Information Engineering
*Contact email: s190101097@stu.cqupt.edu.cn

Abstract

Service function chain (SFC) and in-network computing have become popular service provision approaches in 5G and next-generation communication networks. Since different service functions may change the volume of processed traffic in different ways, inappropriate resource allocation will lead to resource wastage and congestion. In this paper, we study the traffic change effects of service nodes with in-network computing and propose a software defined network based SFC routing and resource allocation scheme. With the objective of minimizing the difference between the service delay of adjacent function pairs in SFC and the corresponding expected delay, an optimization problem is established. Due to the coupling of computing resource provision and traffic engineering, and the non-convexity of the objective function and constraints, the problem becomes difficult to solve in practice. Therefore, we first transform the problem into a convex optimization problem using linear relaxation and variable substitution. Using the dual decomposition method, we decouple the different sets of variables. With this decoupling, the network controller can efficiently design the users’ service nodes and traffic engineering. Finally, we use a rounding method to obtain a feasible solution set of the problem performed by the service nodes. Extensive simulations are performed under different system settings to verify the effectiveness of the scheme.

Keywords
Service function chain In-network computing Resource allocation Traffic engineering
Published
2022-04-05
Appears in
SpringerLink
http://dx.doi.org/10.1007/978-3-030-99200-2_35
Copyright © 2021–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL