Sciweavers

14007 search results - page 2701 / 2802
» Communications in Bus Networks
Sort
View
RANDOM
1998
Springer
15 years 10 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
INFOCOM
1997
IEEE
15 years 10 months ago
VBR over VBR: The Homogeneous, Loss-Free Case
We consider the multiplexing of several variable bit rate (VBR) connections over one variable bit rate connection where the multiplexing uses a multiplexing bu er of size B. The V...
Silvia Giordano, Jean-Yves Le Boudec, Philippe Oec...
PLDI
1997
ACM
15 years 10 months ago
Flick: A Flexible, Optimizing IDL Compiler
An interface definition language (IDL) is a nontraditional language for describing interfaces between software components. IDL compilers generate “stubs” that provide separat...
Eric Eide, Kevin Frei, Bryan Ford, Jay Lepreau, Ga...
SIGCOMM
1997
ACM
15 years 10 months ago
Consistent Overhead Byte Stuffing
—Byte stuffing is a process that encodes a sequence of data bytes that may contain ‘illegal’ or ‘reserved’ values, using a potentially longer sequence that contains no oc...
Stuart Cheshire, Mary Baker
SIGCOMM
1997
ACM
15 years 10 months ago
Dynamics of Random Early Detection
In this paper we evaluate the effectiveness of Random Early Detection (RED) over traffic types categorized as nonadaptive, fragile and robust, according to their responses to con...
Dong Lin, Robert Morris
« Prev « First page 2701 / 2802 Last » Next »