The Differentiated Service architecture is proposed as a scalable a proach to QoS for IP networks. Therefore it is based on the aggregate (per class) scheduling of packets, but it aims at providing QoS to single flows. In particular the Expedited Forwarding (EF) Per Hop Behavior (FHB) and the related Premium Service have been defined in order to provide deterministic QoS guarantees to IP flows: zero loss and very low delay and jitter. Hence a possible approach to characterize and to dimension a network using the EF PHB is the worst case analysis. In this work we propose a worst case analysis which provides bounds to the queuing delay for a class of network topologies. Our results are compared with similar available results, which provide ”looser” bounds. The comparison with simulation results shows that. the bound is not enough ti ht to be of practical use. We justify the reason for this behaviour and indicate directions for further improvements.

Worst-Case Analysis for Deterministic Allocation in a Differentiated Services Network / Listanti, Marco; L., Veltri; F., Ricciato; S., Salsano. - Unico:(2000), pp. 1554-1560. (Intervento presentato al convegno GLOBECOM 2000 tenutosi a SAN FRANCISCO (USA) nel December 2000) [10.1109/GLOCOM.2000.891900].

Worst-Case Analysis for Deterministic Allocation in a Differentiated Services Network

LISTANTI, Marco;
2000

Abstract

The Differentiated Service architecture is proposed as a scalable a proach to QoS for IP networks. Therefore it is based on the aggregate (per class) scheduling of packets, but it aims at providing QoS to single flows. In particular the Expedited Forwarding (EF) Per Hop Behavior (FHB) and the related Premium Service have been defined in order to provide deterministic QoS guarantees to IP flows: zero loss and very low delay and jitter. Hence a possible approach to characterize and to dimension a network using the EF PHB is the worst case analysis. In this work we propose a worst case analysis which provides bounds to the queuing delay for a class of network topologies. Our results are compared with similar available results, which provide ”looser” bounds. The comparison with simulation results shows that. the bound is not enough ti ht to be of practical use. We justify the reason for this behaviour and indicate directions for further improvements.
2000
GLOBECOM 2000
DIFFERENTIATED SERVICES; Worst case analysis; IP NETWORKS
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Worst-Case Analysis for Deterministic Allocation in a Differentiated Services Network / Listanti, Marco; L., Veltri; F., Ricciato; S., Salsano. - Unico:(2000), pp. 1554-1560. (Intervento presentato al convegno GLOBECOM 2000 tenutosi a SAN FRANCISCO (USA) nel December 2000) [10.1109/GLOCOM.2000.891900].
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/189576
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 0
social impact