IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v295y2020i1d10.1007_s10479-020-03700-x.html
   My bibliography  Save this article

Improving service in the presence of surge traffic: a K-policy voluntary flushing queueing system

Author

Listed:
  • Won Seok Yang

    (Hannam University)

  • Nam K. Kim

    (Chonnam National University)

  • Sungjune Park

    (The University of North Carolina at Charlotte)

  • Chandrasekar Subramaniam

    (The University of North Carolina at Charlotte)

Abstract

Unexpected surge in online services causes poor performance and makes it challenging for the service provider to differentiate and serve genuine users. In this paper, we propose a novel approach using voluntary flushing to mitigate disruptions caused by surge traffic, such as distributed denial of service (DDoS) attacks on e-commerce websites. Voluntary flushing of customers has never been modeled because flushing was perceived negatively for customer service. We show that it may not be the case in today’s online services. We propose three queueing performance measures to evaluate the system and present optimal policies for flushing under various scenarios. We use DDoS attacks as use-case to present numerical analysis and discuss the implications of the flushing policies.

Suggested Citation

  • Won Seok Yang & Nam K. Kim & Sungjune Park & Chandrasekar Subramaniam, 2020. "Improving service in the presence of surge traffic: a K-policy voluntary flushing queueing system," Annals of Operations Research, Springer, vol. 295(1), pages 411-423, December.
    • Handle: RePEc:spr:annopr:v:295:y:2020:i:1:d:10.1007_s10479-020-03700-x
    DOI: 10.1007/s10479-020-03700-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-020-03700-x
    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-020-03700-x?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. A. Krishnamoorthy & S. Jaya & B. Lakshmy, 2015. "Queues with interruption in random environment," Annals of Operations Research, Springer, vol. 233(1), pages 201-219, October.
    2. D Worthington, 2009. "Reflections on queue modelling from the last 50 years," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 83-92, May.
    3. Daniel P. Heyman, 1968. "Optimal Operating Policies for M / G /1 Queuing Systems," Operations Research, INFORMS, vol. 16(2), pages 362-382, April.
    4. Alexander Dudin & Varghese Jacob & Achyutha Krishnamoorthy, 2015. "A multi-server queueing system with service interruption, partial protection and repetition of service," Annals of Operations Research, Springer, vol. 233(1), pages 101-121, October.
    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. Ahmadi-Javid, Amir & Hoseinpour, Pooya, 2019. "Service system design for managing interruption risks: A backup-service risk-mitigation strategy," European Journal of Operational Research, Elsevier, vol. 274(2), pages 417-431.
    2. Chandra, Aitichya & Verma, Ashish & Sooraj, K.P. & Padhi, Radhakant, 2023. "Modelling and assessment of the arrival and departure process at the terminal area: A case study of Chennai international airport," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 615(C).
    3. Dong-Yuh Yang & Po-Kai Chang, 2015. "A parametric programming solution to the -policy queue with fuzzy parameters," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(4), pages 590-598, March.
    4. Legros, Benjamin, 2021. "Routing analyses for call centers with human and automated services," International Journal of Production Economics, Elsevier, vol. 240(C).
    5. Wei Li & Attahiru Sule Alfa, 2000. "Optimal policies for M/M/m queue with two different kinds of (N, T)‐policies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(3), pages 240-258, April.
    6. Strang, Kenneth David, 2012. "Importance of verifying queue model assumptions before planning with simulation software," European Journal of Operational Research, Elsevier, vol. 218(2), pages 493-504.
    7. Boronico, Jess S. & Siegel, Philip H., 1998. "Capacity planning for toll roadways incorporating consumer wait time costs," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(4), pages 297-310, May.
    8. Zhang, Zhe George & Tadj, Lotfi & Bounkhel, Messaoud, 2011. "Cost evaluation in M/G/1 queue with T-policy revisited, technical note," European Journal of Operational Research, Elsevier, vol. 214(3), pages 814-817, November.
    9. Gast, Johannes & Binsfeld, Tom & Marsili, Francesca & Jahn, Carlos, 2021. "Analysis of the Suez Canal blockage with queueing theory," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Kersten, Wolfgang & Ringle, Christian M. & Blecker, Thorsten (ed.), Adapting to the Future: How Digitalization Shapes Sustainable Logistics and Resilient Supply Chain Management. Proceedings of the Hamburg Internationa, volume 31, pages 943-959, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.
    10. Erim Kardeş & Fernando Ordóñez & Randolph W. Hall, 2011. "Discounted Robust Stochastic Games and an Application to Queueing Control," Operations Research, INFORMS, vol. 59(2), pages 365-382, April.
    11. Tayfur Altiok & Goang An Shiue, 1995. "Single‐stage, multi‐product production/inventory systems with lost sales," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 889-913, September.
    12. Anthony Ebert & Ritabrata Dutta & Kerrie Mengersen & Antonietta Mira & Fabrizio Ruggeri & Paul Wu, 2021. "Likelihood‐free parameter estimation for dynamic queueing networks: Case study of passenger flow in an international airport terminal," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 70(3), pages 770-792, June.
    13. Tirdad, Ali & Grassmann, Winfried K. & Tavakoli, Javad, 2016. "Optimal policies of M(t)/M/c/c queues with two different levels of servers," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1124-1130.
    14. Vasiliki Kostami, 2020. "Price and Lead time Disclosure Strategies in Inventory Systems," Production and Operations Management, Production and Operations Management Society, vol. 29(12), pages 2760-2788, December.
    15. Li Xia & Zhe George Zhang & Quan‐Lin Li, 2022. "A c/μ‐Rule for Job Assignment in Heterogeneous Group‐Server Queues," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1191-1215, March.
    16. Douglas G. Down, 2022. "Optimal control of energy-aware queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 417-419, April.
    17. Jim (Junmin) Shi & Michael N. Katehakis & Benjamin Melamed & Yusen Xia, 2014. "Production-Inventory Systems with Lost Sales and Compound Poisson Demands," Operations Research, INFORMS, vol. 62(5), pages 1048-1063, October.
    18. R J Ormerod, 2010. "OR as rational choice: a decision and game theory perspective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(12), pages 1761-1776, December.
    19. Alexander Moiseev & Maria Shklennik & Evgeny Polin, 2023. "Infinite-server queueing tandem with Markovian arrival process and service depending on its state," Annals of Operations Research, Springer, vol. 326(1), pages 261-279, July.
    20. R. E. Lillo, 2000. "Optimal Operating Policy for an M/G/1 Exhaustive Server-Vacation Model," Methodology and Computing in Applied Probability, Springer, vol. 2(2), pages 153-167, August.

    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:295:y:2020:i:1:d:10.1007_s10479-020-03700-x. 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.