IEICE TRANSACTIONS on Communications
Incentive-Stable Matching Protocol for Service Chain Placement in Multi-Operator Edge System
Summary :
Network Function Virtualization (NFV) enables the embedding of Virtualized Network Function (VNF) into commodity servers. A sequence of VNFs can be chained in a particular order to form a service chain (SC). This paper considers placing multiple SCs in a geo-distributed edge system owned by multiple service providers (SPs). For a pair of SC and SP, minimizing the placement cost while meeting a latency constraint is formulated as an integer programming problem. As SC clients and SPs are self-interested, we study the matching between SCs and SPs that respects individual's interests yet maximizes social welfare. The proposed matching approach excludes any blocking individual and block pair which may jeopardize the stability of the result. Simulation results show that the proposed approach performs well in terms of social welfare but is suboptimal concerning the number of placed SCs.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E105-B No.11 pp.1353-1360
- Publication Date
- 2022/11/01
- Publicized
- 2022/05/27
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2021TMT0001
- Type of Manuscript
- Special Section PAPER (Special Section on Towards Management for Future Communications and Services in Conjunction with Main Topics of APNOMS2021)
- Category
Authors
Jen-Yu WANG
National Yang Ming Chiao Tung University
Li-Hsing YEN
National Yang Ming Chiao Tung University
Juliana LIMAN
National Yang Ming Chiao Tung University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jen-Yu WANG, Li-Hsing YEN, Juliana LIMAN, "Incentive-Stable Matching Protocol for Service Chain Placement in Multi-Operator Edge System" in IEICE TRANSACTIONS on Communications,
vol. E105-B, no. 11, pp. 1353-1360, November 2022, doi: 10.1587/transcom.2021TMT0001.
Abstract: Network Function Virtualization (NFV) enables the embedding of Virtualized Network Function (VNF) into commodity servers. A sequence of VNFs can be chained in a particular order to form a service chain (SC). This paper considers placing multiple SCs in a geo-distributed edge system owned by multiple service providers (SPs). For a pair of SC and SP, minimizing the placement cost while meeting a latency constraint is formulated as an integer programming problem. As SC clients and SPs are self-interested, we study the matching between SCs and SPs that respects individual's interests yet maximizes social welfare. The proposed matching approach excludes any blocking individual and block pair which may jeopardize the stability of the result. Simulation results show that the proposed approach performs well in terms of social welfare but is suboptimal concerning the number of placed SCs.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2021TMT0001/_p
Copy
@ARTICLE{e105-b_11_1353,
author={Jen-Yu WANG, Li-Hsing YEN, Juliana LIMAN, },
journal={IEICE TRANSACTIONS on Communications},
title={Incentive-Stable Matching Protocol for Service Chain Placement in Multi-Operator Edge System},
year={2022},
volume={E105-B},
number={11},
pages={1353-1360},
abstract={Network Function Virtualization (NFV) enables the embedding of Virtualized Network Function (VNF) into commodity servers. A sequence of VNFs can be chained in a particular order to form a service chain (SC). This paper considers placing multiple SCs in a geo-distributed edge system owned by multiple service providers (SPs). For a pair of SC and SP, minimizing the placement cost while meeting a latency constraint is formulated as an integer programming problem. As SC clients and SPs are self-interested, we study the matching between SCs and SPs that respects individual's interests yet maximizes social welfare. The proposed matching approach excludes any blocking individual and block pair which may jeopardize the stability of the result. Simulation results show that the proposed approach performs well in terms of social welfare but is suboptimal concerning the number of placed SCs.},
keywords={},
doi={10.1587/transcom.2021TMT0001},
ISSN={1745-1345},
month={November},}
Copy
TY - JOUR
TI - Incentive-Stable Matching Protocol for Service Chain Placement in Multi-Operator Edge System
T2 - IEICE TRANSACTIONS on Communications
SP - 1353
EP - 1360
AU - Jen-Yu WANG
AU - Li-Hsing YEN
AU - Juliana LIMAN
PY - 2022
DO - 10.1587/transcom.2021TMT0001
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E105-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2022
AB - Network Function Virtualization (NFV) enables the embedding of Virtualized Network Function (VNF) into commodity servers. A sequence of VNFs can be chained in a particular order to form a service chain (SC). This paper considers placing multiple SCs in a geo-distributed edge system owned by multiple service providers (SPs). For a pair of SC and SP, minimizing the placement cost while meeting a latency constraint is formulated as an integer programming problem. As SC clients and SPs are self-interested, we study the matching between SCs and SPs that respects individual's interests yet maximizes social welfare. The proposed matching approach excludes any blocking individual and block pair which may jeopardize the stability of the result. Simulation results show that the proposed approach performs well in terms of social welfare but is suboptimal concerning the number of placed SCs.
ER -
English
