Displaying similar documents to “Self-tuning random early detection algorithm to improve performance of network transmission.”

Study of Queuing Systems with a Generalized Departure Process

Mirtchev, Seferin, Statev, Stanimir (2008)

Serdica Journal of Computing

Similarity:

This work was supported by the Bulgarian National Science Fund under grant BY-TH-105/2005. This paper deals with a full accessibility loss system and a single server delay system with a Poisson arrival process and state dependent exponentially distributed service time. We use the generalized service flow with nonlinear state dependence mean service time. The idea is based on the analytical continuation of the Binomial distribution and the classic M/M/n/0 and M/M/1/k system....

Quality of Service System Approximation in IP Networks

Goleva, Rossitza, Goleva, Mariya, Atamian, Dimitar, Nikolov, Tashko (2008)

Serdica Journal of Computing

Similarity:

This paper is sponsored by the Ministry of Education and Research of the Republic of Bulgaria in the framework of project No 105 “Multimedia Packet Switching Networks Planning with Quality of Service and Traffic Management”. This paper presents Quality of Service analyses in wired and wireless IP networks based on the three popular techniques – RSVP, IntServ, and DiffServ. The analyses are based on a quick approximation schema of the traffic system with static and dynamic...

ABR traffic control over multisource single-bottleneck ATM networks

Andrzej Bartoszewicz, Tomasz Molik (2004)

International Journal of Applied Mathematics and Computer Science

Similarity:

The problem of flow control in fast, connection-oriented communication networks supporting the traffic generated by multiple sources is considered. A novel sampled time strategy governing the behaviour of the sources is proposed. The strategy combines the Smith principle with the conventional sampled time proportional controller. It guarantees an equal resource allocation between various users, full bottleneck link utilisation and no cell loss in the controlled network. Consequently,...

Analysis of AQM queues with queue size based packet dropping

Andrzej Chydziński, Łukasz Chróst (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical...