University of Illinois

Displaying 1-40 of 268 results

  • White Papers // Sep 2013

    Factoring RSA Keys From Certified Smart Cards: Coppersmith in the Wild

    In this paper, the authors explain how an attacker can efficiently factor 184 distinct RSA keys out of more than two million 1024-bit RSA keys downloaded from Taiwan's national \"Citizen digital certificate\" database. These keys were generated by government-issued smart cards that have built-in hardware random-number generators and that are...

    Provided By University of Illinois

  • White Papers // Aug 2013

    Generation of Control and Data Flow Graphs from Scheduled and Pipelined Assembly Code

    High-level synthesis tools generally convert abstract designs described in a high-level language into a Control and Data Flow Graph (CDFG), which is then optimized and mapped to hardware. However, there has been little work on generating CDFGs from highly pipelined software binaries, which complicate the problem of determining data flow...

    Provided By University of Illinois

  • White Papers // Jun 2013

    Authentication in Ethos

    The abstractions used to provide Operating System (OS) authentication are fundamental to a system's security. Authentication primitives should be simple, general, and robust against attack. The authors describe the authentication mechanisms of Ethos, an experimental, clean-slate operating system that has been designed for security. They reexamine and redesign software layering...

    Provided By University of Illinois

  • White Papers // May 2013

    MinimaLT: Minimal-latency Networking Through Better Security

    Minimal Latency Tunneling (MinimaLT) is a new network protocol that provides ubiquitous encryption for maximal confidentiality, including protecting packet headers. MinimaLT provides server and user authentication, extensive Denial-of-Service protections, and IP mobility while approaching perfect forward secrecy. The authors describe the protocol, demonstrate its performance relative to TLS and unencrypted...

    Provided By University of Illinois

  • White Papers // Dec 2012

    WAVES: Automatic Synthesis of Client-Side Validation Code for Web Applications

    The current practice of web application development treats the client and server components of the application as two separate but interacting pieces of software. Each component is written independently, usually in distinct programming languages and development platforms - a process known to be prone to errors when the client and...

    Provided By University of Illinois

  • White Papers // Sep 2012

    Faster Batch Forgery Identification

    The authors' goal in this paper is to minimize the cost of elliptic-curve signature verification. Batch signature verification detects whether a batch of signatures contains any forgeries. Batch forgery identification pinpoints the location of each forgery. Existing forgery-identification schemes vary in their strategies for selecting sub-batches to verify (individual checks,...

    Provided By University of Illinois

  • White Papers // Sep 2012

    Computing Small Discrete Logarithms Faster

    Computations of small discrete logarithms are feasible even in "Secure" groups, and are used as subroutines in several cryptographic protocols in the literature. For example, the Boneh-Goh-Nissim degree- 2-homomorphic public-key encryption system uses generic square-root discrete-logarithm methods for decryption. This paper shows how to use a small group-specific table to...

    Provided By University of Illinois

  • White Papers // Sep 2012

    SipHash: A Fast Short-Input PRF

    SipHash is a family of pseudorandom functions optimized for short inputs. Target applications include network traffic authentication and hash-table lookups protected against hash-flooding denial-of-service attacks. SipHash is simpler than MACs based on universal hashing, and faster on short inputs. Compared to dedicated designs for hash-table lookup, SipHash has well-defined security...

    Provided By University of Illinois

  • White Papers // Aug 2012

    Optimal Cooperative Spectrum Sensing in Cognitive Radio with Taguchi Method

    Spectrum sensing is an essential topic in cognitive radio networks to detect primary users. Cooperative spectrum sensing with linear fusion scheme is studied in multiband channel systems. The problem turns out to be a non-convex optimization problem in general with thresholds of the energy detectors and the weights of linear...

    Provided By University of Illinois

  • White Papers // Jun 2012

    Two-Way Networks: When Adaptation Is Useless

    Most wireless communication networks are two-way, where nodes act as both sources and destinations of messages. This allows for "Adaptation" at or "Interaction" between the nodes - a node's channel inputs may be functions of its message(s) and previously received signals, in contrast to feedback-free one-way channels where inputs are...

    Provided By University of Illinois

  • White Papers // Jun 2012

    Never Trust a Bunny

    Lapin is a lightweight "RFID authentication" system introduced at FSE 2012. The system is claimed to be "Provably Secure Against Active Attacks". This claim is qualified elsewhere in: attacking Lapin-n is provably as difficult as attacking an n-bit "Ring-LPN" problem introduced in the same paper. "Lapin" is a new RFID...

    Provided By University of Illinois

  • White Papers // May 2012

    On the Capacity of Multi-User Two-Way Linear Deterministic Channels

    In multi-user two-way channels nodes are both sources and destinations of messages. This allows for "Adaptation" at or "Interaction" between the nodes - the next channel inputs may be a function of the past received signals at a particular node. How to best adapt is key to two-way communication problems,...

    Provided By University of Illinois

  • White Papers // May 2012

    Exploiting Opportunistic Overhearing to Improve Performance of Mutual Exclusion in Wireless Ad Hoc Networks

    The authors design two mutual exclusion algorithms for wireless networks. Their mutual exclusion algorithms are distributed token based algorithms which exploit the opportunistic message overhearing in wireless networks. One of the algorithms is based on overhearing of token transmission. In the other algorithm, overhearing of both token and request messages...

    Provided By University of Illinois

  • White Papers // May 2012

    The Sum-Capacity of the Linear Deterministic Three-User Cognitive Interference Channel

    Inspired by cognitive networks, the authors consider the linear deterministic three-user cognitive interference channel with one primary and two secondary/cognitive transmitters which approximates the Gaussian channel at high SNR. Outer bounds on the sum-rate are derived and matching transmission schemes are provided in all interference regimes, thereby completely characterizing the...

    Provided By University of Illinois

  • White Papers // May 2012

    Waveform Scheduling Via Directed Information in Cognitive Radar

    The objective of waveform scheduling is to achieve maximal information extraction of the radar scene, which typically changes from one measurement to the next, by exploiting prior statistics and waveform diversity. In this paper waveform scheduling is addressed using information theoretic concepts. A pre-defined waveform library is assumed to be...

    Provided By University of Illinois

  • White Papers // Apr 2012

    Defining the Undefinedness of C

    This paper investigates undefined behavior in C and offers a few simple techniques for operationally specifying such behavior formally. A semantics-based undefinedness checker for C is developed using these techniques, as well as a test suite of undefined programs. The tool is evaluated against other popular analysis tools, using the...

    Provided By University of Illinois

  • White Papers // Apr 2012

    An Architecture for Dynamic Service-Oriented Computing in Networked Embedded Systems

    Software development in real-time and embedded systems has traditionally focused on stand-alone applications with static models for scheduling and resource allocation. The authors' goal is to facilitate the development of embedded applications in an open system, where tasks and resources arrive and leave dynamically, and their execution is concurrent. They...

    Provided By University of Illinois

  • White Papers // Apr 2012

    Algorithmic Approaches to Low Overhead Fault Detection for Sparse Linear Algebra

    The increasing size and complexity of High-Performance Computing systems is making it increasingly likely that individual circuits will produce erroneous results, especially when operated in a low energy mode. Previous techniques for Algorithm - Based Fault Tolerance (ABFT) have been proposed for detecting errors in dense linear operations, but have...

    Provided By University of Illinois

  • White Papers // Apr 2012

    Scoped Synchronization Constraints for Large Scale Actor Systems

    Very large scale systems of autonomous concurrent objects (Actors) require coordination models to meet two competing goals. On the one hand, the coordination models must allow Actors to dynamically modify protocols in order to adapt to requirement changes over the, likely extensive, lifetime of the system. On the other hand,...

    Provided By University of Illinois

  • White Papers // Apr 2012

    Scalable Parametric Runtime Monitoring

    Run-time monitoring is an effective means to improve the reliability of systems. In recent years, parametric monitoring, which is highly suitable for object-oriented systems, has gained significant traction. Previous work on the performance of parametric run-time monitoring has focused on the performance of monitoring only one specification at a time....

    Provided By University of Illinois

  • White Papers // Mar 2012

    JavaMOP: Efficient Parametric Runtime Monitoring Framework

    Runtime monitoring is a technique usable in all phases of the software development cycle, from initial testing, to debugging, to actually maintaining proper function in production code. Of particular importance are parametric monitoring systems, which allow the specification of properties that relate objects in a program, rather than only global...

    Provided By University of Illinois

  • White Papers // Mar 2012

    Usable Assembly Language for GPUs: A Success Story

    The NVIDIA compilers nvcc and ptxas leave the programmer with only very limited control over register allocation, register spills, instruction selection, and instruction scheduling. In theory a programmer can gain control by writing an entire kernel in van der Laan's cudasm assembly language, but this requires tedious, error-prone tracking of...

    Provided By University of Illinois

  • White Papers // Mar 2012

    Non-Blind Watermarking of Network Flows

    Linking network flows is an important problem in intrusion detection as well as anonymity. Passive traffic analysis can link flows but requires long periods of observation to reduce errors. Active traffic analysis, also known as flow watermarking, allows for better precision and is more scalable. Previous flow watermarks introduce significant...

    Provided By University of Illinois

  • White Papers // Mar 2012

    Self-Partitioning Cloud Datastore for Scalable Transaction Processing Proposal

    The authors are designing a new cloud data storage system that will be highly scalable and yet still be able to provide strong data consistency guarantees. Their system extends existing cloud key/value stores with modular components for transaction management and access-based partitioning. They plan to utilize graph theory, clustering algorithms,...

    Provided By University of Illinois

  • White Papers // Mar 2012

    Maximum Likelihood Time Delay Estimation and Cramer-Rao Bounds for Multipath Exploitation

    In this paper, time delay estimation using the maximum likelihood principle is addressed for the multipath exploitation problem, and the corresponding Cramer-Rao bounds are derived. A single wideband radar, and a target in a known reflecting geometry are assumed. If the multipath is indeed detectable and resolvable, it is shown...

    Provided By University of Illinois

  • White Papers // Mar 2012

    OSA: An Optical Switching Architecture for Data Center Networks With Unprecedented Flexibility

    Data Center Networks (DCNs) form the backbone infrastructure of many large-scale enterprise applications as well as emerging cloud computing providers. This paper describes the design, implementation and evaluation of OSA, a novel optical switching architecture for DCNs. Leveraging runtime reconfigurable optical devices, OSA dynamically changes its topology and link capacities,...

    Provided By University of Illinois

  • White Papers // Mar 2012

    From Hoare Logic to Matching Logic

    Matching logic has been recently proposed as an alternative program verification approach. Unlike Hoare logic, where one defines a language-specific proof system that needs to be proved sound for each language separately, matching logic provides a language-independent and sound proof system that directly uses the trusted operational semantics of the...

    Provided By University of Illinois

  • White Papers // Mar 2012

    Towards Categorizing and Formalizing the JDK API

    Formal specification of correct library usage is extremely useful, both for software developers and for the formal analysis tools they use, such as model checkers or runtime monitoring systems. Unfortunately, the process of creating formal specifications is time consuming, and, for the most part, even the libraries in greatest use,...

    Provided By University of Illinois

  • White Papers // Feb 2012

    Making Maude Definitions More Interactive

    This paper presents an interface for achieving interactive executions of Maude terms by allowing console and file Input/Output (I/O) operations. This interface consists of a Maude API for I/O operations, a Java-based server offering I/O capabilities, and a communication protocol between the two implemented using the external objects concept and...

    Provided By University of Illinois

  • White Papers // Feb 2012

    On the Capacity of the Symmetric Interference Channel With a Cognitive Relay at High SNR

    The capacity of the Interference Channel with Cognitive Relay, a channel model which generalizes the broadcast, interference and cognitive interference channels, is still an open question. To make progress towards understanding this complex channel, the authors first consider the binary linear deterministic models that approximate the Gaussian channel at high...

    Provided By University of Illinois

  • White Papers // Feb 2012

    Token-DCF: An Opportunistic MAC Protocol for Wireless Networks

    IEEE 802.11 DCF is the MAC protocol currently used in wireless LANs. 802.11 DCF is inefficient due to two types of overhead; channel idle time and collision time. This paper presents the design and performance evaluation of an efficient MAC protocol for wireless networks, called Token-DCF. Token-DCF decreases both idle...

    Provided By University of Illinois

  • White Papers // Feb 2012

    Towards a Unified Theory of Operational and Axiomatic Semantics

    This paper presents a nine-rule language-independent proof system that takes an operational semantics as axioms and derives program properties, including ones corresponding to Hoare triples. This eliminates the need for language-specific Hoare-style proof rules in order to verify programs, and, implicitly, the tedious step of proving such proof rules sound...

    Provided By University of Illinois

  • White Papers // Jan 2012

    Optimizing Quality-of-Information in Cost-Sensitive Sensor Data Fusion

    This paper investigates maximizing quality of information subject to cost constraints in data fusion systems. The authors consider data fusion applications that try to estimate or predict some current or future state of a complex physical world. Examples include target tracking, path planning, and sensor node localization. Rather than optimizing...

    Provided By University of Illinois

  • White Papers // Jan 2012

    Evaluating Polynomials in Several Variables and Their Derivatives on a GPU Computing Processor

    In order to obtain more accurate solutions of polynomial systems with numerical continuation methods the users use multiprecision arithmetic. Their goal is to offset the overhead of double arithmetic accelerating the path trackers and in particular Newton's method with a general purpose graphics processing unit. In this paper, the authors...

    Provided By University of Illinois

  • White Papers // Jan 2012

    Service Composition for Advanced Multimedia Applications

    By composing distributed, autonomous services dynamically to provide new functionalities, service composition provides an attractive way for customized multimedia content production and delivery. Previous research work has addressed various aspects of service composition such as composibility, QoS-awareness, and load balancing. However, most of the work has focused on applications where...

    Provided By University of Illinois

  • White Papers // Jan 2012

    Enforcing Alias Analysis for Weakly Typed Languages

    Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized pointers, and array bounds overflow. Optimizing compilers can produce unpredictable results when such errors occur, but this is quite undesirable for many...

    Provided By University of Illinois

  • White Papers // Dec 2011

    Making DTNs Robust Against Spoofing Attacks With Localized Countermeasures

    In this paper, the authors propose countermeasures to mitigate damage caused by spoofing attacks in Delay-Tolerant Networks (DTNs). In their model, an attacker spoofs someone else's address (the victim's) to absorb packets from the network intended for that victim. Address spoofing is arguably a very severe attack in DTNs, compared...

    Provided By University of Illinois

  • White Papers // Dec 2011

    Tiresias: Online Anomaly Detection for Hierarchical Operational Network Data

    Operational network data, management data such as customer care call logs and equipment system logs, is a very important source of information for network operators to detect problems in their networks. Unfortunately, there is lack of efficient tools to automatically track and detect anomalous events on operational data, causing ISP...

    Provided By University of Illinois

  • White Papers // Dec 2011

    Capacity of Byzantine Consensus in Capacity Limited Point-to-Point Networks

    In this paper, the authors investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a capacity constraint. They derive an upper bound of the capacity of consensus in general point-to-point networks, and prove its tightness in 4-node complete...

    Provided By University of Illinois

  • White Papers // Dec 2011

    The Security Impact of a New Cryptographic Library

    This paper introduces a new cryptographic library, NaCl, and explains how the design and implementation of the library avoid various types of cryptographic disasters suffered by previous cryptographic libraries such as OpenSSL. For most cryptographic operations there exist widely accepted standards, such as the Advanced Encryption Standard (AES) for secret-key...

    Provided By University of Illinois

  • White Papers // Jul 2009

    Alibi: A Framework for Identifying Insider-Based Jamming Attacks in Multi-Channel Wireless Networks

    The authors consider the problem of identifying the insider-based attacks in the form of jammers in multi-channel wireless networks, where jammers have the inside knowledge of frequency hopping patterns and any protocols used in the wireless network. They propose a novel technique, called "alibi", to identify the insider-based jammers in...

    Provided By University of Illinois

  • White Papers // Aug 2009

    Identifying Malicious Nodes in Network-Coding-Based Peer-to-Peer Streaming Networks

    Researchers show that network coding can greatly improve the quality of service in P2P live streaming systems (e.g., IPTV). However, network coding is vulnerable to pollution attacks where malicious nodes inject into the network bogus data blocks that will be combined with other legitimate blocks at downstream nodes, leading to...

    Provided By University of Illinois

  • White Papers // Sep 2010

    Troubleshooting Interactive Complexity Bugs in Wireless Sensor Networks Using Data Mining Techniques

    This paper presents a tool for uncovering bugs due to interactive complexity in networked sensing applications. Such bugs are not localized to one component that is faulty, but rather result from complex and unexpected interactions between multiple often individually non-faulty components. Moreover, the manifestations of these bugs are often not...

    Provided By University of Illinois

  • White Papers // Jan 2010

    Denial in DTNs

    Disruption-Tolerant Network (DTN) is an intermittently connected network where the traditional end-to-end data communication between a source-destination pair is hardly possible. Instead, nodes opportunistically replicate the same packet several times and try to deliver them through multiple paths. Due to this multi-copy forwarding scheme, Denial of Service (DoS) attacks in...

    Provided By University of Illinois

  • White Papers // Mar 2010

    A Scalable Distributed File System for Cloud Computing

    Large scale distributed systems such as cloud computing applications are becoming very common. These applications come with increasing challenges on how to transfer and where to store and compute data. The most prevalent distributed file system to deal with these challenges is the HaDoop File System (HDFS) which is a...

    Provided By University of Illinois

  • White Papers // Aug 2010

    Exploiting Joint Wifi/Bluetooth Trace to Predict People Movement

    It is well known that the daily movement of people exhibits a high degree of repetition in which people usually stay at regular places for their daily activities. This paper presents a novel framework to construct a predictive model by exploiting the regularity of people movement found in the collected...

    Provided By University of Illinois

  • White Papers // Oct 2010

    Resource Inflation Threats to Denial of Service Countermeasures

    Currency-based mechanisms have been proposed as a way to use resource fairness among contenders for a service to thwart Denial of Service (DoS) attacks. Under resource fairness, a server allocates its service to the clients in proportion to their payment of a resource, making the resource serve as a kind...

    Provided By University of Illinois

  • White Papers // Nov 2010

    Social Network-Aware Disk Management

    Disk access patterns of social networking applications are different from those of traditional applications. However, today's disk layout techniques are not adapted to social networking workloads and thus suffer in performance. In this paper, the authors first present disk layout techniques that leverage community structure in the social graph to...

    Provided By University of Illinois

  • White Papers // Dec 2010

    Dynamic Mapping of an as Network Into a Smaller Network of Border Routers

    In this paper the authors present a cross layer routing and congestion control scheme which can map an enterprise network into a smaller network of boarder routers. One of the boarder routers in the scheme called a main node computes the virtual link (tunnel) capacities and corresponding queue size for...

    Provided By University of Illinois

  • White Papers // Jan 2011

    Integrating Dynamic Power Management in Systems With Multiple DVS Components

    Recent embedded computing platforms offer multiple independent clocks for different components involved in processing a single instruction stream, such as CPU and memory, giving rise to a new category of power management policies, called MultiDVS, where the different components can be clocked down to different degrees, independently. This paper presents...

    Provided By University of Illinois

  • White Papers // Oct 2008

    Litearch: An Energy-Centric Software Architecture for Wireless Sensor Networks

    Wireless sensor networks promise an unprecedented potential for observing the physical world. Their battery life, however, is usually the bottleneck that limits application lifetime, a problem that is exacerbated by the disparity between the rapidly growing processing speed and the slowly improving battery capacity. The authors observed the importance of...

    Provided By University of Illinois

  • White Papers // Jan 2011

    A Cross-Layer Routing and Congestion Control for Distributed Systems

    Distributed systems have been widely deployed and used in different fields. The Internet itself with all the challenges it brings is one of the successful distributed systems. There has been a lot of research in the efficient design, implementation and evaluation of distributed systems. One of the research challenges in...

    Provided By University of Illinois

  • White Papers // Nov 2008

    Achieving Privacy and Integrity of Data Aggregation in Wireless Sensor Networks

    Wireless Sensor Networks (WSNs) were originally motivated by military applications, and are becoming integral part of more and more civilian applications to improve quality of life. With current wireless sensor network technology, people will gain advanced knowledge of physical and social systems, and the advent of a ubiquitous sensing era...

    Provided By University of Illinois

  • White Papers // Jun 2010

    An Empirical Study of Reported Bugs in Server Software With Implications for Automated Bug Diagnosis

    Reproducing bug symptoms is a prerequisite for performing automatic bug diagnosis. Do bugs have characteristics that ease or hinder automatic bug diagnosis? In this paper, the authors conduct a thorough empirical study of several key characteristics of bugs that affect reproducibility at the production site. They examine randomly selected bug...

    Provided By University of Illinois

  • White Papers // Dec 2008

    Building a Reliable Operating System

    Despite many decades of research, the management of errors in a live operating system remains a challenging problem. This paper presents CuriOS, an operating system that incorporates several new error management techniques that significantly improve reliability. Errors detected by both hardware and software are signaled using language exception handling mechanisms....

    Provided By University of Illinois

  • White Papers // Jan 2009

    DTorial: An Interactive Tutorial Framework for Blind Users in a Web 2.0 World

    Effective tutorial systems can help promote products by reducing barriers of learning new applications. With dynamic web applications becoming as complex as desktop programs, there is a growing need for online tutorial/help systems. For visually impaired users the key limitations of traditional help systems are poor access to help content...

    Provided By University of Illinois

  • White Papers // Feb 2009

    A Type and Effect System for Deterministic Parallelism in Object-Oriented Languages

    The authors describe a type and effect system for ensuring deterministic semantics in a concurrent object-oriented language. The system provides several new capabilities over previous work, including support for linear arrays (important in parallel update traversals), flexible effect specifications and subtyping (important for, e.g., treebased algorithms), dynamic partitioning into subarrays...

    Provided By University of Illinois

  • White Papers // Feb 2009

    A Catalog of Security-Oriented Program Transformations

    Security requirements change, but the typical way of improving system security by patches is ad hoc and has not produced good results. Security improvements should be systematic, just as new features can be added to software systematically. It would be easier to improve the security of a system if one...

    Provided By University of Illinois

  • White Papers // May 2010

    Novel CAD Techniques for New Challenges in Deep Sub-Micron VLSI Design

    CMOS technology has continuously scaled into deep sub-micron regime. With CMOS scaling, many complex design issues arise. The challenges include, but not limited to, the increasing of interconnect delay and power, exponential growth of leakage power, and rapid growth of design complexity. These challenges motivate the authors to design new...

    Provided By University of Illinois

  • White Papers // Oct 2009

    When WatchDog Meets Coding

    In this paper the authors study the problem of misbehavior detection in wireless networks. A commonly adopted approach is to utilize the broadcasting nature of the wireless medium and have nodes monitor their neighborhood. They call such nodes the Watchdogs. In this paper, they first show that even if a...

    Provided By University of Illinois

  • White Papers // Nov 2009

    Optimal Control in Two-Hop Relay Routing

    In DTN (Delay Tolerant Network) mobile ad-hoc networks, connectivity is not needed any more and packets can arrive at their destination thanks to the mobility of some subset of nodes that carry copies of a packet. A naive approach to forward a packet to the destination is by epidemic routing...

    Provided By University of Illinois

  • White Papers // Nov 2009

    Optimal Strategies for Computing Symmetric Boolean Functions in Collocated Networks

    The authors address the problem of finding optimal strategies for computing Boolean symmetric functions. They consider a collocated network, where each node's transmissions can be heard by every other node. Each node has a Boolean measurement and they wish to compute a given Boolean function of these measurements with zero...

    Provided By University of Illinois

  • White Papers // Nov 2009

    Fundamentals of Large Sensor Networks: Connectivity, Capacity, Clocks and Computation

    Sensor networks potentially feature large numbers of nodes. The nodes can monitor and sense their environment over time, communicate with each other over a wireless network, and process information that they exchange with each other. They differ from data networks in that the network as a whole may be designed...

    Provided By University of Illinois

  • White Papers // Nov 2009

    The Importance, Design and Implementation of a Middleware for Networked Control Systems

    Due to the advancement of computing and communication technology, networked control systems may soon become prevalent in many control applications. While the capability of employing the communication network in the control loop certainly provides many benefits, it also raises several challenges which need to be overcome to utilize the benefits....

    Provided By University of Illinois

  • White Papers // Jan 2012

    Optimizing Quality-of-Information in Cost-Sensitive Sensor Data Fusion

    This paper investigates maximizing quality of information subject to cost constraints in data fusion systems. The authors consider data fusion applications that try to estimate or predict some current or future state of a complex physical world. Examples include target tracking, path planning, and sensor node localization. Rather than optimizing...

    Provided By University of Illinois

  • White Papers // Mar 2012

    Non-Blind Watermarking of Network Flows

    Linking network flows is an important problem in intrusion detection as well as anonymity. Passive traffic analysis can link flows but requires long periods of observation to reduce errors. Active traffic analysis, also known as flow watermarking, allows for better precision and is more scalable. Previous flow watermarks introduce significant...

    Provided By University of Illinois

  • White Papers // May 2012

    Exploiting Opportunistic Overhearing to Improve Performance of Mutual Exclusion in Wireless Ad Hoc Networks

    The authors design two mutual exclusion algorithms for wireless networks. Their mutual exclusion algorithms are distributed token based algorithms which exploit the opportunistic message overhearing in wireless networks. One of the algorithms is based on overhearing of token transmission. In the other algorithm, overhearing of both token and request messages...

    Provided By University of Illinois

  • White Papers // Nov 2011

    Experimental Performance Comparison of Byzantine Fault-Tolerant Protocols for Data Centers

    In this paper, the authors implement and evaluate three different Byzantine Fault-Tolerant (BFT) state machine replication protocols for data centers: BASIC: The classic solution from Pease, Shostak, and Lamport ; Digest: A simplified version of the seminal practical BFT protocol PBFT by Castro and Liskov ; and NCBA: a network...

    Provided By University of Illinois

  • White Papers // Dec 2011

    Capacity of Byzantine Consensus in Capacity Limited Point-to-Point Networks

    In this paper, the authors investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a capacity constraint. They derive an upper bound of the capacity of consensus in general point-to-point networks, and prove its tightness in 4-node complete...

    Provided By University of Illinois

  • White Papers // Mar 2012

    Self-Partitioning Cloud Datastore for Scalable Transaction Processing Proposal

    The authors are designing a new cloud data storage system that will be highly scalable and yet still be able to provide strong data consistency guarantees. Their system extends existing cloud key/value stores with modular components for transaction management and access-based partitioning. They plan to utilize graph theory, clustering algorithms,...

    Provided By University of Illinois

  • White Papers // Jul 2011

    Multi-Core and Network Aware MPI Topology Functions

    MPI standard offers a set of topology-aware interfaces that can be used to construct graph and Cartesian topologies for MPI applications. These interfaces have been mostly used for topology construction and not for performance improvement. To optimize the performance, in this paper the authors use graph embedding and node/network architecture...

    Provided By University of Illinois

  • White Papers // Jan 2011

    Minimizing MPI Resource Contention in Multithreaded Multicore Environments

    With the ever-increasing numbers of cores per node in high-performance computing systems, a growing number of applications are using threads to exploit shared memory within a node and MPI across nodes. This hybrid programming model needs efficient support for multithreaded MPI communication. In this paper, the authors describe the optimization...

    Provided By University of Illinois

  • White Papers // Jun 2010

    PMI: A Scalable Parallel Process-Management Interface for Extreme-Scale Systems

    Parallel programming models on large-scale systems require a scalable system for managing the processes that make up the execution of a parallel program. The process-management system must be able to launch millions of processes quickly when starting a parallel program and must provide mechanisms for the processes to exchange the...

    Provided By University of Illinois

  • White Papers // Jun 2010

    Enabling Concurrent Multithreaded MPI Communication on Multicore Petascale Systems

    With the ever-increasing numbers of cores per node on HPC systems, applications are increasingly using threads to exploit the shared memory within a node, combined with MPI across nodes. Achieving high performance when a large number of concurrent threads make MPI calls is a challenging task for an MPI implementation....

    Provided By University of Illinois

  • White Papers // Aug 2009

    MPI on a Million Processors

    Petascale machines with close to a million processors will soon be available. Although MPI is the dominant programming model today, some researchers and users wonder (and perhaps even doubt) whether MPI will scale to such large processor counts. In this paper, the authors examine this issue of how scalable is...

    Provided By University of Illinois

  • White Papers // Aug 2010

    MPI at Exascale

    With petascale systems already available, researchers are devoting their attention to the issues needed to reach the next major level in performance, namely, exascale. Explicit message passing using the Message Passing Interface (MPI) is the most commonly used model for programming petascale systems today. In this paper, the authors investigate...

    Provided By University of Illinois

  • White Papers // Apr 2012

    An Architecture for Dynamic Service-Oriented Computing in Networked Embedded Systems

    Software development in real-time and embedded systems has traditionally focused on stand-alone applications with static models for scheduling and resource allocation. The authors' goal is to facilitate the development of embedded applications in an open system, where tasks and resources arrive and leave dynamically, and their execution is concurrent. They...

    Provided By University of Illinois

  • White Papers // Apr 2012

    Scoped Synchronization Constraints for Large Scale Actor Systems

    Very large scale systems of autonomous concurrent objects (Actors) require coordination models to meet two competing goals. On the one hand, the coordination models must allow Actors to dynamically modify protocols in order to adapt to requirement changes over the, likely extensive, lifetime of the system. On the other hand,...

    Provided By University of Illinois

  • White Papers // Mar 2012

    OSA: An Optical Switching Architecture for Data Center Networks With Unprecedented Flexibility

    Data Center Networks (DCNs) form the backbone infrastructure of many large-scale enterprise applications as well as emerging cloud computing providers. This paper describes the design, implementation and evaluation of OSA, a novel optical switching architecture for DCNs. Leveraging runtime reconfigurable optical devices, OSA dynamically changes its topology and link capacities,...

    Provided By University of Illinois

  • White Papers // Jun 2011

    All-Optical Switching Data Center Network Supporting 100Gbps Upgrade and Mixed-Line-Rate Interoperability

    Over an 8-rack, 32-server WDM-based all-optical switching data center network, the authors show the network upgrade using single-wavelength or multi-wavelength 100 Gbps signals, and further show the mixed-line-rate interoperability between 100 Gbps and 10 Gbps signals. As one of the fast growing sectors in the internet applications, Data Center Networks...

    Provided By University of Illinois