IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v65y2017i4d10.1007_s11235-016-0262-3.html
   My bibliography  Save this article

Performance modeling and analysis of hypoexponential network servers

Author

Listed:
  • Khaled Salah

    (Khalifa University of Science, Technology and Research (KUSTAR))

  • Said El Kafhali

    (Hassan 1st University)

Abstract

Hypoexponential servers are commonly seen in today’s computer and communication networks whereby incoming packets are processed by the network server in multiple stages with each stage having a different processing time. This paper presents an analytical model to capture the behavior and subsequently analyze the performance of these network servers or similarly behaving systems. From our model, we derive key performance measures and features which include CPU utilization, system idleness, mean throughput, packet loss, mean system and queuing packet delays, and mean system and queue sizes. In addition, we present two popular finite queueing models (namely, M / D / 1 / K and M / M / 1 / K) to approximate our hypoexponential model. Results show that the both of these approximate models give close results when the system queue size is large.

Suggested Citation

  • Khaled Salah & Said El Kafhali, 2017. "Performance modeling and analysis of hypoexponential network servers," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 65(4), pages 717-728, August.
    • Handle: RePEc:spr:telsys:v:65:y:2017:i:4:d:10.1007_s11235-016-0262-3
    DOI: 10.1007/s11235-016-0262-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-016-0262-3
    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/s11235-016-0262-3?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.

    Citations

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


    Cited by:

    1. Shalabh Bhatnagar & Sanjeev Patel & Karmeshu, 2018. "A stochastic approximation approach to active queue management," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 68(1), pages 89-104, May.

    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:telsys:v:65:y:2017:i:4:d:10.1007_s11235-016-0262-3. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.