2018
DOI: 10.1109/tnet.2018.2842798
|View full text |Cite
|
Sign up to set email alerts
|

Deploying Chains of Virtual Network Functions: On the Relation Between Link and Server Usage

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
69
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 172 publications
(69 citation statements)
references
References 40 publications
0
69
0
Order By: Relevance
“…Furthermore, the constraints considered in [18] force the DAG tasks to be only mapped into the leaves of the tree-shaped graph of the underlying data center. The contributions in [19] and [20] focus on the (quite recent) problem of the embedding of the service chains. Triggered by the emerging trend of Network Function Virtualization (NFV), the common goal of these contributions is to map a linear application DAG (i.e., a DAG with chain topology) onto the physical path joining fixed source and sink computing nodes, so that a sequential chain of operations may be performed on the data packets moving from the source node to the destination one.…”
Section: Related Workmentioning
confidence: 99%
“…Furthermore, the constraints considered in [18] force the DAG tasks to be only mapped into the leaves of the tree-shaped graph of the underlying data center. The contributions in [19] and [20] focus on the (quite recent) problem of the embedding of the service chains. Triggered by the emerging trend of Network Function Virtualization (NFV), the common goal of these contributions is to map a linear application DAG (i.e., a DAG with chain topology) onto the physical path joining fixed source and sink computing nodes, so that a sequential chain of operations may be performed on the data packets moving from the source node to the destination one.…”
Section: Related Workmentioning
confidence: 99%
“…Many works, including [12]- [16], tackle the problems of VNF placement and routing from a network-centric viewpoint, i.e., they aim at minimizing the load of network resources. In particular, [12] seeks to balance the load on links and servers, while [13] studies how to optimize routing to minimize network utilization. The above approaches formulate mixed-integer linear programming (MILP) problems and propose heuristic strategies to solve them.…”
Section: Related Workmentioning
confidence: 99%
“…(13) The intuition behind constraints (11)- (13) is that Φ(h, l, q, r) mimics the behavior of the productÃ(h, q)Ã(l, r): if ei-therÃ(h, q) orÃ(l, r) are close to 0, then (11) and (12) guarantee that Φ(h, l, q, r) will also be close to zero; if both values are close to one, then (13) allows also Φ(h, l, q, r) to be close to one.…”
Section: Steps 1-2: Convex Formulationmentioning
confidence: 99%
“…5G will significantly exploit the MEC paradigm, and a substantial body of research is devoted to the problem of placing VNFs across the network providers' servers. As an example, [18], [19], [20], [21], [22] tackle the problems of VNF placement and routing from a network-centric viewpoint, i.e., they aim at minimizing the load of network resources. In particular, [18] seeks to balance the load on links and servers, while [19] studies how to optimize routing to minimize network utilization.…”
Section: Related Workmentioning
confidence: 99%