New algorithms to minimize handoff latency in AMTree protocol

Citation

Al-Sharafi, Ali and Othman, Mohamed and K. Subramaniam, Shamala (2009) New algorithms to minimize handoff latency in AMTree protocol. The International Arab Journal of Information Technology, 6 (1). pp. 72-76. ISSN 1683-3198

Abstract

In active networks, programs can be injected to network elements (routers/switches). This allows programmers to enhance existing protocols or deploy new protocols. AMTree protocol is an active network based protocol that makes sending packets to receivers, after source migration, an efficient process. In AMTree protocol, after source migration, handoff latency computed from the time of reconnecting to a new base station until finding nearest core to the mobile source. In this paper the authors present two new algorithms to minimize the handoff latency in AMTree protocol. They show that handoff latency is much lower than that of AMTree handoff algorithm if the mobile source connects to a base station which is subscribed to the multicast group.

Download File

Preview

PDF (Abstract)
New algorithms to minimize handoff latency in AMTree protocol.pdf
Download (84kB) | Preview

Official URL or Download Paper: http://ccis2k.org/iajit/?option=com_content&task=b...

Additional Metadata

Item Type:	Article
Divisions:	Faculty of Computer Science and Information Technology
Publisher:	Zarqa University
Keywords:	Active networks; Mobile networks; Multicast; Handoff
Depositing User:	Ms. Nida Hidayati Ghazali
Date Deposited:	23 Jul 2013 06:30
Last Modified:	16 Jul 2018 06:56
URI:	http://psasir.upm.edu.my/id/eprint/15796
Statistic Details:	View Download Statistic

Actions (login required)

View Item