Temat: preemption - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Performance Evaluation of Preemption Algorithms in MPLS Networks
Autorzy:: Kaczmarek, S.
Nowak, K.
Powiązania:: https://bibliotekanauki.pl/articles/226477.pdf
Data publikacji:: 2011
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: MPLS
preemption
algorithms
traffic engineering
Opis:: Preemption is a traffic engineering technique in Multiprotocol Switching Network that enables creation of high priority paths when there is not enough free bandwidth left on the route. Challenging part of any preemption method is to select the best set of paths for removal. Several heuristic methods are available but no wider comparison had been published before. In this paper, we discusses the dilemmas in implementing preemption methods are presented the simulation studyof well known existing algorithms. Based on the results, we provide recommendations for deployment of preemption for the two most common evaluation criteria: number of preemption and preempted bandwidth.
Źródło:: International Journal of Electronics and Telecommunications; 2011, 57, 2; 169-175
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Stability of preemptive EDF queueing networks
Autorzy:: Kruk, Łukasz
Powiązania:: https://bibliotekanauki.pl/articles/1395935.pdf
Data publikacji:: 2019
Wydawca:: Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:: Multiclass queueing networks
deadlines
preemption
stability
fluid models
fluid limits
Opis:: We show stability of preemptive, strictly subcritical EDF networks with Markovian routing. To this end, we prove that the associated fluid limits satisfy the first-in-system, first-out (FISFO) fluid model equations and thus, by an extension of a result of Bramson (2001), the corresponding fluid models are stable. We also demonstrate that in a preemptive multiclass EDF network, after a time large enough to process all the initial customers to completion, the maximal number of partially served customers in the system over a finite time horizon converges to zero in \(L^1\) under fluid scaling.
Źródło:: Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica; 2019, 73, 2
0365-1029
2083-7402
Pojawia się w:: Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja