Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Pechinkin, A." wg kryterium: Autor


Wyświetlanie 1-2 z 2
Tytuł:
Estimation of Network Disordering Effects by In-depth Analysis of the Resequencing Buffer Contents in Steady-state
Autorzy:
Pechinkin, A.
Razumchik, R.
Powiązania:
https://bibliotekanauki.pl/articles/308107.pdf
Data publikacji:
2016
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
innite capacity
joints distribution
queueing system
resequencing
Opis:
The paper is devoted to the analytic analysis of resequencing issue, which is common in packet networks, using queueing-theoretic approach. The authors propose the mathematical model, which describes the simplest setting of packet resequencing, but which allows one to make the first step in the in-depth-analysis of the queues dynamics in the resequencing buffer. Specifically consideration is given to N-server queueing system (N > 3) with single infinite capacity buffer and resequencing, which may serve as a model of packet reordering in packet networks. Customers arrive at the system according to Poisson flow, occupy one place in the buffer and receive service from one of the servers, which is exponentially distributed with the same parameter. The order of customers upon arrival has to be preserved upon departure. Customers, which violated the order are kept in resequencing buffer which also has infinite capacity. It is shown that the resequencing buffer can be considered as consisting of n, 1 ≤ n ≤ N −1, interconnected queues, depending on the number of busy servers, with i-th queue containing customers, which have to wait for i service completions before they can leave the system. Recursive algorithm for computation of the joint stationary distribution of the number of customers in the buffer and servers, and each queue in resequencing buffer are being obtained. Numerical examples, which show the dynamics of the characteristics of the queues in resequencing buffer are given.
Źródło:
Journal of Telecommunications and Information Technology; 2016, 1; 53-41
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies
Autorzy:
Gaidamaka, Y.
Pechinkin, A.
Razumchik, R.
Samouylov, K.
Sopin, E.
Powiązania:
https://bibliotekanauki.pl/articles/330114.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
queueing system
batch arrival
general service time
overload
hysteretic load control
system kolejkowy
czas obsługi
przeciążenie
Opis:
Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system [...] with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered. The expression for an important performance characteristic of each policy (the mean time between changes in the system mode) is presented. Numerical examples that allow comparison of the efficiency of both policies are given.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 519-534
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies