𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A framework for distributed bandwidth allocation in peer-to-peer networks

✍ Scribed by Iordanis Koutsopoulos; George Iosifidis


Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
830 KB
Volume
67
Category
Article
ISSN
0166-5316

No coin nor oath required. For personal study only.

✦ Synopsis


In peer-to-peer networks, each peer plays the role of client and server. As a server, it receives content requests of others and decides to what extent it will satisfy them by allocating upload bandwidth. As a client, it sends its own requests to others to download content. We consider a star topology network with the capacity bottleneck being the peer access link to the backbone. Peers are assumed to be cooperative but with different resource needs and valuations, captured by their utility function, as well as with different service capabilities. We consider the problem of maximizing total network utility (social welfare) through controlling the bandwidth portion allocated to downloaders and uploaders of each peer. For autonomous unsupervised network operation, the fundamental challenge is to achieve the goal above in a distributed fashion. However, the global bandwidth sharing problem is difficult to solve in a decentralized fashion because of coupled utility functions and constraints, since the utility of a peer depends on allocation decisions of others. By defining new auxiliary variables and constraints, we transform the problem into one that is amenable to distributed solution by dual decomposition methods. The iterative algorithm involves solving separate optimization problems by each peer and updating Lagrange multipliers. Interestingly, the Lagrangian multipliers corresponding to new constraints can be interpreted as metrics for the level of pairwise resource contribution. The solution of the social welfare problem consists of the optimal pairwise amounts of allocated bandwidth and the optimal dual variables that induce these allocations. This leads to a meaningful lightweight algorithm which converges to the globally optimum bandwidth allocation.


πŸ“œ SIMILAR VOLUMES


P2PPerf: a framework for simulating and
✍ J.-B. Ernst-Desmulier; Julien Bourgeois; FranΓ§ois Spies πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 348 KB πŸ‘ 2 views

## Abstract Peer‐to‐peer paradigm is more and more studied by the distributed computing community. Indeed, this type of architecture has interesting properties like the absence of centralized topology, fault tolerance or dynamic reorganization of the network. However, managing these networks is com

A simple analytical framework to analyze
✍ R. Gaeta; G. Balbo; S. Bruell; M. Gribaudo; M. Sereno πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 364 KB

This paper presents an analytical framework to study search strategies in large-scale decentralized unstructured peer-to-peer (P2P) networks. The peers comprising the P2P network and their application-level connections are modeled as generalized random graphs (GRGs) whose simple and efficient analys

Zorilla: a peer-to-peer middleware for r
✍ Niels Drost; Rob V. van Nieuwpoort; Jason Maassen; Frank J. Seinstra; Henri E. B πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 266 KB πŸ‘ 2 views

## Abstract The inherent complex nature of current distributed computing architectures hinders the widespread adoption of these systems for mainstream use. In general, users have access to a highly heterogeneous set of compute resources, which may include clusters, grids, desktop grids, clouds, and

A subscribable peer-to-peer RDF reposito
✍ Min Cai; Martin Frank; Baoshi Yan; Robert MacGregor πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 600 KB

In this paper, we present a scalable peer-to-peer RDF repository, named RDFPeers, which stores each triple in a multiattribute addressable network by applying globally known hash functions. Queries can be efficiently routed to the nodes that store matching triples. RDFPeers also enables users to sel