Carlos Baquero

Carlos Baquero

Auto-generated profile, based on publicly available information

Carlos Baquero

Universidade do Porto & INESC TEC, Porto, Portugal

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2011
Verified
Book Chapter
Closed access
PDF file
MSMarc Shapiro
Marc Shapiro
NPNuno Preguiça
Nuno Preguiça
CBCarlos Baquero
Carlos Baquero
MZMarek Zawirski
Marek Zawirski

1 March 2007 in Information Processing Letters
Verified
Journal Article
Closed access
PAPaulo Sérgio Almeida
Paulo Sérgio Almeida
CBCarlos Baquero
Carlos Baquero
NPNuno Preguiça
Nuno Preguiça
DHDavid Hutchison
David Hutchison

9 September 2014 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Closed access
PJPaulo Jesus
Paulo Jesus
CBCarlos Baquero
Carlos Baquero
PAPaulo Sergio Almeida
Paulo Sergio Almeida
Distributed data aggregation is an important task, allowing the decentralized determination of meaningful global properties, which can then be used to direct the execution of other applications. The resulting values are derived by the distributed computation of functions like Count, Sum, and Average. Some application examples deal with the determination of the network size, total storage capacity, average load, majorities and many others. In the last decade, many different approaches have been proposed, with different trade-offs in terms of accuracy, reliability, message and time complexity. Due to the considerable amount and variety of aggregation algorithms, it can be difficult and time consuming to determine which techniques will be more appropriate to use in specific settings, justifying the existence of a survey to aid in this task. This work reviews the state of the art on distributed data aggregation algorithms, providing three main contributions. First, it formally defines the concept of aggregation, characterizing the different types of aggregation functions. Second, it succinctly describes the main aggregation techniques, organizing them in a taxonomy. Finally, it provides some guidelines toward the selection and use of the most relevant techniques, summarizing their principal characteristics.

1 January 2018 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
PAPaulo Sérgio Almeida
Paulo Sérgio Almeida
ASAli Shoker
Ali Shoker
CBCarlos Baquero
Carlos Baquero

1 May 2011 in Journal of Statistical Mechanics: Theory and Experiment
Verified
Journal Article
Closed access
DJDi Jin
Di Jin
BYBo Yang
Bo Yang
CBCarlos Baquero
Carlos Baquero
DLDayou Liu
Dayou Liu
DHDongxiao He
Dongxiao He
JLJie Liu
Jie Liu

29 July 2011 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
CBCarlos Baquero
Carlos Baquero
PAPaulo Sergio Almeida
Paulo Sergio Almeida
Raquel MenesesRaquel Meneses
Raquel Meneses
PJPaulo Jesus
Paulo Jesus
Aggregation of data values plays an important role on distributed computations, in particular, over peer-to-peer and sensor networks, as it can provide a summary of some global system property and direct the actions of self-adaptive distributed algorithms. Examples include using estimates of the network size to dimension distributed hash tables or estimates of the average system load to direct load balancing. Distributed aggregation using nonidempotent functions, like sums, is not trivial as it is not easy to prevent a given value from being accounted for multiple times; this is especially the case if no centralized algorithms or global identifiers can be used. This paper introduces Extrema Propagation, a probabilistic technique for distributed estimation of the sum of positive real numbers. The technique relies on the exchange of duplicate insensitive messages and can be applied in flood and/or epidemic settings, where multipath routing occurs; it is tolerant of message loss; it is fast, as the number of message exchange steps can be made just slightly above the theoretical minimum; and it is fully distributed, with no single point of failure and the result produced at every node.