IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v263y2018i1d10.1007_s10479-016-2213-5.html
   My bibliography  Save this article

Provider selection and task allocation in telecommunications with QoS degradation policy

Author

Listed:
  • Nihat Kasap

    (Sabanci University)

  • Hasan Hüseyin Turan

    (Qatar University)

  • Hüseyin Savran

    (University of Yalova)

  • Berna Tektas-Sivrikaya

    (Istanbul Technical University)

  • Dursun Delen

    (Oklahoma State University)

Abstract

The information age that we are living in is characterized by exponentially increasing needs and corresponding means to access, transmit and use data in a variety of business settings. Fast growing demand, which is translated to market opportunities, has led to the emergence of many new and well-established firms entering into the telecommunications market, resulting in a crowded, highly competitive business environment with numerous providers and carriers offering a wide range of data services. Today’s firms use telecommunication networks in a variety of ways to carry out their daily communications such as video conferencing, voice over IP and other data-intensive transmissions. In this paper, we report on a study in which we investigate a cost optimization problem that a firm encounters when acquiring network bandwidth from a telecommunication market that consists of many backbone providers offering different combinations of pricing policies and quality of service (QoS) levels. After the acquisition of network resources (bandwidth), firms allocate these resources to their daily data transmissions (tasks) according to the QoS requirement of the tasks. In an optimal allocation scheme, it is generally presumed that each task has to be assigned to a network resource which is capable of providing an equal or higher level of QoS than required by the task. However, it is shown with the proposed heuristic approach (presented herein) that QoS degradations during the allocation of tasks can lead to more favorable outcomes, especially when certain cost penalty policies are applied to the reduction of QoS requirements.

