ACM Home Page
Please provide us with feedback. Feedback
Cost based data dissemination in satellite networks
Full text PdfPdf (312 KB)
Source Mobile Networks and Applications archive
Volume 7 ,  Issue 1  (January 2002) table of contents
SPECIAL ISSUE: Satellite-based information services table of contents
Pages: 49 - 66  
Year of Publication: 2002
ISSN:1383-469X
Authors
Bo Xu  University of Illinois, Chicago
Ouri Wolfson  University of Illinois, Chicago
Sam Chamberlain  Army Research Laboratory
Naphtali Rishe  Florida International University, University Park, Miami, FL
Publisher
Kluwer Academic Publishers  Hingham, MA, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 20,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

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
3
4
5
6
7
 
8
9
10
 
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
 
14
G. Grimmett and D. Welsh, Probability: an Introduction (Clarendon Press, 1986).
 
15
 
16
17
18
19
20
 
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


Collaborative Colleagues:
Bo Xu: colleagues
Ouri Wolfson: colleagues
Sam Chamberlain: colleagues
Naphtali Rishe: colleagues