Name
Abstract | ||
|---|---|---|
This paper considers the problem of mapping virtual links to physical network paths, referred to as
<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Virtual Link Embedding (VLE)</italic>
, under the condition that bandwidth demands of virtual links are uncertain. To realize virtual links with predictable performance, the mapping is required to guarantee a bound on the congestion probability of the physical paths that embed the virtual links. To this end, we consider a general uncertainty model in which bandwidth demands of virtual links are expressed by random variables for which only the mean and variance (or a range) are known. We formulate the VLE problem as a nonlinear optimization program and design an algorithm called
<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Equal Partition VLE (epVLE)</italic>
to solve the problem by employing an approximate formulation that results in a second-order cone program (SOCP) that can be solved efficiently even for large networks. We then provide simulation results as well as model-driven and trace-driven experimental results from an SDN testbed to show the utility and efficiency of the
<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">epVLE</italic>
algorithm in various network scenarios. We apply
<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">epVLE</italic>
to commonly studied small networks as well as randomly generated large networks. Our results show that
<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">epVLE</italic>
is able to satisfy the required link congestion constraint, and that it produces results that are very close to those obtained from the exact optimization model. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/TNSM.2019.2946949 | IEEE Transactions on Network and Service Management |
Keywords | DocType | Volume |
Uncertainty,Optimization,Bandwidth,Computational modeling,Substrates,Approximation algorithms,Delays | Journal | 16 |
Issue | ISSN | Citations |
4 | 1932-4537 | 1 |
PageRank | References | Authors |
0.36 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fatemeh Hosseini | 1 | 1 | 0.36 |
| Alexander James | 2 | 1 | 0.36 |
| Majid Ghaderi | 3 | 271 | 31.77 |