In Time-driven Switching (TDS) networks with non-immediate forwarding (NIF) provides scheduling flexibility and consequently, reduces the blocking probability (blocking is defined to take place when transmission capacity is available, but without a feasible schedule). However, it has been shown that with NIF scheduling complexity may grow exponentially. Efficiently finding a schedule from an exponential set of potential schedules is the focus of this paper. The work first presents the mathematical formulation of the NIF scheduling problem, under a wide variety of networking requirements, then introduces an efficient (i.e., having at most polynomial complexity) search algorithm that guarantees to find at least one schedule whenever such a schedule exists. The novel algorithm uses trellis" representations and the well-known survivor-based searching principle."

An Efficient Scheduling Algorithm for Time-Driven Switching Networks / Truong, Thu-Huong; Baldi, Mario; Ofek, Yoram. - ELETTRONICO. - (2007), pp. 1-8.

An Efficient Scheduling Algorithm for Time-Driven Switching Networks

Truong, Thu-Huong;Ofek, Yoram
2007-01-01

Abstract

In Time-driven Switching (TDS) networks with non-immediate forwarding (NIF) provides scheduling flexibility and consequently, reduces the blocking probability (blocking is defined to take place when transmission capacity is available, but without a feasible schedule). However, it has been shown that with NIF scheduling complexity may grow exponentially. Efficiently finding a schedule from an exponential set of potential schedules is the focus of this paper. The work first presents the mathematical formulation of the NIF scheduling problem, under a wide variety of networking requirements, then introduces an efficient (i.e., having at most polynomial complexity) search algorithm that guarantees to find at least one schedule whenever such a schedule exists. The novel algorithm uses trellis" representations and the well-known survivor-based searching principle."
2007
Trento
Università degli Studi di Trento - Dipartimento di Informatica e Telecomunicazioni
An Efficient Scheduling Algorithm for Time-Driven Switching Networks / Truong, Thu-Huong; Baldi, Mario; Ofek, Yoram. - ELETTRONICO. - (2007), pp. 1-8.
Truong, Thu-Huong; Baldi, Mario; Ofek, Yoram
File in questo prodotto:
File Dimensione Formato  
dtr-07-002.pdf

accesso aperto

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 637.84 kB
Formato Adobe PDF
637.84 kB Adobe PDF Visualizza/Apri

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/11572/357881
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
  • OpenAlex ND
social impact