A distributed rerouting algorithm for mobile-mobile connections in connection-oriented networks
Gopal Racherla, Sridhar Radhakrishnan, Chandra N. Sekharan · 2002
We present a distributed algorithm for rerouting to accommodate unlimited movement of mobile hosts in a mobile-mobile connection. The algorithm is source initiated-that is the source base station is responsible for the rerouting. The algorithm ensures that the establishment of non-optimal and incorrect paths is avoided and that no packets in the session are lost as there is always a path between the base stations in charge of the source and the destination. The design of this distributed algorithm ensures that the processing at the mobile hosts is kept to a minimum. In addition, the proposed framework for rerouting in mobile-mobile communications is independent of the type of rerouting scheme.