IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v44y1997i5p485-505.html
   My bibliography  Save this article

Routing in packet‐switched communication networks with different criticality classes of communicating node pairs

Author

Listed:
  • Ali Amiri
  • Hasan Pirkul

Abstract

This paper addresses the routing problem with reliability requirements in packet‐switched communication networks. In this problem, two classes of communicating node pairs are considered: less critical and highly critical node pairs. We develop a model which identifies a primary route for each less critical node pair and both a primary and a secondary (back up) route for each highly critical node pair. The objective is to minimize the average delay encountered by messages. A solution procedure based on a relaxation of the problem is presented. Computational results over a wide range of problem structures show that the procedure is very effective. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 485–505, 1997

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:44:y:1997:i:5:p:485-505
    DOI: 10.1002/(SICI)1520-6750(199708)44:53.0.CO;2-0
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199708)44:53.0.CO;2-0
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199708)44:53.0.CO;2-0?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
    ---><---

    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. Bezalel Gavish & Kemal Altinkemer, 1990. "Backbone Network Design Tools with Economic Tradeoffs," INFORMS Journal on Computing, INFORMS, vol. 2(3), pages 236-252, August.
    3. 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.
    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. 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. 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.
    3. 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.
    4. Yogesh K. Agarwal, 2002. "Design of Capacitated Multicommodity Networks with Multiple Facilities," Operations Research, INFORMS, vol. 50(2), pages 333-344, April.
    5. 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.
    6. 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.
    7. 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.
    8. Linos F. Frantzeskakis & Hanan Luss, 1999. "The network redesign problem for access telecommunications networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 487-506, August.
    9. Seohee Kim & Chungmok Lee, 2021. "A branch and price approach for the robust bandwidth packing problem with queuing delays," Annals of Operations Research, Springer, vol. 307(1), pages 251-275, December.
    10. Bita Tadayon & J. Cole Smith, 2014. "Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 506-532, May.
    11. 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.
    12. F. Sibel Salman & R. Ravi & John N. Hooker, 2008. "Solving the Capacitated Local Access Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 243-254, May.
    13. 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.
    14. 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.
    15. 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.
    16. Amiri, Ali, 2006. "Designing a distribution network in a supply chain system: Formulation and efficient solution procedure," European Journal of Operational Research, Elsevier, vol. 171(2), pages 567-576, June.
    17. Bretthauer, Kurt M., 1996. "Capacity planning in manufacturing and computer networks," European Journal of Operational Research, Elsevier, vol. 91(2), pages 386-394, June.
    18. Kaj Holmberg & Kurt Jörnsten, 1996. "Solving the generalized knapsack problem with variable coefficients," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(5), pages 673-689, August.
    19. Amiri, Ali, 2002. "An integrated approach for planning the adoption of client/server systems," European Journal of Operational Research, Elsevier, vol. 142(3), pages 509-522, November.
    20. Rizk, Nafee & Martel, Alain & Ramudhin, Amar, 2006. "A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs," International Journal of Production Economics, Elsevier, vol. 102(2), pages 344-357, August.

    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:wly:navres:v:44:y:1997:i:5:p:485-505. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.