Scheduling model and performance analysis in transport mapping layer of control element in forwarding and control element separation system
SUMMARY The transport mapping layer (TML) scheduling model in forwarding and control element separation (ForCES) system is important because it not only should be able to process the messages with different priorities but also can solve the fairness and robustness problems in network element level....
Gespeichert in:
Veröffentlicht in: | International journal of communication systems 2013-03, Vol.26 (3), p.395-411 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | SUMMARY
The transport mapping layer (TML) scheduling model in forwarding and control element separation (ForCES) system is important because it not only should be able to process the messages with different priorities but also can solve the fairness and robustness problems in network element level. In this paper, a two‐stage scheduling scheme with strict priority and general processor share scheduling is proposed. In a stochastic network calculus framework and on the basis of moment‐generating functions, bounds on average backlogs and delays of all channels are derived. The performance solving approach presented in this paper is quite general and practical, and the results may be used in other fields easily, without limiting ForCES CE TML. Numerical examples are presented to test the bounds, which show the scheduling scheme is practical and well suited for CE TML requirements. Copyright © 2013 John Wiley & Sons, Ltd.
The transport mapping layer scheduling model in ForCES control element is important because it not only should be able to process the messages with different priorities but also can solve the fairness and robustness problems in network element level. In this paper, a two‐stage scheduling scheme with strict priority and general processor share scheduling is proposed. In a stochastic network calculus framework, and based on moment generating functions, bounds on average backlogs and delays of all channels are derived. |
---|---|
ISSN: | 1074-5351 1099-1131 |
DOI: | 10.1002/dac.2490 |