1 / 13

IEEE 802.21 MEDIA INDEPENDENT HANDOVER Title: Distributed mobility management Date Submitted:

IEEE 802.21 MEDIA INDEPENDENT HANDOVER Title: Distributed mobility management Date Submitted: Authors or Sources: H Anthony Chan Abstract: Introduction to distributed mobility management. Centralized mobility anchors.

guinevere-church
Télécharger la présentation

IEEE 802.21 MEDIA INDEPENDENT HANDOVER Title: Distributed mobility management Date Submitted:

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. IEEE 802.21 MEDIA INDEPENDENT HANDOVER Title: Distributed mobility management Date Submitted: Authors or Sources: H Anthony Chan Abstract: Introduction to distributed mobility management 21-10-0195-00

  2. Centralized mobility anchors • Current mobile networks are hierarchical, and existing mobility solutions are deployed with centralized mobility anchoring • E.g. HA in MIPv6/DSMIPv6, LMA in PMIPv6, GGSN in 3GPP SAE PMIP GPRS/UMTS GGSN P-GW LMA SGSN S-GW MAG SGSN S-GW MAG 21-10-0195-00

  3. Existing technology • Terminology: • Network: hierarchical versus flattened • Mobility management: centralized versus distributed • Existing mobile networks are hierarchical. Existing mobility solutions deployed with centralized mobility anchoring have some problems or limitations. 21-10-0195-00

  4. Problems and limitations • 1. Routing via a centralized anchor leads to non-optimized routes. • 2. Routes are set up for a large number of mobile hosts even though the majority are not moving : scalability and performance. • 3. Mobility contexts are maintained even if a mobile host will not actually move, resulting in wasted resources. In addition, maintaining mobility contexts in a central entity has scalability issue. • 4. Single point of failure in the centralized architecture • 5. As the volume of wireless data traffic continues to increase exponentially, the revenue growth is falling far behind. Hierarchical architecture is more costly than the more flattened network, so that mobility management deployment with distributed architecture is needed. 21-10-0195-00

  5. Home network with LMA Visited network with MAG Non-optimized routing problem • Packets between MN and CN need to tunnel between MAG and LMA, even when MN is far from home network but is close to CN LMA: Local mobility anchor = Home agent (HA) + PMIP function MN: mobile node CN: correspondent node CN MN 21-10-0195-00

  6. LMA LMA LMA LMA LMA Possible solution: Copy LMA in many networks • HoA’s are anycast addresses • Solves triangle routing problem by using the LMA closest to MN. • http://tools.ietf.org/html/draft-thubert-nemo-global-haha-02 • Yet, synchronizing the location information among the LMA’s in real time is a challenge. MAG CN MN 21-10-0195-00

  7. LM MR MR MR MR MR Distributed Mobility Anchors • LMA functions: mobility routing (MR) + location management (LM) + HoA allocation. Only copy the MR function in different networks. LM: Location management MR: Mobility routing CN MN 21-10-0195-00

  8. LM MR (H-MA) MR (V-MA) MR (V-MA) MR (V-MA / D-MA) MR (V-MA / O-MA) Distributed Mobility Anchors • LMA functions: mobility routing (MR) + location management (LM) + HoA allocation. Only copy the MR function in different networks. H-MA: Home MA: MR + LM V-MA: Visited MA: MR only O-MA: Originating MA D-MA: Destination MA CN MN 21-10-0195-00

  9. H-MA D-MA V-MA H-MA O-MA V-MA D-MA V-MA V-MA O-MA Receiving packets • First packet • Subsequent packet: Optimized route CN MN CN MN 21-10-0195-00

  10. Route optimization algorithm • Whenever a node is the end of an incoming tunnel segment and the beginning of the outgoing tunnel segment for the same packet, the node knows optimization is possible. • The node simply informs the start of the incoming tunnel segment to tunnel future packets to the end of the outgoing tunnel segment. 21-10-0195-00

  11. H-MA D-MA V-MA O-MA O-MA V-MA V-MA V-MA H-MA D-MA Sending packets • to another mobile node • to fixed node MN2 MN1 CN MN 21-10-0195-00

  12. H-MA V-MA V-MA D-MA O-MA Further optimization • Between 2 mobile nodes MN2 MN1 21-10-0195-00

  13. Thank you 21-10-0195-00

More Related