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

Routing and capacity assignment in backbone communication networks under time varying traffic conditions

Author

Listed:
  • Amiri, Ali
  • Pirkul, Hasan

Abstract

No abstract is available for this item.

Suggested Citation

  • Amiri, Ali & Pirkul, Hasan, 1999. "Routing and capacity assignment in backbone communication networks under time varying traffic conditions," European Journal of Operational Research, Elsevier, vol. 117(1), pages 15-29, August.
    • Handle: RePEc:eee:ejores:v:117:y:1999:i:1:p:15-29
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00162-3
    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. Hasan Pirkul & Sridhar Narasimhan, 1994. "Primary and Secondary Route Selection in Backbone Computer Networks," INFORMS Journal on Computing, INFORMS, vol. 6(1), pages 50-60, February.
    2. Larry J. LeBlanc & Ronald V. Simmons, 1989. "Continuous Models for Capacity Design of Large Packet-Switched Telecommunication Networks," INFORMS Journal on Computing, INFORMS, vol. 1(4), pages 271-286, November.
    3. Bezalel Gavish & Kemal Altinkemer, 1990. "Backbone Network Design Tools with Economic Tradeoffs," INFORMS Journal on Computing, INFORMS, vol. 2(3), pages 236-252, August.
    4. Eric Rosenberg, 1987. "A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network," Operations Research, INFORMS, vol. 35(3), pages 354-364, June.
    5. Bazaraa, Mokhtar S. & Goode, Jamie J., 1979. "A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality," European Journal of Operational Research, Elsevier, vol. 3(4), pages 322-338, July.
    6. Chari, Kaushal & Dutta, Amitava, 1993. "Design of private backbone networks -- I: time varying traffic," European Journal of Operational Research, Elsevier, vol. 67(3), pages 428-442, June.
    7. Clyde L. Monma & David F. Shallcross, 1989. "Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints," Operations Research, INFORMS, vol. 37(4), pages 531-541, August.
    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. Terblanche, S.E. & Wessäly, R. & Hattingh, J.M., 2011. "Survivable network design with demand uncertainty," European Journal of Operational Research, Elsevier, vol. 210(1), pages 10-26, April.

    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. Amiri, Ali & Pirkul, Hasan, 1996. "Primary and secondary route selection in backbone communication networks," European Journal of Operational Research, Elsevier, vol. 93(1), pages 98-109, August.
    2. Ali Amiri & Hasan Pirkul, 1997. "Routing in packet‐switched communication networks with different criticality classes of communicating node pairs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(5), pages 485-505, August.
    3. Yogesh K. Agarwal, 2002. "Design of Capacitated Multicommodity Networks with Multiple Facilities," Operations Research, INFORMS, vol. 50(2), pages 333-344, April.
    4. Altinkemer, Kemal & Bose, Indranil, 2003. "Asynchronous transfer mode networks with parallel links and multiple service classes," European Journal of Operational Research, Elsevier, vol. 146(1), pages 181-198, April.
    5. Scheibe, Kevin P. & Ragsdale, Cliff T., 2009. "A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 773-784, September.
    6. Amiri, Ali, 1998. "The design of service systems with queueing time cost, workload capacities and backup service," European Journal of Operational Research, Elsevier, vol. 104(1), pages 201-217, January.
    7. Hyun Kim, 2012. "P-hub protection models for survivable hub network design," Journal of Geographical Systems, Springer, vol. 14(4), pages 437-461, October.
    8. Pirkul, Hasan & Soni, Samit, 2003. "New formulations and solution procedures for the hop constrained network design problem," European Journal of Operational Research, Elsevier, vol. 148(1), pages 126-140, July.
    9. Amiri, Ali, 2001. "The multi-hour service system design problem," European Journal of Operational Research, Elsevier, vol. 128(3), pages 625-638, February.
    10. Peiling Wu & Joseph C. Hartman & George R. Wilson, 2005. "An Integrated Model and Solution Approach for Fleet Sizing with Heterogeneous Assets," Transportation Science, INFORMS, vol. 39(1), pages 87-103, February.
    11. Juan Ma & Foad Mahdavi Pajouh & Balabhaskar Balasundaram & Vladimir Boginski, 2016. "The Minimum Spanning k -Core Problem with Bounded CVaR Under Probabilistic Edge Failures," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 295-307, May.
    12. Liang Chen & Wei-Kun Chen & Mu-Ming Yang & Yu-Hong Dai, 2021. "An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron," Journal of Global Optimization, Springer, vol. 81(3), pages 659-689, November.
    13. Imai, Akio & Nishimura, Etsuko & Current, John, 2007. "A Lagrangian relaxation-based heuristic for the vehicle routing with full container load," European Journal of Operational Research, Elsevier, vol. 176(1), pages 87-105, January.
    14. Yogesh Agarwal, 2013. "Design of Survivable Networks Using Three- and Four-Partition Facets," Operations Research, INFORMS, vol. 61(1), pages 199-213, February.
    15. Gunhak Lee & Ningchuan Xiao, 2009. "Examining the tradeoff between residential broadband service coverage and network connectivity using a bi‐objective facility location model," Papers in Regional Science, Wiley Blackwell, vol. 88(3), pages 547-562, August.
    16. Jinil Han & Kyungsik Lee & Chungmok Lee & Sungsoo Park, 2013. "Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 585-596, August.
    17. Frederick Kaefer & June S. Park, 1998. "Interconnecting LANs and a FDDI Backbone Using Transparent Bridges: A Model and Solution Algorithms," INFORMS Journal on Computing, INFORMS, vol. 10(1), pages 25-39, February.
    18. Gendron, Bernard & Potvin, Jean-Yves & Soriano, Patrick, 2002. "Diversification strategies in local search for a nonbifurcated network loading problem," European Journal of Operational Research, Elsevier, vol. 142(2), pages 231-241, October.
    19. Lawrence V. Snyder & Mark S. Daskin, 2005. "Reliability Models for Facility Location: The Expected Failure Cost Case," Transportation Science, INFORMS, vol. 39(3), pages 400-416, August.
    20. Garcia, Bruno-Laurent & Mahey, Philippe & LeBlanc, Larry J., 1998. "Iterative improvement methods for a multiperiod network design problem," European Journal of Operational Research, Elsevier, vol. 110(1), pages 150-165, October.

    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:117:y:1999:i:1:p:15-29. 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.