NDLI: Attack propagation in networks

Please wait, while we are loading the content...

Compact routing schemes

Routing without flow control

Fast, minimal and oblivious routing algorithms on the mesh with bounded queues

One-to-Many routing on the mesh

Simple on-line algorithms for the maximum disjoint paths problem

Stability and non-stability of the FIFO protocol

Competitve buffer management for shared-memory switches

Tradeoffs between knowledge and time of communication in geometric radio networks

Attack propagation in networks

Deterministic resource discovery in distributed networks

Latency effects on reachability in large-scale peer-to-peer networks

Towards a first vertical prototyping of an extremely fine-grained parallel programming approach

A cost effective architecture for vectorizable numerical and multimedia applications

Automatable verification of sequential consistency

Room synchronizations

A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems

Computational power of pipelined memory hierarchies

Optimal semi-oblique tiling

Finding large independent sets of hypergraphs in parallel

Columnsort lives! an efficient out-of-core sorting program

Efficient parallel exponentiation in GF(2n) using normal basis representations

Low-contention depth-first scheduling of parallel computations with write-once synchronization variables

Scheduling on hierarchical clusters using malleable tasks

Scheduling best-effort and real-time pipelined applications on time-shared clusters

Optimal prefetching and caching for parallel I/O sytems

Ordering disks for double erasure codes

Approximation algorithms for data management in networks

A data tracking scheme for general networks

New spectral bounds on k-partitioning of graphs

Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem

Towards practical deteministic write-all algorithms

Estimating simple functions on the union of data streams

Randomized k-set agreement

Periodic, random-fault-tolerant correction networks

D-CAT: A distributed channel allocation strategy based on a threshold scheme for cellular mobile networks

A note on cycle covering

Pursuit and evasion on a ring: An infinite hierarchy for parallel real—time systems

Scheduling tasks with small communication delays for clusters of processors

Library support for orthogonal processor groups

The push tree problem

Parallel controlled conspiracy number search

On tiling space-time mapped loop nests

A parallel block algorithm for exact triangularization of rectangular matrices

Eventually consistent failure detectors

Finding strongly connected components in parallel in particle transport sweeps

A work-optimal CGM algorithm for the LIS problem

Modeling weakly consistent memories with locks

The power of duality for prefetching and sorting with parallel disks

Attack propagation in networks

Content Provider	ACM Digital Library
Author	Zaroliagis, Christos Prasinos, Grigorios Spirakis, Paul Nikoletseas, Sotiris
Abstract	A new model for intrusion and its propagation through various attack schemes in networks is considered. The model is characterized by the number of network nodes, and two parameters f and g. Parameter f represents the probability of failure of an attack to a node and is a gross measure of the level of security of the attacked system and perhaps of the in truder's skills;g represents a limit on the number of attacks that the intrusion software can ever try, when it issues them from a particular (broken) network node,due to the danger to be discovered. The success of the attack scheme is characterized by two factors: the number of nodes captured (the spread factor) and the number of virtual links that a defense mechanism has to trace from any node where the attack is active to the origin of the intrusion (the traceability factor). The goal of an intruder is to maximize both factors. In our model, we present four different ways (attack schemes) by which an intruder can organize his attacks. Using analytic and experimental methods, we first show that for any O < f < 1, there exists a constant g for which any of our attack schemes can achieve a &THgr; (n) spread and traceability factor with high probability, given sufficient propagation time. We also show for three of our attack schemes that the spread and the traceability factors are, with high probability, linearly related during the whole duration of the attack propagation. This implies that it will not be easy for a detection mechanism to trace the origin of the intrusion, since it will have to trace a number of links proportional to the nodes captured.
Starting Page	67
Ending Page	76
Page Count	10
File Format	PDF
ISBN	1581134096
DOI	10.1145/378580.378591
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2001-07-03
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in