Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Queue" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 56
Tytuł:
M/M/n/(m,V) queueing systems with a rejection mechanism based on AQM
Autorzy:
Ziółkowski, M.
Małek, J.
Powiązania:
https://bibliotekanauki.pl/articles/122605.pdf
Data publikacji:
2013
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
Markovian process
queueing systems with non-homogeneous customers
active queue management introduction
Opis:
M/M/n/(m,V) queueing systems with service time independent of customer volume are well known models used in computer science. In real computer systems (computer networks etc.) we often deal with the overload problem. In computer networks we solve the problem using AQM techniques, which are connected with introducing some accepting function that lets us reject in random way some part of the arriving customers. It causes reduction of each customer's mean waiting time and let us avoid jams in consequence. Unfortunately, in this way the loss probability increases. In this paper we investigate the analogous model based on some generalization of M/M/n/(m,V) queueing system. We obtain formulas for a stationary number of customers distribution function and loss probability and we do some computations in special cases.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 1; 121-130
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Calculating steady-state probabilities of single-channel queueing systems with changes of service times depending on the queue length
Autorzy:
Zhernovyi, Yuriy
Kopytko, Bohdan
Powiązania:
https://bibliotekanauki.pl/articles/122726.pdf
Data publikacji:
2019
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
single-channel queueing system
service times changes depending of the queue length
hyperexponential approximation
rozkład hiperesponencjalny
czas obsługi
system kolejkowania jednokanałowy
długość kolejki
Opis:
In this paper, we propose a method for calculating steady-state probabilities of the G/G/1/m and M/G/1/m queueing systems with service times changes depending of the number of customers in the system. The method is based on the use of fictitious phases and hyperexponential approximations with parameters of the paradoxical and complex type. A change in the service mode can only occur at the moment the service is started. We verified the obtained numerical results using the potential method and simulation models, constructed by means of GPSS World.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2019, 18, 3; 107-117
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On characteristics of the Mθ/G/1/m and Mθ/G/1 queues with queue-size based packet dropping
Autorzy:
Zhernovyi, Y.
Kopytko, B.
Zhernovyi, K.
Powiązania:
https://bibliotekanauki.pl/articles/122429.pdf
Data publikacji:
2014
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
queuing systems
packet arrival of customers
active queue management
random dropping of customers
busy period
distribution of the number of customersdistribution of the number of customers
system kolejkowania
aktywne zarządzanie kolejką
przedział zajętości
Opis:
We study the Mθ/G/1/m and Mθ/G/1 queuing systems with the function of the random dropping of customers used to ensure the required characteristics of the system. Each arriving packet of customers can be rejected with a probability defined depending on the queue length at the service beginning of each customer. The Laplace transform for the distribution of the number of customers in the system on the busy period is found, the mean duration of the busy period is determined, and formulas for the stationary distribution of the number of customers in the system are derived via the approach based on the idea of Korolyuk’s potential method. The obtained results are verified with the help of a simulation model constructed with the assistance of GPSS World tools.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2014, 13, 4; 163-175
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The busy period for the Mθ /G/1/m system with service time dependent of the queue length
Autorzy:
Zhernovyi, Y.
Kopytko, B.
Zhernovyi, K.
Powiązania:
https://bibliotekanauki.pl/articles/122898.pdf
Data publikacji:
2013
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
queueing system
group arrival of customers
service time dependent on the queue length
Opis:
We consider the Mθ/G/1/m system wherein the service time depends on the queuelength and it is determined at the beginning of customer service. Using an approach basedon the potential method proposed by V. Korolyuk, the Laplace transforms for the distribution f the number of customers in the system on the busy period and for the distribution function of the busy period are found.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 4; 127-133
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A multi-source fluid queue based stochastic model of the probabilistic offloading strategy in a MEC system with multiple mobile devices and a single MEC server
Autorzy:
Zheng, Huan
Jin, Shunfu
Powiązania:
https://bibliotekanauki.pl/articles/2055156.pdf
Data publikacji:
2022
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
mobile edge computing
probabilistic offloading strategy
multi-source fluid queue
birth and death process
cumulative distribution function
przetwarzanie mobilne
proces narodzin i śmierci
dystrybuanta
Opis:
Mobile edge computing (MEC) is one of the key technologies to achieve high bandwidth, low latency and reliable service in fifth generation (5G) networks. In order to better evaluate the performance of the probabilistic offloading strategy in a MEC system, we give a modeling method to capture the stochastic behavior of tasks based on a multi-source fluid queue. Considering multiple mobile devices (MDs) in a MEC system, we build a multi-source fluid queue to model the tasks offloaded to the MEC server. We give an approach to analyze the fluid queue driven by multiple independent heterogeneous finite-state birth-and-death processes (BDPs) and present the cumulative distribution function (CDF) of the edge buffer content. Then, we evaluate the performance measures in terms of the utilization of the MEC server, the expected edge buffer content and the average response time of a task. Finally, we provide numerical results with some analysis to illustrate the feasibility of the stochastic model built in this paper.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2022, 32, 1; 125--138
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Expected volumes of requests in systems of the queueing network with a limited number of waiting places
Autorzy:
Zając, P.
Matalytski, M.
Powiązania:
https://bibliotekanauki.pl/articles/121834.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
sieci HM
sieci kolejkowe
system kolejkowy
bezprzewodowy punkt dostępu
HM-networks
queueing network
single-line queueing system
queueing system
queuing time
limited queue
demands total volume
wireless access point
volume of requests
Opis:
We present a method of finding the expected volume of requests in HM-network with homogeneous requests and bypass of the queueing systems of requests. The case was considered when the volume changes associated with the transitions between the states of the network are deterministic functions, depending on the state of the network and time, and the systems are single line. It is assumed that the probability of the states of the network systems, the parameters of the entrance flow of the requests and the service depend on the time.
Źródło:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2017, 22; 141-160
2450-9302
Pojawia się w:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning
Autorzy:
Woźniak, M.
Kempa, W. M.
Gabryel, M.
Nowicki, R. K.
Powiązania:
https://bibliotekanauki.pl/articles/330346.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
finite buffer queue
evolutionary strategy
object positioning
queueing system
busy period
idle time
single vacation
strategia ewolucyjna
pozycjonowanie obiektu
system kolejkowy
czas bezczynności
Opis:
In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defined recursively by means of input distributions. In the paper, an analytical study and numerical experiments are presented. A cost optimization problem is solved using an evolutionary strategy for a class of queueing systems described by exponential and Erlang distributions.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 4; 887-900
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On algorithmic simulation
Autorzy:
Winkowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/747509.pdf
Data publikacji:
1973
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
queue system, calculation process
algorytm, obliczenia,
Opis:
Nie ma dotychczas ostatecznie ukształtowanej teorii symulacji. W pracy w możliwie ścisły sposób temat jest przedstawiony z wykorzystaniem pojęć matematyczych. Podstawowe sa tutaj pojęcia algorytmu i obliczenia.
The mathematical formulation of the simulation problem is given.
Źródło:
Mathematica Applicanda; 1973, 1, 1
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Queue theory and improving the customer service process in the city hall – case study
Autorzy:
Wierzbicka, Aleksandra
Powiązania:
https://bibliotekanauki.pl/articles/2033056.pdf
Data publikacji:
2020
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
queue theory
customer satisfaction survey
optimization of customer service system
teoria kolejek
badanie satysfakcji klienta
optymalizacja systemu obsługi klienta
Opis:
Introduction/background: The objective of the article is to present possibilities of using queue theory at the City Hall to improve the service process. In recent years, the demand for highquality customer service in an industrial city has increased, as it causes the applicant, and in the case of urban logistics – a resident, to become tied to their place of residence. This results in an increase in the number of residents, and thus leads to the development of the city and an increase in its resources (also financial). Aim of the paper: The objective of the article is to present possibilities in City Hall offices of using queue theory to improve the service process. Materials and methods: The article shows the application of mathematical methods in customer service in logistics. Results and conclusions: Queuing systems have particular use in administration. Proper organisation of the work of an office or department enables fast and efficient service and customer satisfaction. The analysis of customer mass service systems is carried out in order to determine the optimal number of stations and to determine the general rules prevailing in the queue. When analysing the City Hall as a customer service system, it can be noticed that the usage of queuing theory to evaluate the system performance allows assessing the ability of the entity’s logistics system to meet customer needs in terms of time, reliability and quality in accordance with the level of customer service.
Źródło:
Organizacja i Zarządzanie : kwartalnik naukowy; 2020, nr 3; 123-136
1899-6116
Pojawia się w:
Organizacja i Zarządzanie : kwartalnik naukowy
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On regular copying languages
Autorzy:
Wang, Yang
Hunter, Tim
Powiązania:
https://bibliotekanauki.pl/articles/24201233.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
reduplication
copying
finite-state machinery
queue automata
Opis:
This paper proposes a formal model of regular languages enriched with unbounded copying. We augment finite-state machinery with the ability to recognize copied strings by adding an unbounded memory buffer with a restricted form of first-in-first-out storage. The newly introduced computational device, finite-state buffered machines (FS-BMs), characterizes the class of regular languages and languages de-rived from them through a primitive copying operation. We name this language class regular copying languages (RCLs). We prove a pumping lemma and examine the closure properties of this language class. As suggested by previous literature (Gazdar and Pullum 1985, p.278), regular copying languages should approach the correct characteriza-tion of natural language word sets.
Źródło:
Journal of Language Modelling; 2023, 11, 1; 1--66
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Discussion on the transient behavior of single server Markovian multiple variant vacation queues
Autorzy:
Vadivukarasi, Manickam
Kalidass, Kaliappan
Powiązania:
https://bibliotekanauki.pl/articles/2099427.pdf
Data publikacji:
2022
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
Markovian queue
multiple variant vacations
transient solution
waiting-time distribution
Opis:
We consider an M/M/1 queue where beneficiary visits occur singly. Once the beneficiary level in the system becomes zero, the server takes a vacation at once. If the server finds no beneficiaries in the system, then the server can take another vacation after the return from the vacation. This process continues until the server has exhaustively taken all the J vacations. The closed form transient solution of the considered model and some important time-dependent performance measures are obtained. Further, the steady state system size distribution is obtained from the time-dependent solution. A stochastic decomposition structure of waiting time distribution and expression for the additional waiting time due to the presence of server vacations are studied. Numerical assessments are presented.
Źródło:
Operations Research and Decisions; 2021, 31, 1; 123--146
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Simulation Model on Determining of Port Capacity and Queue Size: A Case Study for BOTAS Ceyhan Marine Terminal
Autorzy:
Uğurlu, O.
Yüksekyıldız, E.
Köse, E.
Powiązania:
https://bibliotekanauki.pl/articles/116125.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Simulation Model
port capacity
Queue Size
Marine Terminal
Opis:
Simulation programs are a useful and effective tool for analysis of projects requiring high investment costs, studies to improve the functioning of an existing system, and the analysis of the effectiveness and efficiency. They make it possible to control of system or substructure by less investment cost. Simulation models are often used in port modeling, capacity analysis, queue size and port efficiency. In this study, simulation model of loading terminals of the BOTA? Ceyhan pipeline were done. For this reason, AWESIM simulation program was used. This modeling evaluated for 365 days and each ship has approached the port with intervals of 12-24, 12-36, 24-36 and 24-48 hours. Stormy days in a year have been assumed as 30. Each ship demands trailer and pilotage service when approaching and leaving the port. In this simulation model; ship types, capacities, coming frequencies, loading times, maneuvering time and transportation capacity of BOTA? Ceyhan Marine Terminal were investigated.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2014, 8, 1; 143-150
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance evaluation of an M/G/n-type queue with bounded capacity and packet dropping
Autorzy:
Tikhonenko, O.
Kempa, W. M.
Powiązania:
https://bibliotekanauki.pl/articles/331288.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
AQM algorithm
finite buffer
loss probability
total packet volume
queue size distribution
aktywne zarządzanie kolejką
prawdopodobieństwo straty
rozkład wielkości kolejki
Opis:
A queueing system of the M/G/n-type, n ≥ 1, with a bounded total volume is considered. It is assumed that the volumes of the arriving packets are generally distributed random variables. Moreover, the AQM-type mechanism is used to control the actual buffer state: each of the arriving packets is dropped with a probability depending on its volume and the occupied volume of the system at the pre-arrival epoch. The explicit formulae for the stationary queue-size distribution and the loss probability are found. Numerical examples illustrating theoretical formulae are given as well.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 4; 841-854
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
From UML object behavior description into petri net models towards systematic development of embedded systems
Autorzy:
Szmuc, W.
Szmuc, T.
Powiązania:
https://bibliotekanauki.pl/articles/398100.pdf
Data publikacji:
2016
Wydawca:
Politechnika Łódzka. Wydział Mikroelektroniki i Informatyki
Tematy:
UML
state machine
event
queue
object
Petri
formal
model
maszyna stanów
zdarzenie
kolejka
obiekt
Opis:
The paper describes a translation of object behavior specified by UML into semantically equivalent Petri net models. The translation focuses on object behavior with event handling implemented in UML. The resulted Petri net allows to check UML model properties not only by simulation but also in formal way. For possibly closest congruence between UML and Petri net model an event queue is defined. Each state machine assigned to an object has its own event queue which is available as long as the machine exists. It allows modeling not just a simple message passing but also cases, when state machine cannot handle an event. A higher priority of sub-machine's event queue is also considered. The presented solution is a part of wider conversion algorithm from UML model into Petri nets [12]. However, the paper is intended to describe the issue in such a detailed way and focuses on aspects crucial for embedded systems development.
Źródło:
International Journal of Microelectronics and Computer Science; 2016, 7, 2; 60-64
2080-8755
2353-9607
Pojawia się w:
International Journal of Microelectronics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Szacowanie warunków ruchu na miejskich skrzyżowaniach z sygnalizacją świetlną w stanach zatłoczenia
Estimation of traffic conditions on urban intersections with traffic lights in state of oversaturation
Autorzy:
Szczuraszek, T.
Iwanowicz, D.
Powiązania:
https://bibliotekanauki.pl/articles/310730.pdf
Data publikacji:
2017
Wydawca:
Instytut Naukowo-Wydawniczy "SPATIUM"
Tematy:
bezpieczeństwo ruchu
skrzyżowanie miejskie
skrzyżowanie z sygnalizacją świetlną
przepustowość skrzyżowań
modelowanie ruchu
kolejka pojazdów
traffic safety
urban intersection
intersection with traffic lights
capacity of intersection
traffic modelling
vehicles queue
Opis:
W artykule omówiony został problem nieprawidłowego szacowania w kraju warunków ruchu na miejskich skrzyżowaniach z sygnalizacją świetlną w przypadku stanów zatłoczenia. Wykazano, że spowodowane jest to pomijaniem w analizach stopnia obciążenia ruchem wlotów, uwzględniającego długości tzw. kolejki początkowej pojazdów, formułującej się na skutek przesycenia ruchem wlotów. Fakt ten ma znaczący wpływ na błędy w planowaniu, projektowaniu i zarządzaniu infrastrukturą drogową. W artykule podkreślono także, że obecnie stosowane w Polsce wytyczne obliczania przepustowości skrzyżowań z sygnalizacją świetlną nie dają możliwości prawidłowego wyznaczania długości tych kolejek.
The article discusses the problem of incorrect estimation of traffic conditions in urban intersections with traffic lights in case of congestion. This is caused by skipping the volume-to-capacity ratio of inlets with the queue lengths at the start of analyzed period, socalled the ‘initial queue’. The initial queue is formulated as a result of oversaturation in the period preceding the analyzed period. This has a significant impact on errors in the planning, design and management of road infrastructure. The article also emphasizes that the guidelines for calculating the capacity of intersections with traffic lights, currently used in Poland, do not allow for the correct calculation of these queue lengths.
Źródło:
Autobusy : technika, eksploatacja, systemy transportowe; 2017, 18, 12; 1636-1640, CD
1509-5878
2450-7725
Pojawia się w:
Autobusy : technika, eksploatacja, systemy transportowe
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 56

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