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ę "Sarigiannidis, P." wg kryterium: Autor


Wyświetlanie 1-2 z 2
Tytuł:
Performance metrics in OFDM wireless networks supporting quasi-random traffic
Autorzy:
Panagoulias, P.
Moscholios, I.
Sarigiannidis, P.
Piechowiak, M.
Logothetis, M.
Powiązania:
https://bibliotekanauki.pl/articles/200360.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
congestion
quasi random
OFDM
reservation
loss model
recursive
Opis:
We consider the downlink of an orthogonal frequency division multiplexing (OFDM) based cell that accommodates calls from different service-classes with different resource requirements. We assume that calls arrive in the cell according to a quasi-random process, i.e., calls are generated by a finite number of sources. To calculate the most important performance metrics in this OFDM-based cell, i.e., congestion probabilities and resource utilization, we model it as a multirate loss model, show that the steady-state probabilities have a product form solution (PFS) and propose recursive formulas which reduce the complexity of the calculations. In addition, we study the bandwidth reservation (BR) policy which can be used in order to reserve subcarriers in favor of calls with high subcarrier requirements. The existence of the BR policy destroys the PFS of the steady-state probabilities. However, it is shown that there are recursive formulas for the determination of the various performance measures. The accuracy of the proposed formulas is verified via simulation and found to be satisfactory.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 2; 215-223
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance Evaluation of Two-Link Multirate Loss Models with Restricted Accessibility
Autorzy:
Keramidi, Irene P.
Moscholios, Ioannis D.
Sarigiannidis, Panagiotis G.
Logothetis, Michael D.
Powiązania:
https://bibliotekanauki.pl/articles/308606.pdf
Data publikacji:
2020
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
accessibility
blocking
non-product form
Poisson
quasi-random
threshold
Opis:
We consider a two-link communication system with restricted accessibility that services Poisson arriving calls of many service-classes and propose a multirate teletraffic loss model for its analysis. In a restricted accessibility system, call blocking occurs even if available resources do exist at the time of a call’s arrival. In the two-link system under consideration, each link has two thresholds (offloading and support) which express the in-service calls in a link. The offloading threshold represents the point from which a link offloads calls. The support threshold (which is lower than the offloading threshold) defines the point up to which a link supports offloaded calls. The two-link system with restricted accessibility is modeled as a loss system whose steady state probabilities do not have a product form solution. However, approximate formulas for the determination of call blocking probabilities are proposed. In addition, we also provide a corresponding analysis related to the case of quasi-random traffic (i.e. traffic generated by a finite number of users). The accuracy of all formulas is verified through simulation and is found to be quite satisfactory.
Źródło:
Journal of Telecommunications and Information Technology; 2020, 2; 61-69
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    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