异构无线网络融合技术教案PPTPart3.pptVIP

* RP RP RP RP MSDP peer Physical link A B C D Receiver Source PIM message MSDP message (over TCP) SA Source Active SA Join Join Join Join Join MSDP with PIM-SM * Scaling Problems with MSDP Too much information pass around All active (S,G) pairs Too many tunnels to configure * BGMP Use shared tree between PIM domains Bi-directional trees Joins sent toward root PIM domain Single root domain per group Each domain assigned set of multicast group addresses by MASC Free from single point of failure Whole domain acts as the root of the broadcast tree, not just a single RP * Issues by User Mobility Volatile delivery paths lead to data loss Potentially costly to adjust multicast trees to host migrations Smooth handoff Previous schemes mostly Mobile IP-based Multicast trees built as if each host were home Statically spanning tree Cons Routing inefficiency Tunnel convergence * Preliminaries: Base Mobile IP Periodic Agent Advertisement (af) Registration Request (h,ah,af); care-of address af * Preliminaries: Base Mobile IP Data traffic Packets tunneled using IP encapsulation * Tunnel Convergence Example h 1 (Multicast Tree) HA 1 FA 1 HA 2 FA 2 h 2 h’ 1 * Tunnel Convergence Example Remedy (by Chikarmane et al.) h 1 (Multicast Tree) HA 1 FA 1 HA 2 FA 2 h 2 h’ 1 J * Dynamic Route Reconstructions Partition mobile environment into regions Internet composed of regional networks Distinct trees rooted within a common region usually share the same paths off the region * Dynamic Route Reconstructions Partition mobile environment into regions Internet composed of regional networks Distinct trees rooted within a common region usually share the same paths off the region * Realization Treat each region as a single network Gateway suppresses locally-originated routing information and initiates its own towards outgoing links, carrying an extended netmask Routing table Network addr. Interface Metric /24 S0 1 /24 S0 2 /24 S1 6 Network addr. Interface Metric /24 S2 2 /24 S2 3 /24 S3 5 R