Abstract not found

Using a simple model of saturated, synchronized and homogeneous sources of TCP Reno with drop-tail queue management and a discrete-time framework, we derive formulae for stationary as well as transient queueing behavior that shed light on the relationship between large buffers and work conservation

Abstract not found

We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel

This paper argues that the typical household’s saving is better described by a “bufferstock” version than by the traditional version of the Life Cycle/Permanent Income Hypothesis (LC/PIH) model. Buffer-stock behavior emerges if consumers with important income uncertainty are sufficiently impatient

This paper presents Scribe, a scalable application-level multicast infrastructure. Scribe supports large numbers of groups, with a potentially large number of members per group. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet

be computed quickly, making it suitable for large data sets. Our implementation, written for use in a large-scale 3D digitization project, launches quickly, maintains a user-settable interactive frame rate regardless of object complexity or camera position, yields reasonable image quality during motion

existing ideas scaled well, new approaches were necessary in many key areas. This paper describes GPFS, and discusses how distributed locking and recovery techniques were extended to scale to large clusters.

\Delta e \Gamma 2 x 2(1\GammaH) =2 for large x. Explicit formulae for constants , fl and L are given in terms of H and system parameters. 1 Introduction Let the fractional Brownian input process fW t g be defined by W t = mt + oeZ t ; t 0; (1.1) where m, oe are positive constants and fZ t g is a

approximately 250ms × 10Gb/s = 2.5Gbits of buffers; and the amount of buffering grows linearly with the line-rate. Such large buffers are challenging for router manufacturers, who must use large, slow, off-chip DRAMs. And queueing delays can be long, have high variance, and may destabilize the congestion