Results 1 - 10 of 2,037

A Digital Fountain Approach to Reliable Distribution of Bulk Data

by Michael Luby, et al. , 1998
"... The proliferation of applications that must reliably distribute bulk data to a large number of autonomous clients motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A digital fountain a ..."
Abstract - Cited by 492 (19 self) - Add to MetaCart
The proliferation of applications that must reliably distribute bulk data to a large number of autonomous clients motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A digital fountain

The flooding time synchronization protocol

by Miklos Maroti, Branislav Kusy, Gyula Simon, Akos Ledeczi , 2004
"... Wireless sensor network applications, similarly to other distributed systems, often require a scalable time synchronization service enabling data consistency and coordination. This paper introduces the robust Flooding Time Synchronization Protocol (FTSP), especially tailored for applications requir ..."
Abstract - Cited by 469 (16 self) - Add to MetaCart
Wireless sensor network applications, similarly to other distributed systems, often require a scalable time synchronization service enabling data consistency and coordination. This paper introduces the robust Flooding Time Synchronization Protocol (FTSP), especially tailored for applications

On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models

by J. G. Dai - Annals of Applied Probability , 1995
"... It is now known that the usual traffic condition (the nominal load being less than one at each station) is not sufficient for stability for a multiclass open queueing network. Although there has been some progress in establishing the stability conditions for a multiclass network, there is no unified ..."
Abstract - Cited by 357 (27 self) - Add to MetaCart
, there is no unified approach to this problem. In this paper, we prove that a queueing network is positive Harris recurrent if the corresponding fluid limit model eventually reaches zero and stays there regardless of the initial system configuration. As an application of the result, we prove that single class networks

Reevaluating Amdahl’s law

by John L. Gustafson - Commun. ACM , 1988
"... At Sandia National Laboratories, we are currently en-gaged in research involving massively parallel process-ing. There is considerable skepticism regarding the via-bility of massive parallelism; the skepticism centers around Amdahl’s law, an argument put forth by Gene Amda.hl in 1967 [l] that even w ..."
Abstract - Cited by 316 (4 self) - Add to MetaCart
when the fraction of serial work in a given problem is small, say, s, the maximum speedup obtainable from even an infinite number of parallel processors is only l/s. We now have timing results for a 1024-processor system that demon-strate that the assumptions underlying Amdahl’s 1967 argument

Network Control by Bayesian Broadcast

by Ronald L. Rivest - IEEE Transactions on Information Theory , 1987
"... Abstract-A transmission control strategy is described for slotted-ALOHA-type broadcast channels with ternary feedback. At each time slot, each station estimates the probability that n stations are ready to transmit a packet for each n, using Bayes ’ rule and the observed history of collisions, succe ..."
Abstract - Cited by 69 (0 self) - Add to MetaCart
, successful transmissions, and holes (empty slots). A station transmits a packet in a probabilistic manner based on these estimates. Tbis strategy is called Bayesian broadcast. An elegant and very practical strategy-pseudo-Bayesian broadcast-is then derived by approximating the probability estimates with a

A Digital Fountain Approach to Asynchronous Reliable Multicast

by John W. Byers, Michael Luby, Michael Mitzenmacher - IEEE Journal on Selected Areas in Communications , 2002
"... Abstract—The proliferation of applications that must reliably distribute large, rich content to a vast number of autonomous receivers motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A ..."
Abstract - Cited by 174 (10 self) - Add to MetaCart
Abstract—The proliferation of applications that must reliably distribute large, rich content to a vast number of autonomous receivers motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain

Polynomial-Time Approximation Scheme for Data Broadcast

by Claire Kenyon, Nicolas Schabanel, Neal Young - STOC , 2000
"... The data broadcast problem is to find a schedule for broad-casting a given set of messages over multiple channels. The goal is to minimize the cost of the broadcast plus the expected response time to clients who periodically and probabilistically tune in to wait for particular messages. The problem ..."
Abstract - Cited by 39 (3 self) - Add to MetaCart
;push-based" model where the server broadcasts (pushes) its information on the communication medium and multiple clients simultaneously retrieve the spe-cific information of individual interest. This sort of environment motivates the study of "broadcast disks" in Information Systems [1; 7]. In this paper

Lattice-reductionaided broadcast precoding

by Christoph Windpassinger, Robert F. H. Fischer, Johannes B. Huber - IEEE Trans. Commun , 2004
"... Abstract—A precoding scheme for multiuser broadcast communications is described, which fills the gap between the low-complexity Tomlinson–Harashima precoding and the sphere decoderbased system of Peel et al. Simulation results show that, replacing the closest-point search with the Babai approximatio ..."
Abstract - Cited by 55 (4 self) - Add to MetaCart
Abstract—A precoding scheme for multiuser broadcast communications is described, which fills the gap between the low-complexity Tomlinson–Harashima precoding and the sphere decoderbased system of Peel et al. Simulation results show that, replacing the closest-point search with the Babai

Approximating the average response time in broadcast scheduling

by Nikhil Bansal, Moses Charika, Abst Ract - In SODA ’05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms , 2005
"... We consider the problem of approximating the minimum average response time in on-denmnd data broadcasting systems. The best approximation factors known for this problem involve resource augmentation. We provide the first non-trivial approximation factors in the absence of resource augmentation, achi ..."
Abstract - Cited by 20 (2 self) - Add to MetaCart
We consider the problem of approximating the minimum average response time in on-denmnd data broadcasting systems. The best approximation factors known for this problem involve resource augmentation. We provide the first non-trivial approximation factors in the absence of resource augmentation

Adaptive Discontinuous Galerkin Finite Element Methods for Compressible Fluid Flows

by Paul Houston, Ralf Hartmann, Endre Süli, Endre Siili - SIAM J. Sci. Comput
"... this paper is to discuss the a posteriori error analysis and adaptive mesh design for discontinuous Galerkin finite element approximations to systems of conservation laws. In Section 2, we introduce the model problem and formulate its discontinuous Galerkin finite element approximation. Section 3 is ..."
Abstract - Cited by 122 (17 self) - Add to MetaCart
this paper is to discuss the a posteriori error analysis and adaptive mesh design for discontinuous Galerkin finite element approximations to systems of conservation laws. In Section 2, we introduce the model problem and formulate its discontinuous Galerkin finite element approximation. Section 3
Results 1 - 10 of 2,037