and potentially mobile secondary users. We use the technique of Lyapunov Optimization to design an online flow control, scheduling and resource allocation algorithm that meets the desired objectives and provides explicit performance guarantees.

collection protocol, which provides expected reliabil-ity guarantees while minimizing resource consumption by adaptively adjusting the number of retransmissions based on current network fault conditions. 1.

metadata, and (b) Pryer, which delivers the actual data to dissemination-aware receivers. We indicate how reliability guarantees/performance tradeoffs can be achieved by a careful instantiation of Peddler and Pryer. We implement RADcast on mobile devices inside a middleware and determine its feasibility

, and leverages Pastry's reliability, self-organization, and locality properties. Pastry is used to create and manage groups and to build efficient multicast trees for the dissemination of messages to each group. Scribe provides best-effort reliability guarantees, but we outline how an application can extend

stream in a P2P streaming environment. Based on this model, we further develop tree construction algorithms that ensure that every peer in the collaborative network receives a video stream with a statistical reliability guarantee on quality. A key advantage of the proposed approach is that we can now

Automata based scheduling is a recent technique for online scheduling of software control components in embedded systems. This paper studies one important aspect of automata based scheduling that has not been studied in the past, namely resilience to faults. The goal of the proposed technique is to create an automaton thats recommends the scheduling patterns that are admissible with respect to control performance requirements, when the state of the system has been mutated by faults. The problem has been formulated as a game between the scheduler and the (possibly faulty) system, where a winning strategy of the scheduler prevents the system from reaching bad states forever. We present a method for analyzing the structure of the game and extracting an automaton that captures the winning strategies of the scheduler, namely the automaton to be used for automata based scheduling.

assigned to the file. This ensures that there is a non-null intersection between every read quorum and every write quorum. Version numbers make it possible to determine which copies are current. The reliability and performance characteristics of a replicated file can be controlled by appropriately choosing

≪ p, and the zi’s are i.i.d. N(0, σ 2). Is it possible to estimate x reliably based on the noisy data y? To estimate x, we introduce a new estimator—we call the Dantzig selector—which is solution to the ℓ1-regularization problem min ˜x∈R p ‖˜x‖ℓ1 subject to ‖A T r‖ℓ ∞ ≤ (1 + t −1) √ 2 log p · σ

Uncertainty in design performance due to fabrication and environmental variability poses a challenge to create robust designs in sub 90nm technologies. It is imperative to develop design techniques that have a reliability guarantee without imposing a penalty in performance. Such techniques

. In this paper, we employ both the analytical and simulation modeling to address the performance of CMQSs with reliability guarantee. We present a visibility-based modeling approach (VMA) for simulation model using colored Petri nets (CPN). Our model incorporates the important features of message queueing