Sciweavers

85 search results - page 8 / 17
» Mean-Field Analysis of Buffer Sizing
Sort
View
EPEW
2006
Springer
15 years 12 hour ago
Worst Case Analysis of Batch Arrivals with the Increasing Convex Ordering
We consider a finite buffer queue with one deterministic server fed by packets arriving in batches. We assume that we are not able to fully describe the batch distribution: only th...
Ana Busic, Jean-Michel Fourneau, Nihal Pekergin

Publication
255views
16 years 8 months ago
Buffer Management and Rate Guarantees for TCP/IP over Satellite-ATM Networks
Future broadband satellite networks will support a variety of service types. Many such systems are being designed with ATM or ATM like technology. A majority of Internet applicatio...
Rohit Goyal, Raj Jain, Mukul Goyal, Sonia Fahmy, B...
ISSRE
2002
IEEE
15 years 3 months ago
An Empirical Study of Tracing Techniques from a Failure Analysis Perspective
Tracing is a dynamic analysis technique to continuously capture events of interest on a running program. The occurrence of a statement, the invocation of a function, and the trigg...
Satya Kanduri, Sebastian G. Elbaum
TELSYS
2002
122views more  TELSYS 2002»
14 years 9 months ago
Performance Analysis of Reassembly and Multiplexing Queueing with Long-Range-Dependent Input Traffic
This paper studies the impact of long-range-dependent (LRD) traffic on the performance of reassembly and multiplexing queueing. A queueing model characterizing the general reassemb...
George C. Lin, Tatsuya Suda, Fumio Ishizaki
SIGMOD
1993
ACM
163views Database» more  SIGMOD 1993»
15 years 2 months ago
The LRU-K Page Replacement Algorithm For Database Disk Buffering
This paper introduces a new approach to database disk buffering, called the LRU–K method. The basic idea of LRU–K is to keep track of the times of the last K references to pop...
Elizabeth J. O'Neil, Patrick E. O'Neil, Gerhard We...