Conferences in Research and Practice in Information Technology
  

Online Version - Last Updated - 20 Jan 2012

 

 
Home
 

 
Procedures and Resources for Authors

 
Information and Resources for Volume Editors
 

 
Orders and Subscriptions
 

 
Published Articles

 
Upcoming Volumes
 

 
Contact Us
 

 
Useful External Links
 

 
CRPIT Site Search
 
    

Policies for Sharing Distributed Probabilistic Beliefs

Leckie, C. and Kotagiri, R.

    In this paper, we present several general policies for deciding when to share probabilistic beliefs between agents for distributed monitoring. In order to evaluate these policies, we have formulated an application in network intrusion detection as a multi-agent monitoring problem. We have evaluated our policies based on packet trace data from a real network. Based on this evaluation, we have demonstrated that our policies can reduce both the delay and communication overhead required to detect network intrusions. Although we have focused on network intrusion detection as an application, we contend that our policies can generally be applied to domains that use a probabilistic model for evaluating hypotheses, and have a method for combining beliefs from multiple agents
Cite as: Leckie, C. and Kotagiri, R. (2003). Policies for Sharing Distributed Probabilistic Beliefs. In Proc. Twenty-Sixth Australasian Computer Science Conference (ACSC2003), Adelaide, Australia. CRPIT, 16. Oudshoorn, M. J., Ed. ACS. 285-290.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS
 

 

ACS Logo© Copyright Australian Computer Society Inc. 2001-2014.
Comments should be sent to the webmaster at crpit@scem.uws.edu.au.
This page last updated 16 Nov 2007