Efficient Information Flow Control by Reducing Meaningless Messages in P2PPSO Systems

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 926)


In topic-based publish/subscribe (PS) model, each peer process (peer) only receives an event message whose publication topics include some common topic with the subscription topics. In a P2PPSO (P2P (peer-to-peer) type of topic-based PS with Object concept) model, each peer exchanges objects by publishing and receiving event messages with no centralized coordinator. Here, objects are denoted by topics and event messages are characterized by topics of the objects carried by the event messages. Suppose an event message \(e_j\) published by a peer \(p_j\) carries objects on some topics into a target peer \(p_i\). Here, objects in the peer \(p_j\) illegally flow to the peer \(p_i\) if the peer \(p_i\) is not allowed to subscribe the topics. An object of a peer \(p_i\) is illegal, whose topics the peer \(p_i\) is not allowed to subscribe. In this paper, we newly propose an ETOBSCO (Efficient TOBSCO) protocol where meaningless event messages are not published to reduce the number of event messages exchanged among peers. In the evaluation, we show the fewer number of event messages are delivered but longer update delay time to update replicas is taken in the ETOBSCO protocol.


Causally ordering delivery Information flow control P2P (peer-to-peer) PS (publish/subscribe) model TBAC (topic-based access control) model 



This work was supported by Japan Society for the Promotion of Science (JSPS) KAKENHI Grant Numbers JP15H0295, JP17J00106.


  1. 1.
    Google alert. Accessed 1 Aug 2018
  2. 2.
    Denning, D.E.R.: Cryptography and Data Security. Addison Wesley, Boston (1982)zbMATHGoogle Scholar
  3. 3.
    Eugster, P.T., Felber, P.A., Guerraoui, R., Kermarrec, A.M.: The many faces of publish/subscribe. ACM Comput. Surv. 35(2), 114–131 (2003)CrossRefGoogle Scholar
  4. 4.
    Fernandez, E.B., Summers, R.C., Wood, C.: Database Security and Integrity. Adison Wesley, Boston (1980)Google Scholar
  5. 5.
    Lamport, L.: Time, clocks, and the ordering of event in a distributed systems. Commun. ACM 21(7), 558–565 (1978)CrossRefGoogle Scholar
  6. 6.
    Nakamura, A., Takizawa, M.: Causally ordering broadcast protocol. In: Proceedings of IEEE the 14th International Conference on Distributed Computing Systems, pp. 48–55 (1994)Google Scholar
  7. 7.
    Nakamura, S., Enokido, T., Takizawa, M.: Information flow control in object-based peer-to-peer publish/subscribe systems. Concurrency and Computation: Practice and Experience (accepted)Google Scholar
  8. 8.
    Nakamura, S., Enokido, T., Takizawa, M.: A flexible read-write abortion protocol with role safety concept to prevent illegal information flow. J. Ambient Intell. Humaniz Comput. 9(5), 1415–1425 (2018)CrossRefGoogle Scholar
  9. 9.
    Nakamura, S., Ogiela, L., Enokido, T., Takizawa, M.: An information flow control model in a topic-based publish/subscribe system. J. High Speed Netw. 24(3), 243–257 (2018)CrossRefGoogle Scholar
  10. 10.
    Sandhu, R.S., Coyne, E.J., Feinstein, H.L., Youman, C.E.: Role-based access control models. IEEE Comput. 29(2), 38–47 (1996)CrossRefGoogle Scholar
  11. 11.
    Setty, V., Steen, M.V., Vitenberg, R., Voulgaris, S.: Poldercast: fast, robust, and scalable architecture for P2P topic-based pub/sub. In: Proceedings of ACM/IFIP/USENIX 13th International Conference on Middleware, pp. 271–291 (2012)Google Scholar
  12. 12.
    Waluyo, A.B., Taniar, D., Rahayu, W., Aikebaier, A., Takizawa, M., Srinivasan, B.: Trustworthy-based efficient data broadcast model for P2P interaction in resource-constrained wireless environments. J. Comput. Syst. Sci. 78(6), 1716–1736 (2012)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Hosei UniversityTokyoJapan
  2. 2.Rissho UniversityTokyoJapan
  3. 3.Fukuoka Institute of TechnologyFukuokaJapan

Personalised recommendations