By Topic

An Approach for Building Scalable Proxy Mobile IPv6 Domains

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hongbin Luo ; School of Electronic and Information Engineering, Beijing Jiaotong University (BJTU), Beijing 100044, China. They are also with the National Engineering Lab for Next Generation Internet Interconnection Devices at BJTU ; Hongke Zhang ; Yajuan Qin ; Victor C. M. Leung

As a promising network-based mobility management method that does not require active participation of mobile nodes (MNs), Proxy Mobile IPv6 (PMIPv6) is attracting considerable attention among the telecommunication and Internet communities. It remains an open issue how to build a scalable PMIPv6 domain that is able to support a large number of MNs while keeping handover delays low. In this paper, we propose an approach for building Scalable And Robust PMIPv6 (SARP) domains. We propose that every mobility access gateway (MAG) in a SARP domain also functions as a local mobility anchor (LMA), and is organized into a virtual ring with all other MAGs. Consistent hashing is used to efficiently distribute the mapping between each MN and its LMA to all MAGs. A MAG finds an MN's LMA by sending a query message to the virtual ring. Our analysis verifies the robustness and scalability of SARP. We also propose two handover procedures for SARP and show that they achieve low handover delays.

Published in:

IEEE Transactions on Network and Service Management  (Volume:8 ,  Issue: 3 )