New Algorithms to Minimize Handoff Latency in AMTree Protocol

In active networks, programs can be injected to network elements (routers/switches). This allows programmers toenhance existing protocols or deploy new protocols. AMTree protocol is an active network based protocol that makes sendingpackets to receivers, after source migration, an efficient process. In AMTree protocol, after source migration, handoff latencycomputed from the time of reconnecting to a new base station until finding nearest core to the mobile source. In this paper wepresent two new algorithms to minimize the handoff latency in AMTree protocol. We show that handoff latency is much lowerthan that of AMTree handoff algorithm if the mobile source connects to a base station which is subscribed to the multicastgroup. Also we show that our algorithm gets better results than AMTree if the new base station is not in the multicast group