Active Internet Traffic Filtering: Real-time Response to Denial of Service Attacks

Denial of Service (DoS) attacks are one of the most challenging threats to Internet security. An attacker typically compromises a large number of vulnerable hosts and uses them to flood the victim's site with malicious traffic, clogging its tail circuit and interfering with normal traffic. At present, the network operator of a site under attack has no other resolution but to respond manually by inserting filters in the appropriate edge routers to drop attack traffic. However, as DoS attacks become increasingly sophisticated, manual filter propagation becomes unacceptably slow or even infeasible. In this paper, we present Active Internet Traffic Filtering, a new automatic filter propagation protocol. We argue that this system provides a guaranteed, significant level of protection against DoS attacks in exchange for a reasonable, bounded amount of router resources. We also argue that the proposed system cannot be abused by a malicious node to interfere with normal Internet operation. Finally, we argue that it retains its efficiency in the face of continued Internet growth.Comment: Briefly describes the core ideas of AITF, a protocol for facing Denial of Service Attacks. 6 pages lon

Valence holes as Luttinger spinor based qubits in quantum dots

We present a theory of valence holes as Luttinger spinor based qubits in p-doped self-assembled quantum dots within the 4-band $k\cdot p$ formalism. The two qubit levels are identified with the two chiralities of the doubly degenerate ground state. We show that single qubit operations can be implemented with static magnetic field applied along the $z$ and $x$ directions, acting analogously to the $\hat{\sigma}_z$ and $\hat{\sigma}_x$ operators in the qubit subspace respectively. The coupling of two dots and hence the double qubit operations are shown to be sensitive to the orientation of the two quantum dots. For vertical qubit arrays, there exists an optimal qubit separation suitable for the voltage control of qubit-qubit interactions

On the probabilistic min spanning tree Problem

We study a probabilistic optimization model for min spanning tree, where any vertex vi of the input-graph G(V,E) has some presence probability pi in the final instance G′ ⊂ G that will effectively be optimized. Suppose that when this “real” instance G′ becomes known, a spanning tree T, called anticipatory or a priori spanning tree, has already been computed in G and one can run a quick algorithm (quicker than one that recomputes from scratch), called modification strategy, that modifies the anticipatory tree T in order to fit G ′. The goal is to compute an anticipatory spanning tree of G such that, its modification for any G ′ ⊆ G is optimal for G ′. This is what we call probabilistic min spanning tree problem. In this paper we study complexity and approximation of probabilistic min spanning tree in complete graphs under two distinct modification strategies leading to different complexity results for the problem. For the first of the strategies developed, we also study two natural subproblems of probabilistic min spanning tree, namely, the probabilistic metric min spanning tree and the probabilistic min spanning tree 1,2 that deal with metric complete graphs and complete graphs with edge-weights either 1, or 2, respectively

Replication Techniques for Speeding up Parallel Applications on Distributed Systems

This paper discusses the design choices involved in replicating objects and their effect on performance. Important issues are: how to maintain consistency among different copies of an object; how to implement changes to objects; and which strategy for object replication to use. We have implemented several options to determine which ones are most efficient

Relationships between attitudes and performance in young children’s mathematics

Most studies of children’s attitudes to mathematics have dealt with children in second grade or later, and have suggested that attitudes deteriorate, and anxiety increases with age. The present study investigated attitudes to mathematics in 67 English and 49 Chinese children at the end of their first year of school. The participants were given Thomas and Dowker’s (2000) Mathematics Attitude Questionnaire, which uses pictorial rating scales to assess primary school children’s mathematics anxiety, liking for mathematics, unhappiness at poor performance in mathematics, and self-rating in mathematics. They were also given the British Abilities Scales Basic Number Skills test. Attitudes were generally positive, though not more so than previously found for older primary school children. The Chinese children performed better in the arithmetic test and also rated themselves higher than the English children, but did not differ in other attitudes. Self-rating in mathematics and lack of unhappiness at poor performance were associated with better performance in the English group. There were no significant relations between attitudes and performance in the Chinese group. Implications of the findings are discussed