Skip to main content
SpringerLink
Log in

Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

This paper proposes three classes of alternative mathematical programming models (i.e., edge-based, path-based, and tree-based) for redundant multicast routing problem with shared risk link group (SRLG)-diverse constraints (RMR-SRLGD). The goal of RMR-SRLGD problem is to find two redundant multicast trees, each from one of the two sources to every destination, at a minimum cost while ensuring the paths from the two sources to a destination do not share any common risks. Such risk could cause the failures of multiple links simultaneously. Therefore, the RMR-SRLGD problem ensures the availability and reliability of multicast services. We investigated and compared the theoretical bounds of the linear programming (LP) relaxation for all models. We also summarized a hierarchy relationship of the tightness of LP bounds for the proposed models.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)

    Google Scholar 

  2. Guo L., Yu H., Li L.: A new shared-path protection algorithm under shared risk link group constraints for survivable wdm mesh networks. Opt. Commun. 246, 285–295 (2005)

    Article  Google Scholar 

  3. Hu J.Q.: Diverse routing in mesh optical networks. IEEE Trans. commun. 51(3), 489–494 (2003)

    Article  Google Scholar 

  4. Irava, V.S., Hauser, C.: Survivable low-cost low-delay multicast trees. Proceedings of Global Telecommunications Conference GLOBECOM ’05, pp. 109–115. (2005)

  5. Liang, Z., Chaovalitwongse, W.A., Cha, M., Moon, S., Shaikh, A., Yates, J.: An iptv routing problem with hop constraints. Technical report, Department of Industrial & Systems Engineering, Rutgers, The state University of New Jersey, New Brunswick (2009)

  6. Medard M., Finn S.G., Barry R.A.: Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Trans. Netw. 7(5), 641–652 (1999)

    Article  Google Scholar 

  7. Pardalos P., Khoury B.: A heuristic for the steiner problem on graphs. Comp. Opt. Appl. 6, 5–14 (1996)

    Google Scholar 

  8. Paul, P., Raghavan, S.V.: Survey of multicast routing algorithms and protocols. Proceedings of the Fifteenth International Conference on Computer Communication (ICCC 2002), pp. 902–926 (2002)

  9. Shen L., Yang X., Ramanurthy B.: Shared risk link group (srlg)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks. IEEE/ACM Trans. Netw. 13(4), 918–931 (2005)

    Article  Google Scholar 

  10. Yuan S., Jue J.P.: Dynamic lightpath protection in wdm mesh networks under wavelength-continuity and risk-disjoint constraints. Comput. Netw. 48, 91–112 (2005)

    Article  Google Scholar 

  11. Zang H., Ou C., Mukherjee B.: Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints. IEEE/ACM Trans. Netw. 11(2), 248–258 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial & Systems Engineering, Rutgers University, 96 Frelinghuysen Road CoRE Building, Room 201, Piscataway, NJ, 08854, USA

    Zhe Liang & Wanpracha Art Chaovalitwongse

Authors
  1. Zhe Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wanpracha Art Chaovalitwongse
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wanpracha Art Chaovalitwongse.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liang, Z., Art Chaovalitwongse, W. Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models. J Glob Optim 48, 335–345 (2010). https://doi.org/10.1007/s10898-009-9497-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-009-9497-9

Keywords

Search

Navigation