University of Illinois

Displaying 1-40 of 225 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

    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 // 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 // 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

    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

    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

    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

    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 // 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 // May 2011

    Risk Aware Resource Allocation for Clouds

    Cloud computing offers on-demand access to large-scale computing resources in a pay-as-you go manner. Market-based resource allocation mechanisms are gaining popularity among commercial cloud providers to deal with dynamically fluctuating resource demands. For example, the recently introduced Amazon EC2 spot instances allow users to bid for computing resources and thus...

    Provided By University of Illinois

  • White Papers // Jul 2011

    CloudInsight: Shedding Light on the Cloud

    Cloud computing provides a revolutionary new computing paradigm for deploying enterprise applications and Internet services. Rather than operating their own data centers, today cloud users run their applications on the remote cloud infrastructures that are owned and managed by cloud providers. However, the cloud computing paradigm also introduces some new...

    Provided By University of Illinois

  • White Papers // Jan 2010

    Parallel Objects: Virtualization and In-Process Components

    Developing complex parallel applications that run efficiently on large parallel machines is dif-cult because the programmer has to handle many interrelated issues. Two issues that are of interest here are the specification of the parallel algorithm, and its efficient parallel implementation. Most current parallel programming models require the programmer to...

    Provided By University of Illinois

  • White Papers // Jan 2011

    MOve: Design of an Application-Malleable Overlay

    Peer-to-peer overlays allow distributed applications to work in a wide-area, scalable, and fault-tolerant manner. However, most structured and unstructured overlays present in literature today are inflexible from the application viewpoint. In other words, the application has no control over the structure of the overlay itself. This paper proposes the concept...

    Provided By University of Illinois

  • White Papers // Jan 2011

    A Virtual Instruction Set Interface for Operating System Kernels

    In this paper, the authors propose and evaluate a virtual instruction set interface between an Operating System (OS) kernel and a general purpose processor architecture. This interface is a set of operations added to a previously proposed virtual instruction set architecture called LLVA (Low Level Virtual Architecture) and can be...

    Provided By University of Illinois

  • White Papers // May 2009

    Joint Resource Allocation and Admission Control in Wireless Mesh Networks

    Many next generation applications (such as video flows) are likely to have associated minimum data rate requirements to ensure satisfactory quality as perceived by end-users. While there have been prior approaches on supporting Quality-of-Service (QoS) in mesh networks, they have largely ignored the issues that arise due to self-interference, the...

    Provided By University of Illinois

  • White Papers // Jul 2010

    MalStone: Towards a Benchmark for Analytics on Large Data Clouds

    Developing data mining algorithms that are suitable for cloud computing platforms is currently an active area of research, as is developing cloud computing platforms appropriate for data mining. Currently, the most common benchmark for cloud computing is the Terasort (and related) benchmarks. Although the Terasort Benchmark is quite useful, it...

    Provided By University of Illinois

  • White Papers // Nov 2008

    CuriOS: Improving Reliability through Operating System Structure

    An error that occurs in a microkernel operating system service can potentially result in state corruption and service failure. A simple restart of the failed service is not always the best solution for reliability. Blindly restarting a service which maintains client-related state such as session information results in the loss...

    Provided By University of Illinois

  • White Papers // Jan 2011

    Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on an Acyclic Roadmap

    The authors present an algorithm that computes the complete set of Pareto-optimal coordination strategies for two translating polygonal robots in the plane. A collision-free acyclic roadmap of piecewise-linear paths is given on which the two robots move. The robots have a maximum speed and are capable of instantly switching between...

    Provided By University of Illinois

  • White Papers // Jan 2011

    Automatically Mapping Code on an Intelligent Memory Architecture

    This paper presents an algorithm to automatically map code on a generic intelligent memory system that consists of a host processor and a simpler memory processor. To achieve high performance with this type of architecture, code needs to be partitioned and scheduled such that each section is assigned to the...

    Provided By University of Illinois

  • White Papers // Jun 2009

    Memory Safety for Low-Level Software/Hardware Interactions

    Systems that enforce memory safety for today's operating system kernels and other system software do not account for the behavior of low-level software/hardware interactions such as memory-mapped I/O, MMU configuration, and context switching. Bugs in such low-level interactions can lead to violations of the memory safety guarantees provided by a...

    Provided By University of Illinois

  • White Papers // Dec 2009

    Utility Maximization for Delay Constrained QoS in Wireless

    This paper studies the problem of utility maximization for clients with delay based QoS requirements in wireless networks. The authors adopt a model used in a previous work that characterizes the QoS requirements of clients by their delay constraints, channel reliabilities, and timely throughput requirements. In this work, they assume...

    Provided By University of Illinois

  • White Papers // Jan 2011

    Deafness: A MAC Problem in Ad Hoc Networks When Using Directional Antennas

    This paper addresses deafness - a problem that appears when MAC protocols are designed using directional antennas. Briefly, deafness is caused when a transmitter fails to communicate to its intended receiver, because the receiver is beam formed towards a direction away from the transmitter. Existing CSMA/CA protocols rely on the...

    Provided By University of Illinois

  • White Papers // Jan 2011

    Adaptive Offloading Inference for Delivering Applications in Pervasive Computing Environments

    Pervasive computing allows a user to access an application on heterogeneous devices continuously and consistently. However, it is challenging to deliver complex applications on resource-constrained mobile devices, such as cell phones and PDAs. Different approaches, such as application-based or system-based adaptations, have been proposed to address the problem. However, existing...

    Provided By University of Illinois

  • White Papers // Jan 2011

    An Empirical Comparison of Automated Generation and Classification Techniques for Object-Oriented Unit Testing

    Testing involves two major activities: generating test inputs and determining whether they reveal faults. Automated test generation techniques include random generation and symbolic execution. Automated test classification techniques include ones based on uncaught exceptions and violations of operational models inferred from manually provided tests. Previous research on unit testing for...

    Provided By University of Illinois

  • White Papers // Dec 2010

    Style Migration And The Cross-Section Of Stock Returns

    Stocks experiencing sharp changes in their style characteristics present unique opportunities to examine how investors view style information in making their portfolio allocation decisions. The authors examine the average returns of such stocks - which they call "Style migrants" - and the covariation of the returns of style migrants with...

    Provided By University of Illinois

  • White Papers // Dec 2009

    Towards Interactive Debugging for ISP Networks

    The extreme complexity of Internet software leads to a rich variety of hard-to-isolate failure modes and anomalies. Research on debugging modern networked systems has thus far focused on "Removing the human from the loop" by automatically detecting problems that violate predefined conditions. Here, the authors argue for a very different...

    Provided By University of Illinois

  • White Papers // Sep 2010

    Debugging Large Scale Applications in a Virtualized Environment

    With the advent of petascale machines with hundreds of thousands of processors, debugging parallel applications is becoming an increasing challenge. Aside from the complicated debugging techniques required to debug applications at such scale, it is often difficult to gain access to these machines for a sufficient period of time, if...

    Provided By University of Illinois

  • White Papers // Nov 2010

    Cloud Resource Allocation Games

    Cloud computing is a newly emerging paradigm in which a client pays as it uses computing resources owned by a cloud provider. Since multiple clients share the cloud's resources, they could potentially interfere with each others' tasks. Current pricing and resource allocation mechanisms are quite preliminary (E.g., Fixed Pricing In...

    Provided By University of Illinois

  • White Papers // May 2009

    Security Policy Implementation Strategies for Common Carrier Monitoring Service Providers

    There are increasing capabilities and demands for the remote monitoring of homes and their occupants. There are a variety of options for the architecture of such monitoring systems entailing trade-offs between privacy, security, cost, manageability and other factors. This paper considers the virtues of building Monitoring Service Providers (MSPs) based...

    Provided By University of Illinois

  • White Papers // Sep 2010

    Proteus: A Topology Malleable Data Center Network

    Full-bandwidth connectivity between all servers of a data center may be necessary for all-to-all traffic patterns, but such interconnects suffer from high cost, complexity, and energy consumption. Recent work has argued that if all-to-all traffic is uncommon, oversubscribed network architectures that can adapt the topology to meet traffic demands, are...

    Provided By University of Illinois

  • White Papers // Sep 2009

    OCast: Optimal Multicast Routing Protocol for Wireless Sensor Networks

    In this paper, authors describe oCast, an energy-optimal multicast routing protocol for wireless sensor networks. The general minimum-energy multicast problem is NP-hard. Intermittent connectivity that results from duty-cycling further complicates the problem. Nevertheless, authors present both a centralized and distributed algorithm that are provably optimal when the number of destinations...

    Provided By University of Illinois

  • White Papers // Jan 2010

    An XML-Based Quality of Service Enabling Language for the Web

    In this paper, the authors introduce an XML-based Hierarchical QoS Markup Language, called HQML, to enhance distributed multimedia applications on the World Wide Web (WWW) with Quality of Service (QoS) capability. The design of HQML is based on two observations: the absence of a systematic QoS specification language, that can...

    Provided By University of Illinois

  • White Papers // Sep 2010

    DIAMOND: Correlation-Based Anomaly Monitoring Daemon for DIME

    Distributed Interactive Multimedia Environments (DIMEs) show important dependency constraints between application and underlying system components over time. For example, the video frame rate and the underlying bandwidth usage have a strong performance dependency. Performance dependencies must also be considered among distributed components. These dependencies over a time-span form correlation relationships....

    Provided By University of Illinois

  • White Papers // Jan 2011

    DagStream: Locality Aware and Failure Resilient Peer-to-Peer Streaming

    Live Peer to Peer (P2P) media streaming faces many challenges such as peer unreliability and bandwidth heterogeneity. To effectively address these challenges, general "Mesh" based P2P streaming architectures have recently been adopted. Mesh-based systems allow peers to aggregate bandwidth from multiple neighbors, and dynamically adapt to changing network conditions and...

    Provided By University of Illinois

  • White Papers // Jan 2011

    Understanding BGP Session Robustness in Bandwidth Saturation Regime

    The reliability and robustness of the Border Gateway Protocol (BGP) play very important roles in achieving highly stable and prompt Internet data communication. The present BGP uses TCP/IP to exchange routing control information. These routing control messages are usually not differentiated from the normal data packets in Internet packet forwarding,...

    Provided By University of Illinois

  • White Papers // Jan 2011

    Channel-Relay Price Pair: Towards Arbitrating Incentives in Wireless Ad Hoc Networks

    Cooperation in wireless ad hoc networks has two-fold implications. First, each wireless node does not excessively and greedily inject traffic to the shared wireless channel. Second, intermediate nodes voluntarily relay traffic for upstream nodes towards the destination at the cost of its own private resource. Such an assumption supports almost...

    Provided By University of Illinois

  • White Papers // Jan 2011

    EnviroStore: A Cooperative Storage System for Disconnected Operation in Sensor Networks

    This paper presents a new cooperative storage system for sensor networks geared for disconnected operation (where sensor nodes do not have a connected path to a base-station). The goal of the system is to maximize its data storage capacity by appropriately distributing storage utilization and opportunistically of loading data to...

    Provided By University of Illinois

  • White Papers // Jul 2009

    Addressing Safety and Security Contradictions in Cyber-Physical Systems

    Modern cyber-physical systems are found in important domains such as automobiles, medical devices, building automation, avionics, etc. Hence, they are increasingly prone to security violations. Often such vulnerabilities occur as a result of contradictory requirements between the safety/real-time properties and the security needs of the system. In this paper the...

    Provided By University of Illinois

  • White Papers // Jan 2011

    On the Use of Compilers in DSP Laboratory Instruction

    A modern DSP laboratory course should teach students how to quickly develop efficient applications using a mixture of C and assembly instructions. Since typical irregular DSP microprocessor architectures present some challenges to traditional optimizing compilers, the authors introduced a novel new interactive optimizing compiler, VISTA, in a DSP laboratory course...

    Provided By University of Illinois

  • White Papers // Dec 2009

    Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks

    Recently, it has been shown that CSMA-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can never occur. In addition, simulation results indicate that the delay performance of these algorithms can be quite...

    Provided By University of Illinois

  • White Papers // Jul 2009

    Attribute-Sets: A Practically Motivated Enhancement to Attribute-Based Encryption

    In distributed systems users need to share sensitive objects with others based on the recipients' ability to satisfy a policy. Attribute-Based Encryption (ABE) is a new paradigm where such policies are specified and cryptographically enforced in the encryption algorithm itself. Ciphertext-Policy ABE (CP-ABE) is a form of ABE where policies...

    Provided By University of Illinois

  • White Papers // Nov 2010

    Attribute-Based Signatures

    The authors introduce Attribute-Based Signatures (ABS), a versatile primitive that allows a party to sign a message with ne-grained control over identifying information. In ABS, a signer, who possesses a set of attributes from the authority, can sign a message with a predicate that is satisfied by his attributes. The...

    Provided By University of Illinois

  • White Papers // Aug 2009

    On Approximating Gaussian Relay Networks With Deterministic Networks

    The authors examine the extent to which Gaussian relay networks can be approximated by deterministic networks, and present two results, one negative and one positive. The gap between the capacities of a Gaussian relay network and a corresponding linear deterministic network can be unbounded. The key reasons are that the...

    Provided By University of Illinois

  • White Papers // Aug 2009

    GPU Clusters for High-Performance Computing

    Large-scale GPU clusters are gaining popularity in the scientific computing community. However, their deployment and production use are associated with a number of new challenges. In this paper, the authors present the efforts to address some of the challenges with building and running GPU clusters in HPC environments. They touch...

    Provided By University of Illinois

  • White Papers // Feb 2011

    Distributed Resource Allocation for Proportional Fairness in Multi-Band Wireless Systems

    A challenging problem in multi-band multi-cell self-organized wireless systems, such as multi-channel Wi-Fi networks, femto/pico cells in 3G/4G cellular networks, and more recent wireless networks over TV white spaces, is of distributed resource allocation. This involves four components: channel selection, client association, channel access, and client scheduling. In this paper,...

    Provided By University of Illinois

  • White Papers // Jul 2009

    Reciprocity in Linear Deterministic Networks Under Linear Coding

    The linear deterministic model has been used recently to get a first order understanding of many wireless communication network problems. In many of these cases, it has been pointed out that the capacity regions of the network and its reciprocal (where the communication links are reversed and the roles of...

    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 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