Temat: queueing analysis - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Development of QoS Methods in the Information Networks with Fractal Traffic
Autorzy:: Daradkeh, Y. I.
Kirichenko, L.
Radivilova, T.
Powiązania:: https://bibliotekanauki.pl/articles/227166.pdf
Data publikacji:: 2018
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: communication system traffic
fractals
quality of service
queueing analysis
routing
Opis:: The paper discusses actual task of ensuring the quality of services in information networks with fractal traffic. The generalized approach to traffic management and quality of service based on the account of multifractal properties of the network traffic is proposed. To describe the multifractal traffic properties, it is proposed to use the Hurst exponent, the range of generalized Hurst exponent and coefficient of variation. Methods of preventing of network overload in communication node, routing cost calculation and load balancing, which based on fractal properties of traffic are presented. The results of simulation have shown that the joint use of the proposed methods can significantly improve the quality of service network.
Źródło:: International Journal of Electronics and Telecommunications; 2018, 64, 1; 27-32
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Approximate performance analysis of slotted downlink channel in a wireless CDMA system supporting integrated voice and data services
Autorzy:: Świderski, J.
Powiązania:: https://bibliotekanauki.pl/articles/308218.pdf
Data publikacji:: 2004
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: wireless CDMA system
synchronous downlink
voice and data integration
queueing analysis
Opis:: This paper is concerned with the performance analysis of a slotted downlink channel in a wireless CDMA communication system with integrated packet voice and data transmission. The system model consists of mobile terminals (MT) and a single base station (BS). It is assumed that the voice (data) packet error rate (PER) does not exceed lO(-2) (10(-5)). With this requirement the number of simultaneous transmissions over the downlink channel is limited. Therefore, the objective of the call admission control is to restrict the maximum number of CDMA codes available to voice and E data traffic. Packets of accepted voice calls are transmitted immediately while accepted data packets are initially buffered at the BS. This station distinguishes between silence and talk-spurt periods of voice sources, so that data packets can use their own codes for transmission during silent time slots. Data packets are buffered in queues created separately for each destination. Discrete-time Markov processes are used to model the system operation. Statistical dependence between queues is the main difficulty which arises during the analysis. This dependence leads to serious computational complexity. The aim of this paper is to present an approximate analytical method based on the restricted occupancy urn model which enables to evaluate system performance despite the dependence. Numerical calculations compared with simulation results show excellent agreement for the average system throughput and the blocking probability of data packets for higher system loads. On the other hand, when the average data packet delay is considered, analytical results underestimate simulation and therefore only approximate system performance evaluation is possible.
Źródło:: Journal of Telecommunications and Information Technology; 2004, 2; 47-53
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: The asymptotic analysis of the income in closed HM-structure with priority messages
Autorzy:: Matalytski, M.
Kiturko, O.
Powiązania:: https://bibliotekanauki.pl/articles/122336.pdf
Data publikacji:: 2013
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: asymptotic analysis
closed queueing structure
Opis:: In the article the asymptotic analysis of closed exponential queueing HM-structure with priority messages is carried out with a large total number of messages, depending on time. The number of service lines in systems, the intensity of service messages in them, the probabilities of message transitions between systems also depends on time. It is proved that the density of the income distribution in the network systems in asymptotic satisfies differential equations in partial derivatives. This provided the inhomogeneous differential equation for the expected incomes system structure. An example of transport logistics shows how to solve such equations.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 2; 51-59
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Asymptotic analysis of the closed queueing structure with time-dependent service parameters and single-type messages
Autorzy:: Matalytski, M.
Rusilko, T.
Pankov, A.
Powiązania:: https://bibliotekanauki.pl/articles/122305.pdf
Data publikacji:: 2013
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: queueing network
differential equation
asymptotic analysis
Opis:: A closed queueing structure is considered in the paper; the number of single-type messages is not constant and depends on time. The route of messages is given by an arbitrary stochastic matrix of transition probabilities. An asymptotic analysis of this structure in case of large number of service requests is conducted. The service parameters of each queueing system of this structure, as well as the probability of messages transition between systems, depend on time. A system of ordinary differential equations to calculate the average relative number of messages in each queueing system, depending on the time, was obtained.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 2; 73-80
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: Diffusion approximation of the network with limited number of same type customers and time dependent service parameters
Autorzy:: Matalytski, M.
Kopats, D.
Powiązania:: https://bibliotekanauki.pl/articles/122463.pdf
Data publikacji:: 2016
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: queueing network
birth and death process
asymptotic analysis
sieci kolejkowe
analiza asymptotyczna
proces losowy
Opis:: The article presents research of an open queueing network (QN) with the same types of customers, in which the total number of customers is limited. Service parameters are dependent on time, and the route of customers is determined by an arbitrary stochastic transition probability matrix, which is also dependent on time. Service times of customers in each line of the system is exponentially distributed. Customers are selected on the service according to FIFO discipline. It is assumed that the number of customers in one of the systems is determined by the process of birth and death. It generates and destroys customers with certain service times of rates. The network state is described by the random vector, which is a Markov random process. The purpose of the research is an asymptotic analysis of its process with a big number of customers, obtaining a system of differential equations (DE) to find the mean relative number of customers in the network systems at any time. A specific model example was calculated using the computer. The results can be used for modelling processes of customer service in the insurance companies, banks, logistics companies and other organizations.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 2; 77-84
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 6.

