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 Citations (Scopus)

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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages5-18
Number of pages14
Volume6976 LNCS
DOIs
StatePublished - 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Computer system firewalls
Computer Networks
Computer networks
Telecommunication traffic
Observer
Computational complexity
Vertex of a graph
Attack
Ring
Tree Networks
Firewall
Denial of Service
Linear-time Algorithm
Denial-of-service attack
Monitor
NP-complete problem
Non-negative
Traffic
Grid
Integer

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Acharya, H. B., Choi, T., Bazzi, R., & Gouda, M. G. (2011). The K-observer problem in computer networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6976 LNCS, pp. 5-18). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6976 LNCS). https://doi.org/10.1007/978-3-642-24550-3_3

The K-observer problem in computer networks. / Acharya, H. B.; Choi, Taehwan; Bazzi, Rida; Gouda, Mohamed G.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6976 LNCS 2011. p. 5-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6976 LNCS).

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

Acharya, HB, Choi, T, Bazzi, R & Gouda, MG 2011, The K-observer problem in computer networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6976 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6976 LNCS, pp. 5-18, 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011, Grenoble, France, 10/10/11. https://doi.org/10.1007/978-3-642-24550-3_3
Acharya HB, Choi T, Bazzi R, Gouda MG. The K-observer problem in computer networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6976 LNCS. 2011. p. 5-18. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-24550-3_3
Acharya, H. B. ; Choi, Taehwan ; Bazzi, Rida ; Gouda, Mohamed G. / The K-observer problem in computer networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6976 LNCS 2011. pp. 5-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{7fe533101e9b4c108573c16f14a9c116,
title = "The K-observer problem in computer networks",
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.",
author = "Acharya, {H. B.} and Taehwan Choi and Rida Bazzi and Gouda, {Mohamed G.}",
year = "2011",
doi = "10.1007/978-3-642-24550-3_3",
language = "English (US)",
isbn = "9783642245497",
volume = "6976 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "5--18",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - The K-observer problem in computer networks

AU - Acharya, H. B.

AU - Choi, Taehwan

AU - Bazzi, Rida

AU - Gouda, Mohamed G.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80054706158&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80054706158&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-24550-3_3

DO - 10.1007/978-3-642-24550-3_3

M3 - Conference contribution

SN - 9783642245497

VL - 6976 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 5

EP - 18

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -