Scheduling algorithms for multicast traffic in TDM/WDM networks with arbitrary tuning latencies

Authors:
A. Bianco;G. Galante;E. Leonardi;F. Neri;A. Nucci
Affiliations:
Dipartimento di Elettronica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy;Dipartimento di Elettronica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy;Dipartimento di Elettronica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy;Dipartimento di Elettronica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy;Dipartimento di Elettronica, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2003

Citing 13
Cited 4

Optimization

Optimization
A time-wavelength assignment algorithm for a WDM star network

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Scheduling transmissions in WDM broadcast-and-select networks

IEEE/ACM Transactions on Networking (TON)
Packet scheduling in broadcast WDM networks with arbitrary transceiver tuning latencies

IEEE/ACM Transactions on Networking (TON)
Scheduling nonuniform traffic in a packet-switching system with small propagation delay

IEEE/ACM Transactions on Networking (TON)
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization

Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
Efficient Multi-Hop Scheduling Algorithms for All-Optical WDM/TDM Broadcast-and-Select Networks with Arbitrary Transceiver Tuning Latencies

ONDM '98 Proceedings of the IFIP TC6 Second International Working Conference on Optical Network Design and Modeling
Scheduling algorithms for multicast traffic in TDM/WDM networks with arbitrary tuning latencies

Computer Networks: The International Journal of Computer and Telecommunications Networking
The perspective of optical packet switching in IP dominant backbone and metropolitan networks

IEEE Communications Magazine
Efficient scheduling of nonuniform packet traffic in a WDM/TDM local lightwave network with arbitrary transceiver tuning latencies

IEEE Journal on Selected Areas in Communications
Impact of tuning delay on the performance of bandwidth-limited optical broadcast networks with uniform traffic

IEEE Journal on Selected Areas in Communications
Multidestination communication over tunable-receiver single-hop WDM networks

IEEE Journal on Selected Areas in Communications
Network controller design for SONATA-a large-scale all-optical passive network

IEEE Journal on Selected Areas in Communications

Scheduling algorithms for multicast traffic in TDM/WDM networks with arbitrary tuning latencies

Computer Networks: The International Journal of Computer and Telecommunications Networking
A distributed advance reservation system for interconnected slotted optical networks: Design and simulations

Computer Communications
Request scheduling on WDM networks with tunable ADMs

ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Inter-domain advance resource reservation for slotted optical networks

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider all-optical Time Division Multiplexing (TDM)/Wavelength Division Multiplexing (WDM) broadcast and select networks with slotted operation. Each network access node is equipped with one fixed transmitter and one tunable receiver; tuning times are not negligible with respect to the fixed size slot time. We discuss efficient scheduling algorithms to assign TDM/WDM slots to multicast traffic in such networks. The problem is shown to be NP-hard; thus, heuristic algorithms based on the Tabu Search meta-heuristic are proposed, and their performance are assessed using randomly created request matrices based on two types of multicast traffic patterns. We show that significant advantages can be obtained by using these novel algorithms with respect to simpler greedy algorithms, even when restricting CPU times to realistic values to make the algorithms of practical use.