Request Load Balancing for Highly Skewed Traffic in P2P Networks

Author

Brinkmann, André ; Gao, Yan ; Korzeniowski, Miroslaw ; Meister, Dirk

Author_Institution

Paderborn Center for Parallel Comput., Univ. of Paderborn, Paderborn, Germany

fYear

2011

fDate

28-30 July 2011

Firstpage

53

Lastpage

62

Abstract

Request balancing is an important issue in P2P networks, as requests or accesses are typically not distributed evenly among the items. Some of the items may account for a large ratio of the overall requests, e.g., in case of extremely popular videos. In this paper, we present a combination of two approaches to overcome an uneven request distribution even if there is highly skewed traffic. These approaches, in combination with a new local routing scheme on the skewCCC network, are able to balance a skewCCC network by a factor of O(logN) faster than commonly used load balancing schemes.

Keywords

computational complexity; peer-to-peer computing; resource allocation; telecommunication network routing; telecommunication traffic; P2P networks; local routing scheme; request load balancing; skewCCC network; skewed traffic; uneven request distribution; Computer crime; Context; Load management; Merging; Nickel; Peer to peer computing; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Networking, Architecture and Storage (NAS), 2011 6th IEEE International Conference on

Conference_Location

Dalian, Liaoning

Print_ISBN

978-1-4577-1172-5

Electronic_ISBN

978-0-7695-4509-7

Type

conf

DOI

10.1109/NAS.2011.25

Filename

6005447