Online Tracking of Mobile Users
Name
MIT-LCS-TM-410.pdf
Size
6.41 MB
Format
Adobe PDF
Checksum (MD5)
0c8a9030cc5d8e8892ed1602f930010f
Author(s)
Awercuch, Baruch
Peleg, David
Date Issued
August 1989
Series/Report no.
MIT-LCS-TM-410
Abstract
This paper deals with the problem of maintaining a distributed directory server, that enables us to keep track of mobile users in a distributed network. The paper introduces the graph-theoretic concept of regional matching, and demonstrates how fining a regional matching with certain parameters enables efficient tracking. A polynomial-time algorithm that constructs such a regional matching is presented. The communication overhead of our tracking mechanism is within a polylogarithmic factor of the lower bound.
Persistent DSpace Link
