California Institute of Technology

Displaying 1-40 of 76 results

  • White Papers // May 2013

    Power System Dynamics as Primal-Dual Algorithm for Optimal Load Control

    The authors formulate an Optimal Load Control (OLC) problem in power networks where the objective is to minimize the aggregate cost of tracking an operating point subject to power balance over the network. They prove that the swing dynamics and the branch power flows, coupled with frequency-based load control, serve...

    Provided By California Institute of Technology

  • White Papers // Feb 2013

    Rateless Resilient Network Coding Against Byzantine Adversaries

    In this paper, the authors consider rateless network error correction codes for reliable multicast in the presence of adversarial errors. Most existing network error correction codes are designed for a given network capacity and maximum number of errors known a priori to the encoder and decoder. However, in certain practical...

    Provided By California Institute of Technology

  • White Papers // Jan 2013

    Outer Bounds on the Error Correction Capacity Region for Non-Multicast Networks

    In this paper the authors study the capacity regions of non-multicast networks that are susceptible to adversarial errors. They derive outer bounds on the error correction capacity region and give a family of single- and two-source two-sink 3-layer networks for which these bounds are tight. In this paper they consider...

    Provided By California Institute of Technology

  • White Papers // Sep 2012

    Peer-to-Peer Anonymous Networking Using Coding

    In this paper, the authors consider design and analysis of coding-based anonymous routing systems in Peer-To-Peer (P2P) overlay networks. An unknown subset of participating nodes is adversarial, and can collude to try to identify the communicating nodes through passive observations. The paper considers sub-graph setup in the absence of a...

    Provided By California Institute of Technology

  • White Papers // Aug 2012

    Cryptography From Tensor Problems

    This paper describes a proposal for a new trap-door one-way function of the multivariate-quadratic type. It was first posted to the IACR preprint server in May 2012. Subsequently, Enrico Thomae and Christopher Wolf were able to determine that a small-minors MinRank attack works against this scheme. The author would like...

    Provided By California Institute of Technology

  • White Papers // May 2012

    Joint MAX-SER-Minimized DFE Transceiver Design With Bit Allocation for Broadcast Channels

    This paper addresses the joint design problem of bit allocation and Decision Feedback Equalizer (DFE) transceiver for Multi-Input Multi-Output (MIMO) BroadCast (BC) channels. Channel State Information (CSI) is assumed to be available both at the transmitter and receivers. The transceiver is designed by minimizing MAXimum Symbol Error Rate (MAX-SER) under...

    Provided By California Institute of Technology

  • White Papers // May 2012

    Erasure Coding for Real-Time Streaming

    The authors consider a real-time streaming system where messages are created sequentially at the source, and are encoded for transmission over a packet erasure channel. Each message must subsequently be decoded at the receiver within a given delay from its creation time. They consider code design and maximum message rates...

    Provided By California Institute of Technology

  • White Papers // Apr 2012

    Closing the Gap Between Specification and Programming: Vdm++ and Scala

    The authors argue that a modern programming language such as Scala offers a level of succinctness, which makes it suitable for program and systems specification as well as for high-level programming. They illustrate this by comparing the language with the Vdm++ specification language. The comparison also identifies areas where Scala...

    Provided By California Institute of Technology

  • White Papers // Feb 2012

    Where Specification and Programming Meet

    The authors argue that a modern programming language such as Scala has achieved a level of succinctness, which makes it suitable for program/systems specification, hence able to take the role that early very elegant specification languages, way ahead of their time, served. They illustrate this by comparing the VDM++ specification...

    Provided By California Institute of Technology

  • White Papers // Jan 2012

    Online Algorithms for Geographical Load Balancing

    It has recently been proposed that Internet energy costs, both monetary and environmental, can be reduced by exploiting temporal variations and shifting processing to data centers located in regions where energy currently has low cost. Lightly loaded data centers can then turn off surplus servers. This paper studies online algorithms...

    Provided By California Institute of Technology

  • White Papers // Nov 2011

    Distributed Distortion Optimization for Correlated Sources With Network Coding

    The authors consider lossy data compression in capacity-constrained networks with correlated sources. They derive, using dual decomposition, a distributed algorithm that maximizes an aggregate utility measure defined in terms of the distortion levels of the sources. No coordination among sources is required; each source adjusts its distortion level according to...

    Provided By California Institute of Technology

  • White Papers // Oct 2011

    Privacy Preserving Data Aggregating With Multiple Access Channel

    The authors consider the scenario in which a set of users want to compute an aggregate function of their messages at a message center. The users communicate with the message center over a multiple access channel with fading, where the fading states of the channels from individual receivers are unknown...

    Provided By California Institute of Technology

  • White Papers // Oct 2011

    Erasure Correction for Nested Receivers

    The authors consider packet erasure or error correction coding for a nested receiver structure, where each receiver receives a subset of the packets received by the next receiver. This type of structure arises, for instance, with temporal demands, where each receiver corresponds to a deadline by which certain information must...

    Provided By California Institute of Technology

  • White Papers // Oct 2011

    Network Coding: Is zero error always possible?

    In the network coding paradigm, internal nodes of the network may mix the information content of the received packets before forwarding them. This mixing (or encoding) of information has been studied extensively over the last decade. While network coding in the multicast setting is well understood, far less is known...

    Provided By California Institute of Technology

  • White Papers // Sep 2011

    Online Dynamic Capacity Provisioning in Data Centers

    Power consumption imposes a significant cost for implementing cloud services, yet much of that power is used to maintain excess service capacity during periods of low load. In this paper, the authors study how to avoid such waste via an online dynamic capacity provisioning. They overview recent results showing that...

    Provided By California Institute of Technology

  • White Papers // Sep 2011

    Energy Efficient Opportunistic Network Coding for Unicast Flows in Wireless Networks

    Due to the broadcast nature of wireless channels, a packet sent by one node may be "Overheard" by several nearby nodes. Rather than taking these overheard packets as interference, multiple-reception of packet can be exploited to improve network performance. In this paper, the authors consider energy efficient network coding design...

    Provided By California Institute of Technology

  • White Papers // Jun 2011

    On Equivalence for Networks of Noisy Channels Under Byzantine Attacks

    The authors consider the problem of finding network coding capacities of networks of independent point-to-point channels in the presence of a Byzantine adversary. They assume that the adversary knows all messages, and noise values and the code used to communicate across the network. The adversary controls an unknown subset of...

    Provided By California Institute of Technology

  • White Papers // May 2011

    On the Equivalence of Shannon Capacity and Stable Capacity in Networks With Memoryless Channels

    An equivalence result is established between the Shannon capacity and the stable capacity of communication networks. Given a discrete-time network with memoryless, time-invariant, discrete-output channels, it is proved that the Shannon capacity equals the stable capacity. The results treat general demands (e.g., multiple unicast demands) and apply even when neither...

    Provided By California Institute of Technology

  • White Papers // Apr 2011

    Error Estimating Codes With Constant Overhead: A Random Walk Approach

    The paper studies the construction of Error-Estimating Codes (EEC), which estimate the Bit-Error-Rate (BER) of packet transmissions. The concept of EEC was first proposed by Chen et.al, who provided a construction based on group sampling, which term Group-Sampling Error-Estimating Codes (GSEEC). In this paper, RAndom walK based Error-Estimating codes (RAKEE)...

    Provided By California Institute of Technology

  • White Papers // Mar 2011

    On the Impact of a Single Edge on the Network Coding Capacity

    In this paper, the authors study the effect of a single link on the capacity of a network of error-free bit pipes. More precisely, they study the change in network capacity that results when they remove a single link. In a recent result, they proved that if all the sources...

    Provided By California Institute of Technology

  • White Papers // Feb 2011

    Separation of Source-Network Coding and Channel Coding in Wireline Networks

    In this paper the authors prove the separation of source-network coding and channel coding in a wire-line network, which is a network of memory-less point-to-point finite-alphabet channels used to transmit correlated sources. In deriving this result, they also prove that in a general memory-less network with correlated sources lossless and...

    Provided By California Institute of Technology

  • White Papers // Feb 2011

    The Price of Selfishness in Network Coding

    A game theoretic framework is introduced for studying selfish user behavior in shared wireless networks. Specifically, the investigation treats an n-unicast problem in a wireless network that employs a restricted form of network coding called reverse carpooling. Each unicast session independently chooses a route from its transmitter to its receiver....

    Provided By California Institute of Technology

  • White Papers // Jan 2011

    Optimal Demand Response Based on Utility Maximization in Power Networks

    Demand side management will be a key component of future smart grid that can help reduce peak load and adapt elastic demand to fluctuating generations. In this paper, the authors consider households that operate different appliances including PHEVs and batteries and propose a demand response approach based on utility maximization....

    Provided By California Institute of Technology

  • White Papers // Jan 2011

    Mutual Fund Return Predictability In Partially Segmented Markets

    This paper studies the predictability of European equity mutual fund performance during a period when European stock markets were partially segmented. Specifically, the authors use macroeconomic variables to predict the performance of European equity funds, including Pan-European, country, and sector funds. They find that macro-variables are useful in locating funds...

    Provided By California Institute of Technology

  • White Papers // Jan 2011

    Cooperative Diversity in Wireless Relay Networks with Multiple-Antenna Nodes

    It is known that multiple antennas can greatly increase the capacity and reliability of a wireless communication link in a fading environment using space-time coding. Recently, with the increasing interest in ad hoc networks, researchers have been looking for methods to exploit spatial diversity using the antennas of different users...

    Provided By California Institute of Technology

  • White Papers // Jan 2011

    Buffer Coding for Asymmetric Multi-Level Memory

    Certain storage media such as flash memories use write-asymmetric, multi-level storage elements. In such media, data is stored in a multi-level memory cell the contents of which can only be increased, or reset. The reset operation is expensive and should be delayed as much as possible. Mathematically, they consider the...

    Provided By California Institute of Technology

  • White Papers // Jan 2011

    Diversity Coloring for Distributed Storage in Mobile Networks

    Storing multiple copies of files is crucial for ensuring quality of service for data storage in mobile networks. This paper proposes a new scheme, called the K-out-of-N file distribution scheme, for the placement of files. In this scheme files are splitted, and Reed-Solomon codes or other Maximum Distance Seperable (MDS)...

    Provided By California Institute of Technology

  • White Papers // Nov 2010

    Network RS Codes For Efficient Network Adversary Localization

    Network error localizations uses end-to-end observations to localize random or adversarial glitches. For error localization under Random Linear Network Codes (RLNCs) the schemes proposed in previous literatures require the priori knowledge of the network topology. Moreover, adversarial error localization is proved computationally intractable under RLNCs. The goal of current paper...

    Provided By California Institute of Technology

  • White Papers // Nov 2010

    Prototyping a Domain-Specific Language for Monitor and Control Systems

    This paper describes a domain-specific language prototype developed for the NASA Constellation launch control system project. A key element of the launch control system architecture, the domain-specific language prototype is a specialized monitor and control language composed of constructs for specifying and programming test, checkout, and launch processing applications for...

    Provided By California Institute of Technology

  • White Papers // Oct 2010

    DAME: A Web Oriented Infrastructure for Scientific Data Mining & Exploration

    Nowadays, many scientific areas share the same need of being able to deal with massive and distributed datasets and to perform on them complex knowledge extraction tasks. This simple consideration is behind the international efforts to build virtual organizations such as, for instance, the Virtual Observatory (VObs). DAME (DAta Mining...

    Provided By California Institute of Technology

  • White Papers // Oct 2010

    On Equivalence Between Network Topologies

    One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for bounding the capacity of general networks, but their computational complexity grows very quickly with the size of the network. This motivates one to propose...

    Provided By California Institute of Technology

  • White Papers // Aug 2010

    Rebuilding for Array Codes in Distributed Storage Systems

    In distributed storage systems that use coding, the issue of minimizing the communication required to rebuild a storage node after a failure arises. The authors consider the problem of repairing an erased node in a distributed storage system that uses an EVENODD code. EVENODD codes are Maximum Distance Separable (MDS)...

    Provided By California Institute of Technology

  • White Papers // Aug 2010

    The Average Response Time in a Heavytraffic SRPT Queue

    Shortest Remaining Processing Time first (SRPT) has long been known to optimize the queue length distribution and the mean response time (a.k.a. flow time, sojourn time). As such, it has been the focus of a wide body of analysis. However, results about the heavy-traffic behavior of SRPT have only recently...

    Provided By California Institute of Technology

  • White Papers // Aug 2010

    Aspect-Oriented Instrumentation With GCC

    The authors present the Inter-Aspect instrumentation framework for GCC, a widely used compiler infrastructure. The addition of plug-in support in the latest release of GCC makes it an attractive platform for runtime instrumentation, as GCC plug-ins can directly add instrumentation by transforming the compiler's intermediate representation. Such transformations, however, require...

    Provided By California Institute of Technology

  • White Papers // Aug 2010

    Design of Passively Controllable Smart Antennas for Wireless Sensor Networks

    This paper deals with devising a secure, power-efficient, beam-steerable and on-chip transmission system for wireless sensor networks. A Passively Controllable Smart (PCS) antenna system is introduced, which can be programmed to generate different radiation patterns at the far field by adjusting its variable passive controller at every signal transmission. In...

    Provided By California Institute of Technology

  • White Papers // Jul 2010

    Symmetric Allocations for Distributed Storage

    The authors consider the problem of optimally allocating a given total storage budget in a distributed storage system. A source has a data object which it can code and store over a set of storage nodes; it is allowed to store any amount of coded data in each node, as...

    Provided By California Institute of Technology

  • White Papers // Jul 2010

    Two Market Models for Demand Response in Power Networks

    In this paper, the authors consider two abstract market models for designing demand response to match power supply and shape power demand, respectively. They characterize the resulting equilibria in competitive as well as oligopolistic markets, and propose distributed demand response algorithms to achieve the equilibria. The models serve as a...

    Provided By California Institute of Technology

  • White Papers // Jul 2010

    On Secure Network Coding With Unequal Link Capacities and Restricted Wiretapping Sets

    The authors address secure network coding over networks with unequal link capacities in the presence of a wiretapper who has only access to a restricted number of k links in the network. Previous results show that for the case of equal link capacities and unrestricted wiretapping sets, the secrecy capacity...

    Provided By California Institute of Technology

  • White Papers // Jul 2010

    On the Delay Advantage of Coding in Packet Erasure Networks

    The authors consider the delay of network coding compared to routing for a family of simple networks with parallel links. They investigate the sub-linear term in the block delay required for unicasting n packets and show that there is an unbounded gap between network coding and routing. This problem turns...

    Provided By California Institute of Technology

  • White Papers // Jun 2010

    Programmable Antenna Design Using Convex Optimization

    This paper presents an application of convex optimization and algebraic geometry in devising secure, power-efficient, beam-steerable, and on-chip transmission systems for wireless networks. First, the authors introduce a Passively Controllable Smart (PCS) antenna system that can be programmed to generate different radiation patterns in far field by adjusting its variable...

    Provided By California Institute of Technology

  • White Papers // Aug 2012

    Cryptography From Tensor Problems

    This paper describes a proposal for a new trap-door one-way function of the multivariate-quadratic type. It was first posted to the IACR preprint server in May 2012. Subsequently, Enrico Thomae and Christopher Wolf were able to determine that a small-minors MinRank attack works against this scheme. The author would like...

    Provided By California Institute of Technology

  • White Papers // May 2013

    Power System Dynamics as Primal-Dual Algorithm for Optimal Load Control

    The authors formulate an Optimal Load Control (OLC) problem in power networks where the objective is to minimize the aggregate cost of tracking an operating point subject to power balance over the network. They prove that the swing dynamics and the branch power flows, coupled with frequency-based load control, serve...

    Provided By California Institute of Technology

  • White Papers // Feb 2013

    Rateless Resilient Network Coding Against Byzantine Adversaries

    In this paper, the authors consider rateless network error correction codes for reliable multicast in the presence of adversarial errors. Most existing network error correction codes are designed for a given network capacity and maximum number of errors known a priori to the encoder and decoder. However, in certain practical...

    Provided By California Institute of Technology

  • White Papers // Jan 2010

    Achievable Strategies for General Secure Network Coding

    This paper considers secure network coding over networks with restricted wiretapping sets and unequal link capacities in the presence of a wiretapper that can wiretap any subset of k links. In particular, the authors consider networks with point-to-point erasure channels. Existing results for wireline networks show that for the case...

    Provided By California Institute of Technology

  • White Papers // Apr 2010

    Issues in Peer-to-Peer Networking: A Coding Optimization Approach

    In this paper the authors consider a linear optimization approach for studying download finish times in peer-to-peer networks that allow but do not require coding. They demonstrate that using the network coding framework simplifies analysis even in scenarios where the optimal solution does not require coding. For example, they use...

    Provided By California Institute of Technology

  • White Papers // Jul 2010

    On Secure Network Coding With Unequal Link Capacities and Restricted Wiretapping Sets

    The authors address secure network coding over networks with unequal link capacities in the presence of a wiretapper who has only access to a restricted number of k links in the network. Previous results show that for the case of equal link capacities and unrestricted wiretapping sets, the secrecy capacity...

    Provided By California Institute of Technology

  • White Papers // Jan 2013

    Outer Bounds on the Error Correction Capacity Region for Non-Multicast Networks

    In this paper the authors study the capacity regions of non-multicast networks that are susceptible to adversarial errors. They derive outer bounds on the error correction capacity region and give a family of single- and two-source two-sink 3-layer networks for which these bounds are tight. In this paper they consider...

    Provided By California Institute of Technology

  • White Papers // Jul 2010

    Symmetric Allocations for Distributed Storage

    The authors consider the problem of optimally allocating a given total storage budget in a distributed storage system. A source has a data object which it can code and store over a set of storage nodes; it is allowed to store any amount of coded data in each node, as...

    Provided By California Institute of Technology

  • White Papers // Mar 2011

    On the Impact of a Single Edge on the Network Coding Capacity

    In this paper, the authors study the effect of a single link on the capacity of a network of error-free bit pipes. More precisely, they study the change in network capacity that results when they remove a single link. In a recent result, they proved that if all the sources...

    Provided By California Institute of Technology

  • White Papers // Oct 2011

    Privacy Preserving Data Aggregating With Multiple Access Channel

    The authors consider the scenario in which a set of users want to compute an aggregate function of their messages at a message center. The users communicate with the message center over a multiple access channel with fading, where the fading states of the channels from individual receivers are unknown...

    Provided By California Institute of Technology

  • White Papers // Oct 2011

    Erasure Correction for Nested Receivers

    The authors consider packet erasure or error correction coding for a nested receiver structure, where each receiver receives a subset of the packets received by the next receiver. This type of structure arises, for instance, with temporal demands, where each receiver corresponds to a deadline by which certain information must...

    Provided By California Institute of Technology

  • White Papers // Nov 2009

    On Combining Information-Theoretic and Cryptographic Approaches to Network Coding Security Against the Pollution Attack

    In this paper the authors consider the pollution attack in network coded systems where network nodes are computationally limited. They consider the combined use of cryptographic signature based security and information theoretic network error correction and propose a fountain-like network error correction code construction suitable for this purpose. In this...

    Provided By California Institute of Technology

  • White Papers // May 2009

    Rate Regions for Coherent and Noncoherent Multisource Network Error Correction

    Network coding has emerged as a powerful technique to distribute information over networks. However, in unreliable or adversarial networks, due to error propagation in the network even a single error on a network link may lead to a corruption of many received packets at the destination nodes. In this paper...

    Provided By California Institute of Technology

  • White Papers // May 2009

    On Noncoherent Correction of Network Errors and Erasures With Random Locations

    The authors consider the problem of correcting errors and erasures with network coding. Unlike existing works which consider performance limits for worst-case locations of given numbers of errors and erasures, they consider the performance of given (not necessarily optimal) coding and forwarding strategies for given (not necessarily worst-case) models of...

    Provided By California Institute of Technology

  • White Papers // Apr 2009

    On Multiple Access Random Medium Access Control

    In this paper, the authors develop a new class of medium access control protocol, which allows each user to transmit at different data rates chosen randomly from an appropriately determined set of rates. By using successive interference cancellation, multiple packets can be received simultaneously. In slotted Aloha type Gaussian networks,...

    Provided By California Institute of Technology

  • White Papers // Oct 2009

    Searching for Minimum Storage Regenerating Codes

    Regenerating codes allow distributed storage systems to recover from the loss of a storage node while transmitting the minimum possible amount of data across the network. The authors present a systematic computer search for optimal systematic regenerating codes. To search the space of potential codes, they reduce the potential search...

    Provided By California Institute of Technology

  • White Papers // Oct 2011

    Network Coding: Is zero error always possible?

    In the network coding paradigm, internal nodes of the network may mix the information content of the received packets before forwarding them. This mixing (or encoding) of information has been studied extensively over the last decade. While network coding in the multicast setting is well understood, far less is known...

    Provided By California Institute of Technology

  • White Papers // Jan 2012

    Online Algorithms for Geographical Load Balancing

    It has recently been proposed that Internet energy costs, both monetary and environmental, can be reduced by exploiting temporal variations and shifting processing to data centers located in regions where energy currently has low cost. Lightly loaded data centers can then turn off surplus servers. This paper studies online algorithms...

    Provided By California Institute of Technology

  • White Papers // Feb 2011

    Separation of Source-Network Coding and Channel Coding in Wireline Networks

    In this paper the authors prove the separation of source-network coding and channel coding in a wire-line network, which is a network of memory-less point-to-point finite-alphabet channels used to transmit correlated sources. In deriving this result, they also prove that in a general memory-less network with correlated sources lossless and...

    Provided By California Institute of Technology

  • White Papers // Dec 2009

    An Integrated Business Service Management Model with Security Approaches

    Business Service Management (BSM) is not a product or a technology. The authors cannot buy BSM, and it does not come out of any box. Still, one vendor might proudly proclaim, \"BSM is software that essentially forms a dynamic link between business-oriented IT services and the Information Technologies (IT) infrastructure...

    Provided By California Institute of Technology

  • White Papers // Jan 2009

    Ad Hoc Wireless Networks With Noisy Links

    Models of ad-hoc wireless networks are often based on the geometric disc abstraction: transmission is assumed to be isotropic, and reliable communication channels are assumed to exist (apart from interference) between nodes closer than a given distance. In reality communication channels are unreliable and communication range is generally not rotationally...

    Provided By California Institute of Technology

  • White Papers // Jan 2010

    FAST TCP in High-Speed Networks: An Experimental Study

    Various experiments are conducted using FAST TCP on two high-speed networks and uncovered some of the hidden problems affecting high-speed TCP implementations in practice. While FAST TCP achieved good performance in many scenarios, there were also a number of cases, where adverse conditions, both host related and network related, prevented...

    Provided By California Institute of Technology

  • White Papers // Dec 2009

    Stochastic Switching Circuit Synthesis

    It has been proved that switching a relay circuit can lead to the realization of a random Boolean function. Such realization develops the deterministic digital logic. This development is the foundation of improved digital logic design. It also explained and enhanced the ability of manufacturing and designing densely packed digital...

    Provided By California Institute of Technology

  • White Papers // Apr 2009

    The Robustness of Stochastic Switching Networks

    Many natural systems, including chemical and biological systems, can be modeled using stochastic switching circuits. These circuits consist of stochastic switches, called pswitches, which operate with a fixed probability of being open or closed. The paper studies the effect caused by introducing an error of size ? to each pswitch...

    Provided By California Institute of Technology

  • White Papers // Oct 2008

    The Cost of Doing Science on the Cloud: The Montage Example

    Utility grids such as the Amazon EC2 cloud and Amazon S3 offer computational and storage resources that can be used on-demand for a fee by compute and data-intensive applications. The cost of running an application on such a cloud depends on the compute, storage and communication resources it will provision...

    Provided By California Institute of Technology

  • White Papers // Jan 2011

    Mutual Fund Return Predictability In Partially Segmented Markets

    This paper studies the predictability of European equity mutual fund performance during a period when European stock markets were partially segmented. Specifically, the authors use macroeconomic variables to predict the performance of European equity funds, including Pan-European, country, and sector funds. They find that macro-variables are useful in locating funds...

    Provided By California Institute of Technology

  • White Papers // Jan 2011

    Cooperative Diversity in Wireless Relay Networks with Multiple-Antenna Nodes

    It is known that multiple antennas can greatly increase the capacity and reliability of a wireless communication link in a fading environment using space-time coding. Recently, with the increasing interest in ad hoc networks, researchers have been looking for methods to exploit spatial diversity using the antennas of different users...

    Provided By California Institute of Technology

  • White Papers // Jan 2010

    Optimal Reverse Carpooling Over Wireless Networks - A Distributed Optimization Approach

    The authors focus on a particular form of network coding, reverse carpooling, in a wireless network where the potentially coded transmitted messages are to be decoded immediately upon reception. The network is fixed and known, and the system performance is measured in terms of the number of wireless broadcasts required...

    Provided By California Institute of Technology

  • White Papers // Jul 2010

    Two Market Models for Demand Response in Power Networks

    In this paper, the authors consider two abstract market models for designing demand response to match power supply and shape power demand, respectively. They characterize the resulting equilibria in competitive as well as oligopolistic markets, and propose distributed demand response algorithms to achieve the equilibria. The models serve as a...

    Provided By California Institute of Technology

  • White Papers // Jan 2010

    Finding Traitors in Secure Networks Using Byzantine Agreements

    Secure networks rely upon players to maintain security and reliability. However not every player can be assumed to have total loyalty and one must use methods to uncover traitors in such networks. The authors use the original concept of the Byzantine Generals Problem by Lamport, and the more formal Byzantine...

    Provided By California Institute of Technology

  • White Papers // Feb 2012

    Where Specification and Programming Meet

    The authors argue that a modern programming language such as Scala has achieved a level of succinctness, which makes it suitable for program/systems specification, hence able to take the role that early very elegant specification languages, way ahead of their time, served. They illustrate this by comparing the VDM++ specification...

    Provided By California Institute of Technology

  • White Papers // Aug 2010

    Aspect-Oriented Instrumentation With GCC

    The authors present the Inter-Aspect instrumentation framework for GCC, a widely used compiler infrastructure. The addition of plug-in support in the latest release of GCC makes it an attractive platform for runtime instrumentation, as GCC plug-ins can directly add instrumentation by transforming the compiler's intermediate representation. Such transformations, however, require...

    Provided By California Institute of Technology

  • White Papers // Mar 2010

    A Case Study in DSL Development: An Experiment With Python and Scala

    This paper describes an experiment performed with developing a Domain Specific Language (DSL) for monitoring and control of the launch platform for future Constellation rockets at NASA's Kennedy Space Center in Florida, USA. The Constellation project has been conceived as NASA's replacement of the current aging space shuttle program, with...

    Provided By California Institute of Technology

  • White Papers // Nov 2010

    Prototyping a Domain-Specific Language for Monitor and Control Systems

    This paper describes a domain-specific language prototype developed for the NASA Constellation launch control system project. A key element of the launch control system architecture, the domain-specific language prototype is a specialized monitor and control language composed of constructs for specifying and programming test, checkout, and launch processing applications for...

    Provided By California Institute of Technology

  • White Papers // Apr 2008

    Runtime Verification of C Programs

    The authors present in this paper a framework, RMOR, for monitoring the execution of C programs against state machines, expressed in a textual (non-graphical) format in files separate from the program. The state machine language has been inspired by a graphical state machine language RCAT recently developed at the Jet...

    Provided By California Institute of Technology

  • White Papers // May 2008

    Aspect-Oriented Monitoring of C Programs

    The paper presents current work on extending ASPECTC with state machines, resulting in a framework for aspect-oriented monitoring of C programs. Such a framework can be used for testing purposes, or it can be part of a fault protection strategy. The long term goal is to explore the synergy between...

    Provided By California Institute of Technology

  • White Papers // Apr 2012

    Closing the Gap Between Specification and Programming: Vdm++ and Scala

    The authors argue that a modern programming language such as Scala offers a level of succinctness, which makes it suitable for program and systems specification as well as for high-level programming. They illustrate this by comparing the language with the Vdm++ specification language. The comparison also identifies areas where Scala...

    Provided By California Institute of Technology

  • White Papers // May 2008

    A Generalized FAST TCP Scheme

    FAST TCP has been shown to be promising in terms of system stability, throughput and fairness. However, it requires buffering which increases linearly with the number of flows bottlenecked at a link. The authors call the new algorithm Generalized FAST TCP. They prove stability for the case of a single...

    Provided By California Institute of Technology

  • White Papers // Feb 2011

    The Price of Selfishness in Network Coding

    A game theoretic framework is introduced for studying selfish user behavior in shared wireless networks. Specifically, the investigation treats an n-unicast problem in a wireless network that employs a restricted form of network coding called reverse carpooling. Each unicast session independently chooses a route from its transmitter to its receiver....

    Provided By California Institute of Technology

  • White Papers // Sep 2011

    Online Dynamic Capacity Provisioning in Data Centers

    Power consumption imposes a significant cost for implementing cloud services, yet much of that power is used to maintain excess service capacity during periods of low load. In this paper, the authors study how to avoid such waste via an online dynamic capacity provisioning. They overview recent results showing that...

    Provided By California Institute of Technology