Memory Complexity of Automated Trust Negotiation Strategies

Authors:
Indika H. Katugampala;Hirofumi Yamaki;Yukiko Yamaguchi
Affiliations:
Graduate School of Information Science, Nagoya University,;Information Technology Center, Nagoya University,;Information Technology Center, Nagoya University,
Venue:
PRIMA '09 Proceedings of the 12th International Conference on Principles of Practice in Multi-Agent Systems
Year:
2009

Citing 6
Cited 0

Interoperable strategies in automated trust negotiation

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Supporting structured credentials and sensitive policies through interoperable strategies for automated trust negotiation

ACM Transactions on Information and System Security (TISSEC)
Negotiating Trust on the Web

IEEE Internet Computing
Towards Practical Automated Trust Negotiation

POLICY '02 Proceedings of the 3rd International Workshop on Policies for Distributed Systems and Networks (POLICY'02)
A Dynamic Programming Approach to Automated Trust Negotiation for Multiagent Systems

RRS '05 Proceedings of the Rational, Robust, and Secure Negotiation Mechanisms in Multi-Agent Systems (RRS'05) on Multi-Agent Systems
On Interoperable Trust Negotiation Strategies

POLICY '07 Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks

Quantified Score

Hi-index	0.00

Visualization

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.