Load Balancing in Peer-to-Peer Data Networks

NOVÁK, David. Load Balancing in Peer-to-Peer Data Networks. In MEMICS 2006, 2nd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Faculty of Information Technology, Brno University of Technology, 2006, p. 151-157. ISBN 80-214-3287-X.

Basic information

Original name

Load Balancing in Peer-to-Peer Data Networks

Name in Czech

Vyrovnávání zátěže ve strukturovaných peer-to-peer sítích

Authors

NOVÁK, David (203 Czech Republic, guarantor)

Edition

Brno, MEMICS 2006, 2nd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, p. 151-157, 7 pp. 2006

Publisher

Faculty of Information Technology, Brno University of Technology

---

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Czech Republic

Confidentiality degree

není předmětem státního či obchodního tajemství

References:

MEMICS '06 site URL

RIV identification code

RIV/00216224:14330/06:00015932

Organization unit

Faculty of Informatics

ISBN

80-214-3287-X

Keywords in English

peer-to-peer; load-balancing; similarity search

Tags

load-balancing, Peer-to-Peer, similarity search

---

Abstract

V originále

One of the issues considered in all Peer-to-Peer Data Networks, or Structured Overlays, is keeping a fair load distribution among the nodes participating in the network. Whilst this issue is well defined and basically solved for systems with relatively simple search paradigms, none of the existing solutions is appropriate nor applicable for similarity search networks. We suggest a new general solution of the load-balancing problem in P2P Data Networks, which is especially suitable for systems with time-consuming search operations. The framework proposed analyzes the source of the load precisely to choose right balancing action.

In Czech

Jeden z problemu resenych ve vsech strukturovanych peer-to-peer sitich je udrzovani rovnomerne zateze mezi spolupracujicimi uzly. Zatimco tento problem je dobre definovan a v podstate vyresen pro systemy s relativne jednoduchou vyhledavaci funkcionalitou, zadne z existujich reseni neni vhodne ani pouzitelne pro site s podobnostnim hledanim. Navrhujeme nove obecne reseni tohoto problemu, ktere je zvlaste vhodne pro systemy s casove narocnymi vyhledavacimi operacemi. Navrhovy koncept analyzuje zdroj zatizeni co nejpresneji, aby bylo mozne vybrat spravnou vyrovnavaci akci.

---

Links

GD102/05/H050, research and development project

Name: Integrovaný přístup k výchově studentů DSP v oblasti paralelních a distribuovaných systémů Investor: Czech Science Foundation, Integrated approach to education of PhD students in the area of parallel and distributed systems