In today's net-centric warfare environment, effective management and use of the electromagnetic spectrum is critical. Increasing demands on wireless spectrum from radio traffic, unmanned aerial vehicle (UAV) communication, wireless networks, improvised explosive device (IED) jammers, and sensor networks result in sources competing for, and at times conflicting over, limited frequency spectrum. From an intelligence perspective, having a clear understanding of the RF environment, both friendly and foe, is an important essential of battlefield management. This paper presents the Sensor Collection and Analysis of Radio Frequencies (SCARF) system with a focus on the information processing requirements of the sensors and various system components. The overall architecture, sensor processing and fusion challenges, visualization algorithms, and current implementation status are discussed.
An automatic distributed mechanism is proposed to identify the propagation roots of fast spreading internet worms. The information obtained can be used to identify local worm outbreaks, identify network intrusion, identify internal network misuse, and help with the forensic trace-back after detection. It has been designed with simplicity, efficacy, and ease of deployment in mind. Two modes of operation are possible, yielding both real-time and post mortem propagation information. The proposed paradigm can work in unison with any intrusion detection, throttling and human-mediated responses. Simulation results show that even with only 20–30% deployment, worm origins can be pinpointed with great precision.
International Workshop on Dependable and Sustainable Peer-to-Peer Systems, IEEE, Turku, Finland (2008)
Abstract:
In this paper, we present the first heuristic for fully distributed
bootstrapping of peer-to-peer networks. Our heuristic generates a
stream of promising IP addresses to be probed as entry points. This
stream is generated using statistical profiles using the IP ranges of
start-of-authorities (SOAs) in the domain name system (DNS). We
present experimental results demonstrating that with this approach it
is efficient and practical to bootstrap Gnutella-sized peer-to-peer
networks - without the need for centralized services or the public
exposure of end-user's private IP addresses.
This paper presents a variation of the visitor pattern which allows
programmers to write visitor-like code in a concise way. The Runabout
is a library extension that adds a limited form of multi-dispatch to
Java. While the Runabout is not as expressive as a general multiple
dispatching facility, the Runabout can be significantly faster than
existing implementations of multiple dispatch for Java, such as
MultiJava. Unlike MultiJava, the Runabout does not require changes to
the syntax and the compiler.
This paper illustrates how to use the Runabout, details its
implementation, and provides benchmarks comparing its performance with
other approaches. Furthermore, the effect of an automatic static
program transformation tool that translates bytecode using the
Runabout to equivalent bytecode is evaluated. The tool uses double
dispatch and runtime type checks to achieve the same semantics that
the Runabout has. The performance comparisons on large benchmarks
that make extensive use multiple dispatch show that using the Runabout
does not result in a significant loss of performance for realistic
applications and that, depending on the application and platform,
small performance gains are also possible.
