Concurrent online tracking of mobile users

Proceedings of the Conference on Communications Architecture and Protocols, SIGCOMM 1991

Volumn , Issue , 1991, Pages 221-233

  Awerbuch, Baruch ^a   Peleg, David ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; INTERNET PROTOCOLS;

COMMUNICATION OVERHEADS; CONCURRENT REQUESTS; DIRECTORY SERVER; DISTRIBUTED NETWORKS; ON-LINE TRACKING; POLY-LOGARITHMIC FACTORS; REGIONAL MATCHING; TRACKING MECHANISM;

NETWORK ARCHITECTURE;

EID: 84939339237     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/115992.116013     Document Type: Conference Paper

References (16)

1. B. Awerbuch, A. Goldberg, M. Luby and S. Plotkin, Network decomposition and locality in distributed computation, Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989.
2. B. Awerbuch, S. Kutten and David Peleg. On buffer-economical store-and-forward deadlock prevention, Proc. INFO-COM,1991.
3. B. Awerbuch, Complexity of network synchronization, J. of the ACM 32, (1985), 804-823.
4. B. Awerbuch and D. Peleg, Sparse Partitions, 31st IEEE Symp. on Foundations of Computer Science, Oct. 1990, 503-513.
5. B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead, 31st IEEE Symp. on Foundations of Computer Science, 1990, pp. 514-422.
6. B. Awerbuch and D. Peleg, Routing with polynomial communication-space trade-off, SIAM J. on Discrete Math., to appear.
7. B. Awerbuch and D. Peleg, Efficient Distributed Construction of Sparse Covers, Technical Report CS90-17, The Weizmann Institute, July 1990.
8. L. Lamport, Time, clocks, and the ordering of events in a distributed system, Comm. of the ACM 21, (1978), 558-565.
9. K.A. Lantz, J.L. Edighoffer and B.L. Histon, Towards a Universal Directory Service, 4th ACM Symp. on Principles of Distributed Computing, 1985, pp. 261-271.
10. N. Linial and M. Saks, Decomposing Graphs Into Regions of Small Diameter, 2nd ACM Symp. on Discrete Algorithms, San Francisco, 1991.
11. S.J. Mullender and P.M.B. Vitányi, Distributed Match-Making, Algorithmica 3, (1988), pp. 367-391.
12. D. Peleg and A.A. Schäffer, Graph spanners, J. of Graph Theory 13, (1989), 99-116.
13. D. Peleg and J .D. Ullman, An optimal synchronizer for the hypercube. SIAM J. on Comput. 18, (1989), 740-747.
14. D. Peleg and E. Upfal, A tradeoff between size and efficiency for routing tables, J. of the ACM 36, (1989), 510-530.
15. D. Peleg, Sparse Graph Partitions, Report CS89-01, Dept. of Applied Math., The Weizmann Institute, Rehovot, Israel, February 1989.
16. D. Peleg, Distance-Dependent Distributed Directories, Information and Computation, to appear. Also as Report CS89-10, Dept. of Applied Math., The Weizmann Institute, Rehovot, Israel, May 1989.