Optimal Placement of Anchor Points Within Large Telecommunication Networks

  • Florian Liers
  • René Böringer
  • Andreas Mitschele-Thiel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3970)


Classical micro-mobility solutions focus on accelerating local handovers and on minimizing signalling traffic. However, the micro-mobility components also slow down the service times in the user traffic domain. This is a critical drawback in terms of the hard delay requirements of future IP-based radio access networks. Network operators need algorithms to determine the optimal number and placement of anchor points within his network to balance both handover latency and user traffic delay.

This paper presents a very fast and exact mathematical method for selecting the optimal number and placement of nodes supporting micro-mobility functionality for telecommunication networks. The method is in particular applicable for large networks, which is demonstrated by means of an optimization of a real wireless access network with more than 150 nodes. In order to ensure the applicability in real network scenarios we additionally provide a solution to estimate the stability of the optimal configuration. The presented method allows the autonomous and optimal configuration of the network’s micro-mobility functionality as described in concepts of zero-touch networks. Due to the optimization network operators can reduce the administration cost and maximize the quality of service as well.


Mobile Node Packet Loss Access Point Anchor Point Optimal Placement 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Reinbold, P., Bonaventure, O.: IP Micro-mobility Protocols. IEEE Communications Surveys and Tutorials 5 (2003),
  2. 2.
    Kar, C.A., Christos, P., Rahim, T.: Performance Evaluation of Mico-mobility Protocols for All-IP Based Infrastructures. Wireless World Research Forum (December 2002)Google Scholar
  3. 3.
    Robert, H., Aruna, S., Hesham, S., Karim, E.-M.: Performance analysis on Hierarchical Mobile IPv6 with Fast-handoffoverEnd-to-End TCP. In: GLOBECOM, Taipei, Taiwan (2002)Google Scholar
  4. 4.
    Eva, G., Annika, J., Charles, P.E.: Mobile IP Regional Registration. draft-ietf-mobileip-reg-tunnel-04.txt, Internet Draft, Internet Engineering Task Force (2000)Google Scholar
  5. 5.
    René, B., Ahmad, S., Ali, D., Andreas, M.-T., Matthias, S.: I-MPLS: A Transparent Mico-Mobility-enabled MPLS Framework. In: 11th European Wireless 2005, Cyprus (April 2005)Google Scholar
  6. 6.
    Hesham, S., Claude, C., Karim, M.E., Ludovic, B.: Hierarchical Mobile IPv6 mobility management. Network Working Group Draft (2004), draft-ietf-mipshop-hmipv6-04.txt
  7. 7.
    Craig, C.W., Steven, H., David, L.X.W.: High Density Model for Server Allocation and Placement. ACM Sigmetrics (2002)Google Scholar
  8. 8.
    Mark, D.S.: Network and Discrete Location: Models, Algorithms, and Applications. John Wiley & Sons Inc., New York (1995)zbMATHGoogle Scholar
  9. 9.
    Eiselt, H.A., Sandblom, C.-L.: Integer Programming and Network Models. Springer, Heidelberg (2000)zbMATHGoogle Scholar
  10. 10.
    MathWorks: Matlab 7 Online Help (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Florian Liers
    • 1
  • René Böringer
    • 1
  • Andreas Mitschele-Thiel
    • 1
  1. 1.Faculty of Computer Science and AutomationTechnical University of IlmenauGermany

Personalised recommendations