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

Optimal Sizing of Records when Divided Messages Can Be Stored in Records of Different Sizes

Author

Listed:
  • Ranel E. Erickson

    (Bell Laboratories, Holmdel, New Jersey)

  • Shlomo Halfin

    (Bell Laboratories, Holmdel, New Jersey)

  • Hanan Luss

    (Bell Laboratories, Holmdel, New Jersey)

Abstract

In many computer applications, messages of various lengths need to be stored efficiently. We examine the problem in which a fixed number of record lengths can be used to store messages. Whenever a message arrives it is stored in the smallest possible record that can contain the message. If the message length exceeds the largest record length, the message is divided into segments whose lengths are equal to the largest record length except for the final segment which may be smaller. Each segment is then stored in the smallest possible record. Furthermore, each record is accompanied by a header that contains overhead information. Using a nonlinear programming approach, an efficient algorithm is developed that finds the record lengths which minimize the expected space used to store a message. Numerical examples are presented and compared to those obtained in a previous work in which it was assumed that divided messages are stored in several records all of the same length.

Suggested Citation

  • Ranel E. Erickson & Shlomo Halfin & Hanan Luss, 1982. "Optimal Sizing of Records when Divided Messages Can Be Stored in Records of Different Sizes," Operations Research, INFORMS, vol. 30(1), pages 29-39, February.
    • Handle: RePEc:inm:oropre:v:30:y:1982:i:1:p:29-39
    DOI: 10.1287/opre.30.1.29
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.30.1.29
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.30.1.29?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
    ---><---

    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:30:y:1982:i:1:p:29-39. 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.