Skip to main content

Finding Trusted Publish/Subscribe Trees

  • Conference paper

Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT,volume 374)

Abstract

Publish/Subscribe systems assume that clients and brokers abide by the matching and forwarding protocols. Such an assumption implies implicit trust between all components of the system and has led to security issues being largely ignored. As publish/subscribe is increasingly used in applications where implicit trust can not be assumed, an approach is required to mitigate misbehaviour. We propose the construction and reconfiguration of the event forwarding topology, the publish/subscribe tree (PST), with respect to the trust requirements of the clients. The principal contribution of this paper is a trust metric for PSTs, which aggregates each client’s trust evaluation of a PST to give a socially acceptable trust evaluation and allows for the ordering of PSTs. Additionally, we define the PST trust maximisation problem with overhead budget, which is solved by the PST that maximises trust within an overhead budget for a given advertisement. A tabu search based algorithm for this problem is presented and is shown to scale to large problem instances and give good approximations of the optimal solutions.

References

  1. Belokosztolszki, A., Eyers, D., Pietzuch, P., Bacon, J., Moody, K.: Role-based access control for publish/subscribe middleware architectures. In: Proc. 2nd Intl. Workshop on Distributed Event-Based Systems, pp. 1–8. ACM (2003)

    Google Scholar 

  2. Cao, X., Shen, C.: Subscription-aware publish/subscribe tree construction in mobile ad hoc networks. In: Intl. Conf. on Parallel and Distributed Systems, vol. 2, pp. 1–9. IEEE (2009)

    Google Scholar 

  3. Char, J.: Generation of trees, two-trees, and storage of master forests. IEEE Transactions on Circuit Theory 15(3), 228–238 (1968)

    MathSciNet  CrossRef  Google Scholar 

  4. Fiege, L., Zeidler, A., Buchmann, A., Kilian-Kehr, R., Mühl, G.: Security aspects in publish/subscribe systems. In: 3rd Intl. Workshop on Distributed Event-Based Systems (DEBS 2004), pp. 44–49. Citeseer (2004)

    Google Scholar 

  5. Gabow, H.N., Myers, E.W.: Finding All Spanning Trees of Directed and Undirected Graphs. SIAM Journal on Computing 7(3), 280 (1978)

    MathSciNet  MATH  CrossRef  Google Scholar 

  6. Gendreau, M., Larochelle, J., Sanso, B.: A tabu search heuristic for the Steiner tree problem. Networks 34(2), 162–172 (1999)

    MathSciNet  MATH  CrossRef  Google Scholar 

  7. Grandison, T., Sloman, M.: A survey of trust in internet applications. IEEE Communications Surveys & Tutorials 3(4), 2–16 (2000)

    CrossRef  Google Scholar 

  8. Huang, Y., Garcia-Molina, H.: Publish/Subscribe Tree Construction in Wireless Ad-Hoc Networks. In: Chen, M.-S., Chrysanthis, P.K., Sloman, M., Zaslavsky, A. (eds.) MDM 2003. LNCS, vol. 2574, pp. 122–140. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

  9. Jayakumar, R., Thulasiraman, K., Swamy, M.: Complexity of computation of a spanning tree enumeration algorithm. IEEE Transactions on Circuits and Systems 31(10), 853–860 (1984)

    MathSciNet  MATH  CrossRef  Google Scholar 

  10. Kamvar, S., Schlosser, M., Garcia-Molina, H.: The eigentrust algorithm for reputation management in P2P networks. In: Proc. of the 12th Intl. Conf. on World Wide Web, pp. 640–651. ACM (2003)

    Google Scholar 

  11. Kulturel-Konak, S., Norman, B., Coit, D.W., Smith, A.E.: Exploiting Tabu Search Memory in Constrained Problems. INFORMS Journal on Computing 16(3), 241–254 (2004)

    MathSciNet  CrossRef  Google Scholar 

  12. Marti, S., Ganesan, P., Garcia-Molina, H.: SPROUT: P2P Routing with Social Networks. In: Lindner, W., Fischer, F., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol. 3268, pp. 425–435. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  13. Miklós, Z.: Towards an access control mechanism for wide-area publish/subscribe systems. In: Proc. 22nd Intl. Conf. on Distributed Computing Systems Workshops, pp. 516–521. IEEE (2002)

    Google Scholar 

  14. Minty, G.: A Simple Algorithm for Listing All the Trees of a Graph. IEEE Transactions on Circuit Theory 12(1), 120–120 (1965)

    MathSciNet  Google Scholar 

  15. Mühl, G.: Large-Scale Content-Based Publish/Subscribe Systems. Ph.D. thesis, Berlin Institute of Technology (2002)

    Google Scholar 

  16. Pietzuch, P., Bacon, J.: Hermes: a distributed event-based middleware architecture. In: Proc. 22nd Intl. Conf. on Distributed Computing Systems Workshops, pp. 611–618 (2002)

    Google Scholar 

  17. Raiciu, C., Rosenblum, D.S.: Enabling Confidentiality in Content-Based Publish/Subscribe Infrastructures. In: 2006 Securecomm and Workshops, pp. 1–11. IEEE (August 2006)

    Google Scholar 

  18. Rawls, J.: A theory of justice, 2nd edn. Oxford University Press (1971)

    Google Scholar 

  19. Ray, I., Chakraborty, S.: A Vector Model of Trust for Developing Trustworthy Systems. In: Samarati, P., Ryan, P.Y.A., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol. 3193, pp. 260–275. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  20. Ribeiro, C.C., De Souza, M.C.: Tabu search for the steiner tree problem in graphs. Networks 36, 138–146 (2000)

    MathSciNet  MATH  CrossRef  Google Scholar 

  21. Sen, A.: Interpersonal aggregation and partial comparability. Econometrica: Journal of the Econometric Society 38(3), 393–409 (1970), http://www.jstor.org/stable/1909546

    MathSciNet  CrossRef  Google Scholar 

  22. Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Japonica 24(6), 573–577 (1980)

    MathSciNet  MATH  Google Scholar 

  23. Theodorakopoulos, G., Baras, J.: On trust models and trust evaluation metrics for ad hoc networks. IEEE Journal on Selected Areas in Communications 24(2), 318–328 (2006)

    CrossRef  Google Scholar 

  24. Wang, C., Carzaniga, A., Evans, D., Wolf, A.: Security issues and requirements for Internet-scale publish-subscribe systems. In: Proc. of the 35th Annual Hawaii Intl. Conf. on System Sciences (HICSS), pp. 3940–3947. IEEE (2002)

    Google Scholar 

  25. Wun, A., Jacobsen, H.A.: A Policy Management Framework for Content-Based Publish/Subscribe Middleware. In: Cerqueira, R., Pasquale, F. (eds.) Middleware 2007. LNCS, vol. 4834, pp. 368–388. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Naicken, S., Wakeman, I., Chalmers, D. (2012). Finding Trusted Publish/Subscribe Trees. In: Dimitrakos, T., Moona, R., Patel, D., McKnight, D.H. (eds) Trust Management VI. IFIPTM 2012. IFIP Advances in Information and Communication Technology, vol 374. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29852-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29852-3_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29851-6

  • Online ISBN: 978-3-642-29852-3

  • eBook Packages: Computer ScienceComputer Science (R0)