Load Balancing in Peer-to-Peer Data Networks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F06%3A00015932" target="_blank" >RIV/00216224:14330/06:00015932 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Load Balancing in Peer-to-Peer Data Networks
Original language description
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.
Czech name
Vyrovnávání zátěže ve strukturovaných peer-to-peer sítích
Czech description
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.
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GD102%2F05%2FH050" target="_blank" >GD102/05/H050: Integrated Approach to Education of PhD Students in the Area of Parallel and Distributed Systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
MEMICS 2006, 2nd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
ISBN
80-214-3287-X
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
151-157
Publisher name
Faculty of Information Technology, Brno University of Technology
Place of publication
Brno
Event location
Mikulov, Czech Republic
Event date
Oct 27, 2006
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—