Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Scheduling of real-time messages in optical broadcast-and-select networks
Autore:
Bonuccelli, MA; Clo, MC;
Indirizzi:
Univ Pisa, Dipartimento Informat, I-56125 Pisa, Italy Univ Pisa Pisa Italy I-56125 Dipartimento Informat, I-56125 Pisa, Italy
Titolo Testata:
IEEE-ACM TRANSACTIONS ON NETWORKING
fascicolo: 5, volume: 9, anno: 2001,
pagine: 541 - 552
SICI:
1063-6692(200110)9:5<541:SORMIO>2.0.ZU;2-C
Fonte:
ISI
Lingua:
ENG
Soggetto:
SLOT ASSIGNMENT ALGORITHM; TRANSCEIVER TUNING LATENCIES; LOCAL LIGHTWAVE NETWORK; WDM NETWORKS; SYSTEMS; TRANSMISSIONS;
Keywords:
approximating algorithms; complexity; feasibility test; multimedia; optical broadcast-and-select networks; performance guarantees; real-time transmission; scheduling; single-hop multichannel systems; time-wavelength division multiplexing;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
36
Recensione:
Indirizzi per estratti:
Indirizzo: Bonuccelli, MA Univ Pisa, Dipartimento Informat, Corso Italia 40, I-56125 Pisa, Italy Univ Pisa Corso Italia 40 Pisa Italy I-56125 5 Pisa, Italy
Citazione:
M.A. Bonuccelli e M.C. Clo, "Scheduling of real-time messages in optical broadcast-and-select networks", IEEE ACM TN, 9(5), 2001, pp. 541-552

Abstract

In this paper, we consider broadcast-and-select networks based on optical passive stars. In these single-hop networks, communicating pairs can exchange messages directly, without the need to store information at intermediatenodes for later forwarding. Messages are transmitted in a packetized way, and each message has an associated deadline. In order to guarantee the message reception timeliness, we ask that all the messages are received within their corresponding deadline. We show that this scheduling problem is strong NP-complete, even in a very restricted case. Then, we turn our attention to fast approximating heuristics. We present four of them, assess their average performance by means of computer simulation, and give their worst-caseperformance bounds. Such bounds can be effectively used to test the success of the schedule before generating it.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 25/01/20 alle ore 18:53:01