IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v150y2007i1p93-11410.1007-s10479-006-0160-2.html
   My bibliography  Save this article

Packet scheduling in third-generation mobile systems with UTRA-TDD air interface

Author

Listed:
  • Gianfranco Ciaschetti
  • Lorenzo Corsini
  • Paolo Detti
  • Giovanni Giambene

Abstract

UTRA-TDD is one of the adopted air interfaces for third-generation mobile communication systems (UMTS). In UTRA-TDD, information packets are transmitted organized into radio frames. A radio frame is divided into a fixed number of time slots and different packets can be sent on the same time slot by means of the Code Division Multiple Access technique. Packets belong to different traffic classes and have different formats and Quality of Service (QoS) requirements in terms of delay, transmission error probability and priority level. In this paper, we address the problem of scheduling packets for downlink transmissions in the time slots of a frame, in such a way that QoS requirements are fulfilled. In particular, exact pseudo-polynomial and heuristic scheduling algorithms are compared in terms of typical performance parameters. Computational results for three traffic classes show that the proposed algorithms are suitable for UTRA-TDD implementation, both for solution quality and computational time. Copyright Springer Science+Business Media, LLC 2007

Suggested Citation

  • Gianfranco Ciaschetti & Lorenzo Corsini & Paolo Detti & Giovanni Giambene, 2007. "Packet scheduling in third-generation mobile systems with UTRA-TDD air interface," Annals of Operations Research, Springer, vol. 150(1), pages 93-114, March.
    • Handle: RePEc:spr:annopr:v:150:y:2007:i:1:p:93-114:10.1007/s10479-006-0160-2
    DOI: 10.1007/s10479-006-0160-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0160-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0160-2?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. Dorit S. Hochbaum & Ron Shamir, 1991. "Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem," Operations Research, INFORMS, vol. 39(4), pages 648-653, August.
    2. S. Thomas McCormick & Scott R. Smallwood & Frits C. R. Spieksma, 2001. "A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths," Mathematics of Operations Research, INFORMS, vol. 26(1), pages 31-49, February.
    Full references (including those not matched with items on IDEAS)

    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. N. Brauner & Y. Crama & A. Grigoriev & J. Klundert, 2005. "A Framework for the Complexity of High-Multiplicity Scheduling Problems," Journal of Combinatorial Optimization, Springer, vol. 9(3), pages 313-323, May.
    2. Klaus Jansen & Roberto Solis-Oba, 2011. "A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 743-753, November.
    3. Selvarajah, Esaignani & Steiner, George, 2006. "Batch scheduling in a two-level supply chain--a focus on the supplier," European Journal of Operational Research, Elsevier, vol. 173(1), pages 226-240, August.
    4. John J. Clifford & Marc E. Posner, 2000. "High Multiplicity in Earliness-Tardiness Scheduling," Operations Research, INFORMS, vol. 48(5), pages 788-800, October.
    5. A. Agnetis & S. Smriglio, 2000. "Optimal assignment of high multiplicity flight plans to dispatchers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(5), pages 359-376, August.
    6. Sterna, Malgorzata, 2011. "A survey of scheduling problems with late work criteria," Omega, Elsevier, vol. 39(2), pages 120-129, April.
    7. Cheng, T.C.E. & Shafransky, Y. & Ng, C.T., 2016. "An alternative approach for proving the NP-hardness of optimization problems," European Journal of Operational Research, Elsevier, vol. 248(1), pages 52-58.
    8. Omri Dover & Dvir Shabtay, 2016. "Single machine scheduling with two competing agents, arbitrary release dates and unit processing times," Annals of Operations Research, Springer, vol. 238(1), pages 145-178, March.
    9. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2020. "Scheduling a proportionate flow shop of batching machines," Journal of Scheduling, Springer, vol. 23(5), pages 575-593, October.
    10. C. T. Ng & T. C. E. Cheng & J. J. Yuan, 2006. "A note on the complexity of the problem of two-agent scheduling on a single machine," Journal of Combinatorial Optimization, Springer, vol. 12(4), pages 387-394, December.
    11. Goldberg, Noam & Karhi, Shlomo, 2017. "Packing into designated and multipurpose bins: A theoretical study and application to the cold chain," Omega, Elsevier, vol. 71(C), pages 85-92.
    12. S. Thomas McCormick & Scott R. Smallwood & Frits C. R. Spieksma, 2001. "A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths," Mathematics of Operations Research, INFORMS, vol. 26(1), pages 31-49, February.
    13. Rubing Chen & Jinjiang Yuan & Yuan Gao, 2019. "The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs," Journal of Scheduling, Springer, vol. 22(5), pages 581-593, October.
    14. Sterna, Małgorzata, 2021. "Late and early work scheduling: A survey," Omega, Elsevier, vol. 104(C).
    15. Filippi, Carlo, 2007. "On the bin packing problem with a fixed number of object weights," European Journal of Operational Research, Elsevier, vol. 181(1), pages 117-126, August.
    16. Vergauwen, P.G.M.C. & Busser, K. & Rongen, P. & Verwaijen, R. & Vossen, D.J.L.H., 2001. "Cost accounting and pricing improvement at Helmond Print: using Xeikon digital colour printing equipment: a case study," Research Memorandum 028, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    17. Alexander Grigoriev & Vincent J. Kreuzen & Tim Oosterwijk, 2021. "Cyclic lot-sizing problems with sequencing costs," Journal of Scheduling, Springer, vol. 24(2), pages 123-135, April.
    18. Omri Dover & Dvir Shabtay, 2016. "Single machine scheduling with two competing agents, arbitrary release dates and unit processing times," Annals of Operations Research, Springer, vol. 238(1), pages 145-178, March.

    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:annopr:v:150:y:2007:i:1:p:93-114:10.1007/s10479-006-0160-2. 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.