|
ABSTRACT
We consider the problem of data dissemination in a broadcast network. In contrast to previously studied models, broadcasting is among peers, rather than client server. Such a model represents, for example, satellite communication among widely distributed nodes, sensor networks, and mobile ad hoc networks. We introduce a cost model for data dissemination in peer to peer broadcast networks. The model quantifies the tradeoff between the inconsistency of the data, and its transmission cost; the transmission cost may be given in terms of dollars, energy, or bandwidth. Using the model we first determine the parameters for which eager (i.e. consistent) replication has a lower cost than lazy (i.e. inconsistent) replication. Then we introduce a lazy broadcast policy and compare it with several naive or traditional approaches to solving the problem.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
Swarup Acharya , Michael Franklin , Stanley Zdonik, Balancing push and pull for data broadcast, Proceedings of the 1997 ACM SIGMOD international conference on Management of data, p.183-194, May 11-15, 1997, Tucson, Arizona, United States
|
 |
3
|
Pankaj K. Agarwal , Lars Arge , Jeff Erickson, Indexing moving points (extended abstract), Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.175-186, May 15-18, 2000, Dallas, Texas, United States
[doi> 10.1145/335168.335220]
|
 |
4
|
|
 |
5
|
|
 |
6
|
|
 |
7
|
Yuri Breitbart , Raghavan Komondoor , Rajeev Rastogi , S. Seshadri , Avi Silberschatz, Update propagation protocols for replicated databates, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.97-108, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
|
| |
8
|
|
 |
9
|
|
 |
10
|
Alan Demers , Dan Greene , Carl Houser , Wes Irish , John Larson , Scott Shenker , Howard Sturgis , Dan Swinehart , Doug Terry, Epidemic algorithms for replicated database maintenance, ACM SIGOPS Operating Systems Review, v.22 n.1, p.8-32, Jan., 1988
[doi> 10.1145/43921.43922]
|
| |
11
|
C. Fidge, Timestamps in message-passing systems that preserve the partial ordering, in: Proceedings of the 11th Australian Computer Science Conference (1988).
|
| |
12
|
R. Golding, A weak-consistency architecture for distributed information services, Usenix Association, Computing Systems 5(4) (1992).
|
 |
13
|
Jim Gray , Pat Helland , Patrick O'Neil , Dennis Shasha, The dangers of replication and a solution, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.173-182, June 04-06, 1996, Montreal, Quebec, Canada
|
| |
14
|
G. Grimmett and D. Welsh, Probability: an Introduction (Clarendon Press, 1986).
|
| |
15
|
|
| |
16
|
|
 |
17
|
|
 |
18
|
|
 |
19
|
|
 |
20
|
George Kollios , Dimitrios Gunopulos , Vassilis J. Tsotras, On indexing mobile objects, Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.261-272, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
[doi> 10.1145/303976.304002]
|
| |
21
|
|
 |
22
|
|
 |
23
|
|
| |
24
|
B. Liskov, R. Scheifler, E. Walker and W. Weihl, Orphan detection (extended abstract), in: Proceedings of the 17th International Symposium on Fault-Tolerant Computing (July 1987).
|
 |
25
|
|
| |
26
|
F. Mattern, Virtual time and global states of distributed systems, in: Proceedings of the International Workshop on Parallel and Distributed Algorithms (North-Holland, 1989).
|
| |
27
|
C. Olston and J. Widom, Offering a precision-performance tradeoff for aggregation queries over replicated data, http://www-db.stanford.edu/pub/papers/trapp-ag.ps
|
 |
28
|
|
| |
29
|
|
 |
30
|
|
| |
31
|
|
| |
32
|
|
| |
33
|
|
|