Další formáty:
BibTeX
LaTeX
RIS
@misc{720893,
author = {Novák, David and Zezula, Pavel},
address = {Brno, Czech Republic},
keywords = {peer-to-peer; load-balancing; similarity search},
language = {eng},
location = {Brno, Czech Republic},
publisher = {Faculty of Informatics, Masaryk University},
title = {LOBS: Load Balancing for Similarity Peer-to-Peer Structures},
url = {http://www.fi.muni.cz/reports/files/2007/FIMU-RS-2007-04.pdf},
year = {2007}
}
TY - GEN
ID - 720893
AU - Novák, David - Zezula, Pavel
PY - 2007
TI - LOBS: Load Balancing for Similarity Peer-to-Peer Structures
VL - Technical report FIMU-RS-2007-04
PB - Faculty of Informatics, Masaryk University
CY - Brno, Czech Republic
KW - peer-to-peer
KW - load-balancing
KW - similarity search
UR - http://www.fi.muni.cz/reports/files/2007/FIMU-RS-2007-04.pdf
N2 - The real-life experience with the similarity search shows that this task is both difficult and very expensive in terms of processing time. The peer-to-peer structures seem to be a suitable solution for content-based retrieval in huge data collections. In these systems, the computational load generated by a query traffic is highly skewed which degrades the searching performance. Since no current load-balancing techniques are designed for this task, we propose LOBS -- a novel and 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 of the peers, separation of the logical and the physical level of the system, and detailed analysis of the load source to exploit either data relocation or data replication. This report contains detailed description of the fundamentals and specific algorithms of LOBS, a theoretical analysis of its behaviour, and results of extensive experiments we conducted using a prototype implementation of LOBS. We tested LOBS with the peer-to-peer structure M-Chord having a various number of peers. We used a real-life dataset and query sets of various distributions. The results show that LOBS is able to cope with any query-distribution and that it improves both the utilization of resources and the system performance of query processing. The costs of balancing are reasonable compared to the level of imbalance and are very small if the system has time to adapt to a query-traffic. The behaviour of LOBS is independent of the size of the network.
ER -
NOVÁK, David a Pavel ZEZULA. \textit{LOBS: Load Balancing for Similarity Peer-to-Peer Structures}. Online. Brno, Czech Republic: Faculty of Informatics, Masaryk University, 2007. Technical report FIMU-RS-2007-04. [citováno 2024-04-23]
|
