The price of validity in dynamic networks

DOI10.1016/J.JCSS.2006.10.007zbMATH Open1115.68011OpenAlexW1976404012MaRDI QIDQ878747FDOQ878747

Authors: Mayank Bawa, Aristides Gionis, Hector Garcia-Molina, Rajeev Motwani 

Publication date: 26 April 2007

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2006.10.007

Recommendations

• Towards robust and efficient computation in dynamic peer-to-peer networks
• Efficient Dynamic Aggregation
• Distributed agreement in dynamic peer-to-peer networks
• Aggregation in dynamic networks
• Computing in dynamic networks

zbMATH Keywords

sensorpeer-to-peercorrectness criterionaggregate queries

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Emergence of Scaling in Random Networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• The small-world phenomenon
• Title not available (Why is that?)
• Viceroy
• Capture-Recapture Studies for Multiple Strata Including Non-Markovian Transitions
• Title not available (Why is that?)

Cited In (8)

• Scalable, asynchronous, distributed eigen monitoring of astronomy data streams
• Maximising the worth of nascent networks
• Peer-to-peer aggregation techniques dissected
• AVCOL: availability-aware information aggregation in large distributed systems under uncollaborative behavior
• Efficient Dynamic Aggregation
• The Cost of Fault Tolerance in Multi-Party Communication Complexity
• A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network
• Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions

Uses Software

• Chord
• Pastry
• ANF
• TAG

This page was built for publication: The price of validity in dynamic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878747)