Lazy Protocols Research Articles

Cross Layer AMC Scheduling for a Cooperative Wireless Communication System over Nakagami-m Fading Channels

We study a single-source single-destination cooperative wireless communication system with multiple relays operating in a modified decode-and-forward mode. Nakagami-m fading with additive white Gaussian noise is assumed for all inter-node channels. The bursty data packet arrival is modeled by a Markov-modulated Poisson process (MMPP). A packet feedback model is proposed to characterize packet loss in the wireless channel. An approximation to the steady state distribution of the proposed generalized discrete time M/G/1-type queue at the source is obtained by state truncation. Packet level performance of four transmission modes adopting different modulation and coding schemes is analyzed under a variety of channel and traffic conditions using the truncated queueing analysis. The network power is used as a criterion to find boundary curves of adaptive modulation and coding (AMC) scheduling for the cooperative wireless system. Two source node transmission protocols, namely the transmit-every-clock-tick (TREC) and the LAZY protocols, are examined for both the AMC scheduling and channel utilization analysis.

Update propagation protocols for replicated databates

Replication is often used in many distributed systems to provide a higher level of performance, reliability and availability. Lazy replica update protocols, which propagate updates to replicas through independent transactions after the original transaction commits, have become popular with database vendors due to their superior performance characteristics. However, if lazy protocols are used indiscriminately, they can result in non-serializable executions. In this paper, we propose two new lazy update protocols that guarantee serializability but impose a much weaker requirement on data placement than earlier protocols. Further, many naturally occurring distributed systems, like distributed data warehouses, satisfy this requirement. We also extend our lazy update protocols to eliminate all requirements on data placement. The extension is a hybrid protocol that propagates as many updates as possible in a lazy fashion. We implemented our protocols on the Datablitz database system product developed at Bell Labs. We also conducted an extensive performance study which shows that our protocols outperform existing protocols over a wide range of workloads.

An Evaluation of Software-Based Release Consistent Protocols

This paper presents an evaluation of three software implementations of release consistency. Release consistent protocols allow data communication to be aggregated and allow multiple writers to simultaneously modify a single page. We evaluated an eager invalidate protocol that enforces consistency when synchronization variables are released, a lazy invalidate protocol that enforces consistency when synchronization variables are acquired, and a lazy hybrid protocol that selectively uses update to reduce access misses. Our evaluation is based on implementations running on DECstation-5000/240s connected by an ATM LAN and on an execution-driven simulator that allows us to vary network parameters. Our results show that the lazy protocols consistently outperform the eager protocol for all but one application and that the lazy hybrid performs the best overall. However, the relative performance of the implementations is highly dependent on the relative speeds of the network, processor, and communication software. Lower bandwidths and high per-byte software communication costs favor the lazy invalidate protocol, while high bandwidths and low per-byte costs favor the hybrid. Performance of the eager protocol approaches that of the lazy protocols only when communication becomes essentially free.