Time-slot assignment for TDMA-systems
Computing
Telecommunication networks: protocols, modeling and analysis
Telecommunication networks: protocols, modeling and analysis
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Introduction to the theory of complexity
Introduction to the theory of complexity
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)
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
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On supporting time-constrained communications in WDMA-based star-coupled optical networks
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
IEEE Journal on Selected Areas in Communications
Optimal Packet Scheduling in Tree-Structured LEO Satellite Clusters
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Optimal packet scheduling in tree-structured LEO satellite clusters
Mobile Networks and Applications
An optimal packet scheduling and load balancing algorithm for LEO/MEO satellite networks
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Hi-index | 0.00 |
Switching networks are the core of many communication and multiprocessor systems. In these systems, a set of entities (communication equipment or processors) communicate through the switching network by exchanging messages. Simultaneous transmission or reception of two or more different messages through an input or output port results in the corruption of the messages (also called collision), which are useless and must be retransmitted later. This causes a performance degradation. Collisions can be avoided only by a proper scheduling of the messages. The same problem also arises in single-hop purely optical WDM systems, where simultaneous reception or transmission over the same wavelength channel results in a collision. In this paper, we study the problem of minimum length scheduling of a set of messages subject to precedence constraints. We show that the decision version of the problem is NP-complete even in very restricted cases. This means that the optimization problem cannot be solved in polynomial time, unless P=NP. Since the problem cannot be optimally solved by fast algorithms, we then investigate the existence of polynomial time approximation algorithms, by first proving that approximation algorithms cannot exist with performance ratio bounded by $4/3$ or smaller and successively presenting an $\epsilon$-approximation algorithm with $\epsilon