It is shown that a Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can route any permutation among the n = dg processors in one slot when d = 1 and 2 d/g slots when d > 1. The number of slots used is optimal in the worst case, and is at most the double of the optimum for all permutations π such that π ́(i) \neq i, for all i.

Routing Permutations in Partitioned Optical Passive Star Networks

RIZZI, ROMEO
2002

Abstract

It is shown that a Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can route any permutation among the n = dg processors in one slot when d = 1 and 2 d/g slots when d > 1. The number of slots used is optimal in the worst case, and is at most the double of the optimum for all permutations π such that π ́(i) \neq i, for all i.
0769515738
POPS networks; routing; permutation routing; offline routing
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: http://hdl.handle.net/11562/435327
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 10
  • ???jsp.display-item.citation.isi??? ND
social impact