Concurrent online tracking of mobile users

This paper deals with the problem of maintaining distributed directory server, that enables us to keep track of mobile users in a distributed network in the presence of concurrent requests. The paper uses the graph-theoretic concept of regional matching for implementing efficient tracking mechanisms. The communication overhead of our tracking mechanism is within a polylogarithmic factor of the lower bound.

[1]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[2]  Michael E. Saks,et al.  Decomposing graphs into regions of small diameter , 1991, SODA '91.

[3]  Baruch Awerbuch,et al.  On buffer-economical store-and-forward deadlock prevention , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[4]  Jose Augusto Ramos Soares,et al.  Graph Spanners: a Survey , 1992 .

[5]  Andrew V. Goldberg,et al.  Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.

[6]  Baruch Awerbuch,et al.  Routing with Polynomial Communication-Space Trade-Off , 1992, SIAM J. Discret. Math..

[7]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[8]  Baruch Awerbuch,et al.  Network synchronization with polylogarithmic overhead , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[9]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[10]  Keith A. Lantz,et al.  Towards a universal directory service , 1985, PODC '85.

[11]  David Peleg,et al.  An Optimal Synchronizer for the Hypercube , 1989, SIAM J. Comput..

[12]  Eli Upfal,et al.  A trade-off between space and efficiency for routing tables , 1989, JACM.