Scheduling in Switching Networks with Set-Up Delays

@article{Afrati2005SchedulingIS,
  title={Scheduling in Switching Networks with Set-Up Delays},
  author={Foto N. Afrati and Timos Aslanidis and Evripidis Bampis and Ioannis Milis},
  journal={J. Comb. Optim.},
  year={2005},
  volume={9},
  pages={49-57}
}
We consider the (preemptive bipartite scheduling problem PBS) (Crescenzi et al., “On approximating a scheduling problem,” Journal of Combinatorial Optimization, vol. 5, pp. 287–297, 2001) arising in switching communication systems, where each input and output port can be involved in at most one communication at the same time. Given a set of communication tasks to be communicated from the transmitters to the receivers of such a system, we aim to find a schedule minimizing the overall… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS
17 Citations
9 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

An optimal switching algorithm for multibeam satellite systems with variable bandwidth beams,

  • I. S. Gopal, G. Bongiovanni, M. A. Bonucelli, D. T. Tang, C. K. Wong
  • IEEE Trans. Commun.,
  • 1982
Highly Influential
4 Excerpts

An optimal time slot assignment for an SS/TDMA system with variable number of transponders,

  • G. Bongiovanni, D. Coppersmith, C. K. Wong
  • IEEE Trans. Commun.,
  • 1981
2 Excerpts

Time slot assignment in an SS / TDMA system with minimum switchings

  • L. G. Valiant
  • IBM Res . Rep .
  • 1981

An efficient SS / TDMA time slot assignment algorithm

  • S. B. Calo
  • IEEE Trans . Commun .
  • 1979

Similar Papers

Loading similar papers…