IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v56y2005i10d10.1057_palgrave.jors.2601944.html
   My bibliography  Save this article

Internet protocol network design with uncertain demand

Author

Listed:
  • M Riis

    (TDC)

  • A J V Skriver

    (TDC)

  • S F Møller

    (TDC)

Abstract

We present a case study concerning the design and dimensioning of the internet protocol network of TDC, the largest Danish network operator. Due to historical reasons the number of points of presence (POPs) in the network has reached a level, believed to be too high. To point out potential POPs for dismantling, we consider a network planning problem concerning dimensioning of the POPs and capacity expansion of the transmission links of the network. This problem is formulated as a two-stage stochastic program using a finite number of scenarios to describe the uncertain outcome of future demand. The problem is then solved by an L-shaped algorithm, and we report results of our computational experiments.

Suggested Citation

  • M Riis & A J V Skriver & S F Møller, 2005. "Internet protocol network design with uncertain demand," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(10), pages 1184-1195, October.
    • Handle: RePEc:pal:jorsoc:v:56:y:2005:i:10:d:10.1057_palgrave.jors.2601944
    DOI: 10.1057/palgrave.jors.2601944
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601944
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601944?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. Geir Dahl & Mechthild Stoer, 1998. "A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems," INFORMS Journal on Computing, INFORMS, vol. 10(1), pages 1-11, February.
    2. M Ríos & V Marianov & M Gutierrez, 2000. "Survivable capacitated network design problem: new formulation and Lagrangean relaxation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(5), pages 574-582, May.
    3. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(1), pages 193-194, February.
    4. C Y Lee & S J Koh, 2001. "Assignment of add–drop multiplexer (ADM) rings and digital cross-connect system (DCS) mesh in telecommunication networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(4), pages 440-448, April.
    5. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(2), pages 541-545, April.
    6. repec:dgr:rugsom:02a11 is not listed on IDEAS
    7. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(4), pages 1007-1017, August.
    8. Albareda-Sambola, Maria & Vlerk, Maarten H. van der & Fernandez, Elena, 2002. "Exact solutions to a class of stochastic generalized assignment problems," Research Report 02A11, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    9. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(6), pages 1461-1465, December.
    10. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(5), pages 1273-1289, October.
    11. Daniel Bienstock & Oktay Günlük, 1996. "Capacitated Network Design---Polyhedral Structure and Computation," INFORMS Journal on Computing, INFORMS, vol. 8(3), pages 243-259, August.
    12. Morten Riis & Kim Allan Andersen, 2002. "Capacitated Network Design with Uncertain Demand," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 247-260, August.
    13. C S Sung & S H Song, 2003. "Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(1), pages 72-82, January.
    14. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(3), pages 819-821, June.
    15. E. Medova, 1998. "Chance-constrained stochastic programming forintegrated services network management," Annals of Operations Research, Springer, vol. 81(0), pages 213-230, June.
    16. Morten Riis & Jørn Lodahl, 2002. "A bicriteria stochastic programming model for capacity expansion in telecommunications," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 56(1), pages 83-100, August.
    17. Werner Römisch & Rüdiger Schultz, 1993. "Stability of Solutions for Stochastic Programs with Complete Recourse," Mathematics of Operations Research, INFORMS, vol. 18(3), pages 590-609, August.
    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. Subhash C. Sarin & Hanif D. Sherali & Seon Ki Kim, 2014. "A branch‐and‐price approach for the stochastic generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(2), pages 131-143, March.
    2. Claudia García-García & Catalina B. García-García & Román Salmerón, 2021. "Confronting collinearity in environmental regression models: evidence from world data," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 30(3), pages 895-926, September.
    3. Cambier, Adrien & Chardy, Matthieu & Figueiredo, Rosa & Ouorou, Adam & Poss, Michael, 2022. "Optimizing subscriber migrations for a telecommunication operator in uncertain context," European Journal of Operational Research, Elsevier, vol. 298(1), pages 308-321.
    4. Libura, Marek, 2007. "On the adjustment problem for linear programs," European Journal of Operational Research, Elsevier, vol. 183(1), pages 125-134, November.
    5. Christophe Loussouarn & Carine Franc & Yann Videau & Julien Mousquès, 2021. "Can General Practitioners Be More Productive? The Impact of Teamwork and Cooperation with Nurses on GP Activities," Health Economics, John Wiley & Sons, Ltd., vol. 30(3), pages 680-698, March.
    6. Tschakert, Petra, 2016. "Shifting Discourses of Vilification and the Taming of Unruly Mining Landscapes in Ghana," World Development, Elsevier, vol. 86(C), pages 123-132.
    7. María-Consuelo Casabán & Rafael Company & Lucas Jódar, 2020. "Non-Gaussian Quadrature Integral Transform Solution of Parabolic Models with a Finite Degree of Randomness," Mathematics, MDPI, vol. 8(7), pages 1-16, July.
    8. Isabelle Boutron & Peter John & David J. Torgerson, 2010. "Reporting Methodological Items in Randomized Experiments in Political Science," The ANNALS of the American Academy of Political and Social Science, , vol. 628(1), pages 112-131, March.
    9. Ben Slimane, Faten & Padilla Angulo, Laura, 2019. "Strategic change and corporate governance: Evidence from the stock exchange industry," Journal of Business Research, Elsevier, vol. 103(C), pages 206-218.
    10. Bossert, Walter & Derks, Jean & Peters, Hans, 2005. "Efficiency in uncertain cooperative games," Mathematical Social Sciences, Elsevier, vol. 50(1), pages 12-23, July.
    11. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    12. Sin-Yu Ho & N.M. Odhiambo, 2018. "Analysing the macroeconomic drivers of stock market development in the Philippines," Cogent Economics & Finance, Taylor & Francis Journals, vol. 6(1), pages 1451265-145, January.
    13. Natalia Nikolaevna Natocheeva* & Yuri Alexandrovich Rovensky & Yuri Yuryevich Rusanov & Tatiana Viktorovna Belyanchikova & Anna Anatolevna Staurskaya, 2018. "Optimizing Variability of Approaches to Regulatory Financing of Higher Education Services," The Journal of Social Sciences Research, Academic Research Publishing Group, pages 221-227:3.
    14. Philip Arestis & Howard Stein, 2005. "An Institutional Perspective to Finance and Development as an Alternative to Financial Liberalisation," International Review of Applied Economics, Taylor & Francis Journals, vol. 19(4), pages 381-398.
    15. Sahar Validi & Arijit Bhattacharya & P. J. Byrne, 2020. "Sustainable distribution system design: a two-phase DoE-guided meta-heuristic solution approach for a three-echelon bi-objective AHP-integrated location-routing model," Annals of Operations Research, Springer, vol. 290(1), pages 191-222, July.
    16. Cabada, Alberto & Fernández-Gómez, Carlos, 2015. "Constant sign solutions of two-point fourth order problems," Applied Mathematics and Computation, Elsevier, vol. 263(C), pages 122-133.
    17. Andy Hall, 2005. "Capacity development for agricultural biotechnology in developing countries: an innovation systems view of what it is and how to develop it," Journal of International Development, John Wiley & Sons, Ltd., vol. 17(5), pages 611-630.
    18. Athinoula A. Kosti & Simon Colreavy-Donnelly & Fabio Caraffini & Zacharias A. Anastassi, 2020. "Efficient Computation of the Nonlinear Schrödinger Equation with Time-Dependent Coefficients," Mathematics, MDPI, vol. 8(3), pages 1-12, March.
    19. Bruno Frey, 2005. "Problems with Publishing: Existing State and Solutions," European Journal of Law and Economics, Springer, vol. 19(2), pages 173-190, April.
    20. Lan, Heng-you, 2021. "Approximation-solvability of population biology systems based on p-Laplacian elliptic inequalities with demicontinuous strongly pseudo-contractive operators," Chaos, Solitons & Fractals, Elsevier, vol. 150(C).

    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:pal:jorsoc:v:56:y:2005:i:10:d:10.1057_palgrave.jors.2601944. 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.palgrave-journals.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.