Informacja

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

Wyszukujesz frazę "Packet size" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
Token Bucket Algorithm with Modernization Techniques to avoid Congestion in DEC Protocol of WSN
Autorzy:
Mohammad, Habibulla
Krishna, K. Phani Rama
Gangadhar, Ch
Mohammed, Riazuddin
Powiązania:
https://bibliotekanauki.pl/articles/27311894.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
Packet size
Token bucket
Queue
Base station
Residual energy
congestion
Opis:
A wireless sensor system is an essential aspect in many fields. It consists of a great deal of sensor nodes. These sensor networks carry out a number of tasks, including interaction, distribution, recognition, and power supply. Data is transmitted from source to destination and plays an important role. Congestion may occur during data transmission from one node to another and also at cluster head locations. Congestion will arise as a result of either traffic division or resource allocation. Energy will be wasted due to traffic division congestion, which causes packet loss and retransmission of removed packets. As a result, it must be simplified; hence there are a few Wireless sensor networks with various protocols that will handle Congestion Control. The Deterministic Energy Efficient Clustering (DEC) protocol, which is fully based on residual energy and the token bucket method, is being investigated as a way to increase the energy efficiency. In the event of congestion, our proposal provides a way to cope with it and solves it using this method to improve lifespan of the sensor networks. Experiments in simulation show that the proposed strategy can significantly enhance lifetime, energy, throughput, and packet loss.
Źródło:
International Journal of Electronics and Telecommunications; 2023, 69, 3; 507--513
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
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ł:
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ł
    Wyświetlanie 1-3 z 3

    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