In this paper, we provide low-congested interval rout- ing schemes (IRS) for some common interconnec- tion networks such as butterflies, wrapped butterflies, and cube-connected cycles. In particular, by exploit- ing their hypercubelike structure, we show that 1-IRS and 2-IRS are already sufficient to get schemes with a congestion which is at most c times the optimal one, for low constant values of c. All such schemes have also a small dilation proportional to the diame- ter. Moreover, a new lower bound on the congestion achievable by schemes for butterfly networks is pro- vided, which improves upon the best previously known one

Low Congested Interval Routing Schemes for Hypercube-Like Networks

FLAMMINI, MICHELE
2000

Abstract

In this paper, we provide low-congested interval rout- ing schemes (IRS) for some common interconnec- tion networks such as butterflies, wrapped butterflies, and cube-connected cycles. In particular, by exploit- ing their hypercubelike structure, we show that 1-IRS and 2-IRS are already sufficient to get schemes with a congestion which is at most c times the optimal one, for low constant values of c. All such schemes have also a small dilation proportional to the diame- ter. Moreover, a new lower bound on the congestion achievable by schemes for butterfly networks is pro- vided, which improves upon the best previously known one
File in 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/20.500.12571/2469
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
social impact