Belief-propagation assisted scheduling in input-queued switches (Articolo in rivista)

Type
Label
  • Belief-propagation assisted scheduling in input-queued switches (Articolo in rivista) (literal)
Anno
  • 2013-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1109/TC.2012.198 (literal)
Alternative label
  • Atalla, S (1); Cuda, D (1); Giaccone, P (1); Pretti, M (2) (2013)
    Belief-propagation assisted scheduling in input-queued switches
    in I.E.E.E. transactions on computers (Print)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Atalla, S (1); Cuda, D (1); Giaccone, P (1); Pretti, M (2) (literal)
Pagina inizio
  • 2101 (literal)
Pagina fine
  • 2107 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6275437&tag=1# (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 62 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
  • 7 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 10 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • (1) Dipartimento di Elettronica e Telecomunicazioni (DET), Politecnico di Torino, I-10129 Torino, Italy; (2) Consiglio Nazionale delle Ricerche - Istituto dei Sistemi Complessi (CNR-ISC), Dipartimento di Scienze Applicate e Tecnologia (DISAT), Politecnico di Torino, I-10129 Torino, Italy (literal)
Titolo
  • Belief-propagation assisted scheduling in input-queued switches (literal)
Abstract
  • We consider the problem of scheduling the transmission of packets in an input-queued switch. In order to achieve maximum throughput, scheduling algorithms usually employ the queue length as a parameter for determining the priority to serve a given queue. In this work, we propose a novel scheme to optimize the performance of a preexisting scheduler. Our main idea is to assist the scheduling decision, considering \"messagesa^ rather than queue lengths. Such messages are obtained by running an iterative parallel algorithm, inspired by a rigorous belief-propagation approach. We demonstrate that belief-propagation-assisted scheduling is able to boost the performance of a given scheduler, reaching almost optimal throughput, even under critical traffic scenarios. (literal)
Prodotto di
Autore CNR

Incoming links:


Autore CNR di
Prodotto
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
data.CNR.it