In active networks (ANs) programs can be injected into routers and switches
to extend the functionalities of the network. This allows programmers to e
nhance existing protocols and enables the rapid deployment of new protocols
. The main objective of this paper is to show why ANs are ideal in solving
the problem of connection rerouting and how current end-to-end based approa
ches can be enhanced. In this paper we propose a new model called active co
nnection rerouting (ACR). In the ACR model, programs are dynamically inject
ed into switches/routers in mobile networks to faciliate efficient connecti
on rerouting during mobile host (MH) migration. We show how connection rero
uting can be performed efficiently within the network. The ACR model uses a
two stage optimization process: (i) path extension and (ii) lazy optimizat
ion. Unlike previous work on two stage connection rerouting ACR has the fol
lowing properties: elimination of loops within switches/routers and increme
ntal optimization which minimizes buffer requirements and maximized path re
use. ACR performs well in all topologies. Our experimental results show tha
t ACR is efficient and scalable and it performs well in all topologies.