Sciweavers

5785 search results - page 1011 / 1157
» Approximability of Probability Distributions
Sort
View
128
Voted
SIGMETRICS
2000
ACM
15 years 8 months ago
TCP in presence of bursty losses
In this paper we analyze the performance of a TCP-like flow control in a lossy environment. The transmission rate in the control scheme that we consider has a linear growth rate;...
Eitan Altman, Konstantin Avrachenkov, Chadi Baraka...
137
Voted
SIGMETRICS
2000
ACM
153views Hardware» more  SIGMETRICS 2000»
15 years 8 months ago
Measurement and analysis of LDAP performance
The Lightweight Directory Access Protocol (LDAP) is being used for an increasing number of distributed directory applications. We describe a tool to analyze the performance of LDA...
Xin Wang, Henning Schulzrinne, Dilip D. Kandlur, D...
137
Voted
LCN
1999
IEEE
15 years 8 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen
MSS
1999
IEEE
140views Hardware» more  MSS 1999»
15 years 8 months ago
Pursuit of a Scalable High Performance Multi-Petabyte Database
When the BaBar experiment at the Stanford Linear Accelerator Center starts in April 1999, it will generate approximately 200TB/year of data at a rate of 10MB/sec for 10 years. A m...
Andrew Hanushevsky, Marcia Nowark
VLDB
1999
ACM
133views Database» more  VLDB 1999»
15 years 8 months ago
Online Dynamic Reordering for Interactive Data Processing
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
Vijayshankar Raman, Bhaskaran Raman, Joseph M. Hel...
« Prev « First page 1011 / 1157 Last » Next »