Telecommunication networks: protocols, modeling and analysis
Telecommunication networks: protocols, modeling and analysis
A polynomial time optimal algorithm for satellite communications with general switching modes
SIAM Journal on Discrete Mathematics
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)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Scheduling transmissions in WDM broadcast-and-select networks
IEEE/ACM Transactions on Networking (TON)
Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems
IEEE/ACM Transactions on Networking (TON)
Analysis and optimization of transmission schedules for single-hop WDM networks
IEEE/ACM Transactions on Networking (TON)
Scheduling variable-length messages in a single-hop multichannel local lightwave network
IEEE/ACM Transactions on Networking (TON)
Efficient scheduling of transmissions in optical broadcast networks
IEEE/ACM Transactions on Networking (TON)
Heuristics for Scheduling I/O Operations
IEEE Transactions on Parallel and Distributed Systems
Efficient routing and scheduling algorithms for optical networks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
EDD Algorithm Performance Guarantee for Periodic Hard-Real-Time Scheduling in Distributed Systems
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
On supporting time-constrained communications in WDMA-based star-coupled optical networks
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
IEEE Journal on Selected Areas in Communications
An efficient packet scheduling algorithm with deadline guarantees for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches
Theoretical Computer Science
| Hi-index | 0.00 |
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 intermediate nodes 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-case performance bounds. Such bounds can be effectively used to test the success of the schedule before generating it.