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 overbead of our tracking mechanism is within a polylogarithmic factor of the lower bound. Categories and Subject Descriptors: B.4.4 [Input/Output and Data Communications]: Performance Analysis and Design Aids-formal models, Lvrification, worst-case analysis; C.2.2 [Computer- Communication Networks]: Network Protocols-protocol architecture, protocol L'erificatiott; D.4.4. [Operating Systems]: Communications Management-network commanicationy F. 1.2 [Computation by Abstract Devices]: Models of Computation-parallelism and concawency General Terms: Design, Protocols, Reliability, Theory, Verification.
| Original language | English |
|---|---|
| Pages (from-to) | 1021-1058 |
| Number of pages | 38 |
| Journal | Journal of the ACM |
| Volume | 42 |
| Issue number | 5 |
| DOIs | |
| State | Published - 12 Jan 1995 |
| Externally published | Yes |
Keywords
- Bounded packet header
- bounded protocol
- ideal transmission cost
- lookahead
- non-FIFO channels
- receiver-driven protocol
- recoverable protocol
- recovery cost
- sequence transmission problem
