A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem

Authors:
Marco A. Boschetti;Vittorio Maniezzo;Matteo Roffilli
Affiliations:
Department of Mathematics, University of Bologna, 40127 Bologna, Italy;Department of Computer Science, University of Bologna, 40127 Bologna, Italy;Department of Computer Science, University of Bologna, 40127 Bologna, Italy
Venue:
INFORMS Journal on Computing
Year:
2011

Citing 16
Cited 0

Minimization methods for non-differentiable functions

Minimization methods for non-differentiable functions
Epidemic algorithms for replicated database maintenance

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Modern operating systems

Modern operating systems
Variable neighborhood search

Computers and Operations Research
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial

Journal of Heuristics
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems

Management Science
Epidemic-Style Proactive Aggregation in Large Overlay Networks

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Robust Aggregation Protocols for Large-Scale Overlay Networks

DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Approaching Optimal Peer-to-Peer Overlays

MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
A Generic Trust Overlay Simulator for P2P Networks

PRDC '06 Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing
The state of peer-to-peer simulators and simulations

ACM SIGCOMM Computer Communication Review
Epidemic Information Dissemination in Distributed Systems

Computer
Benders decomposition, Lagrangean relaxation and metaheuristic design

Journal of Heuristics
HAND: an overlay optimization algorithm in peer-to-peer systems

HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Peer-to-peer (P2P) computing already accounts for a large part of the traffic on the Internet, and it is likely to become as ubiquitous as current client/server architectures in next generation information systems. This paper addresses a central problem of P2P systems: the design of an optimal overlay communication network for a set of processes on the Internet. Such a network defines membership to the P2P group and allows for members to disseminate information within the group. The problem, named the membership overlay problem (MOP), can be formulated as a dynamic optimization problem where classical combinatorial optimization techniques must face the further challenge of time-varying input data. This paper proposes an innovative, fully distributed, and asynchronous subgradient optimization algorithm for the Lagrangean relaxation of the MOP, which can run online in fully decentralized P2P systems, and integrates it with a distributed heuristic that can achieve sound hot-start states for fast response to varying network structures.