• DocumentCode
    3750433
  • Title

    Comparison of subscriber assignment methods on scalable distributed Pub/Sub systems

  • Author

    Ryohei Banno;Tetsuo Kawano;Susumu Takeuchi;Michiharu Takemoto;Masato Matsuo

  • Author_Institution
    NTT Network Innovation Laboratories, NTT Corporation, Tokyo, Japan
  • fYear
    2015
  • Firstpage
    632
  • Lastpage
    632
  • Abstract
    Scalable messaging methods for IoT services are needed to accommodate a vast number of devices. Skip Graph based topic based pub/sub (SG-TPS), which utilizes multiple brokers composing a structured overlay network, is one of the promising candidates. In SG-TPS, the distribution delay time is widely influenced by a way to assign subscribers to each broker. There are two possible approaches: the intensive assignment by which subscribers having a same topic are accommodated on a same broker, and the extensive assignment by which the subscribers are accommodated on different brokers as far as possible. In this paper, we formulate the difference of the distribution delay time between these two approaches, and discuss about the optimization of subscriber assignment.
  • Keywords
    "Delays","Overlay networks","Binary trees","Data models","Routing","Technological innovation","Laboratories"
  • Publisher
    ieee
  • Conference_Titel
    Communications (APCC), 2015 21st Asia-Pacific Conference on
  • Type

    conf

  • DOI
    10.1109/APCC.2015.7412584
  • Filename
    7412584