A scheme for search-related issues of mobile IP

For search-related issues in mobile internetworking, the paper tries to make search policy and cache aging policy in the Columbia mobile IP specified taking switching delay as a performance measure. It is proved that giving up a little bit of expectancy on search success can greatly shorten the search time. When lightly loaded, the search algorithm is multi-casting or circle-casting not needling optimization; while when heavy loaded, it is ring-casting which is optimal. When cells are not ubiquitous or small, the scheme can hopefully work well