Neighbor Graph (NG)
, Is an undirected graph with a number of edges that represent the
mobility paths between the vertices
, Provides the abstractions to identify the candidate subset of next
potential brokers
, Forms the basis for pre-loading the subscriber context one hop ahead
of its current broker
, Automatically generated and adaptively changes according to the
mobility graph
, A timestamp based LRU method can be used to ensure the freshness
of NG and remove the outlier edges
, Is stored in a distributed manner