Multi-path with probable performance for congestion control in DHT networks

Author

Zhi Chen ; Guowei Huang

Author_Institution

Sch. of Comput. Sci. & Software, Tianjin Polytech. Univ., Tianjin, China

Volume

1

fYear

2011

fDate

12-14 Aug. 2011

Firstpage

48

Lastpage

51

Abstract

In structured P2P networks, the skewness in query pattern and the greedy routing strategy could result in query congestion in some hot spots. Bearing both aforementioned factors in mind, we propose a congestion control mechanism named Multi-Path with Probable Performance (MPPP) in this paper. The basic idea behind MPPP mechanism is to disperse the routing load via multi-path to more nodes to exploit the free capacity and to ameliorate the degree of congestion in the network. We also provide a theoretical analysis to prove that the performance of MPPP is bounded with probability. Additionally, simulation results demonstrate the effectiveness of MPPP mechanism.

Keywords

computational complexity; distributed processing; greedy algorithms; peer-to-peer computing; probability; query processing; resource allocation; telecommunication congestion control; telecommunication network routing; DHT networks; MPPP mechanism; congestion control mechanism; greedy routing strategy; load balancing algorithms; multipath with probable performance; query pattern; routing load; structured P2P networks; Clocks; Load management; Object recognition; Peer to peer computing; Routing; Servers; Simulation; Congestion control; DHT; Load balancing; Multi-path;

fLanguage

English

Publisher

ieee

Conference_Titel

Electronic and Mechanical Engineering and Information Technology (EMEIT), 2011 International Conference on

Conference_Location

Harbin, Heilongjiang, China

Print_ISBN

978-1-61284-087-1

Type

conf

DOI

10.1109/EMEIT.2011.6022835

Filename

6022835