The use of Neighbor Graphs for Context Caching
draft-mishra-seamoby-context-caching-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Author | Arunesh Mishra | ||
| Last updated | 2003-02-27 | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
The use of neighbor graphs as a method for dynamically caching the context of mobile stations in front of the station's mobility path can reduce the latency of handoff's between base stations or access points. Neighbor graphs capture the set of all potential mobility paths for a wireless network. Given any base station or access point, the set of all possible hand-offs can easily be determined by examining the neighbor graph in either a distributed fashion (at each base station) or centralized at the AAA server. This draft describes how the neighbor graph algorithm works at both the base station and the AAA server.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)