Optimal gossiping in square 2D meshes
Gossiping is the communication problem in which each node has a unique message to be transmitted to every other node. The nodes exchange their message by packets. A solution to the problem is judged by how many rounds of packet sending it requires. In this paper, we consider the version of the problem in which small-size packets each carrying exactly one message are used. The nodes of the target meshes are assumed to be all-port (a node's incident edges can all be active at the same time); and their edges are either half-duplex or full-duplex, which are also known as the H* model and the F* model, respectively. We study the class of 2D square meshes. Soch and Tvrdik (SIROCCO'97, pp. 253-265; Tech. rep. DC-97-04, Dept. of CS&E, Czech Technical University) have obtained optimal algorithms for the F* model (for square or nonsquare meshes). Lau and Zhang ( (4) (2002) 349-358) have obtained fast algorithms for the H* model. We present optimal algorithms for both models, with the interesting property that they route their messages along the same paths and in the same order, i.e. for any edge {u,v}, the i-th message from u to v under either model is the same message.

title: NP-Completeness Results for All-Shortest-Path Interval Routing
abstract: k-Interval Routing Scheme (k-IRS) is a compact routing method that allows up to k interval labels to be assigned to an arc. A fundamental problem is to characterize the networks that admit k-IRS. Many of the problems related to single-shortest-path k-IRS have already been shown to be NP-complete. For all-shortest-path k-IRS, the characterization problem remains open for k≥ 1. We investigate the time complexity of devising minimal-space all-shortest-path k-IRS and prove that it is NP-complete to decide whether a graph admits an all-shortest-path k-IRS, for every integer k≥ 3, as well as whether a graph admits an all-shortest-path k-strict IRS, for every integer k≥ 4. These are the first NP-completeness results for all-shortest-path k-IRS where k is a constant and the graph is unweighted. Moreover, the NP-completeness holds also for the linear case.

title: Decentralized Fair Scheduling in Two-Hop Relay-Assisted Cognitive OFDMA Systems
abstract: In this paper, we consider a two-hop relay-assisted cognitive downlink Orthogonal frequency-division multiple access (OFDMA) system (named as secondary system) dynamically accessing a spectrum licensed to a primary network, thereby improving the efficiency of spectrum usage. A cluster-based relay-assisted architecture is proposed for the secondary system, where relay stations are employed for minimizing the interference to the users in the primary network and achieving fairness for cell-edge users in the secondary system. Based on this architecture, an asymptotically optimal solution is derived for jointly controlling data rates, transmission power, and subchannel allocation to optimize the average weighted sum goodput where the proportional fair scheduling (PFS) is included as a special case. This solution supports decentralized implementation, requires small communication overhead, and is robust against imperfect channel state information at the transmitter (CSIT) and imperfect sensing measurement. The proposed solution achieves significant throughput gain and better user-fairness compared with the existing designs. Finally, we derive a simple and asymptotically optimal scheduling solution as well as the associated closed-form performance under the proportional fair scheduling for a large number of users. The system throughput is shown to be O(N(1-qp)(1-qpN)lnlnKc), where Kc is the number of users in one cluster, N is the number of subchannels, and qp is the active probability of primary users.

title: A new scaling law on throughput and delay performance of wireless mobile relay networks over parallel fading channels
abstract: In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing mobile relay network. The proposed scheme achieves the maximum throughput of Θ(log K) at a cost of O(1) total transmission power and O(K=q) average end-to-end packet delay, where 0 ≪ q ≤ ½ measures the speed of relays' mobility. It can be proved that this system throughput is unattainable for the existing designs with low relay mobility. Therefore, the proposed relay scheme can exploit the time diversity and relays' mobility more efficiently.

title: Towards automatic reverse engineering of software security configurations
abstract: The specifications of an application's security configuration are crucial for understanding its security policies, which can be very helpful in security-related contexts such as misconfiguration detection. Such specifications, however, are often ill-documented, or even close because of the increasing use of graphic user interfaces to set program options. In this paper, we propose ConfigRE, a new technique for automatic reverse engineering of an application's access-control configurations. Our approach first partitions a configuration input into fields, and then identifies the semantic relations among these fields and the roles they play in enforcing an access control policy. Based upon such knowledge, ConfigRE automatically generates a specification language to describe the syntactic relations of these fields. The language can be converted into a scanner using standard parser generators for scanning configuration files and discovering the security policies specified in an application. We implemented ConfigRE in our research and evaluated it against real applications. The experiment results demonstrate the efficacy of our approach.

title: Solving P2P Traffic Identification Problems Via Optimized Support Vector Machines
abstract: Since the emergence of peer-to-peer (P2P) networking in the last 90s, P2P traffic has become one of the most significant portions of the network traffic. Accurate identification of P2P traffic makes great sense for efficient network management and reasonable utility of network resources. Application level classification of P2P traffic, especially without payload feature detection, is still a challenging problem. This paper proposes a new method for P2P traffic identification and application level classification, which merely uses transport layer information. The method uses support vector machines which have been optimized for performing large learning tasks, rendering that this method become more suitable for large network traffic. The experimental results show that this method achieved high efficiency and is suitable for real-time identification. And carefully tuning the parameters could make the method achieve high accuracy.

title: Real-time KD-tree construction on graphics hardware
abstract: We present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-time performance by exploiting the GPU's streaming architecture at all stages of kd-tree construction. Unlike previous parallel kd-tree algorithms, our method builds tree nodes completely in BFS (breadth-first search) order. We also develop a special strategy for large nodes at upper tree levels so as to further exploit the fine-grained parallelism of GPUs. For these nodes, we parallelize the computation over all geometric primitives instead of nodes at each level. Finally, in order to maintain kd-tree quality, we introduce novel schemes for fast evaluation of node split costs.
 As far as we know, ours is the first real-time kd-tree algorithm on the GPU. The kd-trees built by our algorithm are of comparable quality as those constructed by off-line CPU algorithms. In terms of speed, our algorithm is significantly faster than well-optimized single-core CPU algorithms and competitive with multi-core CPU algorithms. Our algorithm provides a general way for handling dynamic scenes on the GPU. We demonstrate the potential of our algorithm in applications involving dynamic scenes, including GPU ray tracing, interactive photon mapping, and point cloud modeling.