The K-observer problem in computer networks

H. B. Acharya, Taehwan Choi, Rida Bazzi, Mohamed G. Gouda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

For any non-negative integer K, a K-observer P of a network N is a set of nodes in N such that each message, that travels at least K hops in N, is handled (and so observed) by at least one node in P. A K-observer P of a network N is minimum iff the number of nodes in P is less than or equal the number of nodes in every K-observer of N. The nodes in a minimum K-observer of a network N can be used to monitor the message traffic in network N, detect denial-of-service attacks, and act as firewalls to identify and discard attack messages. This paper considers the problem of constructing a minimum K-observer for any given network. We show that the problem is NP-hard for general networks, and give linear-time algorithms for constructing minimum or near-minimum K-observers for special classes of networks: trees, rings, L-rings, and large grids.

Original languageEnglish (US)
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Proceedings
Pages5-18
Number of pages14
DOIs
StatePublished - Oct 21 2011
Event13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011 - Grenoble, France
Duration: Oct 10 2011Oct 12 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6976 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011
CountryFrance
CityGrenoble
Period10/10/1110/12/11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'The K-observer problem in computer networks'. Together they form a unique fingerprint.

Cite this