Finding Trusted Publish/Subscribe Trees

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.

[1]  Alejandro P. Buchmann,et al.  Filter Similarities in Content-Based Publish/Subscribe Systems , 2002, ARCS.

[2]  Hans-Arno Jacobsen,et al.  A Policy Management Framework for Content-Based Publish/Subscribe Middleware , 2007, Middleware.

[3]  David W. Coit,et al.  Exploiting Tabu Search Memory in Constrained Problems , 2004, INFORMS J. Comput..

[4]  K. Thulasiraman,et al.  Complexity of computation of a spanning tree enumeration algorithm , 1984 .

[5]  Xiang Cao,et al.  Subscription-aware publish/subscribe tree construction in mobile ad hoc networks , 2007, 2007 International Conference on Parallel and Distributed Systems.

[6]  Wolfgang Lindner,et al.  Current Trends in Database Technology - EDBT 2004 Workshops, EDBT 2004 Workshops PhD, DataX, PIM, P2P&DB, and ClustWeb, Heraklion, Crete, Greece, March 14-18, 2004, Revised Selected Papers , 2004, EDBT Workshops.

[7]  Eugene W. Myers,et al.  Finding All Spanning Trees of Directed and Undirected Graphs , 1978, SIAM J. Comput..

[8]  Dieter Gollmann,et al.  Computer Security – ESORICS 2004 , 2004, Lecture Notes in Computer Science.

[9]  M. Gendreau,et al.  A tabu search heuristic for the Steiner Tree Problem , 1999, Networks.

[10]  G. Minty,et al.  A Simple Algorithm for Listing All the Trees of a Graph , 1965 .

[11]  Alexander L. Wolf,et al.  Security issues and requirements for Internet-scale publish-subscribe systems , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[12]  J. Char.  Generation of Trees, Two-Trees, and Storage of Master Forests , 1968 .

[13]  David S. Rosenblum,et al.  Enabling Confidentiality in Content-Based Publish/Subscribe Infrastructures , 2006, 2006 Securecomm and Workshops.

[14]  Ludger Fiege,et al.  Security aspects in publish/subscribe systems , 2004, ICSE 2004.

[15]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[16]  Zoltán Miklós.  Towards an access control mechanism for wide-area publish/subscribe systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[17]  A. Sen,et al.  Interpersonal Aggregation and Partial Comparability , 1970 .

[18]  Celso C. Ribeiro,et al.  Improved Tabu Search For The Steiner Problem In Graphs , 2000 .

[19]  Vom Fachbereich Informatik.  Large-Scale Content-Based Publish/Subscribe Systems , 2002 .

[20]  David M. Eyers,et al.  Role-based access control for publish/subscribe middleware architectures , 2003, DEBS '03.

[21]  Peter R. Pietzuch,et al.  Hermes: a distributed event-based middleware architecture , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[22]  Hector Garcia-Molina,et al.  Publish/Subscribe Tree Construction in Wireless Ad-Hoc Networks , 2003, Mobile Data Management.

[23]  John S. Baras,et al.  On trust models and trust evaluation metrics for ad hoc networks , 2006, IEEE Journal on Selected Areas in Communications.

[24]  Morris Sloman,et al.  A survey of trust in internet applications , 2000, IEEE Communications Surveys & Tutorials.

[25]  Celso C. Ribeiro,et al.  Tabu search for the Steiner problem in graphs , 2000, Networks.

[26]  Hector Garcia-Molina,et al.  SPROUT: P2P Routing with Social Networks , 2004, EDBT Workshops.

[27]  Indrajit Ray,et al.  A Vector Model of Trust for Developing Trustworthy Systems , 2004, ESORICS.