(Enter summary)
Abstract: We present a monitoring system for a dynamic network,
in which a set of domain nodes shares the responsibility
for producing and storing monitoring information about a
set of visitors. This information is stored persistently when
the set of domain nodes grows and shrinks. Such a system
can be used to store traffic or other logs for auditing, or
can be used as a subroutine for many applications to allow
significant increases in functionality and reliability.
The features of our system include... (Update)
Similar documents based on text: More All
0.5: A Distributed Hash Table for Computational Grids - Riley, Scheideler
(Correct)
0.4: Pagoda: A Dynamic Overlay Network for Routing.. - Bhargava.. (2004)
(Correct)
0.3: Guaranteed Broadcasting Using SPON: Supervised P2P Overlay.. - Riley, Scheideler (2004)
(Correct)
BibTeX entry: (Update)
G. Ateniese, C. Riley, and C. Scheideler. Survivable monitoring in dynamic networks. In Proceedings of the International Information Assurance Workshop, 2004 (to appear). http://citeseer.ist.psu.edu/ateniese04survivable.html More
@misc{ ateniese04survivable,
author = "G. Ateniese and C. Riley and C. Scheideler",
title = "Survivable monitoring in dynamic networks",
text = "G. Ateniese, C. Riley, and C. Scheideler. Survivable monitoring in dynamic
networks. In Proceedings of the International Information Assurance Workshop,
2004 (to appear).",
year = "2004",
url = "citeseer.ist.psu.edu/ateniese04survivable.html" }
Citations (may not include all citations):
1225
Chord: A scalable peer-topeer lookup service for Internet ap..
- Stoica, Morris et al. - 2001
477
distributed object location and routing for large-scale peer.. (context) - Rowstron, Druschel et al. - 2001
449
OceanStore: An architecture for globalscale persistent stora..
- Kubiatowicz, Bindel et al. - 2000
411
Freenet: A distributed anonymous information storage and ret..
- Clarke, Sandberg et al. - 2000
342
Wide-area cooperative storage with CFS
- Dabek, Kaashoek et al. - 2001
280
persistent peer-to-peer storage utility (context) - Rowstron, Druschel et al. - 2001
189
Keying hash functions for message authentication
- Bellare, Canetti et al. - 1996
163
Efficient dispersal of information for security (context) - Rabin - 1989
132
EMERALD: Event Monitoring Enabling Responses to Anomalous Li..
- Porras, Neumann - 1997
105
Secure Hash Standard (context) - for, Technology - 1993
79
Computer Security Threat Monitoring and Surveillance (context) - Anderson - 1980
77
A prototype implementation of archival intermemory
- Chen, Edler et al. - 1999
63
An architecture for intrusion detection using autonomous age..
- Balasubramaniyan, Garcia-Fernandez et al.
59
Implementing a distributed firewall
- Ioannidis, Keromytis et al. - 2000
56
A Survey of Intrusion Detection Techniques (context) - Lunt - 1993
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.jhu.edu/~scheideler/): More
Simple On-line Algorithms for the Maximum Disjoint Paths.. - Kolman, Scheideler (2001)
(Correct)
Improved Bounds for the Unsplittable Flow Problem - Kolman, Scheideler (2002)
(Correct)
Anycasting in Adversarial Systems: Routing and Admission .. - Awerbuch, Brinkmann..
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC