Results 1 - 10 of 573

Estimating the Loss Probability for Finite Buffer Multiplexers

by Han S. Kim, Ness B. Shroff
"... In this paper we propose an approximation for the loss probability in a finite buffer system by making a simple mapping from the tail probability in an infinite buffer system. We focus on the case of a high-speed network where a large number of sources are expected to be multiplexed so that we model ..."
Abstract - Add to MetaCart
In this paper we propose an approximation for the loss probability in a finite buffer system by making a simple mapping from the tail probability in an infinite buffer system. We focus on the case of a high-speed network where a large number of sources are expected to be multiplexed so that we

Loss Probability Calculations and Asymptotic Analysis for Finite Buffer Multiplexers

by Han S. Kim, Ness B. Shroff , 2001
"... In this paper, we propose an approximation for the loss probability, @ A, in a finite buffer system with buffer size. Our study is motivated by the case of a high-speed network where a large number of sources are expected to be multiplexed. Hence, by appealing to Central Limit Theorem type of argum ..."
Abstract - Cited by 49 (4 self) - Add to MetaCart
In this paper, we propose an approximation for the loss probability, @ A, in a finite buffer system with buffer size. Our study is motivated by the case of a high-speed network where a large number of sources are expected to be multiplexed. Hence, by appealing to Central Limit Theorem type

Loss Probability for a Finite Buffer Multiplexer with the M/G/ ∞ Input Process

by George C. Lin , 2004
"... Abstract. This paper studies the impact of long-range-dependent (LRD) traffic on the performance of a network multiplexer. The network multiplexer is characterized by a multiplexing queue with a finite buffer and an M/G/ ∞ input process. Our analysis expresses the loss probability bounds using a sim ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. This paper studies the impact of long-range-dependent (LRD) traffic on the performance of a network multiplexer. The network multiplexer is characterized by a multiplexing queue with a finite buffer and an M/G/ ∞ input process. Our analysis expresses the loss probability bounds using a

Feedforward SDL constructions of output-buffered multiplexers and switches with variable length bursts,” accepted by

by Yi-ting Chen, Cheng-shang Chang, Jay Cheng, Duan-shin Lee - IEEE INFOCOM , 2007
"... Abstract — In this paper, we study the problem of exact emulation of two types of optical queues: (i) N-to-1 output-buffered multiplexers with variable length bursts, and (ii) N × N outputbuffered switches with variable length bursts. For both queues, the delay of a packet is known upon its arrival. ..."
Abstract - Cited by 4 (4 self) - Add to MetaCart
Abstract — In this paper, we study the problem of exact emulation of two types of optical queues: (i) N-to-1 output-buffered multiplexers with variable length bursts, and (ii) N × N outputbuffered switches with variable length bursts. For both queues, the delay of a packet is known upon its arrival

Sizing Router Buffers

by Guido Appenzeller, Isaac Keslassy, Nick McKeown , 2004
"... All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algorithm. In particular, the goal is to make sure that when a link is congested, it is busy 100 % of the time; which is equivalen ..."
Abstract - Cited by 352 (17 self) - Add to MetaCart
All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algorithm. In particular, the goal is to make sure that when a link is congested, it is busy 100 % of the time; which

A Markov-modulated characterization of packetized voice and data traffic and related statistical multiplexer performance

by Harry Heffes, et al. - IEEE J. ON SELECTED AREAS IN COMMUN , 1986
"... We study the performance of a statistical multiplexer whose inputs consist of a superposition of packetized voice sources and data. The performance analysis predicts voice packet delay distributions, which usually have a stringent requirement, as well as data packet delay distributions. The superpos ..."
Abstract - Cited by 288 (4 self) - Add to MetaCart
We study the performance of a statistical multiplexer whose inputs consist of a superposition of packetized voice sources and data. The performance analysis predicts voice packet delay distributions, which usually have a stringent requirement, as well as data packet delay distributions

Credit-Based Flow Control for ATM Networks: Credit Update Protocol, Adaptive Credit Allocation, and Statistical Multiplexing

by H. T. Kung, Trevor Blackwell, Alan Chapman , 1994
"... This paper presents three new results concerning credit-based flow control for ATM networks: (1) a simple and robust credit update protocol (CUP) suited for relatively inexpensive hardware/ software implementation; (2) automatic adaptation of credit buffer allocation for virtual circuits (VCs) shari ..."
Abstract - Cited by 189 (4 self) - Add to MetaCart
) sharing the same buffer pool; (3) use of credit-based fiow control to improve the effectiveness of statistical multiplexing in minimizing switch memory. These results have been substantiated by analysis, simulation and implementa- tion.

inputs OUTPUT BUFFER

by Qos Scheduling, Qos Scheduling
"... Scheduling algorithms • Scheduling: choose a packet to transmit over a link among all packets stored in a given buffer (multiplexing point) • Mainly look at QoS scheduling algorithms – Choose the packet according to QoS needs ..."
Abstract - Add to MetaCart
Scheduling algorithms • Scheduling: choose a packet to transmit over a link among all packets stored in a given buffer (multiplexing point) • Mainly look at QoS scheduling algorithms – Choose the packet according to QoS needs

inputs OUTPUT BUFFER

by Scheduling Algorithms
"... • Scheduling: choose a packet to transmit over a link among all packets stored in a given buffer (multiplexing point) • Mainly look at QoS scheduling algorithms – Choose the packet according to QoS needs ..."
Abstract - Add to MetaCart
• Scheduling: choose a packet to transmit over a link among all packets stored in a given buffer (multiplexing point) • Mainly look at QoS scheduling algorithms – Choose the packet according to QoS needs

1 Buffer sizes for large multiplexers:

by Tcp Queueing Theory, Instability Analysis
"... Abstract — In large multiplexers with many TCP flows, the aggregate traffic flow behaves predictably; this is a basis for the fluid model of Misra, Gong and Towsley [1] and for a growing literature on fluid models of congestion control. In this paper we argue that different fluid models arise from d ..."
Abstract - Add to MetaCart
Abstract — In large multiplexers with many TCP flows, the aggregate traffic flow behaves predictably; this is a basis for the fluid model of Misra, Gong and Towsley [1] and for a growing literature on fluid models of congestion control. In this paper we argue that different fluid models arise from
Results 1 - 10 of 573