This paper deals with the problem of maintaining a distributed directo
ry server, that enables us to keep track of mobile users in a distribu
ted network. The paper introduces the graph-theoretic concept of regio
nal matching, and demonstrates how finding a regional matching with ce
rtain parameters enables efficient tracking. The communication overhea
d of our tracking mechanism is within a polylogarithmic factor of the
lower bound.