IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v9y2005i1d10.1007_s10878-005-5483-4.html
   My bibliography  Save this article

Scheduling in Switching Networks with Set-Up Delays

Author

Listed:
  • Foto Afrati

    (NTUA)

  • Timos Aslanidis

    (NTUA)

  • Evripidis Bampis

    (Université d’Evry Val d’Essonne)

  • Ioannis Milis

    (Athens University of Business and Economics)

Abstract

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 transmission time. To achieve this, we allow the preemption of communication tasks. However, in practice preemption comes with a cost, d, and this renders the problem NP-hard (Gopal et al., “An optimal switching algorithm for multibeam satellite systems with variable bandwidth beams,” IEEE Trans. Commun., vol.30, pp. 2475–2481, 1982). In this paper, we present a $$2 - \frac{1}{d+1}$$ approximation algorithm, which is the first one for the PBS problem with approximation ratio strictly less than two. Furthermore, we propose a simple optimal polynomial time algorithm for a subclass of instances of the PBS problem.

Suggested Citation

  • Foto Afrati & Timos Aslanidis & Evripidis Bampis & Ioannis Milis, 2005. "Scheduling in Switching Networks with Set-Up Delays," Journal of Combinatorial Optimization, Springer, vol. 9(1), pages 49-57, February.
    • Handle: RePEc:spr:jcomop:v:9:y:2005:i:1:d:10.1007_s10878-005-5483-4
    DOI: 10.1007/s10878-005-5483-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-5483-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-005-5483-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Pierluigi Crescenzi & Xiaotie Deng & Christos H. Papadimitriou, 2001. "On Approximating a Scheduling Problem," Journal of Combinatorial Optimization, Springer, vol. 5(3), pages 287-297, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Giorgio Lucarelli & Ioannis Milis & Vangelis T. Paschos, 2010. "On the max-weight edge coloring problem," Journal of Combinatorial Optimization, Springer, vol. 20(4), pages 429-442, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Giorgio Lucarelli & Ioannis Milis & Vangelis T. Paschos, 2010. "On the max-weight edge coloring problem," Journal of Combinatorial Optimization, Springer, vol. 20(4), pages 429-442, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:9:y:2005:i:1:d:10.1007_s10878-005-5483-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.