Ograniczanie wyników
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Powiadomienia systemowe
  • Sesja wygasła!

Znaleziono wyników: 1

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  MFCR
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
A communication link that accommodates different service-classes whose calls have different bandwidth requirements and compete for the available bandwidth under the Multiple Fractional Channel Reservation (MFCR) policy is considered. The MFCR policy allows the reservation of real number of channel In order to fawor high Speer calls. Two call arrival processes are studied: i) the Poisson (random) process and ii) the quasi-random process. In the first case, calls come from an infinite number of sources while in the second case calls are generated by a finite number of sources. To determine call blocking probabilities for Poisson arriving calls, recursive formulas are proposed based on reverse transition rates. To determine time and call congestion probabilities for quasi-random arriving calls,recursive formulas are proven based on the fact that the steady state probabilities cannot be described by a product form solution. The accuracy of the new formulas is verified through simulation.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.