IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v36y2026i1ne70033.html

Load Balancing Based on Consistent Hashing in P4 Switches

Author

Listed:
  • Yu‐An Shi
  • Kuan‐Ting Liu
  • Li‐Der Chou

Abstract

In recent years, the emergence of new network architectures has seen substantial growth. Among these advancements, distributed server architectures and server load balancing have gradually become key areas of focus. This paper introduces a mechanism called consistent hashing with congestion awareness (CHCA), designed to optimize load balancing. CHCA enhances traditional algorithms by minimizing data migration when servers are added or removed. Additionally, this mechanism incorporates the least connections method to prevent certain servers from becoming overloaded due to persistent traffic, thereby mitigating server hotspots. Aiming to support this mechanism, two custom headers, the forward header and the MRI header, are introduced using P4 switches. The forward header allows P4 switches to make dynamic packet forwarding decisions based on optimal paths at runtime, eliminating the need for a static routing table. Meanwhile, the MRI header records the load information from all traversed P4 switches, enabling the load balancing forwarding strategy to adapt in real time based on current network conditions.

Suggested Citation

  • Yu‐An Shi & Kuan‐Ting Liu & Li‐Der Chou, 2026. "Load Balancing Based on Consistent Hashing in P4 Switches," International Journal of Network Management, John Wiley & Sons, vol. 36(1), January.
  • Handle: RePEc:wly:intnem:v:36:y:2026:i:1:n:e70033
    DOI: 10.1002/nem.70033
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.70033
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.70033?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:36:y:2026:i:1:n:e70033. 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.