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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Analysis of AQM queues with queue size based packet dropping
    Autorzy:
    Chydziński, A.
    Chróst, Ł.
    Powiązania:
    https://bibliotekanauki.pl/articles/907529.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    system kolejkowy
    porzucanie pakietu
    wielkość rozproszenia
    aktywne zarządzanie kolejką
    single-server queue
    packet dropping
    queue size distribution
    active queue management
    Opis:
    Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical examples that include some commonly used blocking probabilities (dropping functions).
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2011, 21, 3; 567-577
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    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ł:
    Transient and stationary characteristics of a packet buffer modelled as an MAP/SM/1/b system
    Autorzy:
    Rusek, K.
    Janowski, L.
    Papir, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/330560.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    router interface
    Markovian arrival process
    semi Markov service time
    hidden Markov model
    finite buffer queue
    packet loss
    first passage time
    proces Markowiana
    model Markowa niejawny
    utrata pakietu
    Opis:
    A packet buffer limited to a fixed number of packets (regardless of their lengths) is considered. The buffer is described as a finite FIFO queuing system fed by a Markovian Arrival Process (MAP) with service times forming a Semi-Markov (SM) process (MAP/SM/1/b in Kendall’s notation). Such assumptions allow us to obtain new analytical results for the queuing characteristics of the buffer. In the paper, the following are considered: the time to fill the buffer, the local loss intensity, the loss ratio, and the total number of losses in a given time interval. Predictions of the proposed model are much closer to the trace-driven simulation results compared with the prediction of the MAP/G/1/b model.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2014, 24, 2; 429-442
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    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ł:
    Fault diagnosis of networked control systems
    Autorzy:
    Aubrun, C.
    Sauter, D.
    Yamé, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/929885.pdf
    Data publikacji:
    2008
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    sterowanie siecią
    system sterowania
    diagnostyka uszkodzeń
    sterowanie odporne na błędy
    straty pakietów
    komunikacja ograniczona
    networked control systems
    fault diagnosis
    fault tolerant control
    network-induced time delays
    packet losses
    limited communication
    Opis:
    Networked Control Systems (NCSs) deal with feedback control systems with loops closed via data communication networks. Control over a network has many advantages compared with traditionally controlled systems, such as a lower implementation cost, reduced wiring, simpler installation and maintenance and higher reliability. Nevertheless, the network-induced delay, packet dropout, asynchronous behavior and other specificities of networks will degrade the performance of closed-loop systems. In this context, it is necessary to develop a new theory for systems that operate in a distributed and asynchronous environment. Research on Fault Detection and Isolation (FDI) for NCSs has received increasing attention in recent years. This paper reviews the state of the art in this topic.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2008, 18, 4; 525-537
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    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