Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | Proceedings - 2006 Fourteenth International Workshop on Quality of Service |
| Untertitel | IWQoS 2006 |
| Seiten | 261-270 |
| Seitenumfang | 10 |
| Publikationsstatus | Veröffentlicht - 2006 |
| Extern publiziert | Ja |
| Veranstaltung | 2006 14th IEEE International Workshop on Quality of Service, IWQoS 2006 - New Haven, CT, USA / Vereinigte Staaten Dauer: 19 Juni 2006 → 21 Juni 2006 |
Publikationsreihe
| Name | IEEE International Workshop on Quality of Service, IWQoS |
|---|---|
| ISSN (Print) | 1548-615X |
Abstract
Network calculus is a min-plus system theory for performance evaluation of queuing networks. Its elegance stems from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worst-case assumptions of network calculus to develop a probabilistic equivalent that benefits from statistical multiplexing. Significant achievements have been made, owing for example to the theory of effective bandwidths, however, the outstanding scalability set up by concatenation of deterministic servers has not been shown. This paper establishes a concise, probabilistic network calculus with moment generating functions. The presented work features closed-form, end-to-end, probabilistic performance bounds that achieve the objective of scaling linearly in the number of servers in series. The consistent application of moment generating functions put forth in this paper utilizes independence beyond the scope of current statistical multiplexing of flows. A relevant additional gain is demonstrated for tandem servers with independent cross-traffic.
ASJC Scopus Sachgebiete
- Ingenieurwesen (insg.)
- Elektrotechnik und Elektronik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Proceedings - 2006 Fourteenth International Workshop on Quality of Service: IWQoS 2006. 2006. S. 261-270 4015760 (IEEE International Workshop on Quality of Service, IWQoS).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - An End-to-End Probabilistic Network Calculus with Moment Generating Functions
AU - Fidler, Markus
PY - 2006
Y1 - 2006
N2 - Network calculus is a min-plus system theory for performance evaluation of queuing networks. Its elegance stems from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worst-case assumptions of network calculus to develop a probabilistic equivalent that benefits from statistical multiplexing. Significant achievements have been made, owing for example to the theory of effective bandwidths, however, the outstanding scalability set up by concatenation of deterministic servers has not been shown. This paper establishes a concise, probabilistic network calculus with moment generating functions. The presented work features closed-form, end-to-end, probabilistic performance bounds that achieve the objective of scaling linearly in the number of servers in series. The consistent application of moment generating functions put forth in this paper utilizes independence beyond the scope of current statistical multiplexing of flows. A relevant additional gain is demonstrated for tandem servers with independent cross-traffic.
AB - Network calculus is a min-plus system theory for performance evaluation of queuing networks. Its elegance stems from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worst-case assumptions of network calculus to develop a probabilistic equivalent that benefits from statistical multiplexing. Significant achievements have been made, owing for example to the theory of effective bandwidths, however, the outstanding scalability set up by concatenation of deterministic servers has not been shown. This paper establishes a concise, probabilistic network calculus with moment generating functions. The presented work features closed-form, end-to-end, probabilistic performance bounds that achieve the objective of scaling linearly in the number of servers in series. The consistent application of moment generating functions put forth in this paper utilizes independence beyond the scope of current statistical multiplexing of flows. A relevant additional gain is demonstrated for tandem servers with independent cross-traffic.
UR - http://www.scopus.com/inward/record.url?scp=33748557572&partnerID=8YFLogxK
U2 - 10.1109/IWQOS.2006.250477
DO - 10.1109/IWQOS.2006.250477
M3 - Conference contribution
AN - SCOPUS:33748557572
SN - 1424404762
SN - 9781424404766
T3 - IEEE International Workshop on Quality of Service, IWQoS
SP - 261
EP - 270
BT - Proceedings - 2006 Fourteenth International Workshop on Quality of Service
T2 - 2006 14th IEEE International Workshop on Quality of Service, IWQoS 2006
Y2 - 19 June 2006 through 21 June 2006
ER -