Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all domains
Limit my searches in the following domains
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(16)
Approximate Algorithm
Community Networks
Computational Complexity
Cost Efficiency
Cost Reduction
Data Center
Distributed Computing
Graph Theory
Heuristic Algorithm
Integer Program
Optimization Problem
Peer To Peer
Performance Metric
Service Delivery
Theoretical Analysis
Round Trip Time
Subscribe
Academic
Publications
Optimal network locality in distributed virtualized data-centers
Edit
Optimal network locality in distributed virtualized data-centers
BibTex
|
RIS
|
RefWorks
Download
Jimmy Leblet
,
Zhe Li
,
Gwendal Simon
,
Di Yuan
Cost efficiency
is a key aspect in deploying distributed service in networks within decentralized
service delivery
architectures. In this paper, we address this aspect from an optimization and algorithmic standpoint. The research deals with the placement of service components to network sites, where the
performance metric
is the cost for acquiring components between the sites. The resulting optimization problem, which we refer to as the k-Component Multi-site Placement Problem, is applicable to service distribution in a wide range of communication networking scenarios. We provide a
theoretical analysis
of the problem’s computational complexity, and develop an integer
programming model
for providing reference results for performance benchmarking. On the algorithmic side, we present four approaches: an algorithm with approximation guarantee and three heuristics algorithms. The first heuristic is derived from
graph theory
on domatic partition. The second heuristic, built on intuition, admits distributed computation. The third heuristic emphasizes on fairness in cost distribution among the sites. We report simulation results for sets of networks where cost is represented by round-trip time (RTT) originating from real measurements. For small networks, the integer model is used to study algorithm performance in terms of optimality. Large networks are used to compare the algorithms relatively to each other. Among the algorithms, the heuristic based on intuition has close-to-optimal performance, and the fairness heuristic achieves a good balance between single-site cost and the overall one. In addition, the experiments demonstrate the significance of optimization for
cost reduction
in comparison to a the random allocation strategy.
Journal:
Computer Communications - COMCOM
, vol. 34, no. 16, pp. 1968-1979, 2011
DOI:
10.1016/j.comcom.2011.06.002
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.sciencedirect.com
)