Memory complexity of automated trust negotiation strategies

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Automated Trust Negotiation(ATN) has been proposed as a mechanism to establish mutual trust among strangers. Protocols and strategies to be used during ATN have also been studied. When considering the real world usage of ATN, there are many factors to be considered. One of the factors that has not been addressed by previous studies is the memory complexity of negotiation strategies. This paper analyses the memory complexities of previously proposed negotiation strategies and evaluates the average memory consumption through simulations using an ATN framework for web services. The experimental results revealed that memory complexity of Parsimonious strategy grows exponentially as the number of credentials increases, which is consistent with the theoretical analysis. As a solution, a method to reduce the memory consumption by exploiting the knowledge each entity has about the negotiation is presented. In addition, the paper presents a new criterion that enables the truncation of the negotiation to reduce the memory consumption in situations where the negotiation fails. Experiment results, which show the effectiveness of above methods in reducing the memory consumption, negotiation length are also presented. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Katugampala, I. H., Yamaki, H., & Yamaguchi, Y. (2009). Memory complexity of automated trust negotiation strategies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5925 LNAI, pp. 229–244). https://doi.org/10.1007/978-3-642-11161-7_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free