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ę "queuing systems" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 28
Tytuł:
A method to build network-of-queues-based simulators for communication systems
Autorzy:
Pasini, L.
Feliziani, S.
Powiązania:
https://bibliotekanauki.pl/articles/1954090.pdf
Data publikacji:
2004
Wydawca:
Politechnika Gdańska
Tematy:
queuing systems
computer simulation
communication systems
Opis:
In this study we build a library of new object types whose architecture is based on models of networks-of-queues to simulate communication networks. We also define a class of procedures to automatically generate a simulator of a generic communication network described by the library's objects.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2004, 8, 3; 333-358
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analiza parametrów czasowych w systemach pomiarowo-sterujących z wykorzystaniem teorii masowej obsługi i metod szeregowania zadań
Methods of time parameters analysis in soft real-time systems
Autorzy:
Eljasz, D.
Powiązania:
https://bibliotekanauki.pl/articles/152995.pdf
Data publikacji:
2010
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
szeregowanie zadań
metody kolejkowe
system obsługi masowej
queuing theory
task scheduling theory
Opis:
W artykule zaprezentowano możliwości wykorzystania teorii masowej obsługi w analizie systemów pomiarowo-sterujących (SPS). Wyniki zostały zestawione z metodą szeregowania zadań oraz wynikami symulacyjnymi. Analizie poddano parametry związane z warunkiem realizowalności zadań, średnim i maksymalnym czasem wykonania zadań oraz średnim czasem oczekiwania zadania w kolejce. Dodatkowo wyniki zostały potwierdzone poprzez symulację wykonaną w programie NS2 (Network Symulator).
In currently designed measurement and control systems (MCS) with real-time constrains, the task scheduling theory is used to calculate the tasks response time [3, 4]. Such approach is suitable for hard real-time MCS and sometimes can lead to oversizing the resources of the designed MCS. For design of soft real-time MCS a better solution can be to apply the queuing theory. The queuing theory is based on mean values of a task execution time and times between the successive tasks. Such approach allows achieving better allocation of MSC resources for task execution but sometimes tasks deadlines can be exceeded. In the paper a general introduction to the task scheduling theory and the queuing theory is presented. The basic time parameters of a task in both approaches are the task execution time and the task period occurrence. In Paragraphs 4 and 5 the method for calculation of the utilization-based coefficient for the task scheduling theory (Formula 2) [3] and the rate of occupancy of service in the queuing theory are outlined (5) [7]. Formulas 3 and 4 describe the task response time for a system with or without pre-emptive system determined with use of the task scheduling theory [3]. In Paragraph 5 calculation of the mean task residence time in the non-pre-emptive (7) and pre-emptive system (10), as well as the mean task residence time in the queue with use of the queuing theory are presented (formulas 6 and 8) [5, 7]. The results of carried out calculations and simulations contained in Paragraph 6 show usability of the queuing theory for analysis of MCS.
Źródło:
Pomiary Automatyka Kontrola; 2010, R. 56, nr 11, 11; 1342-1344
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analiza porównawcza protokołów przesyłania wiadomościasynchronicznych w systemach kolejkowych
Comparative analysis of transfer protocols asynchronous messages on systems queuing
Autorzy:
Derlatka, Grzegorz
Kopniak, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/24083634.pdf
Data publikacji:
2023
Wydawca:
Politechnika Lubelska. Instytut Informatyki
Tematy:
message broker
asynchronous communication
amqp protocol
mqtt protocol
system kolejkowy
broker komunikatów
komunikacja asynchroniczna
protokół AMQP
protokół MQTT
Opis:
W tym artykule została przedstawiona analiza wydajności dwóch protokołów obsługiwanych przez systemy kolejkowe, tj. protokołu MQTT (ang. MQ Telemetry Transport) oraz AMQP (ang. Advanced Message Queuing Protocol). Analiza ta została przeprowadzona z użyciem dwóch brokerów wiadomości - ActiveMQ oraz RabbitMQ. Analizie został poddany czas przesłania wiadomości wyznaczony na podstawie czasu wysłania i odebrania komunikatu dla obu protokołów w obu przytoczonych systemach kolejkowych. Testy zostały przeprowadzone przy pomocy własnych aplikacji napisanych w języku Java oraz szkielecie aplikacji Spring.
This article presents an analysis of the performance of two protocols supported by queuing systems, i.e. MQTT and AMQP. This analysis was performed using two message brokers - ActiveMQ and RabbitMQ. The time of sending the message was analyzed, determined on the basis of the time of sending and receiving the message for both protocols in both of the above-mentioned queuing systems. The tests were carried out using proprietary applications written in Java and the Spring application framework.
Źródło:
Journal of Computer Sciences Institute; 2023, 26; 29--32
2544-0764
Pojawia się w:
Journal of Computer Sciences Institute
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analytical properties of a stochastic teletraffic system with MMPP input and an access function
Autorzy:
Tralhao, L.
Craveirinha, J.
Cardoso, D.
Powiązania:
https://bibliotekanauki.pl/articles/309285.pdf
Data publikacji:
2002
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
sieci telekomunikacyjne
stochastic analysis
telecommunication networks
teletraffic theory
GoS analysis
teletraffic systems
queuing systems
Opis:
Stochastic modeling of teletraffic systems with restricted availability and correlated input arrival rates is of great interest in GoS (grade of service) analysis and design of certain telecommunication networks. This paper presents some analytical properties of a recursive nature, associated with the infinitesimal generator of the Markov process which describes the state of a teletraffic system with MMPP (Markov modulated Poisson process) input traffic, negative exponentially distributed service times, finite queue and restricted availability defined through a loss function. Also the possible application of the derived properties to a direct method of resolution of the linear system, which gives the stationary probability distribution of the system, will be discussed.
Źródło:
Journal of Telecommunications and Information Technology; 2002, 3; 17-23
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Classical and non-classical processor sharing systems with non-homogeneous customers
Autorzy:
Tikhonenko, O.
Powiązania:
https://bibliotekanauki.pl/articles/121683.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
kolejkowanie
system kolejkowania
egalitarne współdzielenie procesora
transformata Laplace'a
queuing
queuing system
egalitarian processor sharing
Laplace transform
Opis:
We discuss a processor sharing system with non-homogeneous customers. There are resources of two types for their service: 1) resource of the first type is discrete, there are N units (servers) of the resource; 2) resource of the second type (capacity) is not-necessary discrete. The type of a customer is defined by the amount of first type resource units which is used for the customer service. Each customer is also characterized by some random capacity or some amount of the second type resource which is also used for his service. The total capacity of customers present in the system is limited by some value V >0, which is called the memory volume of the system. The customer capacity and length (the work necessary for service) are generally dependent. The joint distribution of these random variables also depends on the customer type. For such systems we determine the stationary distribution of the number of customers of each type present in the system and stationary loss probabilities for each type of customers.
Źródło:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2009, 14; 133-150
2450-9302
Pojawia się w:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Construction of queue-based simulators for web applications distributed on computer networks
Autorzy:
Pasini, L.
Feliziani, S.
Powiązania:
https://bibliotekanauki.pl/articles/1964158.pdf
Data publikacji:
2005
Wydawca:
Politechnika Gdańska
Tematy:
queuing systems
web-distributed applications
computer networks simulation
communication systems
web interaction paradigms
Opis:
Modern Internet and web applications involve interactions among remote host computers connected by communication networks. Simulation modelling is an important technique to evaluate performance in the implementation of a web-distributed application over given networks formed by computer hosts connected by heterogeneous networks. In this paper we extend a previous work concerning the construction of a queue-based simulator of communication networks. We define a set of new queue-based object types which permit us to specify the behaviour of a web-distributed application whose software components run over different hosts in a given communication network. We apply this technique to show how to build a simulator to evaluate the performance of various software architectures for a web-distributed application run over a given computer network.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2005, 9, 4; 373-396
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Estimating the reliability of the elements of cloud services
Autorzy:
Ignatova, I. V.
Biehun, A. V.
Powiązania:
https://bibliotekanauki.pl/articles/406316.pdf
Data publikacji:
2017
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
cloud technologies
performance evaluation
Markovian queuing systems
Poisson input flow
Opis:
Cloud technologies are a very considerable area that influence IT infrastructure, network services and applications. Research has highlighted difficulties in the functioning of cloud infrastructure. For instance, if a server is subjected to malicious attacks or a force majeure causes a failure in the cloud’s service, it is required to determine the time that it takes the system to return to being fully functional after the crash. This will determine the technological and financial risks faced by the owner and end users of cloud services. Therefore, to solve the problem of determining the expected time before service is resumed after a failure, we propose to apply Markovian queuing systems, specifically a model of a multi-channel queuing system with Poisson input flow and denial-of-service (breakdown).
Źródło:
Operations Research and Decisions; 2017, 27, 3; 65-80
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evaluation of the impact of changes in the city road system on traffic flows
Autorzy:
Pasini, Leonardo
Powiązania:
https://bibliotekanauki.pl/articles/1955280.pdf
Data publikacji:
2018
Wydawca:
Politechnika Gdańska
Tematy:
vehicular traffic systems
queuing networks
modeling
simulation
Opis:
This paper outlines a study carried out to answer the questions asked by an architect of the Siena Municipality Office during a conference at our Department on the managementof traffic flows through the Siena North city road system. The purpose of the study was to ascertain if changes in the road system introduced and included in the new City Developmen tPlan would resolve the current traffic congestion issues. In order to answer this question, we used the technology for the development of vehicle traffic system simulators which was introduced during our previous projects (TASKQuart.14(4) 405,17(3) 155,20(1) 9,20(3) 273).
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2018, 22, 2; 135-171
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
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ł:
Integrated mathematical model of competence-based learning-teaching process
Autorzy:
Różewski, P.
Zaikin, O.
Powiązania:
https://bibliotekanauki.pl/articles/202145.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
competence-based learning
incentive mechanism
control in social-economic systems
queuing theory
competence models
nauczanie
mechanizm motywacyjny
sterowanie w systemach społeczno-gospodarczych
teoria kolejek
model kompetencyjny
Opis:
The competence-based learning-teaching process is a significant approach to the didactical process organization. In this paper the mathematical model of the competence-based learning-teaching process is proposed. The model integrates three models: a knowledge representation model (based on the ontological approach), a motivation model (as a behavioral-incentive model) and a servicing model (in a form of the queuing model). The proposed integrated model allows to control the learning-teaching process on different levels of management. The learning-teaching process can be interpreted as competence-based due to Open and Distance Learning (ODL) philosophy. We assume that the competence is a result of fundamental, procedural and project knowledge acquisition in accordance to the incoming European Qualification Framework.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2015, 63, 1; 245-259
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Investigation of G-network with bypasses of queueing systems by positive customers at a non-stationary regime
Autorzy:
Naumenko, Victor
Kopats, Dmitry
Matalytski, Mikhail
Pankov, Andrey
Powiązania:
https://bibliotekanauki.pl/articles/1839756.pdf
Data publikacji:
2020
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
queuing network
non-stationary regime
negative customers
bypass
sieć kolejkowa
negatywny klient
pozytywny klient
Opis:
An open queuing network (QN) with single-line queuing systems (QS) is considered. QS are characterized by the presence of bypasses and the possibility of coming of negative customers. The network receives two independent elementary streams. The first stream is formed from the ordinary (positive) customers, while the second is composed of negative customers. Arriving of each negative customer to the system destroys exactly one positive customer in the queue, if those are contained. Negative customers do not require maintenance as the service of positive customers in the network systems is carried out in accordance with the FIFO discipline. Positive customers with a probability depending on the state of the node when they are sent to it are added to the queue, and with an additional probability, they immediately bypass it and behave in the future as served. The service in the systems is exponential, the routing of positive customers in the network is Markov, taking into account the possibility of turning the customer into a negative one after sending it to another system.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2020, 19, 3; 85-97
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Metody zarządzania zasobami na przykładzie służby zdrowia
Methods of resource management – the case of healthcare
Autorzy:
Uziałko, Justyna
Radosiński, Edward
Powiązania:
https://bibliotekanauki.pl/articles/907206.pdf
Data publikacji:
2009
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
zasoby opieki zdrowotnej
zarządzanie zasobami służby zdrowia
programowanie liniowe
programowanie całkowitoliczbowe
programowanie celowe
programowanie sieciowe
teoria kolejek
modelowanie symulacyjne
systemy hybrydowe
metody kosztowo-efektywnościowe
healthcare resources
healthcare resource management
linear programming
integer programming
goal programming
network programming
queuing theory
simulation
hybrid systems
costeffectiveness methods
Opis:
W artykule przedstawiono i zanalizowano problem zarządzania zasobami w służbie zdrowia. Omówiono podstawowe zagadnienia w procesie alokacji zasobów medycznych. Zaprezentowano przykłady zastosowania wybranych metod: programowania matematycznego (liniowego, całkowitoliczbowego, celowego, sieciowego), teorii kolejek, modelowania symulacyjnego, systemów hybrydowych oraz standardowych metod kosztowo-efektywnościowych do analizy zagadnień, związanych z podziałem zasobów w systemach opieki zdrowotnej. Przedyskutowano użyteczność tych metod do rozwiązywania szczegółowych problemów dotyczących zarządzania zasobami medycznymi.
Various issues referring to general problems of resource allocation in the area of healthcare were discussed in the article. Fundamental questions regarding the process of allocating healthcare resources were pointed out. The topics were presented according to the categories of methods used to potentially solve these problems. The following approaches were considered: chosen methods of mathematical programming, queuing theory, simulation, hybrid algorithms combining, among others, artificial intelligence and other techniques, as well as standard cost-effectiveness methods. Such methods were applied to the following problems: analyzing the current state of health care units and presenting proposals of changes to such systems. The modifications suggested referred to: allocation of material resources, planning the work schedules of medical personnel and patient admission. The question of determining the effectiveness of various medical strategies was also discussed. The article clearly underlined the importance and complexity of the problem of managing healthcare resources.
Źródło:
Operations Research and Decisions; 2009, 19, 1; 121-142
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimization of the total completion time for asynchronous transmission in a packet data-transmission system
Autorzy:
Piórkowski, A.
Werewka, J.
Powiązania:
https://bibliotekanauki.pl/articles/907757.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
szeregowanie wiadomości
kolejkowanie komunikatu
system rozproszony
system czasu rzeczywistego
message scheduling
message queuing
distributed system
real-time systems
Opis:
The minimization of the total completion time for asynchronous transmission in distributed systems is discussed. Attention is focused on the problem of message scheduling on part of the sender. Messages to be sent form a queue, and the order in which they are to be sent has to be first established. The methods of scheduling messages, which minimize the factor of the total completion time, are presented herein. The message-scheduling problem becomes considerably complicated when the stream of data transmitted between the sender and the receiver is organized into packets. A scheduling rule, according to which the shortest messages (SPT-Shortest Processing Time) are selected as the first to be sent, has been proven to be appropriate for the proposed model. A heuristic algorithm for scheduling messages with real-time constraints is proposed. The performance of the scheduling algorithm is experimentally evaluated. The results of the study show the possibility of improving the total completion time from a few to ten percent, depending on the characteristics of the sender. Thus, the practicability of the method has been proved.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 391-400
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-criteria approach to comparison of inspection allocation for multi-product manufacturing systems in make-to-order sector
Autorzy:
Korytkowski, P.
Wiśniewski, T.
Zaikin, O.
Powiązania:
https://bibliotekanauki.pl/articles/971015.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
production line
queuing network
quality control
make-to-order
Opis:
This paper studies multi-product production manufacturing systems with in-line quality control. Quality control is carried at inspection stations located within a production line. Quality control has an impact on performance of the system: throughput decreases and resource utilization increases. Production lines are modeled as a multi-product Open Jackson Network, where stochastic character of routing is a result of quality control operations. Quality inspection can result in feedback to a work station of the manufacturing system. The approach developed allows for comparing different inspection allocations using three principal indices: overall cost, lead-time and equipment utilization.
Źródło:
Control and Cybernetics; 2010, 39, 1; 97-116
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Networks of queues for the simulation of urban flow systems: an intermodal traffic system
Autorzy:
Pasini, L.
Feliziani, S.
Powiązania:
https://bibliotekanauki.pl/articles/1955697.pdf
Data publikacji:
2004
Wydawca:
Politechnika Gdańska
Tematy:
traffic simulation
traffic engineering
queuing network simulation
Opis:
In this paper we introduce a queueing network model, which can be used to simulate the behaviour of specific traffic systems in an urban context. The frame of the work is that of road automation and traffic system control by queue based models simulation.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2004, 8, 1; 121-130
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 28

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