Finding trusted publish/subscribe trees

Naicken, Stephen, Wakeman, Ian and Chalmers, Dan (2012) Finding trusted publish/subscribe trees. In: 6th IFIP WG 11.11 International Conference, IFIPTM, 21-25 May 2012, Surat, India.

Full text not available from this repository.

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.

Item Type: Conference or Workshop Item (Paper)
Schools and Departments: School of Engineering and Informatics > Informatics
Subjects: Q Science > QA Mathematics > QA0075 Electronic computers. Computer science
Depositing User: Ian Wakeman
Date Deposited: 09 Nov 2012 15:21
Last Modified: 28 Nov 2012 12:51
URI: http://sro.sussex.ac.uk/id/eprint/42236
📧 Request an update