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 system" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-14 z 14
    Tytuł:
    Queuing in terms of complex systems
    Autorzy:
    Grabowski, F.
    Paszkiewicz, A.
    Bolanowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/106320.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Tematy:
    complex systems
    queuing system
    simple systems
    Opis:
    Limited resources are a natural feature of most real systems, both artificial and natural ones. This causes the need for effective management of access to existing resources. In this area, queuing systems are of special application. However, they are treated as simple systems for which two states are characteristic: work underload and work on the border of thermodynamic equilibrium.This approach is reflected in existing queue management mechanisms, that need to keep them in one of two mentioned states. On the other hand, they should be considered from the point of complex systems view, for which the third operation states: overload state is natural as well. In order to be closer to this issue, in this paper the authors consider queues performance from the perspective of complex systems.
    Źródło:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2014, 14, 3; 7-13
    1732-1360
    2083-3628
    Pojawia się w:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Traffic simulation in a telecommunication system based on queuing systems with different input flows
    Autorzy:
    Bobalo, Y.
    Politanskyi, R.
    Klymash, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/411201.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Oddział w Lublinie PAN
    Tematy:
    herst index
    self-similar flow
    queuing system
    Poisson flow
    Opis:
    The simulation method of queuing system for traffic simulation in telecommunication system is studied. Different types of input flow are considered: uniform distributed, Poisson distributed and self-similar flow with different Herst indexes.
    Źródło:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2015, 4, 1; 11-15
    2084-5715
    Pojawia się w:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
    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ł:
    Optimization of an M/M/1/N feedback queue with retention of reneged customers
    Autorzy:
    Kumar, R.
    Jain, N. K.
    Som, B. K.
    Powiązania:
    https://bibliotekanauki.pl/articles/969064.pdf
    Data publikacji:
    2014
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    reneging
    retention of reneged customers
    revenue
    queuing system
    optimization
    dochód
    system kolejkowania
    optymalizacja
    Opis:
    Customer impatience has become a threat to the business world. Firms employ various customer retention strategies to retain their impatient (or reneged) customers. Customer retention mechanisms may help to retain some or all impatient customers. Further, due to unsatisfactory service, customers may rejoin a queue immediately after departure. Such cases are referred to as feedback customers. Kumar and Sharma take this situation into account and study an M/M/1/N feedback queuing system with retention of reneged customers. They obtain only a steady-state solution for this model. In this paper, we extend the work of Kumar and Sharma by performing an economic analysis of the model. We develop a model for the costs incurred and perform the appropriate optimization. The optimum system capacity and optimum service rate are obtained.
    Źródło:
    Operations Research and Decisions; 2014, 24, 3; 45-58
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Program for Modelling Queuing Systems in Transport
    Autorzy:
    Dimitrov, Stavri
    Powiązania:
    https://bibliotekanauki.pl/articles/504405.pdf
    Data publikacji:
    2012
    Wydawca:
    Międzynarodowa Wyższa Szkoła Logistyki i Transportu
    Tematy:
    transport
    process
    service
    queuing theory
    queuing system
    modelling
    software program
    programming language
    VBA
    Microsoft® Office Excel
    Opis:
    This paper presents an example application of a software program developed using the programming language VBA and designed for modelling queuing systems in the field of transport. The program enables users to quantitatively determine the indicators of the queuing systems. In order to show the program’s capabilities and how it can be used, two scenarios have been considered - modelling single-server and multi-server queuing systems of type M/M/1 and M/M/S, respectively, having a Poisson incoming flow of requests and exponentially distributed service times.
    Źródło:
    Logistics and Transport; 2012, 15, 2; 85-90
    1734-2015
    Pojawia się w:
    Logistics and Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Passenger level of service estimation model for queuing systems at the airport
    Autorzy:
    Kierzkowski, A.
    Kisiel, T.
    Pawlak, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/223601.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    airport
    passenger service
    level of service
    queuing system
    lotnisko
    obsługa pasażerów
    poziom usług
    system kolejkowania
    Opis:
    This paper presents a model for the management of passenger service operations at airports by the estimation of a global index of the level of service. This paper presents a new approach to the scheduling of resources required to perform passenger service operations at airports. The approach takes into account the index of level of service as a quantitative indicator that can be associated with airport revenues. Taking this index into account makes it possible to create an operating schedule of desks, adapted to the intensity of checking-in passengers, and, as such, to apply dynamic process management. This offers positive aspects, particularly the possibility of improvement of service quality that directly translates into profits generated by the non-aeronautical activity of airports. When talking about level of service, there can be distinguish other important indicators that are considered very often (eg maximum queuing time, space in square meters). In this model, however, they are considered as secondary. Of course, space in square meters is important when designing a system. Here this system is already built and functioning. The concept of the model is the use of a hybrid method: computer simulation (Monte Carlo simulation) with multiple regression. This paper focuses on the presentation of a mathematical model used to determine the level of service index that provides new functionality in the current simulation model, as presented in the authors’ previous scientific publications. The mathematical model is based on a multiple regression function, taking into account the significance of individual elementary operations of passenger service at an air terminal.
    Źródło:
    Archives of Transport; 2018, 47, 3; 29-38
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Queue-based simulators of P2P networks
    Autorzy:
    Pasini, L.
    Feliziani, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/1933180.pdf
    Data publikacji:
    2007
    Wydawca:
    Politechnika Gdańska
    Tematy:
    computer science engineering
    queuing system networks
    computer networks simulation
    communication system protocols
    voice over IP networks
    Opis:
    A technique is introduced for the construction of simulators of telecommunication networks based on the P2P protocol with a decentralized directory. The context of the application concerns P2P networks used both by sharing software and by telecommunication applications, as in VoIP applications. P2P systems have the advantages of boundless scalability and the break-up insensibility of devices, but suffer from heavy traffic of signals and network delays. Therefore, simulation of signal traffic in P2P networks is an important issue. The technique we have developed enables individuation of a generic P2P network's components and their functional characterization. We have worked at this level of description in order to determine the architecture of every component as a model of queues' networks. We have therefore defined a library of new types of objects for the construction of P2P network simulators with the Qnap2.V9 programming language. In this context, we have defined a procedure automatically generating the simulator of an any P2P network. During its execution, the procedure reads data from a file containing a description of the structure of the considered P2P network and values of the characteristic parameters of its components. Results related to the simulation of three configurations of a P2P network are introduced in Section 5 below. They differ according to the technology used to realize the local interconnection networks. The context of the present paper is a research program developed at the University of Camerino in defining specific computer procedures aimed at construction of simulators of telecommunication and computing networks. This technique also enables simulation of the software elaboration phases on computer networks and evaluation of the impact of specific choices concerning the structure of transmission protocols and operation paradigms of software applications [1, 2].
    Źródło:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2007, 11, 3; 203-235
    1428-6394
    Pojawia się w:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Dynamic programming in constrained Markov decision
    Autorzy:
    Piunovskiy, A. B.
    Powiązania:
    https://bibliotekanauki.pl/articles/970861.pdf
    Data publikacji:
    2006
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    optymalizacja
    programowanie dynamiczne
    system kolejek
    Markov decision process (MDP)
    constraints
    optimization
    dynamic programming
    myopic control strategy
    queuing system
    Opis:
    We consider a discounted Markov Decision Process (MDP) supplemented with the requirement that another discounted loss must not exceed a specified value, almost surely. We show that he problem can be reformulated as a standard MDP and solved using the Dynamic Programming approach. An example on a controlled queue is presented. In the last section, we briefly reinforce the connection of the Dynamic Programming approach to another close problem statement and present the corresponding example. Several other types of constraints are discussed, as well.
    Źródło:
    Control and Cybernetics; 2006, 35, 3; 645-660
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    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ł:
    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ł:
    Analytical Model of the Optimal Capacity of an Irrigation System
    Analityczny model optymalnej wydajności systemu nawadniania
    Autorzy:
    Palkova, Z.
    Rodny, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/298215.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Warmińsko-Mazurski w Olsztynie
    Tematy:
    system nawadniania
    teoria kolejkowania
    model analityczny
    optymalizacja procesu
    irrigation system
    queuing theory application
    analytical model
    process optimization
    Opis:
    The size and stability of yield per hectare of agricultural crops are greatly affected by climatic conditions, temperature, solar radiation, but especially the quantity and quality of rainfall, which for most agricultural crops is insufficient. Building large-scale irrigation systems is difficult in terms of investment, as well as operating costs. Claimed agricultural yields often do not emanate from a set of certain claims for each of the crops, but are only an estimate based upon empirical experience. Precise determination of these data is very difficult and without the use of exact mathematical methods and information technology would be virtually impossible. Goal of this project is dedicated to enhance of an irrigation system analytical model usability, which would allow the determination of the optimal capacity of the irrigation system in response to microclimate and soil conditions with respect to the crops and irrigation facilities. Developing new methods of precise irrigation is the way of higher and ecological productivity in agricultural production subsystem.
    Wielkość oraz stabilność plonu z hektara uprawianego pola w dużej mierze zależy od warunków klimatycznych, temperatury, promieniowania słonecznego, ale w szczególny sposób od jakości oraz ilości opadów deszczowych. Opady te dla większości upraw rolniczych są niewystarczające. Oszacowanie wydajności systemu nawadniania nie wynika zatem jedynie z zapotrzebowania na wodę uprawianych roślin, lecz także zależy od czynników losowych - mikroklimatycznych. Aktualnie wydajność systemu nawadniania, wielkości jedynie przybliżonej, szacuje się często na podstawie doświadczeń empirycznych. Dokładne określenie wydajności systemu nawadniania jest bardzo trudne i praktycznie niemożliwe bez zastosowania dokładnych metod matematycznych oraz technologii informatycznych. Celem pracy było zwiększenie użyteczności matematycznego modelu systemu nawadniania, co powinno pozwolić na określenie optymalnej wydajności systemu nawadniania w zależności od mikroklimatu i warunków gruntowych, z uwzględnieniem upraw oraz urządzeń nawadniających.
    Źródło:
    Technical Sciences / University of Warmia and Mazury in Olsztyn; 2011, 14(1); 23-31
    1505-4675
    2083-4527
    Pojawia się w:
    Technical Sciences / University of Warmia and Mazury in Olsztyn
    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ł:
    Queueing theory as an instrument of optimization operational and economic sphere of port terminals - case study
    Autorzy:
    Grzelakowski, Andrzej S.
    Karaś, Adrianna
    Powiązania:
    https://bibliotekanauki.pl/articles/2203763.pdf
    Data publikacji:
    2022
    Wydawca:
    Wyższa Szkoła Logistyki
    Tematy:
    port terminal
    mass service system
    queuing theory
    terminal operating effectiveness
    terminal efficiency
    terminal added value
    terminal portowy
    system obsługi masowej
    teoria kolejek
    efektywność pracy terminala
    efektywność terminala
    wartość dodana terminala
    Opis:
    Background: The maritime port terminals, handling cargo and servicing maritime and land means of transport with variable intensity over time, operate as mass service systems where the process of notifying and fulfilling needs usually occur at random. The main research problem was to determine the interdependence between the mechanism of reporting and meeting the demand for terminal services and its effectiveness measured in terms of operational efficiency and profitability. Methods: The aim of research involves evaluating the terminal operational mechanism and evaluating it under operational categories, that is, operational stability and efficiency, and economic ones, i.e., effectiveness with respect to costs and revenue. To achieve the aim of research, the theory of mass service was applied, with the use of queuing theory as well as case study. The research was conducted in an example of bulk handling terminal, i.e. HES Gdynia Bulk Terminal. Results: In the article, the authors assumed that the bulk cargo handling terminal in Gdynia operates as a queueing model. Therefore, it was possible to analyse the operating mechanism of the selected port terminal as a logistics system and a link in the supply chain by characterising it in terms of technical and operational efficiency and economic and financial effectiveness. Conclusions: So far, such terminals have not the subject of this kind research, because researchers focused predominantly on seaports as composite multimodal transport nodes. The results of the conducted research confirm the previously formulated hypothesis, indicating that queueing theory can be used as an useful instrument to optimize the efficiency and effectiveness of bulk cargo terminals.
    Źródło:
    LogForum; 2022, 18, 3; 345--355
    1734-459X
    Pojawia się w:
    LogForum
    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ł
      Wyświetlanie 1-14 z 14

      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