Service function chain deployment algorithm based on optimal weighted graph matching
Service function chain can support flexible network service requirement by linking virtual network functions.Aiming at the problem of service function chain deployment in a resource-constrained network,an algorithm for service function chain deployment based on optimal weighted graph matching was pr...
Saved in:
Main Authors: | Dan LI, Julong LAN, Peng WANG, Yuxiang HU |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2019-03-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2019059/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Some general classes of comatching graphs
by: E. J. Farrell, et al.
Published: (1987-01-01) -
The matching polynomial of a distance-regular graph
by: Robert A. Beezer, et al.
Published: (2000-01-01) -
A Deployment Method of Middlebox Service Chain Based on Multi-Flow Table
by: Shiran Liu, et al.
Published: (2015-08-01) -
An interactive address matching method based on a graph attention mechanism
by: Ming Li, et al.
Published: (2025-12-01) -
Edge-level multi-constranint graph pattern matching with lung cancer knowledge graph
by: Houdie Tu, et al.
Published: (2025-02-01)