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: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    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ł:
    Simulation modeling in GPSS for optimizing the traffic lights cycle of adjustable crossroads
    Autorzy:
    Kravchenya, Irina
    Lebid, Iryna
    Powiązania:
    https://bibliotekanauki.pl/articles/2141049.pdf
    Data publikacji:
    2020
    Wydawca:
    Fundacja Centrum Badań Socjologicznych
    Tematy:
    simulation modeling
    adjustable crossroads
    traffic lights cycle
    queuing systems
    Opis:
    The problem of traffic management, especially in big cities is particularly actual. Due to unavoidable motorization increase in number of vehicles has resulted in congestion, traffic jams, difficulty of the movement of pedestrians, increasing the number of accidents. Traffic jams are undesirable because of higher fuel consumption, increased pollution due to exhaust gases as well as noise, etc. The only way to avoid harmful consequences is to optimize the operation of the traffic lights cycle. The purpose of the work is creation the simulation model in GPSS for determining the optimal traffic lights cycle at adjustable crossroads when managing vehicle flows with specified intensities. The mathematical model of adjustable crossroads can be presented as a queuing system. Development of the simulation model includes several stages: programming in GPSS, verification and assessment of the adequacy. The algorithm for optimizing the traffic lights cycle and diagrams are used to find the optimal value of the cycle. The minimum intersection travel time (including time of queuing) is selected as the optimal criterion. The object of study is the traffic lights cycle regulation of the intersection Sovietskaya St. – Rogachevskaya St. – Telman St. in Gomel, Belarus. The existing traffic lights cycle regulation at the intersection Sovietskaya str. – Rogachevskaya str. – Telman str. has been studied. Simulation modeling of the intersection has been created in GPSS and traffic light cycle optimization algorithm has been developed. According to a worked out algorithm the traffic lights cycle at research intersection during saturation flux has been improved. Transport delays both at the existing and optimized crossings have been estimated. Optimization of the traffic lights cycle will increase the traffic capacity of the intersection, reduce the volume of toxic emissions and decrease the accident risk. The developed simulation model can be modified for other types of intersections and used as the basis for a decision support system based on low-level simulation.
    Źródło:
    Journal of Sustainable Development of Transport and Logistics; 2020, 5, 1; 48-55
    2520-2979
    Pojawia się w:
    Journal of Sustainable Development of Transport and Logistics
    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ł:
    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ł:
    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-5 z 5

      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