2012
DOI: 10.1016/j.comnet.2012.06.015
|View full text |Cite
|
Sign up to set email alerts
|

Achieving effective resilience for QoS-aware application mapping

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 25 publications
0
7
0
Order By: Relevance
“…x(i, u, t ) = 1, if virtual node u is assigned to physical node i at time t 0, otherwise (7) The operation cost of embedding a virtual node u to physical node i at time t consists of a possible baseline energy consumption E base (i) for waking up node i if its status S status (i, t − 1) at time t − 1 is asleep and an operation cost for executing virtual node u's tasks c v (u, t) at time t. S status (i, t ) = 1, if physical node i is asleep at the beginning of time t 0, otherwise (8) On the other hand, link operation cost is determined by traffic volume, b v (u, w, t) on the virtual link (u, w) at time t, and the weight, w p (i, j) of the physical links (i, j) that is different for inter or intra DC links. We use network flow f(i, j, u, w, t) to determine whether a physical link (i, j) is used to embed a virtual link u, w. When f(i, j, u, w, t) is equal to 1, virtual link (u, w) passes through the physical link (i, …”
Section: Operation Energy Consumptionmentioning
confidence: 99%
“…x(i, u, t ) = 1, if virtual node u is assigned to physical node i at time t 0, otherwise (7) The operation cost of embedding a virtual node u to physical node i at time t consists of a possible baseline energy consumption E base (i) for waking up node i if its status S status (i, t − 1) at time t − 1 is asleep and an operation cost for executing virtual node u's tasks c v (u, t) at time t. S status (i, t ) = 1, if physical node i is asleep at the beginning of time t 0, otherwise (8) On the other hand, link operation cost is determined by traffic volume, b v (u, w, t) on the virtual link (u, w) at time t, and the weight, w p (i, j) of the physical links (i, j) that is different for inter or intra DC links. We use network flow f(i, j, u, w, t) to determine whether a physical link (i, j) is used to embed a virtual link u, w. When f(i, j, u, w, t) is equal to 1, virtual link (u, w) passes through the physical link (i, …”
Section: Operation Energy Consumptionmentioning
confidence: 99%
“…Survivable virtual network embedding against link failures was addressed in many works [31,33,51,76,91,92,101,102,[115][116][117]. In particular, Shamsi et al [101,102] present QoS-aware resource allocation from the application's perspective.…”
Section: Survivable Virtual Network Embeddingmentioning
confidence: 99%
“…The overlay links requiring high quality were mapped to the direct paths on the substrate networks, and alternative paths were provisioned by indirect paths going through intermediate nodes on the substrate network. Zhang et al [116,117] also considered a QoS-based allocation, where disjoint backup paths on the substrate network were provisioned against link failures and the latency for the requested virtual network was minimized. While allocating the backup paths, the proposed model aimed to minimize the number of the substrate nodes that were selected to support backup paths.…”
Section: Survivable Virtual Network Embeddingmentioning
confidence: 99%
“…However, most make the unrealistic assumption that a substrate network is operational at all times [22]. Some studies deal with providing resilience for VN mapping, but the most frequently proposed protection approaches deal with physical link failure [21], [22], [36], [39], [40], [41]. Only a very few proposals [25], [26], [27], [37], [38] consider backup mechanisms in the event of a physical node failure.…”
Section: Introductionmentioning
confidence: 99%