The effect of traffic shaping in efficiently providing end-to-end performance guarantees
| ISSN: |
1572-9451
|
|---|---|
| Source: |
Springer Online Journal Archives 1860-2000
|
| Topics: |
Electrical Engineering, Measurement and Control Technology
|
| Notes: |
Abstract This paper reports new results concerning the capabilities of a family of service disciplines aimed at providing per-connection end-to-end delay (and throughput) guarantees in high-speed networks. This family consists of the class of rate-controlled service disciplines, in which traffic from a connection is reshaped to conform to specific traffic characteristics, at every hop on its path. When used together with a scheduling policy at each node, this reshaping enables the network to provide end-to-end delay guarantees to individual connections. The main advantages of this family of service disciplines are their implementation simplicity and flexibility. On the other hand, because the delay guarantees provided are based on summing worst case delays at each node, it has also been argued that the resulting bounds are very conservative which may more than offset the benefits. In particular, other service disciplines such as those based on Fair Queueing or Generalized Processor Sharing (GPS), have been shown to provide much tighter delay bounds. As a result, these disciplines, although more complex from an implementation point-of-view, have been considered for the purpose of providing end-to-end guarantees in high-speed networks. In this paper, we show that through “proper” selection of the reshaping to which we subject the traffic of a connection, the penalty incurred by computing end-to-end delay bounds based on worst cases at each node can be alleviated. Specifically, we show how rate-controlled service disciplines can be designed to outperform the Rate Proportional Processor Sharing (RPPS) service discipline. Based on these findings, we believe that rate-controlled service disciplines provide a very powerful and practical solution to the problem of providing end-to-end guarantees in high-speed networks.
|
| Type of Medium: |
Electronic Resource
|
| URL: |
| _version_ | 1798296444105392128 |
|---|---|
| autor | Georgiadis, L. Guérin, R. Peris, V. Sivarajan, K. N. |
| autorsonst | Georgiadis, L. Guérin, R. Peris, V. Sivarajan, K. N. |
| book_url | http://dx.doi.org/10.1007/BF02109727 |
| datenlieferant | nat_lic_papers |
| hauptsatz | hsatz_simple |
| identnr | NLM189968591 |
| issn | 1572-9451 |
| journal_name | Telecommunication systems |
| materialart | 1 |
| notes | Abstract This paper reports new results concerning the capabilities of a family of service disciplines aimed at providing per-connection end-to-end delay (and throughput) guarantees in high-speed networks. This family consists of the class of rate-controlled service disciplines, in which traffic from a connection is reshaped to conform to specific traffic characteristics, at every hop on its path. When used together with a scheduling policy at each node, this reshaping enables the network to provide end-to-end delay guarantees to individual connections. The main advantages of this family of service disciplines are their implementation simplicity and flexibility. On the other hand, because the delay guarantees provided are based on summing worst case delays at each node, it has also been argued that the resulting bounds are very conservative which may more than offset the benefits. In particular, other service disciplines such as those based on Fair Queueing or Generalized Processor Sharing (GPS), have been shown to provide much tighter delay bounds. As a result, these disciplines, although more complex from an implementation point-of-view, have been considered for the purpose of providing end-to-end guarantees in high-speed networks. In this paper, we show that through “proper” selection of the reshaping to which we subject the traffic of a connection, the penalty incurred by computing end-to-end delay bounds based on worst cases at each node can be alleviated. Specifically, we show how rate-controlled service disciplines can be designed to outperform the Rate Proportional Processor Sharing (RPPS) service discipline. Based on these findings, we believe that rate-controlled service disciplines provide a very powerful and practical solution to the problem of providing end-to-end guarantees in high-speed networks. |
| package_name | Springer |
| publikationsjahr_anzeige | 1996 |
| publikationsjahr_facette | 1996 |
| publikationsjahr_intervall | 8004:1995-1999 |
| publikationsjahr_sort | 1996 |
| publisher | Springer |
| reference | 5 (1996), S. 71-83 |
| search_space | articles |
| shingle_author_1 | Georgiadis, L. Guérin, R. Peris, V. Sivarajan, K. N. |
| shingle_author_2 | Georgiadis, L. Guérin, R. Peris, V. Sivarajan, K. N. |
| shingle_author_3 | Georgiadis, L. Guérin, R. Peris, V. Sivarajan, K. N. |
| shingle_author_4 | Georgiadis, L. Guérin, R. Peris, V. Sivarajan, K. N. |
| shingle_catch_all_1 | Georgiadis, L. Guérin, R. Peris, V. Sivarajan, K. N. The effect of traffic shaping in efficiently providing end-to-end performance guarantees Abstract This paper reports new results concerning the capabilities of a family of service disciplines aimed at providing per-connection end-to-end delay (and throughput) guarantees in high-speed networks. This family consists of the class of rate-controlled service disciplines, in which traffic from a connection is reshaped to conform to specific traffic characteristics, at every hop on its path. When used together with a scheduling policy at each node, this reshaping enables the network to provide end-to-end delay guarantees to individual connections. The main advantages of this family of service disciplines are their implementation simplicity and flexibility. On the other hand, because the delay guarantees provided are based on summing worst case delays at each node, it has also been argued that the resulting bounds are very conservative which may more than offset the benefits. In particular, other service disciplines such as those based on Fair Queueing or Generalized Processor Sharing (GPS), have been shown to provide much tighter delay bounds. As a result, these disciplines, although more complex from an implementation point-of-view, have been considered for the purpose of providing end-to-end guarantees in high-speed networks. In this paper, we show that through “proper” selection of the reshaping to which we subject the traffic of a connection, the penalty incurred by computing end-to-end delay bounds based on worst cases at each node can be alleviated. Specifically, we show how rate-controlled service disciplines can be designed to outperform the Rate Proportional Processor Sharing (RPPS) service discipline. Based on these findings, we believe that rate-controlled service disciplines provide a very powerful and practical solution to the problem of providing end-to-end guarantees in high-speed networks. 1572-9451 15729451 Springer |
| shingle_catch_all_2 | Georgiadis, L. Guérin, R. Peris, V. Sivarajan, K. N. The effect of traffic shaping in efficiently providing end-to-end performance guarantees Abstract This paper reports new results concerning the capabilities of a family of service disciplines aimed at providing per-connection end-to-end delay (and throughput) guarantees in high-speed networks. This family consists of the class of rate-controlled service disciplines, in which traffic from a connection is reshaped to conform to specific traffic characteristics, at every hop on its path. When used together with a scheduling policy at each node, this reshaping enables the network to provide end-to-end delay guarantees to individual connections. The main advantages of this family of service disciplines are their implementation simplicity and flexibility. On the other hand, because the delay guarantees provided are based on summing worst case delays at each node, it has also been argued that the resulting bounds are very conservative which may more than offset the benefits. In particular, other service disciplines such as those based on Fair Queueing or Generalized Processor Sharing (GPS), have been shown to provide much tighter delay bounds. As a result, these disciplines, although more complex from an implementation point-of-view, have been considered for the purpose of providing end-to-end guarantees in high-speed networks. In this paper, we show that through “proper” selection of the reshaping to which we subject the traffic of a connection, the penalty incurred by computing end-to-end delay bounds based on worst cases at each node can be alleviated. Specifically, we show how rate-controlled service disciplines can be designed to outperform the Rate Proportional Processor Sharing (RPPS) service discipline. Based on these findings, we believe that rate-controlled service disciplines provide a very powerful and practical solution to the problem of providing end-to-end guarantees in high-speed networks. 1572-9451 15729451 Springer |
| shingle_catch_all_3 | Georgiadis, L. Guérin, R. Peris, V. Sivarajan, K. N. The effect of traffic shaping in efficiently providing end-to-end performance guarantees Abstract This paper reports new results concerning the capabilities of a family of service disciplines aimed at providing per-connection end-to-end delay (and throughput) guarantees in high-speed networks. This family consists of the class of rate-controlled service disciplines, in which traffic from a connection is reshaped to conform to specific traffic characteristics, at every hop on its path. When used together with a scheduling policy at each node, this reshaping enables the network to provide end-to-end delay guarantees to individual connections. The main advantages of this family of service disciplines are their implementation simplicity and flexibility. On the other hand, because the delay guarantees provided are based on summing worst case delays at each node, it has also been argued that the resulting bounds are very conservative which may more than offset the benefits. In particular, other service disciplines such as those based on Fair Queueing or Generalized Processor Sharing (GPS), have been shown to provide much tighter delay bounds. As a result, these disciplines, although more complex from an implementation point-of-view, have been considered for the purpose of providing end-to-end guarantees in high-speed networks. In this paper, we show that through “proper” selection of the reshaping to which we subject the traffic of a connection, the penalty incurred by computing end-to-end delay bounds based on worst cases at each node can be alleviated. Specifically, we show how rate-controlled service disciplines can be designed to outperform the Rate Proportional Processor Sharing (RPPS) service discipline. Based on these findings, we believe that rate-controlled service disciplines provide a very powerful and practical solution to the problem of providing end-to-end guarantees in high-speed networks. 1572-9451 15729451 Springer |
| shingle_catch_all_4 | Georgiadis, L. Guérin, R. Peris, V. Sivarajan, K. N. The effect of traffic shaping in efficiently providing end-to-end performance guarantees Abstract This paper reports new results concerning the capabilities of a family of service disciplines aimed at providing per-connection end-to-end delay (and throughput) guarantees in high-speed networks. This family consists of the class of rate-controlled service disciplines, in which traffic from a connection is reshaped to conform to specific traffic characteristics, at every hop on its path. When used together with a scheduling policy at each node, this reshaping enables the network to provide end-to-end delay guarantees to individual connections. The main advantages of this family of service disciplines are their implementation simplicity and flexibility. On the other hand, because the delay guarantees provided are based on summing worst case delays at each node, it has also been argued that the resulting bounds are very conservative which may more than offset the benefits. In particular, other service disciplines such as those based on Fair Queueing or Generalized Processor Sharing (GPS), have been shown to provide much tighter delay bounds. As a result, these disciplines, although more complex from an implementation point-of-view, have been considered for the purpose of providing end-to-end guarantees in high-speed networks. In this paper, we show that through “proper” selection of the reshaping to which we subject the traffic of a connection, the penalty incurred by computing end-to-end delay bounds based on worst cases at each node can be alleviated. Specifically, we show how rate-controlled service disciplines can be designed to outperform the Rate Proportional Processor Sharing (RPPS) service discipline. Based on these findings, we believe that rate-controlled service disciplines provide a very powerful and practical solution to the problem of providing end-to-end guarantees in high-speed networks. 1572-9451 15729451 Springer |
| shingle_title_1 | The effect of traffic shaping in efficiently providing end-to-end performance guarantees |
| shingle_title_2 | The effect of traffic shaping in efficiently providing end-to-end performance guarantees |
| shingle_title_3 | The effect of traffic shaping in efficiently providing end-to-end performance guarantees |
| shingle_title_4 | The effect of traffic shaping in efficiently providing end-to-end performance guarantees |
| sigel_instance_filter | dkfz geomar wilbert ipn albert fhp |
| source_archive | Springer Online Journal Archives 1860-2000 |
| timestamp | 2024-05-06T09:52:11.988Z |
| titel | The effect of traffic shaping in efficiently providing end-to-end performance guarantees |
| titel_suche | The effect of traffic shaping in efficiently providing end-to-end performance guarantees |
| topic | ZN |
| uid | nat_lic_papers_NLM189968591 |