rapid mobility via type indirection ben y. zhao, ling huang, anthony d. joseph, john d. kubiatowicz...
TRANSCRIPT
Rapid Mobility viaType Indirection
Ben Y. Zhao, Ling Huang,Anthony D. Joseph, John D. Kubiatowicz
Computer Science Division, UC Berkeley
IPTPS 2004
IPTPS 2004 [email protected]
wired network
Rapid Mobility large-scale mobile deployment becoming a reality
IPTPS 2004 [email protected]
Our Approach Warp: mobility infrastructure on structured P2P overlay
route using in-network indirection
directory service API (DOLR): RouteMsgToObject(ObjectID, Data)
treat mobile nodes as objects on their proxy
Flexible hierarchy for fast handoff layers of overlay forwarding hops
longer hops in wide-area, shorter hops in LAN
implicit hierarchy: only modify short hops if moving locally
Aggregate control traffic for mobile crowds “elect” mobile trunk node to tunnel traffic for others
reduce control traffic to one handoff per crowd
Routing, hierarchy, aggregation all managed by P2P protocol
IPTPS 2004 [email protected]
Decentralized Object Location & Routing
Decentralized directory API on structured peer to peer overlays
Server “publishes” object: overlay distributes location pointers to log(n) nodes
Clients route message towards object’s ID, redirect when location pointer found
Performance from locality-aware routing and local convergence properties
IPTPS 2004 [email protected]
Type Indirection
Overlay Node
Mobile Node Mobile Node Mobile Node… …
Register / Handoff
Proxy node
Mobile node
object onstatic node
Mobile Node Mobile Node Mobile Node…
J o i n / L e a v e
Mobile node
object onmobile node
leaf leaf leaf
Mobile Crowd
trunk
Leverage built-in indirection in object location layer of DOLR
Can further iterate type indirection: e.g. PDAs on train passenger
Type Indirection
IPTPS 2004 [email protected]
Routing Performance compare warp to Mobile IP add redundant root to reduce end to end latency
0
5
10
15
20
25
30
35
40
45
0 50 100 150 200 250 300 350 400
Shortest Path Latency between MN and CH
Ro
uti
ng
Lat
ency
RD
P
MIP far
MIP close
MIP medium
Warp
Warp 2 roots
IPTPS 2004 [email protected]
Handoff Latency
0
200
400
600
800
1000
1200
1400
1600
1800
2000
0 50 100 150 200 250 300
Distance between Handover proxies (ms)
Tim
e t
o c
om
ple
te h
an
do
ff (
ms
)
MIP Far MIP Close Warp Conv. Warp
compare time for Mobile IP, Warp and Warp full convergence
IPTPS 2004 [email protected]
Related Work
Fast handoffs hierarchical handoff (Caceres96)
hierarchical Mobile IP (Perkins96)
incremental route establishment (Keeton93)
Session mobility (Snoeren00)
ROAM (I3) (Zhuang03) in-network traffic redirection pointers (triggers)
can do hierarchical mobility, node aggregation
placement of triggers up to mobile node
IPTPS 2004 [email protected]
Summary
Flexible name-based hierarchical mobility treat mobile nodes as “objects” on overlay proxy
routing protocol manages traffic redirection points
virtual paths eliminate home agent and triangle routing no notion of “home network”
Aggregation to reduce control traffic treat leaf nodes as “objects” on mobile trunks
Self-managing network redirection rely on self-organizing protocol for aggregation, hierarchical
handoff, fast route establishment
protocol adapts to node failures, topology changes
Thanks…
Comments, questions?
http://www.cs.berkeley.edu/~ravenben/tapestry
IPTPS 2004 [email protected]
Handoff Load
1
10
100
1000
10000
100000
1 10 100 1000 10000 100000
Number of Mobile Hosts
Ha
nd
off
Me
ss
ag
es
in W
arp
No aggregation Uniform Dist.
Exponential Dist. Binomial Dist.