DSpace DSpace UPC
 Català   Castellano   English  

E-prints UPC >
Altres >
Enviament des de DRAC >

Empreu aquest identificador per citar o enllaçar aquest ítem: http://hdl.handle.net/2117/15321

Ítem no disponible en accés obert per política de l'editorial

Arxiu Descripció MidaFormat
06041894.pdf205,01 kBAdobe PDF Accés restringit

Citació: Brunner, R.; Freitag, F.; Navarro, L. Self-regulated trade-off among timeliness, messages and accuracy for approximate queries in large-scale information aggregation. A: International Conference on Network-Based Information Systems. "Proceedings 2011 International Conference on Network-Based Information Systems NBiS 2011". Tirana: IEEE Press. Institute of Electrical and Electronics Engineers, 2011, p. 258-267.
Títol: Self-regulated trade-off among timeliness, messages and accuracy for approximate queries in large-scale information aggregation
Autor: Brunner, René Veure Producció científica UPC; Freitag, Fèlix Veure Producció científica UPC; Navarro Moldes, Leandro Veure Producció científica UPC
Editorial: IEEE Press. Institute of Electrical and Electronics Engineers
Data: 2011
Tipus de document: Conference report
Resum: In data management for large-scale applications such as Peer-to-Peer networks, and Grid and Cloud Computing arise challenges in regard to the decentralization of the application and in regard to an increasing number of failures. A consequence of these conditions is an increasing retrieval time, inaccurate results and higher network consumption. A solution to restrain an increasing retrieval time and an increasing number of messages is the introduction of approximate queries. The introduction of approximate queries limits the querying of all nodes of a network to a subset of nodes in the cost of the results' accuracy. Thus, a conflict to provide a large-scalability lies in guaranteeing accurate data, in the provision of fast results and in a low consumption of network bandwidth. Therefore, we propose an information aggregation that is based on an analytic hierarchical process (AHP) to find a trade-off among the unpredictable factors of time, messages and accuracy. After a user defines the preferences for the retrieval process, the AHP-based algorithm makes autonomous decisions on each node. The algorithm decides autonomously about pruning the approximate queries to reach an optimal trade-off from a global perspective. Applying the self-regulated pruning of the approximate queries allows reducing the messages from an exponential in crease to a constant factor. At the same time, the retrieval time is reduced from a linear increase to a constant factor in regard to an increasing number of nodes. At the same time of reducing the retrieval time and network bandwidth, the AHP-based self-regulation guarantees certain level of accuracy
URI: http://hdl.handle.net/2117/15321
DOI: 10.1109/NBIS.2011.45
Apareix a les col·leccions:Altres. Enviament des de DRAC
CNDS - Xarxes de Computadors i Sistemes Distribuïts. Ponències/Comunicacions de congressos
Departament d'Arquitectura de Computadors. Ponències/Comunicacions de congressos
Comparteix:


Stats Mostra les estadístiques d'aquest ítem

SFX Query

Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets.

Per a qualsevol ús que se'n vulgui fer no previst a la llei, dirigiu-vos a: sepi.bupc@upc.edu

 

Valid XHTML 1.0! Programari DSpace Copyright © 2002-2004 MIT and Hewlett-Packard Comentaris
Universitat Politècnica de Catalunya. Servei de Biblioteques, Publicacions i Arxius