LOBS: Load Balancing for Similarity Peer-to-Peer Structures

NOVÁK, David and Pavel ZEZULA. LOBS: Load Balancing for Similarity Peer-to-Peer Structures. In Databases Information Systems and Peer-to-Peer Computing 2007. Berlin: Springer-Verlag Berlin Heidelberg New York, 2007, p. 1-8.

Basic information

Original name

LOBS: Load Balancing for Similarity Peer-to-Peer Structures

Name in Czech

LOBS: Vyrovnávání zátěže pro podobnostní peer-to-peer struktury

Authors

NOVÁK, David (203 Czech Republic, guarantor) and Pavel ZEZULA (203 Czech Republic)

Edition

Berlin, Databases Information Systems and Peer-to-Peer Computing 2007, p. 1-8, 2007

Publisher

Springer-Verlag Berlin Heidelberg New York

---

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Germany

Confidentiality degree

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

References:

Extended pre-proceedings version of the paper

RIV identification code

RIV/00216224:14330/07:00019483

Organization unit

Faculty of Informatics

Keywords in English

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

Tags

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

Tags

International impact, Reviewed

---

Abstract

V originále

The concept of peer-to-peer structures has recently been applied on the problem of large-scale similarity search. This resulted in systems where the computational load of the peers is of a high importance. Since no current load-balancing technique is designed for structures of this kind, we propose LOBS - a general system for load-balancing in peer-to-peer structures with time-consuming searching. LOBS is based on the following principles: measuring the computational load, separation of the logical and the physical level of the system, and detailed analysis of the load source to exploit either data relocation or replication. This work contains results of experiments we conducted using a prototype implementation of LOBS. In these trials, we used a real-life dataset and we varied the number of peers and the distribution of the query traffic in the system. The results show that LOBS is able to cope with any query-distribution and that it improves both the utilization of resources and the performance of the query processing. The costs of balancing are reasonable and are very small if there is time to adapt to a query-traffic. The behaviour of LOBS is independent of the network size.

In Czech

Článek popisuje nový obecný systém pro vyrovnávání zátěže ve strukturovaných peer-to-peer sítích pro časově náročné vyhledávání. Obsahuje také výsledky experimentů ve kterých autoři aplikovali systém na strukturu M-Chord.

---

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
1ET100300419, research and development project	Name: Inteligentní modely, algoritmy, metody a nástroje pro vytváření sémantického webu Investor: Academy of Sciences of the Czech Republic, Intelligent Models, Algorithms, Methods and Tools for the Semantic Web (realization)