This paper describes the impact that buffer management has on network performance for a cut-through 1D ring. Such network provides only one routing alternative between each pair of nodes. The network is kept simple to illustrate the significance of buffer management for all virtual cut-through networks. Besides, 2D and 3D torus, among other networks, can be seen as a collection of interlinked 1...

We study the interaction between an MIMD (Multiplicative Increase Multiplicative Decrease) congestion control algorithm and a Drop Tail buffer. We consider the problem in the framework of deterministic hybrid models. We first show that the hybrid model of the interaction between the MIMD congestion control and bottleneck router always converges to a cyclic behavior that can be of only two diffe...

Network throughput can be increased by dividing the buffer storage associated with each network channel into several virtual channels [DalSei]. Each physical channel is associated with several small queues, virtual channels, rather than a single deep queue. The virtual channels associated with one physical channel are allocated independently but compete with each other for physical bandwidth. V...

Saliva has a buffer capacity which neutralizes acids in the mouth. The buffer capacity of human saliva is regulated by 3 buffer systems: the carbonic acid/bicarbonate system, the phosphate system, and the proteins. In nonstimulated saliva, the concentration of inorganic phosphate is rather high, while the concentration of carbonic acid/bicarbonate system is low. Carbonic acid/bicarbonate system...

product, xC RTT , where RTT is the average round trip time, and C the link capacity. Subsequent work has shown that these buffer sizes are over-provisioned. Current implementations of operating systems set a maximum congestion window size of between 10 (in Windows XP) to 40 (in Linux 2.4 and 2.6). In addition, many Internet flows today are short-lived, and end with the packets still buffered in...

Buffer capacity allocation problems for flow-line manufacturing systems with unreliable machines are studied. These problems arise in a wide range of manufacturing systems and concern determining buffer capacities with respect to a given optimality criterion which can depend on the average production rate of the line, buffer cost, inventory cost, etc. Here, this problem is proven to be NP-hard ...

In this paper we study a general stochastic fluid model with a single infinite capacity buffer, where the buffer content can change continuously as well as by instantaneous upward jumps. The continuous as well as the instantaneous change is modulated by an external environment process modelled as a finite state continuous time Markov chain. The Laplace-Stieltjes transform of the steady-state jo...

In this paper, we propose a rate control mechanism for multimedia multicast streaming in the Internet. A single and optimal transmission rate that is adaptive to the network congestion, buffer occupancies, and the playback requirements of the member clients in the multicast group is allocated. We optimize the multicasting delivery in the Internet by improving the buffer occupancy of all clients...

Conventional IP routers are passive devices that accept packets and perform the routing function on any input. Usually the tail-drop (TD) strategy is used where the input which exceeds the buffer capacity are simply dropped. In active queue management (AQM) methods routers manage their buffers by dropping packets selectively. We study one of the AQM methods called as random exponential marking ...

– When we speak about the buffer overflow period we mean the time interval in which the queue size is equal to the capacity of the buffer. Thus packets or cells arriving during this period are lost. The distribution of the length of this interval is recently gaining attention as a very informative characteristic of the queueing performance. In this paper the numerous results related to the dist...