Modeling a Slotted Ring Local Area Network
IEEE Transactions on Computers
Precoloring extension. I: Interval graphs
Discrete Mathematics - Special volume (part 1) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs”
A broadband ring network: multichannel optical slotted ring
Computer Networks and ISDN Systems
Scheduling computer and manufacturing processes
Scheduling computer and manufacturing processes
Balancing loads on SONET rings with integer demand splitting
Computers and Operations Research
SIAM Journal on Discrete Mathematics
Graph classes: a survey
Scheduling preemptable tasks on parallel processors with limited availability
Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics
Approximation algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Modelling Slotted Multi-Channel Ring All-Optical Networks
MASCOTS '97 Proceedings of the 5th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Linear time algorithms for the ring loading problem with demand splitting
Journal of Algorithms
Performance of multicast in WDM slotted ring networks
Computer Communications
Algorithm for Multislot Just-in-Time Scheduling on Identical Parallel Machines
ICICIC '07 Proceedings of the Second International Conference on Innovative Computing, Informatio and Control
On two coloring problems in mixed graphs
European Journal of Combinatorics
Metropolitan area packet-switched WDM networks: A survey on ring systems
IEEE Communications Surveys & Tutorials
On the ring loading problem with demand splitting
Operations Research Letters
Metro WDM networks: performance comparison of slotted ring and AWG star networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We deal with the problem of routing messages on a slotted ring network in this paper. We study the computational complexity and algorithms for this routing by means of the results known in the literature for the multi-slot just-in-time scheduling problem. We consider two criteria for the routing problem: makespan, or minimum routing time, and diagonal makespan. A diagonal is simply a schedule of ring links i=0,驴,q驴1 in q consecutive time slots, respectively. The number of diagonals between the earliest and the latest diagonals with non-empty packets is referred to as the diagonal makespan. For the former, we show that the optimal routing of messages of size k, is NP-hard in the strong sense, while an optimal routing when k=q can be computed in O(n 2log2 n) time. We also give an O(nlogn)-time constant factor approximation algorithm for unit size messages. For the latter, we prove that the optimal routing of messages of size k, where k divides the size of the ring q, is NP-hard in the strong sense even for any fixed k驴1, while an optimal routing when k=q can be computed in O(nlogn) time. We also give an O(nlogn)-time approximation algorithm with an absolute error 2q驴k.