Abstract
This paper deals with the problem of maintaining distributed directory track of mobile users in a distributed presence of concurrent graph-theoretic server, that enables us to keep network in the concept of regional matching requests. The paper uses the for imple- menting efficient tracking mechanisms. The communi- cation overhead of our tracking mechanism is is within a polylogarithmic factor of the lower bound.
Cite
CITATION STYLE
APA
Awerbuch, B., & Peleg, D. (1991). Concurrent online tracking of mobile users. ACM SIGCOMM Computer Communication Review, 21(4), 221–233. https://doi.org/10.1145/115994.116013
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free