Skip to main content
SpringerLink
Log in

A heuristic approach to working and spare capacity optimization for survivable anycast streaming protected by p-cycles

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Most of previous research in the field of network survivability has been focused on unicast transmissions. However, growing popularity of various concepts following the idea of content-oriented networks has triggered the need to develop new approaches to protect networks with other than unicast flows including multicast and anycast flows. In this paper, we consider the latter case and address the problem of working and spare capacity allocation in networks with anycast streaming, i.e., it is assumed that a set of replica servers is deployed in the network to serve streaming requests. To protect the network we propose to apply p-cycles—a relatively novel survivability approach combining capacity effectiveness of mesh restoration and ring-like restoration speed. To benefit from special properties of anycast flows, we use augmented version of p-cycles called Anycast-Protecting p-Cycles (APpC). We formulate the optimization problem as an ILP (Integer Linear Programming) model further applied to obtain optimal results using the GuRoBi solver. Due to high complexity of this optimization problem, we propose an effective heuristic algorithm based on the Simulated Annealing approach. Several versions of the algorithm are developed and examined—the best method yields on average results only 4.14 % worse than optimal ones. A wide range of experiments is conducted to verify performance of the proposed approach as a function of various network parameters including: p-cycle generator, p-cycle length, number of replica servers, number of clients. Moreover, we evaluate the Anycast-Protecting p-Cycles approach against classical p-cycle.

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

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Akamai. http://www.akamai.com.

  2. Streaming video to outpace p2p growth (referencing cisco visual networking index forecast 2009–2014). http://news.cnet.com/8301-30686_3-20006530-266.html.

  3. Aarts, E., & van Laarhoven, P. (1987). A pedestrian review of the theory and application of the simulated anealing algorithm. Lecture Notes in Physics, 275, 287–306.

    Article  Google Scholar 

  4. Buford, J., Yu, H., & Lua, E. K. (2008). P2P networking and applications. San Francisco: Morgan Kaufmann

    Google Scholar 

  5. Choi, J., Han, J., Cho, E., Kwon, T., & Choi, Y. (2011). A survey on content-oriented networking for efficient content delivery. IEEE Communications Magazine, 49, 121–127.

    Article  Google Scholar 

  6. Doucette, J., He, D., Grover, W. D., & Yang, O. (2003). Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design. In Proceedings of the fourth international workshop on design of reliable communication networks (pp. 212–220).

    Google Scholar 

  7. Feng, T., Ruan, L., & Zhang, W. (2010). Intelligent p-cycle protection for dynamic multicast sessions in wdm networks. IEEE/OSA Journal of Optical Communications and Networking, 2(7), 389–399.

    Article  Google Scholar 

  8. Feng, Z., & Wen-De, Z. (2006). A novel path-protecting p-cycle heuristic algorithm. In Proceedings of the international conference on transparent optical networks (pp. 203–206).

    Google Scholar 

  9. Frikha, A., Cousin, B., & Lahoud, S. (2011). Extending node protection concept of p-cycles for an efficient resource utilization in multicast traffic.

    Google Scholar 

  10. Grover, W. D. (2003). Mesh-based survivable networks: options and strategies for optical MPLS, SONET, and ATM networking. New Jersey: Prentice Hall.

    Google Scholar 

  11. Grover, W. D., & Shen, G. (2003). Extending the p-cycle concept to path-segment protection. IEEE Journal on Selected Areas in Communications, 21(8), 1306–1319.

    Article  Google Scholar 

  12. Gruber, C. (2003). Resilient networks with non-simple p-cycles. In Proceedings of the 10th international conference on telecommunications (pp. 1027–1032).

    Google Scholar 

  13. Guha, S., Meyerson, A., & Munagala, K. (2001). Improved algorithms for fault folerant facility location. In Proceedings of the twelfth annual ACM-SIAM symposium on discrete algorithms, Washington, DC, USA (pp. 636–641).

    Google Scholar 

  14. Hofmann, M., & Beaumont, L. R. (2005). Content networking: architecture, protocols and practice. The Morgan Kaufmann series in networking. San Mateo: Morgan Kaufmann.

    Google Scholar 

  15. Jaumard, B., & Shaikh, A. (2011). Maximizing access to it services on resilient optical grids. In 3rd international Congress on ultra modern telecommunications and control systems and workshops, ICUMT 2011, Budapest, Hungary (pp. 1–6).

    Google Scholar 

  16. Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problems. Berlin: Springer.

    Book  Google Scholar 

  17. Kirkpatrick, S., Gelatt, C. D. J., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671–680.

    Article  Google Scholar 

  18. Krishnan, P., & Shavitt, D. R. Y. (2000). The cache location problem. IEEE/ACM Transactions on Networking, 8(5), 568–582.

    Article  Google Scholar 

  19. Li, W., Doucette, J., & Zuo, M. (2007). P-Cycle network design for specified minimum dual-failure restorability. In Proceedings of the IEEE international conference on communications, ICC 2007, Glasgow, Scotland (pp. 2204–2210).

    Chapter  Google Scholar 

  20. Mukherjee, D. S., Assi, C., & Agarwal, A. (2006). Alternate strategies for dual failure restoration using p-cycles. In Proceedings of the IEEE international conference on communications (pp. 2477–2482).

    Google Scholar 

  21. Nguyen, H., Habibi, D., Phung, V., Lachowicz, S., Kungmeng, L., & Kang, B. (2006). Joint optimization in capacity design of networks with p-cycle using the fundamental cycle set. In Proceedings of the global telecommunications conference, GLOBECOM ’06 (pp. 1–5).

    Google Scholar 

  22. Orlowski, S., Pióro, M., Tomaszewski, A., & Wessäly, R. (2007). SNDlib 1.0—survivable network design library. In Proceedings of the 3rd international network optimization conference (INOC 2007), Spa, Belgium. http://sndlib.zib.de.

    Google Scholar 

  23. Pióro, M., & Medhi, D. (2004). Routing, flow, and capacity design in communication and computer networks. San Francisco: Elsevier

    Google Scholar 

  24. Qiu, L., Padmanabhan, V., & Voelker, G. (2001). On the placement of web server replicas. In Proceedings of the twentieth annual joint conference of the IEEE computer and communications societies, INFOCOM 2001, Anchorage, AK, USA (Vol. 3, pp. 1587–1596).

    Google Scholar 

  25. Rak, J., & Walkowiak, K. (2013). Reliable anycast and unicast routing: protection against attacks. Telecommunication systems, 1–18.

  26. Rocha, C., Jaumard, B., & Bougué, P. (2009). Directed vs. undirected p-cycles and FIPP p-cycles. In Proceedings of the international network optimization conference, INOC 2009.

    Google Scholar 

  27. Sack, A., & Grover, W. (2004). Hamiltonian p-cycles for fiber-level protection in homogeneous and semi-homogeneous optical networks. IEEE Network, 18(2), 49–56.

    Article  Google Scholar 

  28. Shah-Heydari, S., Mardini, W., & Yang, O. (2004). Theoretical analysis of restorability of Hamiltonian protection cycles in random mesh networks. In Proceedings of the ninth international symposium on computers and communications (pp. 921–926).

    Google Scholar 

  29. Shaikh, A., Buysse, J., Jaumard, B., & Develder, C. (2011). Anycast routing for survivable optical grids: scalable solution methods and the impact of relocation. Journal of Optical Communications and Networking, 3(9), 767–779.

    Article  Google Scholar 

  30. Smutnicki, A., & Walkowiak, K. (2009). Optimization of p-cycles for survivable anycasting streaming. In Proceedings of 7th international workshop on design of reliable communication networks, Washington DC, USA (pp. 227–234).

    Google Scholar 

  31. Smutnicki, A., & Walkowiak, K. (2010). Optimal results for anycast-protecting p-cycles problem. In Proceedings of the international congress on ultra modern telecommunications and control systems and workshops, Moscow (pp. 511–517).

    Chapter  Google Scholar 

  32. Stamatelakis, D., & Grover, W. D. (2000). Theoretical underpinnings for the efficiency of restorable network using preconfigured cycles (p-cycles). IEEE Transactions on Communications, 48(8), 1262–1265.

    Article  Google Scholar 

  33. Szigeti, J., & Cinkler, T. (2013). Evaluation and estimation of the availability of p-cycle protected connections. Telecommunication systems, 1–16.

  34. Walkowiak, K. (2005). Heuristic algorithm for anycast flow assignment in connection-oriented networks. In International conference on computational science (3)’05 (pp. 1092–1095).

    Google Scholar 

  35. Walkowiak, K. (2006). Lagrangean heuristic for anycast flow assignment in connection-oriented networks. In International conference on computational science (1)’06 (pp. 626–633).

    Google Scholar 

  36. Walkowiak, K., & Rak, J. (2013). Simultaneous optimization of unicast and anycast flows and replica location in survivable optical networks. Telecommunication systems, 1–13.

  37. Wang, X., Guo, L., Cao, J., Wu, J., & Hou, W. (2010). Multicast protection scheme based on Hamiltonian cycle in fault-tolerant optical mesh networks. In Optical fiber technology.

    Google Scholar 

  38. Zhang, F., & Zhong, W. D. (2007). Applying p-cycles in dynamic provisioning of survivable multicast sessions in optical wdm networks. In OFC/NFOEC conference on optical fiber communication and the national fiber optic engineers conference (pp. 1–3).

    Google Scholar 

  39. Zhang, F., & Zhong, W. D. (2009). Optimized design of node-and-link protecting p-cycle with restorability constraints for optical multicast traffic protection. In 14th optoelectronics and communications conference, OECC 2009 (pp. 1–2).

    Google Scholar 

  40. Zhang, F., & Zhong, W. D. (2009). P-Cycle based tree protection of optical multicast traffic for combined link and node failure recovery in wdm mesh networks. IEEE Communications Letters, 13(1), 40–42.

    Article  Google Scholar 

  41. Zhang, F., & Zhong, W. D. (2009). Performance evaluation of optical multicast protection approaches for combined node and link failure recovery. Journal of Lightwave Technology, 27(18), 4017–4025.

    Article  Google Scholar 

  42. Zhang, F., & Zhong, W. D. (2010). Extending p-cycles to source failure recovery for optical multicast media traffic. IEEE/OSA Journal of Optical Communications and Networking, 2(10), 831–840.

    Article  Google Scholar 

  43. Zhang, Z., Zhong, W., & Mukherjee, B. (2004). A heuristic method for design of survivable WDM networks with p-pycles. IEEE Communications Letters, 8(7), 467–469.

    Article  Google Scholar 

  44. Zhong, W. D., & Zhang, F. (2010). p-Cycle based optical multicast protection approaches for combined node and link failure recovery. In Communications and photonics conference and exhibition (ACP), Asia (pp. 367–368).

    Chapter  Google Scholar 

  45. Zhong, W. D., & Zhang, F. (2011). An overview of p-cycle based optical multicast protection approaches in mesh WDM networks. Optical Switching and Networking, 8(4), 259–274.

    Article  Google Scholar 

  46. Zhong, W. D., & Zhang, F. (2011). Source failure recovery for optical multicast traffic in wdm networks. In 13th international conference on transparent optical networks (ICTON) (pp. 1–4).

    Google Scholar 

Download references

Acknowledgements

The work was supported by the Polish National Science Centre (NCN), under grant N N519 650440.

Fellowship co-financed by European Union within European Social Fund.

Calculations have been carried out in Wroclaw Centre for Networking and Supercomputing (http://www.wcss.wroc.pl), grant No. 168.

Author information

Authors and Affiliations

  1. Department of Systems and Computer Networks, Faculty of Electronics, Wroclaw University of Technology, Wybrzeze Wyspianskiego 27, 50-370, Wroclaw, Poland

    Adam Smutnicki & Krzysztof Walkowiak

Authors
  1. Adam Smutnicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krzysztof Walkowiak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adam Smutnicki.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Smutnicki, A., Walkowiak, K. A heuristic approach to working and spare capacity optimization for survivable anycast streaming protected by p-cycles. Telecommun Syst 56, 141–156 (2014). https://doi.org/10.1007/s11235-013-9824-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-013-9824-9

Keywords

Search

Navigation