IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v53y2005i4p575-585.html
   My bibliography  Save this article

Sizing Backbone Internet Links

Author

Listed:
  • Daniel P. Heyman

    (101 Lindy Lane, Lincroft, New Jersey 07738)

Abstract

One of the distinguishing features of a backbone link is that it is designed to carry traffic from a large number of end users. This results in a Normal distribution for the number of bytes or packets that arrive in a fixed-length time interval. Based on this observation, which is substantiated by data analysis, we present a simple model for the steady-state loss probability that can be solved in closed form. This model assumes that there is no buffer, so that issues raised by the correlation of counts that is characteristic of packet traffic are bypassed.The longest interval that captures the relevant statistical fluctuations of backbone traffic is one second. Data collection on live commercial networks is costly, so byte and packet counts are usually collected over much longer time intervals; five minutes is a lower bound. This creates no problem in estimating the mean of the Normal distribution, but it makes direct estimation of the variance for one-second counts infeasible. Routers collect flow data; flows are analogous to “calls” in telephony. By modeling the number of active flows as an M/G/ ∞ queue and assuming that packets in a flow are spread uniformly in time, an equation for the variance of (say) one-second counts in terms of measured quantities is derived. The efficacy of this formula is demonstrated by applying it to data.

Suggested Citation

  • Daniel P. Heyman, 2005. "Sizing Backbone Internet Links," Operations Research, INFORMS, vol. 53(4), pages 575-585, August.
  • Handle: RePEc:inm:oropre:v:53:y:2005:i:4:p:575-585
    DOI: 10.1287/opre.1040.0192
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1040.0192
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.1040.0192?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
    ---><---

    Citations

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


    Cited by:

    1. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, 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:inm:oropre:v:53:y:2005:i:4:p:575-585. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.