Fair resource allocation in peer-to-peer networks (extended version)

نویسندگان

  • Kolja Eger
  • Ulrich Killat
چکیده

The first Peer-to-Peer (P2P) networks were based mainly on the altruistic behaviour of the peers. Although newer implementations incorporate some kind of incentive mechanism to award sharing peers, no P2P network assures any quality of service. This paper is meant as a first step towards the development of P2P networks with quality of service. We propose a distributed resource allocation algorithm where peers control the service rates to their neighbours. This algorithm is based on the congestion pricing principle known from IP networks and ensures some form of fairness. Hence a peer gets a fair share of the resources available in the P2P network weighted by its contribution to the network. We present the first simulation results about the convergence of our algorithm and its functionality in large and varying networks. The results indicate a fair allocation of the resources even when the service rates of some peers deteriorate due to errors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Neighbor selection for proportional fairness in P2P networks

This paper analyzes reciprocation strategies in peer-to-peer networks from the point of view of the resulting resource allocation. Our stated aim is to achieve through decentralized interactions a weighted proportionally fair allocation. We analyze the desirable properties of such allocation, as well as an ideal proportional reciprocity algorithm to achieve it, using tools of convex optimizatio...

متن کامل

Fair and distributed peer-to-peer allocation of a common, refillable resource

We consider the general problem of distributed and fair peer-to-peer (p2p) allocation of a common, refillable resource. This problem recurrs in a number of scenarios, for example grid computing, content distribution, Internet Service Provider service sharing, and file sharing over asymmetric channels. We present several distributed schemes for this allocation problem, and show that these scheme...

متن کامل

Lifetime Optimization Using Energy Allocation in Wireless Ad-hoc Networks

We develop energy-balancing strategies for wireless ad-hoc networks energy resource allocation and deployment. The objective is to extend the network lifetime. We find the amount of energy storage that each node requires for having a balanced energy consumption throughout the network. For a limited set of energy resources in the deployment area, we determine an efficient deployment scenario in ...

متن کامل

Reduced-complexity Models for Network Performance Prediction

The Internet consists of thousands of nodes interconnected in complex ways, with millions of users sending traffic over the network. To understand such a complex system, it is necessary to develop accurate, yet simple, models to describe the performance of the network. The models have to be then used to design new algorithms that dramatically improve network performance. In this project, we hav...

متن کامل

From resource allocation to neighbor selection in peer-to-peer networks

In peer-to-peer networks there are two main issues: the efficiency in the use of the upload bandwidth of the peers; and the incentives that the resource allocation provides to the peers, which should promote the upload of content which is key to its scalability. There are some ad-hoc solutions to these issues such as the popular BitTorrent protocol. In this thesis we pretend to study, first fro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Communications

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2007