IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v218y2012i3p698-707.html
   My bibliography  Save this article

Approximate dynamic programming with Bézier Curves/Surfaces for Top-percentile Traffic Routing

Author

Listed:
  • Grothey, Andreas
  • Yang, Xinan

Abstract

Multi-homing is used by Internet Service Providers (ISPs) to connect to the Internet via different network providers. This study develops a routing strategy under multi-homing in the case where network providers charge ISPs according to top-percentile pricing (i.e. based on the θth highest volume of traffic shipped). We call this problem the Top-percentile Traffic Routing Problem (TpTRP).

Suggested Citation

  • Grothey, Andreas & Yang, Xinan, 2012. "Approximate dynamic programming with Bézier Curves/Surfaces for Top-percentile Traffic Routing," European Journal of Operational Research, Elsevier, vol. 218(3), pages 698-707.
    • Handle: RePEc:eee:ejores:v:218:y:2012:i:3:p:698-707
    DOI: 10.1016/j.ejor.2011.11.041
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711010502
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2011.11.041?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. Joseph Levy & Hanoch Levy & Yaron Kahana, 2006. "Top percentile network pricing and the economics of multi-homing," Annals of Operations Research, Springer, vol. 146(1), pages 153-167, September.
    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. Cervellera, Cristiano, 2023. "Optimized ensemble value function approximation for dynamic programming," European Journal of Operational Research, Elsevier, vol. 309(2), pages 719-730.
    2. Yang, Xinan & Vernitski, Alexei & Carrea, Laura, 2016. "An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters," European Journal of Operational Research, Elsevier, vol. 252(3), pages 985-994.

    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. 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:eee:ejores:v:218:y:2012:i:3:p:698-707. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.