Suggested Citation

  • Nihat Kasap & Hasan Hüseyin Turan & Hüseyin Savran & Berna Tektas-Sivrikaya & Dursun Delen, 2018. "Provider selection and task allocation in telecommunications with QoS degradation policy," Annals of Operations Research, Springer, vol. 263(1), pages 311-337, April.
  • Handle: RePEc:spr:annopr:v:263:y:2018:i:1:d:10.1007_s10479-016-2213-5
    DOI: 10.1007/s10479-016-2213-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-016-2213-5
    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/s10479-016-2213-5?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. Jan-Arild Audestad & Alexei Gaivoronski & Adrian Werner, 2006. "Extending the stochastic programming framework for the modeling of several decision makers: pricing and competition in the telecommunication sector," Annals of Operations Research, Springer, vol. 142(1), pages 19-39, February.
    2. Lijian Chen & Tito Homem-de-Mello, 2010. "Re-solving stochastic programming models for airline revenue management," Annals of Operations Research, Springer, vol. 177(1), pages 91-114, June.
    3. Hans-Jörg Schütz & Rainer Kolisch, 2013. "Capacity allocation for demand of different customer-product-combinations with cancellations, no-shows, and overbooking when there is a sequential delivery of service," Annals of Operations Research, Springer, vol. 206(1), pages 401-423, July.
    4. Costas Courcoubetis & Frank Kelly & Richard Weber, 2000. "Measurement-Based Usage Charges in Communications Networks," Operations Research, INFORMS, vol. 48(4), pages 535-548, August.
    5. Wei Pan & Xianjia Wang & Yong-guang Zhong & Lean Yu & Cao Jie & Lun Ran & Han Qiao & Shouyang Wang & Xianhao Xu, 2012. "A fuzzy multi-objective model for capacity allocation and pricing policy of provider in data communication service with different QoS levels," International Journal of Systems Science, Taylor & Francis Journals, vol. 43(6), pages 1054-1063.
    6. Patrick Maillé & Bruno Tuffin, 2012. "Competition among providers in loss networks," Annals of Operations Research, Springer, vol. 199(1), pages 3-22, October.
    7. Liu, Tieming & Methapatara, Chinnatat & Wynter, Laura, 2010. "Revenue management model for on-demand IT services," European Journal of Operational Research, Elsevier, vol. 207(1), pages 401-408, November.
    8. P. Baecker & G. Grass & U. Hommel, 2010. "Business value and risk in the presence of price controls: an option-based analysis of margin squeeze rules in the telecommunications industry," Annals of Operations Research, Springer, vol. 176(1), pages 311-332, April.
    9. Silvano Martello & Daniele Vigo, 1998. "Exact Solution of the Two-Dimensional Finite Bin Packing Problem," Management Science, INFORMS, vol. 44(3), pages 388-399, March.
    10. Raha Akhavan-Tabatabaei & Manuel Bolívar & Jorge Hincapie & Andrés Medaglia, 2014. "On the optimal parking lot subscription policy problem: a hybrid simulation-optimization approach," Annals of Operations Research, Springer, vol. 222(1), pages 29-44, November.
    11. Li, Feng & Whalley, Jason, 0. "Deconstruction of the telecommunications industry: from value chains to value networks," Telecommunications Policy, Elsevier, vol. 26(9-10), pages 451-472, October.
    12. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    13. Marcel A. Sieke & Ralf W. Seifert & Ulrich W. Thonemann, 2012. "Designing Service Level Contracts for Supply Chain Coordination," Production and Operations Management, Production and Operations Management Society, vol. 21(4), pages 698-714, July.
    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. Shivam Gupta & Sachin Modgil & Samadrita Bhattacharyya & Indranil Bose, 2022. "Artificial intelligence for decision support systems in the field of operations research: review and future scope of research," Annals of Operations Research, Springer, vol. 308(1), pages 215-274, January.
    2. Libiao Bai & Kanyin Zheng & Zhiguo Wang & Jiale Liu, 2022. "Service provider portfolio selection for project management using a BP neural network," Annals of Operations Research, Springer, vol. 308(1), pages 41-62, January.

    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. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
    2. Michele Monaci & Paolo Toth, 2006. "A Set-Covering-Based Heuristic Approach for Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 71-85, February.
    3. Liao, Chung-Shou & Hsu, Chia-Hong, 2013. "New lower bounds for the three-dimensional orthogonal bin packing problem," European Journal of Operational Research, Elsevier, vol. 225(2), pages 244-252.
    4. Braam, Florian & van den Berg, Daan, 2022. "Which rectangle sets have perfect packings?," Operations Research Perspectives, Elsevier, vol. 9(C).
    5. Önder Aşık & Ender Özcan, 2009. "Bidirectional best-fit heuristic for orthogonal rectangular strip packing," Annals of Operations Research, Springer, vol. 172(1), pages 405-427, November.
    6. Hadjiconstantinou, Eleni & Iori, Manuel, 2007. "A hybrid genetic algorithm for the two-dimensional single large object placement problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1150-1166, December.
    7. Fernando Aliaga & Diego Delle Donne & Guillermo Durán & Javier Marenco, 2022. "Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques," Annals of Operations Research, Springer, vol. 316(2), pages 891-904, September.
    8. Khanafer, Ali & Clautiaux, François & Talbi, El-Ghazali, 2010. "New lower bounds for bin packing problems with conflicts," European Journal of Operational Research, Elsevier, vol. 206(2), pages 281-288, October.
    9. Qi Zhang & Shixin Liu & Ruiyou Zhang & Shujin Qin, 2021. "Column generation algorithms for mother plate design in steel plants," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 127-153, March.
    10. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    11. Clautiaux, Francois & Carlier, Jacques & Moukrim, Aziz, 2007. "A new exact method for the two-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1196-1211, December.
    12. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    13. Torsten Buchwald & Kirsten Hoffmann & Guntram Scheithauer, 2014. "Relations between capacity utilization, minimal bin size and bin number," Annals of Operations Research, Springer, vol. 217(1), pages 55-76, June.
    14. Stéphane Grandcolas & Cyril Pain-Barre, 2022. "A hybrid metaheuristic for the two-dimensional strip packing problem," Annals of Operations Research, Springer, vol. 309(1), pages 79-102, February.
    15. Nestor M Cid-Garcia & Yasmin A Rios-Solis, 2020. "Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem," PLOS ONE, Public Library of Science, vol. 15(4), pages 1-22, April.
    16. Polyakovsky, Sergey & M'Hallah, Rym, 2009. "An agent-based approach to the two-dimensional guillotine bin packing problem," European Journal of Operational Research, Elsevier, vol. 192(3), pages 767-781, February.
    17. Thanh-Hung Nguyen & Xuan-Thuan Nguyen, 2023. "Space Splitting and Merging Technique for Online 3-D Bin Packing," Mathematics, MDPI, vol. 11(8), pages 1-16, April.
    18. Bennell, Julia A. & Soon Lee, Lai & Potts, Chris N., 2013. "A genetic algorithm for two-dimensional bin packing with due dates," International Journal of Production Economics, Elsevier, vol. 145(2), pages 547-560.
    19. Defu Zhang & Yuxin Che & Furong Ye & Yain-Whar Si & Stephen C. H. Leung, 2016. "A hybrid algorithm based on variable neighbourhood for the strip packing problem," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 513-530, August.
    20. Li, Xueping & Zhang, Kaike, 2018. "Single batch processing machine scheduling with two-dimensional bin packing constraints," International Journal of Production Economics, Elsevier, vol. 196(C), pages 113-121.

    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:263:y:2018:i:1:d:10.1007_s10479-016-2213-5. 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.