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

Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network

Author

Listed:
  • Cole Smith, J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Cole Smith, J., 2004. "Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network," European Journal of Operational Research, Elsevier, vol. 154(3), pages 659-672, May.
    • Handle: RePEc:eee:ejores:v:154:y:2004:i:3:p:659-672
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00804-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Belvaux, Gaetan & Boissin, Nicolas & Sutter, Alain & Wolsey, Laurence A., 1998. "Optimal placement of add /drop multiplexers static and dynamic models," European Journal of Operational Research, Elsevier, vol. 108(1), pages 26-35, July.
    2. Manuel Laguna, 1994. "Clustering for the Design of SONET Rings in Interoffice Telecommunications," Management Science, INFORMS, vol. 40(11), pages 1533-1541, November.
    3. Alain S. Sutter & François Vanderbeck & Laurence Wolsey, 1998. "Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms," Operations Research, INFORMS, vol. 46(5), pages 719-728, October.
    4. James B. Orlin, 1993. "A Faster Strongly Polynomial Minimum Cost Flow Algorithm," Operations Research, INFORMS, vol. 41(2), pages 338-350, April.
    5. Young-Soo Myung & Hu-Gon Kim & Dong-Wan Tcha, 1997. "Optimal Load Balancing on Sonet Bidirectional Rings," Operations Research, INFORMS, vol. 45(1), pages 148-152, February.
    6. Hanif D. Sherali & J. Cole Smith & Youngho Lee, 2000. "Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 284-298, November.
    7. Ahuja, Ravindra K. & Kodialam, Murali & Mishra, Ajay K. & Orlin, James B., 1997. "Computational investigations of maximum flow algorithms," European Journal of Operational Research, Elsevier, vol. 97(3), pages 509-542, March.
    8. BELVAUX, Gaetan & BOISSIN, Nicolas & SUTTER, Alain & WOLSEY, Laurence A., 1998. "Optimal placement of add/drop multiplexers: Static and dynamic models," LIDAM Reprints CORE 1320, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. 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.

    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. Polinder, G.-J. & Cacchiani, V. & Schmidt, M.E. & Huisman, D., 2020. "An iterative heuristic for passenger-centric train timetabling with integrated adaption times," ERIM Report Series Research in Management ERS-2020-006-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    2. Polinder, G.-J. & Schmidt, M.E. & Huisman, D., 2020. "Timetabling for strategic passenger railway planning," ERIM Report Series Research in Management ERS-2020-001-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    3. Hanif D. Sherali & J. Cole Smith & Youngho Lee, 2000. "Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 284-298, November.
    4. Polinder, Gert-Jaap & Schmidt, Marie & Huisman, Dennis, 2021. "Timetabling for strategic passenger railway planning," Transportation Research Part B: Methodological, Elsevier, vol. 146(C), pages 111-135.
    5. Fortz, Bernard & Soriano, Patrick & Wynants, Christelle, 2003. "A tabu search algorithm for self-healing ring network design," European Journal of Operational Research, Elsevier, vol. 151(2), pages 280-295, December.
    6. Müller, R.J. & Gui, H. & Vohra, R., 2004. "Dominant strategy mechanisms with multidimensional types," Research Memorandum 046, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    7. Leegwater, D.K. & de Groot, J.D., 2004. "Optimisation of connections to a fibre network," Econometric Institute Research Papers EI 2004-42, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    8. Absi, Nabil & van den Heuvel, Wilco, 2019. "Worst case analysis of Relax and Fix heuristics for lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 279(2), pages 449-458.
    9. Stefan Voßs & Andreas Fink & Cees Duin, 2005. "Looking Ahead with the Pilot Method," Annals of Operations Research, Springer, vol. 136(1), pages 285-302, April.
    10. Sedeño-Noda, A. & González-Dávila, E. & González-Martín, C. & González-Yanes, A., 2009. "Preemptive benchmarking problem: An approach for official statistics in small areas," European Journal of Operational Research, Elsevier, vol. 196(1), pages 360-369, July.
    11. Man Xiao & Weidong Li & Xiaofei Liu, 2023. "Online Mixed Ring Covering Problem with Two Nodes," SN Operations Research Forum, Springer, vol. 4(1), pages 1-20, March.
    12. Dereniowski, Dariusz & Kubiak, Wiesław, 2020. "Shared processor scheduling of multiprocessor jobs," European Journal of Operational Research, Elsevier, vol. 282(2), pages 464-477.
    13. Y Shim & S A Gabriel & A Desai & P Sahakij & S Milner, 2008. "A fast heuristic method for minimizing traffic congestion on reconfigurable ring topologies," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(4), pages 521-539, April.
    14. Balaji Gopalakrishnan & Seunghyun Kong & Earl Barnes & Ellis Johnson & Joel Sokol, 2011. "A least-squares minimum-cost network flow algorithm," Annals of Operations Research, Springer, vol. 186(1), pages 119-140, June.
    15. Qingqin Nong & Jinjiang Yuan & Yixun Lin, 2009. "The weighted link ring loading problem," Journal of Combinatorial Optimization, Springer, vol. 18(1), pages 38-50, July.
    16. Niu, Yi-Feng & Gao, Zi-You & Lam, William H.K., 2017. "A new efficient algorithm for finding all d-minimal cuts in multi-state networks," Reliability Engineering and System Safety, Elsevier, vol. 166(C), pages 151-163.
    17. Shoshana Anily, 1996. "The vehicle‐routing problem with delivery and back‐haul options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 415-434, April.
    18. László A. Végh, 2017. "A Strongly Polynomial Algorithm for Generalized Flow Maximization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 179-211, January.
    19. Jane, Chin-Chia & Laih, Yih-Wenn, 2010. "A dynamic bounding algorithm for approximating multi-state two-terminal reliability," European Journal of Operational Research, Elsevier, vol. 205(3), pages 625-637, September.
    20. Garg, Manish & Smith, J. Cole, 2008. "Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios," Omega, Elsevier, vol. 36(6), pages 1057-1071, December.

    More about this item

    Statistics

    Access and download statistics

    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:154:y:2004:i:3:p:659-672. 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.