Thumbnail
Access Restriction
Subscribed

Author Awerbuch, Baruch ♦ Peleg, David
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1995
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Bounded packet header ♦ Bounded protocol ♦ Ideal transmission cost ♦ Lookahead ♦ Non-FIFO channels ♦ Receiver-driven protocol ♦ Recoverable protocol ♦ Recovery cost ♦ Sequence transmission problem
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 finding a regional matching with certain parameters enables efficient tracking. The communication overhead of our tracking mechanism is within a polylogarithmic factor of the lower bound.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1995-09-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 42
Issue Number 5
Page Count 38
Starting Page 1021
Ending Page 1058


Open content in new tab

   Open content in new tab
Source: ACM Digital Library