Applying p-cycle protection for a reliable IPTV service in IP-over-DWDM networks
详细信息 查看全文
- 作者：Ahmed Frikha (1)
Bernard Cousin (1)
Samer Lahoud (1) - 关键词：IPTV service ; multicast routing ; IP ; over ; DWDM networks ; Reliability ; p ; cycles ; node and link protection
- 刊名：Journal of Internet Services and Applications
- 出版年：2014
- 出版时间：December 2014
- 年：2014
- 卷：5
- 期：1
- 全文大小：295 KB
- 参考文献：1. Bhattacharyya S: An overview of source-specific multicast (SSM). / IETF RFC 2003, 3569.
2. Doverspike R, Ramakrishnan KK, Chase C: Structural overview of ISP networks. In / Kalmanek C, Misra S, Yang R (eds) Guide to reliable internet services and applications, Computer Communications and Networks. London: Springer; 2010:19-3. CrossRef
3. Grover WD, Stamatelakis D: Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration. / Proceedings of IEEE International Conference on Communications (IEEE ICC), vol 1 1998, 537-43.
4. Clouqueur M, Grover WD: Availability analysis and enhanced availability design in p-cycle-based networks. / Photonic Netw Commun 2005,10(1):55-1. CrossRef
5. Doucette J, Giese PA, Grover WD: Combined node and span protection strategies with node-encircling p-cycles. In / Proceedings of the workshop on design of reliable communication networks (DRCN). Italy: Ischia (Naples); 2005:213-21.
6. Cisco Systems: White paper on optimizing video transport in your IP triple play network. 2006. http://www.cisco.com
7. Zhang F, Zhong WD: Performance evaluation of optical multicast protection approaches for combined node and link failure recovery. / J Lightw Technol 2009,27(18):4017-025. CrossRef
8. Singhal NK, Sahasrabuddhe LH, Mukherjee B: Provisioning of survivable multicast sessions against single link failures in optical WDM mesh networks. / J Lightw Technol 2003,21(11):2587-594. CrossRef
9. Zhang F, Zhong WD: p -cycle based tree protection of optical multicast traffic for combined link and node failure recovery in WDM mesh networks. / IEEE Commun Lett 2009,13(1):40-2. CrossRef
10. Zhang ZR, Zhong WD, Mukherjee B: A heuristic method for design of survivable WDM networks with p-cycles. / IEEE Commun Lett 2004, 8:467-69. CrossRef
11. Maesschalck SD, Colle D, Lievens I, Pickavet M, Demeester P, Mauz C, Jaeger M, Inkret R, Derkacz BM: Pan-European optical transport networks: an availability based comparison. / Photonic Netw Commun 2003,5(3):203-26. CrossRef
12. Batchelor P, Daino B, Heinzmann P, Weinert C, Spath J, Van Caenegem B, Hjelme DR, Inkret R, Jager HA, Joindot M, Kuchar A, Le Coquil E, Leuthold P, De Marchis G, Matera F, Mikac B, Nolting HP, Tillerot F, Wauters N: Ultra high capacity optical transmission networks. / Final report of Action COST 1999, 239. - 作者单位：Ahmed Frikha (1)
Bernard Cousin (1)
Samer Lahoud (1)
1. IRISA, University of Rennes 1, Campus universitaire Beaulieu, 35042, Rennes, France - ISSN：1869-0238
文摘
Today, television over Internet protocol (IPTV) has become very popular and service providers must deal with the rapid growth in the number of IPTV customers. Service providers must ensure the reliability of IPTV to satisfy customers-needs, as a network failure could disrupt an IPTV transmission. Survivable multicast routing is important for providing a reliable IPTV service. Generally, most carriers route multicast traffic using the protocol-independent multicast source-specific mode (PIM-SSM) based on the routing information provided by the interior gateway protocol (IGP). Restoration using the IGP reconfiguration is slow and typically takes from 10 to 60 seconds. To ensure a fast restoration, we consider node and link failure recovery in the Dense Wavelength Division Multiplexing (DWDM) optical layer. The backup path is provided in this layer. Thus, the multicast tree does not change at the IP layer (the logical links do not change) and the restoration time is faster (typically of the order of 50 to 80 ms). In this paper, we apply p-cycles in IP-over-DWDM networks to provide a robust IPTV service. In addition, we propose a novel concept for node protection using p-cycles to achieve more efficient resource utilization. We also propose a new algorithm, the node and link protecting candidate p-cycle based algorithm (NPCC). This algorithm integrates our new concept for node protection. Extensive simulations show that it outperforms the existing approaches in terms of blocking probability, resource utilization efficiency and computation time rapidity.