IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v27y2017i2ne1961.html
   My bibliography  Save this article

A hash‐based distributed mapping control scheme in mobile locator‐identifier separation protocol networks

Author

Listed:
  • Moneeb Gohar
  • Faisal Bashir
  • Jin‐Ghoo Choi
  • Seok‐Joo Koh
  • Waleed Ahmad

Abstract

In the locator‐identifier separation protocol (LISP), the existing mapping control scheme is based on a centralized approach, in which a map server is used as a mobility anchor for mobile hosts. However, such a centralized scheme has some limitations that include traffic overhead at the central map server, service degradation by a single point of failure, and large data transmission delay. In this article, we propose a new hash‐based distributed mapping control scheme of endpoint identifier (EID) and local locator in the LISP‐based mobile networks. In the proposed scheme, each access router in the mobile network has a distributed local map server. For a mobile host, a distributed local map server is designated to manage the associated EID‐local locator mapping by using a hash function. For roaming support, each gateway has a distributed global map server, which maintains visiting EID‐locator register. From the numerical results, we see that the proposed scheme can reduce the amount of control traffic at the map server and total signaling delay compared to the existing mapping control schemes.

Suggested Citation

  • Moneeb Gohar & Faisal Bashir & Jin‐Ghoo Choi & Seok‐Joo Koh & Waleed Ahmad, 2017. "A hash‐based distributed mapping control scheme in mobile locator‐identifier separation protocol networks," International Journal of Network Management, John Wiley & Sons, vol. 27(2), March.
    • Handle: RePEc:wly:intnem:v:27:y:2017:i:2:n:e1961
    DOI: 10.1002/nem.1961
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.1961
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nem.1961?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:intnem:v:27:y:2017:i:2:n:e1961. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.