The original dataset consists of data on over four million connections each described by 42 attributes (e.g., duration, protocol, etc.) and identified either as normal traffic or one of 24 attack types. Our simulation is designed as follows: 1. A total of 20,000 connections were randomly selected from the original dataset to form the simulation training set; 16 attack types were represented in ...

Suppose we are given a graph G = (V, E), with a metric cost function c over the edges. (that is, a cost function which satisfies the triangle inequality). Suppose we have a set of clients D ⊆ V. Consider that facilities can be opened at any client vertex. Each client i ∈ D has an associated demand di. There are no facility opening costs. The task is to connect each client to a facility. Let us ...

Network reconfiguration is an important mechanism for network operators to optimize performance and optical flow transfer. It concerns unicast multicast connections. Multicast connections are required meet the bandwidth requirements of applications, such as Internet Protocol-based TeleVision (IPTV), distance learning, telemedicine. In networks, a connection made possible by creation tree-shaped...

We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the rst few frequencies are strong. Another important observation is Parseval's theorem, which speci es that the Fourier transform preserve...

To investigate dynamic paths of network formation of free trade agreements (FTAs), we conduct simulations of Goyal and Joshi’s (2006) model of FTA network formation game with many countries. We compare the results between two protocols regarding the choice of the pair that decides if they form (or sever) an FTA link in each round in the network evolution. The first protocol is the random protoc...

Given a weighted graph G = (V,E) and a subset R of V , a Steiner tree in G is a tree which spans all vertices in R. The vertices in V \R are called Steiner vertices. A full Steiner tree is a Steiner tree in which each vertex of R is a leaf. The full Steiner tree problem is to find a full Steiner tree with minimum weight. The bottleneck full Steiner tree problem is to find a full Steiner tree wh...

We propose a dynamic multipath routing (DMPR) scheme to improve resource utilization of a network for a given quality of service (QoS) in carrying delay sensitive traffic. The proposed scheme takes advantage of available alternate routes which can be used beneficially in communication networks or switches, without increasing the network latency. Through simulation study of circuit-switched, vir...

We extend a word language concept called shuffle ideal to general algebras. For this purpose, we introduce the relation SH and show that there exists a natural connection between this relation and the homeomorphic embedding order on trees. We establish connections between shuffle ideals, monotonically ordered algebras and automata, and piecewise testable tree languages.

This paper compares different approaches which provide guaranteed assurance to connection-oriented group communications based on the use of working and backup disjoint route sets. Specifically, we present experimental results showing the effect of disjoint backup route sets on mesh/tree/ring: (1) feasibility and (2) cost.

It will be proved that the problem of determining whether a set of vertices of a dually chordal graphs is the set of leaves of a tree compatible with it can be solved in polynomial time by establishing a connection with finding clique trees of chordal graphs with minimum number of leaves.