This paper introduces Wave and Equation Based Rate Control (WEBRC), the first multiple rate multi... more This paper introduces Wave and Equation Based Rate Control (WEBRC), the first multiple rate multicast congestion control protocol to be equation based. The equation-based approach enforces fairness to TCP with the benefit that fluctuations in the flow rate are small in comparison to TCP. This paper also introduces the multicast round trip time (MRTT), a multicast analogue of the unicast round trip time (RTT). The MRTT is fundamental to the equation-based protocol that each receiver uses to adjust its reception rate. Each receiver independently measures its own MRTT without placing any added messaging burden on the receiver, the sender or the intermediate network elements. Benefits provided by the MRTT include those that the RTT provides to TCP, e.g., reduced reception rates in reaction to buffer filling and fair sharing of bottleneck links. In addition, the use of MRTT is shown to synchronize and equalize the reception rates of proximate receivers and to cause reception rates to increase as the density of receivers increases. Another innovation of WEBRC is the idea of transmitting data with waves: the transmission rate on a channel is periodic, with an exponentially decreasing form during an active period followed by a quiescent period. Benefits of using waves include insensitivity to large IGMP leave latency; a frequency of joins and leaves by each receiver that is small and independent of the receiver reception rate; the use of a small number of multicast channels; fine-grained control over the receiver reception rate; and minimal, at times nonexistent, losses due to buffer overflow.
We show how to efficiently construct a pseudorandom invertible permutation generator from a pseud... more We show how to efficiently construct a pseudorandom invertible permutation generator from a pseudorandom function generator. Goldreich, Goldwasser and Micali ["How to construct random functions," Proc. 25th Annual Symposium on Foundations of Computer Science, October 24-26, 1984.] introduce the notion of a pseudorandom function generator and show how to efficiently construct a pseudorandom function generator from a pseudorandom bit generator. We use some of the ideas behind the design of the Data Encryption Standard for our construction. A practical implication of our result is that any pseudorandom bit generator can be used to construct a block private key cryptosystem which is secure against chosen plaintext attack, which is one of the strongest known attacks against a cryptosystem.
We introduce a new model of interactive learning in which an expert examines the predictions of a... more We introduce a new model of interactive learning in which an expert examines the predictions of a learner and partially fixes them if they are wrong. Although this kind of feedback is not i.i.d., we show statistical generalization bounds on the quality of the learned model.
We consider the problem of finding a maximal independent set in an independence system quickly in... more We consider the problem of finding a maximal independent set in an independence system quickly in parallel when the independence system is presented as an explicit list of minimal dependent sets. An NC algorithm for the special case when the size of each minimal dependent set is at most two was given by Karp and Wigderson [KW] and has been substantially improved by Luby [Lull, by Alon, Babai and Itai [ABI] and by Goldberg and Spencer [GS]. On the other hand, no previous work on this problem extends even to the case when the size of each minimal dependent set is at most three. We provide a randomized NC algorithm for the case when the size of each minimal dependent set is at most a constant, and provide an algorithm which we conjecture is a randomized NC algorithm for the general case.
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We ... more Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show h o w to construct a pseudorandom generator from any oneway function. Since it is easy to construct a one-way function from a pseudorandom generator, this result shows that there is a pseudorandom generator i there is a one-way function.
Immersive experiences, such as remote collaboration and augmented and virtual reality, require de... more Immersive experiences, such as remote collaboration and augmented and virtual reality, require delivery of large volumes of data with consistent ultra-low latency across wireless networks in fluctuating network conditions. We describe the high-level design behind a data delivery solution that meets these requirements and provide synthetic simulations and test results running in network conditions based on real-world measurements demonstrating the efficacy of the solution. • Networks → Transport protocols; Network reliability; • Computer systems organization → Real-time system architecture.
The proliferation of applications that must reliably distribute large, rich content to a vast num... more 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 digital fountain allows any number of heterogeneous receivers to acquire content with optimal efficiency at times of their choosing. Moreover, no feedback channels are needed to ensure reliable delivery, even in the face of high loss rates. We develop a protocol that closely approximates a digital fountain using two new classes of erasure codes that for large block sizes are orders of magnitude faster than standard erasure codes. We provide performance measurements that demonstrate the feasibility of our approach and discuss the design, implementation, and performance of an experimental system.
... USA E-mail: (luby{at}icsi.berkeley.edu). Vern Paxson. Lawrence Berkeley National Laboratory, ... more ... USA E-mail: (luby{at}icsi.berkeley.edu). Vern Paxson. Lawrence Berkeley National Laboratory, University of California, Berkeley, CA 94720, USA E-mail: (vern{at}ee. lbl.gov). References. ↵: G. Hardin. , Science 162, 1243 (1968). ...
Levialdl [6J introduced a parallel synchronous algorithm for counting the number of connected com... more Levialdl [6J introduced a parallel synchronous algorithm for counting the number of connected components in a binary image embedded in an n X n mesh of processors that runs in time O(n). We describe a parallel asynchronous algorithm for the same problem achieving the same time bound.
This paper introduces Wave and Equation Based Rate Control (WEBRC), the first multiple rate multi... more This paper introduces Wave and Equation Based Rate Control (WEBRC), the first multiple rate multicast congestion control protocol to be equation based. The equation-based approach enforces fairness to TCP with the benefit that fluctuations in the flow rate are small in comparison to TCP. This paper also introduces the multicast round trip time (MRTT), a multicast analogue of the unicast round trip time (RTT). The MRTT is fundamental to the equation-based protocol that each receiver uses to adjust its reception rate. Each receiver independently measures its own MRTT without placing any added messaging burden on the receiver, the sender or the intermediate network elements. Benefits provided by the MRTT include those that the RTT provides to TCP, e.g., reduced reception rates in reaction to buffer filling and fair sharing of bottleneck links. In addition, the use of MRTT is shown to synchronize and equalize the reception rates of proximate receivers and to cause reception rates to increase as the density of receivers increases. Another innovation of WEBRC is the idea of transmitting data with waves: the transmission rate on a channel is periodic, with an exponentially decreasing form during an active period followed by a quiescent period. Benefits of using waves include insensitivity to large IGMP leave latency; a frequency of joins and leaves by each receiver that is small and independent of the receiver reception rate; the use of a small number of multicast channels; fine-grained control over the receiver reception rate; and minimal, at times nonexistent, losses due to buffer overflow.
We show how to efficiently construct a pseudorandom invertible permutation generator from a pseud... more We show how to efficiently construct a pseudorandom invertible permutation generator from a pseudorandom function generator. Goldreich, Goldwasser and Micali ["How to construct random functions," Proc. 25th Annual Symposium on Foundations of Computer Science, October 24-26, 1984.] introduce the notion of a pseudorandom function generator and show how to efficiently construct a pseudorandom function generator from a pseudorandom bit generator. We use some of the ideas behind the design of the Data Encryption Standard for our construction. A practical implication of our result is that any pseudorandom bit generator can be used to construct a block private key cryptosystem which is secure against chosen plaintext attack, which is one of the strongest known attacks against a cryptosystem.
We introduce a new model of interactive learning in which an expert examines the predictions of a... more We introduce a new model of interactive learning in which an expert examines the predictions of a learner and partially fixes them if they are wrong. Although this kind of feedback is not i.i.d., we show statistical generalization bounds on the quality of the learned model.
We consider the problem of finding a maximal independent set in an independence system quickly in... more We consider the problem of finding a maximal independent set in an independence system quickly in parallel when the independence system is presented as an explicit list of minimal dependent sets. An NC algorithm for the special case when the size of each minimal dependent set is at most two was given by Karp and Wigderson [KW] and has been substantially improved by Luby [Lull, by Alon, Babai and Itai [ABI] and by Goldberg and Spencer [GS]. On the other hand, no previous work on this problem extends even to the case when the size of each minimal dependent set is at most three. We provide a randomized NC algorithm for the case when the size of each minimal dependent set is at most a constant, and provide an algorithm which we conjecture is a randomized NC algorithm for the general case.
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We ... more Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show h o w to construct a pseudorandom generator from any oneway function. Since it is easy to construct a one-way function from a pseudorandom generator, this result shows that there is a pseudorandom generator i there is a one-way function.
Immersive experiences, such as remote collaboration and augmented and virtual reality, require de... more Immersive experiences, such as remote collaboration and augmented and virtual reality, require delivery of large volumes of data with consistent ultra-low latency across wireless networks in fluctuating network conditions. We describe the high-level design behind a data delivery solution that meets these requirements and provide synthetic simulations and test results running in network conditions based on real-world measurements demonstrating the efficacy of the solution. • Networks → Transport protocols; Network reliability; • Computer systems organization → Real-time system architecture.
The proliferation of applications that must reliably distribute large, rich content to a vast num... more 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 digital fountain allows any number of heterogeneous receivers to acquire content with optimal efficiency at times of their choosing. Moreover, no feedback channels are needed to ensure reliable delivery, even in the face of high loss rates. We develop a protocol that closely approximates a digital fountain using two new classes of erasure codes that for large block sizes are orders of magnitude faster than standard erasure codes. We provide performance measurements that demonstrate the feasibility of our approach and discuss the design, implementation, and performance of an experimental system.
... USA E-mail: (luby{at}icsi.berkeley.edu). Vern Paxson. Lawrence Berkeley National Laboratory, ... more ... USA E-mail: (luby{at}icsi.berkeley.edu). Vern Paxson. Lawrence Berkeley National Laboratory, University of California, Berkeley, CA 94720, USA E-mail: (vern{at}ee. lbl.gov). References. ↵: G. Hardin. , Science 162, 1243 (1968). ...
Levialdl [6J introduced a parallel synchronous algorithm for counting the number of connected com... more Levialdl [6J introduced a parallel synchronous algorithm for counting the number of connected components in a binary image embedded in an n X n mesh of processors that runs in time O(n). We describe a parallel asynchronous algorithm for the same problem achieving the same time bound.
Uploads
Papers by Michael Luby