Centrality-driven scalable service migration
Panagiotis Pantazopoulos,Merkourios Karaliopoulos,Ioannis Stavrakakis +2 more
- pp 127-134
TLDR
The proposed iterative service migration algorithm, called cDSMA, is extensively evaluated over both synthetic and real-world network topologies and achieves remarkable accuracy and robustness, clearly outperforming typical local-search heuristics for service migration.Abstract:
As social networking sites provide increasingly richer context, user-centric service development is expected to explode following the example of User-Generated Content. A major challenge for this emerging paradigm is how to make these exploding in numbers, yet individually of vanishing demand, services available in a cost-effective manner; central to this task is the determination of the optimal service host location. We formulate this problem as a facility location problem and devise a distributed and highly scalable heuristic to solve it. Key to our approach is the introduction of a novel centrality metric. Wherever the service is generated, this metric helps to a) identify a small subgraph of candidate service host nodes with high service demand concentration capacity; b) project on them a reduced yet accurate view of the global demand distribution; and, ultimately, c) pave the service migration path towards the location that minimizes its aggregate access cost over the whole network. The proposed iterative service migration algorithm, called cDSMA, is extensively evaluated over both synthetic and real-world network topologies. In all cases, it achieves remarkable accuracy and robustness, clearly outperforming typical local-search heuristics for service migration. Finally, we outline a realistic cDSMA protocol implementation with complexity up to two orders of magnitude lower than that of centralized solutions.read more
Citations
More filters
Journal ArticleDOI
Discrete location theory
TL;DR: In this article, the authors propose a method for solving the p-center problem on trees and demonstrate the duality of covering and constraining p-Center problems on trees.
Book ChapterDOI
Cache less for more in information-centric networks
TL;DR: A centrality-based caching algorithm is proposed by exploiting the concept of (ego network) betweenness centrality to improve the caching gain and eliminate the uncertainty in the performance of the simplistic random caching strategy.
Journal ArticleDOI
Cache less for more in information-centric networks (extended version)
TL;DR: This work studies the problem of en route caching and investigates if caching in only a subset of nodes along the delivery path can achieve better performance in terms of cache and server hit rates and proposes a centrality-based caching algorithm that can consistently achieve better gain across both synthetic and real network topologies that have different structural properties.
Journal ArticleDOI
Distributed Placement of Autonomic Internet Services
TL;DR: A distributed service migration heuristic that iteratively solves instances of the 1-median problem pushing progressively the service to more cost-effective locations and demonstrating the effectiveness of the heuristic over synthetic and real-world topologies as well as its advantages against comparable local-search-like migration schemes are proposed.
Book ChapterDOI
On the Local Approximations of Node Centrality in Internet Router-Level Topologies
TL;DR: The paper assesses how well the egocentric metrics approximate the original sociocentric ones, determined under perfect network-wide information, and suggests that rank-correlation is a poor indicator for the approximability of centrality metrics.
References
More filters
Journal ArticleDOI
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Journal ArticleDOI
The Structure and Function of Complex Networks
TL;DR: Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Journal ArticleDOI
A faster algorithm for betweenness centrality
TL;DR: New algorithms for betweenness are introduced in this paper and require O(n + m) space and run in O(nm) and O( nm + n2 log n) time on unweighted and weighted networks, respectively, where m is the number of links.
Journal ArticleDOI
Networking named content
Van L. Jacobson,Diana K. Smetters,James D. Thornton,Michael F. Plass,Nicholas H. Briggs,R. Braynard +5 more
TL;DR: Content-Centric Networking (CCN) is presented which uses content chunks as a primitive---decoupling location from identity, security and access, and retrieving chunks of content by name, and simultaneously achieves scalability, security, and performance.
Proceedings ArticleDOI
Bubble rap: social-based forwarding in delay tolerant networks
TL;DR: BUBBLE is designed and evaluated, a novel social-based forwarding algorithm that utilizes the aforementioned metrics to enhance delivery performance and empirically shows that BUBBLE can substantially improve forwarding performance compared to a number of previously proposed algorithms including the benchmarking history-based PROPHET algorithm, and social- based forwarding SimBet algorithm.