loading...
A Distributed Rerouting Algorithm for Mobile-Mobile connections in Connection-Oriented Networks
Lafayette, Lousiana October 12-October 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCCN.1998.739896Seventh International Conference on C ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Gopal Racherla, University of Oklahoma
Sridhar Radhakrishnan, University of Oklahoma
Chandra N. Sekharan, Loyola University at Chicago
We present a distributed algorithm for rerouting to accommodate unlimited movement of mobile hosts ina 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.
Citation:
Gopal Racherla, Sridhar Radhakrishnan, Chandra N. Sekharan, "A Distributed Rerouting Algorithm for Mobile-Mobile connections in Connection-Oriented Networks," icccn, pp.40, Seventh International Conference on Computer Communications and Networks (ICCCN '98), 1998
Usage of this product signifies your acceptance of the Terms of Use.