Details
| Original language | English |
|---|---|
| Pages (from-to) | 274-286 |
| Number of pages | 13 |
| Journal | Computer communications |
| Volume | 28 |
| Issue number | 3 |
| Publication status | Published - 18 Nov 2004 |
| Externally published | Yes |
Abstract
The Differentiated Services architecture allows providing scalable Quality of Service by means of aggregating flows to a small number of traffic classes. Among these classes a Premium Service is defined, for which end-to-end delay guarantees are of particular interest. However, in aggregate scheduling networks such delay bounds suffer significantly from effects that are due to multiplexing of flows to aggregates. A way to minimize the impacts of interfering flows is to shape incoming traffic, so that bursts are smoothed. Doing so reduces the queuing delay within the core of a domain, whereas an additional shaping delay at the edge is introduced. This paper addresses the issue of traffic shaping analytically by extending known Network Calculus. An equation that allows computing tight per-flow output bounds in aggregate scheduling networks is derived and a solution for shaped interfering flows is provided. We then give an overview on the shaping capabilities of current legacy routers, showing deviations of actual implementations compared to the idealized view. Finally, the evolved analytical framework is applied to an example scenario and the results are compared to corresponding measurements.
Keywords
- Aggregate scheduling, Differentiated services, Legacy routers, Network calculus, Traffic shaping
ASJC Scopus subject areas
- Computer Science(all)
- Computer Networks and Communications
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Computer communications, Vol. 28, No. 3, 18.11.2004, p. 274-286.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - Traffic shaping in aggregate-based networks
T2 - Implementation and analysis
AU - Fidler, Markus
AU - Sander, Volker
AU - Klimala, Wojciech
PY - 2004/11/18
Y1 - 2004/11/18
N2 - The Differentiated Services architecture allows providing scalable Quality of Service by means of aggregating flows to a small number of traffic classes. Among these classes a Premium Service is defined, for which end-to-end delay guarantees are of particular interest. However, in aggregate scheduling networks such delay bounds suffer significantly from effects that are due to multiplexing of flows to aggregates. A way to minimize the impacts of interfering flows is to shape incoming traffic, so that bursts are smoothed. Doing so reduces the queuing delay within the core of a domain, whereas an additional shaping delay at the edge is introduced. This paper addresses the issue of traffic shaping analytically by extending known Network Calculus. An equation that allows computing tight per-flow output bounds in aggregate scheduling networks is derived and a solution for shaped interfering flows is provided. We then give an overview on the shaping capabilities of current legacy routers, showing deviations of actual implementations compared to the idealized view. Finally, the evolved analytical framework is applied to an example scenario and the results are compared to corresponding measurements.
AB - The Differentiated Services architecture allows providing scalable Quality of Service by means of aggregating flows to a small number of traffic classes. Among these classes a Premium Service is defined, for which end-to-end delay guarantees are of particular interest. However, in aggregate scheduling networks such delay bounds suffer significantly from effects that are due to multiplexing of flows to aggregates. A way to minimize the impacts of interfering flows is to shape incoming traffic, so that bursts are smoothed. Doing so reduces the queuing delay within the core of a domain, whereas an additional shaping delay at the edge is introduced. This paper addresses the issue of traffic shaping analytically by extending known Network Calculus. An equation that allows computing tight per-flow output bounds in aggregate scheduling networks is derived and a solution for shaped interfering flows is provided. We then give an overview on the shaping capabilities of current legacy routers, showing deviations of actual implementations compared to the idealized view. Finally, the evolved analytical framework is applied to an example scenario and the results are compared to corresponding measurements.
KW - Aggregate scheduling
KW - Differentiated services
KW - Legacy routers
KW - Network calculus
KW - Traffic shaping
UR - http://www.scopus.com/inward/record.url?scp=13544261418&partnerID=8YFLogxK
U2 - 10.1016/j.comcom.2004.10.005
DO - 10.1016/j.comcom.2004.10.005
M3 - Article
AN - SCOPUS:13544261418
VL - 28
SP - 274
EP - 286
JO - Computer communications
JF - Computer communications
SN - 0140-3664
IS - 3
ER -