Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
RETRIAL NETWORKS WITH FINITE BUFFERS AND THEIR APPLICATION TO INTERNET DATA TRAFFIC
 

Summary: RETRIAL NETWORKS WITH FINITE BUFFERS
AND THEIR APPLICATION TO INTERNET DATA TRAFFIC
Kostia Avrachenkov
Uri Yechiali
Abstract
Data on the Internet is sent by packets that go through a network of routers. A router drops
packets either when its buffer is full or when it uses the Active Queue Management. Up to the
present time, the majority of the Internet routers use a simple DropTail strategy. The rate at
which a user injects the data into the network is determined by Transmission Control Protocol
(TCP). However, most connections in the Internet consist only of few packets, and TCP does
not really have an opportunity to adjust the sending rate. Thus, the data flow generated by
short TCP connections appears to be some uncontrolled stochastic process. In the present
work we try to describe the interaction of the data flow generated by short TCP connections
with a network of finite buffers. The framework of retrial queues and networks seems to be an
adequate approach for this problem. The effect of packet retransmission becomes essential when
the network congestion level is high. We consider several benchmark retrial network models.
In some particular cases explicit analytic solution is possible. If the analytic solution is not
available or too entangled, we suggest to use a fixed point approximation scheme. In particular,
we consider a network of one or two tandem M/M/1/K type queues with blocking, and with
M/M/1/ type retrial (orbit) queue. We explicitly solve the models with particular choices of

  

Source: Avrachenkov, Konstantin - INRIA Sophia Antipolis

 

Collections: Computer Technologies and Information Sciences