Title :
Shared Backup Path Protection for Anycast and Unicast Flows Using the Node-Link Notation
Author :
Walkowiak, Krzysztof ; Rak, Jacek
Author_Institution :
Wroclaw Univ. of Technol., Wroclaw, Poland
Abstract :
In this paper we address the problem of shared backup path protection (SBPP) against random failures of single links in connection-oriented communication networks. Most of recent works has been concentrated on protecting the unicast traffic. Our paper is also focused on shared protection of anycast (i.e. one-to-one-out-of-many) flows. Anycasting is frequently met in practice (e.g. in Content Delivery Networks, peer-to-peer systems, or DNS service). A new ILP model for joint optimization of dedicated working and shared backup paths of anycast and unicast demands is introduced and is followed by extensive simulation research. The model is the first one that provides the optimal solutions to the problem of anycast traffic shared protection by using the Node-Link notation. The results show that our approach reduces the network cost and capacity utilization ratio by 36% and 42% accordingly, compared to the case when capacity sharing is not used.
Keywords :
integer programming; linear programming; telecommunication network reliability; telecommunication security; telecommunication traffic; ILP model; SBPP; anycast flows; anycast traffic-shared protection; capacity utilization ratio; connection-oriented communication networks; joint optimization; node-link notation; shared backup path protection; single-link random failures; unicast flows; unicast traffic; Computational modeling; Joints; Measurement; Optimization; Peer to peer computing; Servers; Unicast;
Conference_Titel :
Communications (ICC), 2011 IEEE International Conference on
Conference_Location :
Kyoto
Print_ISBN :
978-1-61284-232-5
Electronic_ISBN :
1550-3607
DOI :
10.1109/icc.2011.5962478