Tytuł:: Probabilistic elements in analysis of performance of multiprocessor systems
Autorzy:: Taborek, K.
Hrynkiewicz, E.
Powiązania:: https://bibliotekanauki.pl/articles/201505.pdf
Data publikacji:: 2014
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: arbitration circuit
multiprocessor system
performance analysis
queueing model
arbitraż
system wieloprocesorowy
analiza wydajności
model kolejkowy
Opis:: The paper presents important probabilistic elements that should be taken into consideration in the analysis of performance of classical multiprocessor systems. These elements represent the following quantities: modified arrival rate for processor requests and a few probabilities, which determine the frequency of certain events when a multiprocessor system is working. There are four peculiar events: service of another job, existence of the queue, a processor request while the given task is waiting into the queue and the return of another task into the queue while the given task is waiting in the queue. The first three events happen more often when a system consists of less number of processors, whereas the fourth event happens more often when more processors work in a system. Including (or not) the probabilities of these events to the analysis of performance of multiprocessor systems exerts its much influence on the precision of computations. All the mentioned quantities were described in detail. Formulas for these quantities were derived. Examples of applications of the formulas to the prediction of performance of various multiprocessor systems were presented.
Źródło:: Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 4; 765-771
0239-7528
Pojawia się w:: Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 7.

Tytuł:: Asymptotic analysis of a closed G-network of unreliable nodes
Autorzy:: Rusilko, Tatiana
Powiązania:: https://bibliotekanauki.pl/articles/2175521.pdf
Data publikacji:: 2022
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: G-network
unreliable queueing systems
positive customer
negative customer
birth-death process
asymptotic analysis
queueing network
sieć G
proces narodzin i śmierci
analiza asymptotyczna
sieci kolejkowe
Opis:: A closed exponential queueing G-network of unreliable multi-server nodes was studied under the asymptotic assumption of a large number of customers. The process of changing the number of functional servers in network nodes was considered as the birth-death process. The process of changing the number of customers at the nodes was considered as a continuous-state Markov process. It was proved that its probability density function satisfies the Fokker-Planck-Kolmogorov equation. The system of differential equations for the first-order and second-order moments of this process was derived. This allows us to predict the expectation, the variance and the pairwise correlation of the number of customers in the G-network nodes both in the transient and steady state.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2022, 21, 2; 91--102
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "queueing analysis" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język