Article

The price of validity in dynamic networks

Authors:

Aristides Gionis,

Hector Garcia-Molina,

Rajeev MotwaniAuthors Info & Claims

SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference on Management of data

Pages 515 - 526

https://doi.org/10.1145/1007568.1007627

Published: 13 June 2004 Publication History

Abstract

Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with short-lived hosts being the norm rather than an exception. In recent years, researchers have investigated best-effort algorithms to efficiently process aggregate queries (e.g., sum, count, average, minimum and maximum) [6, 13, 21, 34, 35, 37] on these networks. Unfortunately, query semantics for best-effort algorithms are ill-defined, making it hard to reason about guarantees associated with the result returned. In this paper, we specify a correctness condition, single-site validity, with respect to which the above algorithms are best-effort. We present a class of algorithms that guarantee validity in dynamic networks. Experiments on real-life and synthetic network topologies validate performance of our algorithms, revealing the hitherto unknown price of validity.

References

[1]

D. Agrawal, A. El Abbadi, and R. C. Steinke. Epidemic algorithms in replicated databases. In Proc. of PODS, 1997.]]

Digital Library

[2]

R. Albert, H. Jeong, and A.-L Barabasi. Diameter of the world wide web. Nature, 401, 1999.]]

[3]

N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proc. of STOC, 1996.]]

Digital Library

[4]

A.-L Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286, 1999.]]

[5]

P. Bonnet, J. Gehrke, and P. Seshadri. Towards sensor database systems. In Proc. of MDM, 2001.]]

Digital Library

[6]

J. Considine, F. Li, G. Kollios, and J. Byers. Approximate aggregation techniques for sensor databases. In Proc. of ICDE, 2004.]]

Digital Library

[7]

D. De Couto, D. Aguayo, B. Chambers, and R. Morris. Performance of multihop wireless networks: Shortest path is not enough. In Proc. of HotNets, 2002.]]

[8]

A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In Proc. of PODC, 1987.]]

Digital Library

[9]

The dss clip2 company.]]

[10]

J. Elson, L. Girod, and D. Estrin. Fine-grained network time synchronization using reference broadcasts. In Proc. of OSDI, 2002.]]

Digital Library

[11]

D. Estrin, R. Govindan, J. Heidermann, and S. Kumar. Next century challenges: Scalable coordination in sensor networks. In Proc. of MOBICOMM, 1999.]]

Digital Library

[12]

P. Flajolet and G. N. Martin. Probabilistic counting. In Proc. of FOCS, 1983.]]

Digital Library

[13]

I. Gupta, R. van Renesse, and K. Birman. Scalable fault-tolerant aggregation in large process groups. In Proc. of DSN, 2001.]]

Digital Library

[14]

J. M. Hellerstein, P. J. Haas, and H. J. Wang. Online aggregation. In Proc. of SIGMOD, 1997.]]

Digital Library

[15]

T. Imielinski and B. R. Badrinath. Querying in highly mobile distributed environments. In Proc. of VLDB, 1992.]]

Digital Library

[16]

C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proc. of MOBICOMM, 2000.]]

Digital Library

[17]

J. M. Kahn, R. H. Katz, and K. S. J. Pister. Next century challenges: Mobile networking for smart dust. In Proc. of MOBICOMM, 1999.]]

Digital Library

[18]

D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proc. of FOCS, 2003.]]

Digital Library

[19]

P. Keyani, B. Larson, and M. Senthil. Peer pressure: Distributed recovery from attacks in peer-to-peer systems. In Proc. of Networking, 2002.]]

Digital Library

[20]

J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proc. of STOC, 2000.]]

Digital Library

[21]

S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong. TAG: a Tiny AGgregation service for ad-hoc sensor networks. In Proc. of OSDI, 2002.]]

Digital Library

[22]

D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In Proc. of PODC, 2002.]]

Digital Library

[23]

S. Milgram. The small world problem. Psychology Today, 1, 1967.]]

[24]

D. L. Mills. Network time protocol (version 2) specification and implementation, 1989.]]

[25]

C. R. Palmer, P. B. Gibbons, and C. Faloutsos. ANF: A fast and scalable tool for data mining in massive graphs. In Proc. of SIGKDD, 2002.]]

Digital Library

[26]

G. Pandurangan, P. Raghavan, and E. Upfal. Building low-diameter p2p networks. In Proc. of FOCS, 2001.]]

Digital Library

[27]

C. E. Perkins and E. M. Royer. Ad hoc on-demand distance vector routing. In Proc. of WMCSA, 1999.]]

Digital Library

[28]

K. H. Pollock, J. D. Nichols, C. Brownie, and J. E. Hines. Statistical inference for capture-recapture experiments. Wildlife Society Monographs, 107, 1990.]]

[29]

G. Pottie and W. Kaiser. Wireless integrated network sensors. Communications of the ACM, 43(5), 2000.]]

Digital Library

[30]

M. Ripeanu, I. Foster, and A. Iamnitchi. Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. Internet Computing Journal, 6(1), 2002.]]

Digital Library

[31]

A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large scale peer-to-peer systems. In Proc. of Middleware, 2001.]]

Digital Library

[32]

S. Saroiu, P. Gummadi, and S. Gribble. A measurement study of peer-to-peer file sharing systems. In Proc. of MMCN, 2002.]]

[33]

I. Stoica, R. Morris, D. Karger, M. Fran Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. of SIGCOMM, 2001.]]

Digital Library

[34]

R. van Renesse, K. Birman, and W. Vogels. Astrolabe: A robust and scalable technology for distributed system monitoring, management and data mining. ACM Transaction on Computer Systems, 21(2), 2003.]]

Digital Library

[35]

Y. Yao and J. Gehrke. Query processing for sensor networks. In Proc. of CIDR, 2003.]]

[36]

Z. Zhang, S. Shi, and J. Zhu. SOMO: Self-organized metadata overlay for resource management in p2p dht. In Proc. of IPTPS, 2003.]]

[37]

J. Zhao, R. Govindan, and D. Estrin. Computing aggregates for monitoring wireless sensor networks. In Proc. of SNPA, 2003.]]

Cited By

Melnyk DWattenhofer R(2018)Byzantine Agreement with Interval Validity2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS.2018.00036(251-260)Online publication date: Oct-2018
https://doi.org/10.1109/SRDS.2018.00036
Jesus PBaquero CAlmeida P(2015)A Survey of Distributed Data Aggregation AlgorithmsIEEE Communications Surveys & Tutorials10.1109/COMST.2014.235439817:1(381-404)Online publication date: Sep-2016
https://doi.org/10.1109/COMST.2014.2354398
Brunner RFreitag FNavarro LRana O(2012)Self-adaptive approximate queries for large-scale information aggregationInternational Journal of Web and Grid Services10.1504/IJWGS.2012.0491688:3(225-247)Online publication date: 1-Sep-2012
https://dl.acm.org/doi/10.1504/IJWGS.2012.049168
Show More Cited By

The price of validity in dynamic networks
1. Information systems
  1. Data management systems
    1. Database management system engines
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory

Recommendations

The price of validity in dynamic networks

Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with short-lived hosts being the norm rather than an exception. In recent years,...
Centrality metric for dynamic networks
MLG '10: Proceedings of the Eighth Workshop on Mining and Learning with Graphs

Centrality is an important notion in network analysis and is used to measure the degree to which network structure contributes to the importance of a node in a network. While many different centrality measures exist, most of them apply to static ...
Dynamic resource allocation in quality of service networks
EURO-NGI'05: Proceedings of the Second international conference on Wireless Systems and Network Architectures in Next Generation Internet

Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to offer services that satisfy the QoS requirements of individual users while ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference on Management of data

June 2004

988 pages

ISBN:1581138598

DOI:10.1145/1007568

Conference Chairs:
Arnd Christian König
Microsoft Research
,
Stefan Dessloch
University of Kaiserslautern, Germany
,
General Chair:
Patrick Valduriez
INRIA, France
,
Program Chair:
Gerhard Weikum
University of the Saarland

Copyright © 2004 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS04

Sponsor:

SIGMOD

SIGMOD/PODS04: International Conference on Management of Data and Symposium on Principles Database and Systems

June 13 - 18, 2004

Paris, France

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

57
Total Citations
View Citations
1,065
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)1

Reflects downloads up to 06 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Melnyk DWattenhofer R(2018)Byzantine Agreement with Interval Validity2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS.2018.00036(251-260)Online publication date: Oct-2018
https://doi.org/10.1109/SRDS.2018.00036
Jesus PBaquero CAlmeida P(2015)A Survey of Distributed Data Aggregation AlgorithmsIEEE Communications Surveys & Tutorials10.1109/COMST.2014.235439817:1(381-404)Online publication date: Sep-2016
https://doi.org/10.1109/COMST.2014.2354398
Brunner RFreitag FNavarro LRana O(2012)Self-adaptive approximate queries for large-scale information aggregationInternational Journal of Web and Grid Services10.1504/IJWGS.2012.0491688:3(225-247)Online publication date: 1-Sep-2012
https://dl.acm.org/doi/10.1504/IJWGS.2012.049168
Payton JJulien CRoman GSullivan K(2010)Integrating participatory sensing in application development practicesProceedings of the FSE/SDP workshop on Future of software engineering research10.1145/1882362.1882420(277-282)Online publication date: 7-Nov-2010
https://dl.acm.org/doi/10.1145/1882362.1882420
Payton JJulien CRoman GRajamani V(2010)Semantic self-assessment of query results in dynamic environmentsACM Transactions on Software Engineering and Methodology10.1145/1734229.173423119:4(1-33)Online publication date: 23-Apr-2010
https://dl.acm.org/doi/10.1145/1734229.1734231
Palma WAkbarinia RPacitti EValduriez P(2009)Distributed processing of continuous join queries using DHT networksProceedings of the 2009 EDBT/ICDT Workshops10.1145/1698790.1698798(34-41)Online publication date: 22-Mar-2009
https://dl.acm.org/doi/10.1145/1698790.1698798
Ntarmos NTriantafillou PWeikum G(2009)Distributed hash sketchesACM Transactions on Computer Systems10.1145/1482619.148262127:1(1-53)Online publication date: 13-Feb-2009
https://dl.acm.org/doi/10.1145/1482619.1482621
Wolff RBhaduri KKargupta H(2009)A Generic Local Algorithm for Mining Data Streams in Large Distributed SystemsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2008.16921:4(465-478)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.1109/TKDE.2008.169
Wu SVu QLi JTan K(2009)Adaptive Multi-join Query Processing in PDBMSProceedings of the 2009 IEEE International Conference on Data Engineering10.1109/ICDE.2009.210(1239-1242)Online publication date: 29-Mar-2009
https://dl.acm.org/doi/10.1109/ICDE.2009.210
Lazaridis IHan QMehrotra SVenkatasubramanian N(2009)Fault Tolerant Evaluation of Continuous Selection Queries over Sensor DataInternational Journal of Distributed Sensor Networks10.1080/155013207015856005:4(338-360)Online publication date: 1-Jul-2009
https://dl.acm.org/doi/10.1080/15501320701585600
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents