2012 Proceedings IEEE INFOCOM 2012
DOI: 10.1109/infcom.2012.6195847
|View full text |Cite
|
Sign up to set email alerts
|

Network aware resource allocation in distributed clouds

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
180
0
2

Year Published

2013
2013
2022
2022

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 292 publications
(188 citation statements)
references
References 13 publications
0
180
0
2
Order By: Relevance
“…On one hand, CSPs have been expanding their presence on the territory by adding more and more data centers across the planet. Even though some of the most successful providers (e.g., Amazon EC2 11 ) have still nowadays barely one or two data centers per continent, there are other efforts towards creating way more distributed data center architectures for provisioning of cloud services [33] [34] [32], such as those leveraging "containerized" and modular data center solutions [35] [36].…”
Section: Deployment Scenariosmentioning
confidence: 99%
“…On one hand, CSPs have been expanding their presence on the territory by adding more and more data centers across the planet. Even though some of the most successful providers (e.g., Amazon EC2 11 ) have still nowadays barely one or two data centers per continent, there are other efforts towards creating way more distributed data center architectures for provisioning of cloud services [33] [34] [32], such as those leveraging "containerized" and modular data center solutions [35] [36].…”
Section: Deployment Scenariosmentioning
confidence: 99%
“…(For example, [9,10] offer solutions for survivable VNet embedding, but consider that the VNet is already designed and given.) Work on optimal server selection and routing of anycast services in the physical layer for intra-and inter-DC networks [11,12] do not consider resilient network design in the virtual layer.…”
Section: Related Workmentioning
confidence: 99%
“…Breitgand and Epstein presented a 2-approximation algorithm for the stochastic bin packing problem under the assumption of independent normally distributed random variables [24]. Alicherry and Lakshman derived some approximation algorithms and inapproximability results for the problem of minimizing the cost of communication among VMs [25,26]. Breitgand et al devised algorithms for profit optimization in a federated cloud and proved that, under certain conditions, the algorithm for one of the sub-problems, which is a greedy LProunding procedure, ensures 2-approximation [27].…”
Section: Introduction and Previous Workmentioning
confidence: 99%