PORTO @ 
Archivio Istituzionale della Ricerca
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishThis paper deals with multicast flow support in N × N Input Queued switch architectures. A practical approach to support multicast traffic is presented, assuming that O(N) queues are available at each input port. The focus is on dynamic queueing policies, where, at each input port, multicast flows are assigned to one among the available queues when flows become active: flows are assigned to queues according to switch queue status and, possibly, to flow information. We discuss queueing assignments, scheduling algorithms and flow activity definition models. We explain why dynamic queueing disciplines may outperform static policies, and we show that, even in the most favorable conditions for static policies, they provide comparable performance. © 2006 IEEE.
Practical algorithms for multicast support in input queued switches / Bianco, A.; Giaccone, P.; Piglione, C.; Sessa, S.. - STAMPA. - (2006), pp. 187-192. ((Intervento presentato al convegno 2006 Workshop on High Performance Switching and Routing, HPSR 2006 tenutosi a Poznan, pol nel 2006 [10.1109/hpsr.2006.1709704].
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
| Titolo: | Practical algorithms for multicast support in input queued switches | |
| Autori: | ||
| Data di pubblicazione: | 2006 | |
| Abstract: | This paper deals with multicast flow support in N × N Input Queued switch architectures. A practi...cal approach to support multicast traffic is presented, assuming that O(N) queues are available at each input port. The focus is on dynamic queueing policies, where, at each input port, multicast flows are assigned to one among the available queues when flows become active: flows are assigned to queues according to switch queue status and, possibly, to flow information. We discuss queueing assignments, scheduling algorithms and flow activity definition models. We explain why dynamic queueing disciplines may outperform static policies, and we show that, even in the most favorable conditions for static policies, they provide comparable performance. © 2006 IEEE. | |
| Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| Bianco-Practical.pdf | 2a Post-print versione editoriale / Version of Record | Non Pubblico - Accesso privato/ristretto | Administrator Richiedi una copia |
http://hdl.handle.net/11583/2844292
Copyright © 2021