In this paper we propose an admission control algorithm which is suitable for real time traffic in a sink-tree network in which per-aggregate resource management is in place. Every flow specifies its leaky-bucket parameters and a required delay bound, and the algorithm admits a new flow if a guarantee can be given that the delay bound for every established flow is not exceeded. The algorithm is based on a formula, derived through Network Calculus, that relates the worst-case delay of a single flow to the transmission rate provisioned for the aggregate and to the leaky-bucket parameters of flows at the ingress of the network. We describe the algorithm and the employed data structures, and we evaluate its complexity.

Exploiting Network Calculus for Delay-based Admission Control in a Sink-Tree Network

LENZINI, LUCIANO;MARTORINI, LINDA;MINGOZZI, ENZO;STEA, GIOVANNI
2005

Abstract

In this paper we propose an admission control algorithm which is suitable for real time traffic in a sink-tree network in which per-aggregate resource management is in place. Every flow specifies its leaky-bucket parameters and a required delay bound, and the algorithm admits a new flow if a guarantee can be given that the delay bound for every established flow is not exceeded. The algorithm is based on a formula, derived through Network Calculus, that relates the worst-case delay of a single flow to the transmission rate provisioned for the aggregate and to the leaky-bucket parameters of flows at the ingress of the network. We describe the algorithm and the employed data structures, and we evaluate its complexity.
File in questo prodotto:
File Dimensione Formato  
2005PERF01587701.pdf

solo utenti autorizzati

Descrizione: Versione ufficiale dei proceedings
Tipologia: Versione finale editoriale
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 282.65 kB
Formato Adobe PDF
282.65 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

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: http://hdl.handle.net/11568/190739
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 2
social impact