Routing equal-size messages on a slotted ring

@article{Dereniowski2012RoutingEM,
  title={Routing equal-size messages on a slotted ring},
  author={Dariusz Dereniowski and Wiesław Kubiak},
  journal={Journal of Scheduling},
  year={2012},
  volume={15},
  pages={473-486}
}
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… 

References

SHOWING 1-10 OF 44 REFERENCES
The Ring Loading Problem
TLDR
A fast, simple algorithm is provided which achieves a load that is guaranteed to exceed the optimum by at most 3/2 times the maximum demand, and that performs even better in practice.
JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS
TLDR
It is shown that when setup times between jobs are considered, the problem becomes unary NP-hard even in the single machine case, and a simple polynomial time algorithm solving the problem is presented.
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
TLDR
The paper addresses the problem of multi-slot just-in-time scheduling and gives an O(nlog 2n)-time optimization algorithm for the single machine problem and proposes a polynomial time constant factor approximation algorithm.
Scheduling variable-size packets in the DAVID metropolitan area network
TLDR
A new resource allocation scheme capable of transporting variable-size packets without segmentation into fixed-size data units is proposed and its performance is studied by simulation.
Algorithm for multislot just-in-time scheduling
Multislot just-in time scheduling deals with processing a set of jobs in an environment with cyclically repeating due dates, where the length of the period between two consecutive due dates is the
Modelling slotted multi-channel ring all-optical networks
  • M. Marsan, A. Fumagalli, E. Leonardi, F. Neri
  • Business, Computer Science
    Proceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
  • 1997
This paper presents an approximate analytical model for the evaluation of throughput and access delays in high-speed all-optical networks with slotted multi-channel ring topology, where each channel
...
...