An approach for scalable proxy mobile IPv6

Authors:
Hongbin Luo;Hongke Zhang;Victor C. M. Leung
Affiliations:
School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China;School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China;Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, B.C., Canada
Venue:
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Year:
2010

Citing 6
Cited 0

Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
Stochastic properties of the random waypoint mobility model

Wireless Networks
Secure untrusted data repository (SUNDR)

OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
ECHOS: edge capacity hosting overlays of nano data centers

ACM SIGCOMM Computer Communication Review
Mobility management for all-IP mobile networks: mobile IPv6 vs. proxy mobile IPv6

IEEE Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Because of its salient features such as ease of deployment, Proxy Mobile IPv6 (PMIPv6) is a promising solution for mobility management and is attracting considerable attention among the telecommunication and Internet communities. To the best of our knowledge, however, it is still an open issue how to build a scalable PMIPv6 domain so that a PMIPv6 domain is able to support as many mobile nodes (MNs) as possible while keeping low handover delay. In this paper, we propose an approach for building Scalable And Robust PMIPv6 (SARP) domains. We propose that every mobile access gateway (MAG) behaves as both an MAG and a local mobility anchor (LMA). All MAGs in a proxy mobility domain then organize into a ring and (key = MN-identifier, value = MN's LMA) pairs are distributed to all MAGs using consistent hashing. In this way, every MAG can send proxy binding update messages to the LMA identified by hashing the MN-identifier of the MN. We show that SARP is robust, scalable, and has very low handover delay. In particular, our results show that with SARP, a single PMIPv6 domain is able to support 108 MNs.