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

Topic allocation method on edge servers for latency‐sensitive notification service

Author

Listed:
  • Tomoya Tanaka
  • Tomio Kamada
  • Chikara Ohta

Abstract

The importance of real‐time notification has been growing for social services and Intelligent Transporting System (ITS). As an advanced version of Pub/Sub systems, publish‐process‐subscribe systems, where published messages are spooled and processed on edge servers, have been proposed to achieve data‐driven intelligent notifications. In this paper, we present a system that allows a topic to be managed on multiple edge servers so that messages are processed near the publishers, even when publishers spread over a wide area. Duplicating messages on geographically distributed servers could enable immediate notification to neighboring subscribers. However, the duplicated message spool may cause exhaustion of resources. We prepare a formal model of our publish‐process‐subscribe system and formulate the topic allocation as an optimization problem under the resource constraints of edge servers. As the optimization problem is NP‐hard, we propose heuristics leveraging the locality and the pub/sub relationships observed between clients to use the edge server resources efficiently. Our performance evaluation shows that our method reduces the delay to deliver notifications and the effectiveness of the strategy exploiting the relationships between clients.

Suggested Citation

  • Tomoya Tanaka & Tomio Kamada & Chikara Ohta, 2021. "Topic allocation method on edge servers for latency‐sensitive notification service," International Journal of Network Management, John Wiley & Sons, vol. 31(6), November.
  • Handle: RePEc:wly:intnem:v:31:y:2021:i:6:n:e2173
    DOI: 10.1002/nem.2173
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1002/nem.2173?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:31:y:2021:i:6:n:e2173. 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.