2011
DOI: 10.1007/978-3-642-21527-8_14
|View full text |Cite
|
Sign up to set email alerts
|

Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
34
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 42 publications
(36 citation statements)
references
References 14 publications
0
34
0
Order By: Relevance
“…To improve the mapping efficiency, one-stage VNE algorithms have been proposed where the related virtual links are mapped right after mapping a virtual node [7,[25][26][27][28]. In [25], constraints on delay, routing, and location were taken into consideration in the VNE problem, and the multicommodity flow integer linear program is used to solve the improved model.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…To improve the mapping efficiency, one-stage VNE algorithms have been proposed where the related virtual links are mapped right after mapping a virtual node [7,[25][26][27][28]. In [25], constraints on delay, routing, and location were taken into consideration in the VNE problem, and the multicommodity flow integer linear program is used to solve the improved model.…”
Section: Related Workmentioning
confidence: 99%
“…In [25], constraints on delay, routing, and location were taken into consideration in the VNE problem, and the multicommodity flow integer linear program is used to solve the improved model. Trinh et al [26] tried to increase the profit of the infrastructure provider and save the cost of subscribers by applying a careful overbooking concept.…”
Section: Related Workmentioning
confidence: 99%
“…As we know that network virtualization is not a completely new concept for this age of study but it has been identified that the network virtualization is the main paradigm of Research on Future Internet [20][21]. The Virtual Nodes and Virtual Links are working on the basis of distributed networks principles, where installed systems allowing for creation of Virtual Networks that are planned towards experimenting with new virtual network architectures [5].…”
Section: Related Workmentioning
confidence: 99%
“…As can be seen, the learning process is made 984 up of different steps as already described. However, we note that (Chowdhury et al, 2012) S-OS Static, link based optimal one shot virtual network embedding (Mijumbi et al, 2014) on a multi-agent system is proposed in Houidi, Louati, and 1184 Zeghlache (2008), while Infhr and Raidl (2011) and Jarray and 1185 Karmouch (2013) based on three approaches: control theory, performance dynamics 1236 modelling and workload prediction. Pan, Mu, Wu, and Yao (2008) 1237 and Patikirikorala, Colman, Han, and Wang (2011) are control the-1238 oretic approaches while Han, Guo, Ghanem, and Guo (2012) and 1239 Lai, Chiang, Lee, and Lee (2013) are based on performance dynam-1240 ics.…”
mentioning
confidence: 98%