A new algorithm with segment protection and load balancing for single-link failure in multicasting survivable networks☆
Introduction
With the service requirements in Internet increasing, the multicast traffic, such as multiparty conferencing, video distribution and interactive distance learning, become more and more popular in current computer networks (Sahasrabuddhe and Mukherjee, 1999, Li and Li, 2005, Wang et al., 2006). The multicasting technique is aim to construct a feasible multicast tree from the source node to all detonation nodes to transmit the traffic. Since each multicast tree can provide very high transmission rate in current high speed backbone communication networks, e.g., optical transport networks, the failure problem may lead to a lot of traffic blocked. Therefore, network security for failure tolerance in multicast requests in survivable communication networks is very important, and the literature (Luo and Li, 2007, Singhal and Ou, 2006, Liao et al., 2006, Lu et al., 2006) in recent years has addressed the problem of single-link failure which denotes one physical link breakdown at the same time in networks.
In Singhal and Ou (2006), the authors proposed two multicasting techniques that are called self-sharing and cross-sharing to improve the resource utilization ratio. In self-sharing, the common resources can be shared by the primary tree and backup tree (paths) if the primary tree and backup tree (paths) belong to the same multicast request. In cross-sharing, the common resources can be shared by the backup trees (backups) of different multicast requests if these backup trees (backups) are risk-disjoint. In Singhal and Ou (2006), each multicast requests will be assigned to a primary tree and a link-disjoint backup tree to tolerate the single-link failure. Normally, the traffic is transmitted on the primary tree; after the failures occur, the traffic will be switched to the backup tree. However, the backup tree method may easily lead to the trap problem. In this problem, the backup tree may not be found due to the link-disjoint or shared backup resources constraint, so that the blocking probability may become high. In Lu et al. (2006), the authors proposed the conventional segment protection (CSP) algorithm to protect the single-link failure. Although CSP can avoid the trap problem, it does not consider the cross-sharing, self-sharing, and load balancing such that the resource utilization ratio may be lower because there will be more redundant backup resources without regard to the cross-sharing, self-sharing and load balancing. Lower resource utilization ratio will lead to higher blocking probability because there are fewer free resources to be used by new requests.
In this paper, in order to overcome the trap problem in conventional backup tree method, we propose a new segment protection method, in which the primary tree can be divided into several un-overlapped primary segments according to the branch nodes on the primary tree, and each primary segment can be assigned to a link-disjoint backup path. In order to improve the performances of resource utilization ratio and blocking probability, we jointly consider the techniques of cross-sharing and self-sharing and the idea of load balancing routing. Based on these ideas and methods, we propose a new heuristic algorithm named segment protection with load balancing (SPLB) for multicast requests to address the problem of single-link failure. Compared with previous algorithm, SPLB is able to obtain better performances of resource utilization ratio and blocking probability.
The rest of this paper is organized as follow: Section 2 states the network mode, segment protection, sharing resources, and the idea of load balancing; Section 3 presents the process of SPLB algorithm and performance parameters; Section 4 evaluates the resource utilization ratio and blocking probability for SPLB compared with conventional algorithm; Section 5 is for conclusion.
Section snippets
Network model
The given network is denoted as G (N, L, C), where N denotes the node set, L denotes the link set, and C denotes the capacity of each link. Each multicast request is denoted as M (S, D), where s ∈ N is the source node and D = {D1,D2, … ,Dx} ⊆ N is the set of destination nodes. We assume there is only one multicast request arrival at a time and each required bandwidth is one capacity unit. Some important notations are defined as follows:
- j
physical link in networks
- Costj
basic cost of link j, which is
Process of SPLB
Step 1: Wait for new multicast request. If multicast request MRn arrives, go to step 2; otherwise, go back to step 1.
Step 2: Adjust the link-costs according to (1), and compute the primary tree PTn with the minimal cost from the source node to destination nodes by Prim algorithm. If PTn can be successfully found, go to step 3; otherwise, block MRn, update the network state, and go back to step 1.
Step 3: Divide PTn into several un-overlapped primary segments according to the branch nodes, record
Simulation results and analysis
In simulations, the test networks are NSFNET and National networks as shown in Fig. 3, where NSFNET network has 14 nodes and 21 links, National network has 15 nodes and 27 links. The basic cost of each link is assumed to 350 and α = 1. We simulate an incremental traffic model. In this model, the matrix of multicast requests is not known ahead of time. Each new multicast request enters the network one by one. Once allocated, the multicast requests in the network cannot be reconfigured. We assume
Conclusion
In this paper, we have investigated the problem of failure tolerated multicast requests in survivable networks and proposed a new algorithm SPLB to protect the single-link failure. In order to improve the performances, in SPLB we have presented the segment protection algorithm to overcome the trap problem, used the ideas of cross-sharing and self-sharing to save the backup capacities, and proposed the load balancing method to reduce the blocking probability. Simulation results have shown that
Acknowledgement
The authors would like to thank reviewers for valuable comments.
Xingwei Wang received the BSc, MSc, and Ph.D degrees in computer science from Northeastern University, China, in 1989, 1992, and 1998, respectively. He is currently a Professor in the College of Information Science and Engineering, Northeastern University, China. His research interests are mainly on routing algorithms and protocols, QoS (Quality of Service) control schemes, fault-tolerance and survivability models, mobility management mechanisms and resource assignment methods in NGI (Next
References (8)
- et al.
Cross-sharing vs. self-sharing trees for protecting multicast sessions in mesh networks
Computer Networks
(2006) - et al.
A multicast routing protocol with multiple QoS constraints
Journal of Software
(2005) - et al.
Dynamic segment shared protection for multicast traffic in meshed wavelength-division-multiplexing optical networks
Journal of Optical Networking
(2006) - et al.
Data Structure (C Program)
(2004)
Cited by (4)
Multicast protection algorithms based on aggregated logical topology in survivable multi-domain optical networks
2012, OptikCitation Excerpt :Considering both the multicast protection and multi-domains situation, it is necessary to address the multicast protection in multi-domain optical networks. However, previous works addressed only the multicast protection in single-domain optical networks [10–12] or the unicast protection in multi-domain optical networks [6–9]; namely, few or no previous works well solved the multicast protection in multi-domain optical networks. Therefore, in this paper we study the protection problem for multicast multi-domain optical networks and propose two heuristic algorithms called Multicast Multi-domain Dedicated Protection (MMDP) and Multicast Multi-domain Shared Protection (MMSP) based on the developed multi-domain logical topology that includes the border nodes, inter-links and intra-logical links.
A low-cost dynamical segmented 1+N dedicated protection mechanism in WDM network
2011, Guangdianzi Jiguang/Journal of Optoelectronics LaserHeuristic protection algorithm in multicast multi-domain optical networks
2011, 2011 IEEE 3rd International Conference on Communication Software and Networks, ICCSN 2011A novel segment protection with segment route scheme in multicasting survivable networks
2009, Proceedings of SPIE - The International Society for Optical Engineering
Xingwei Wang received the BSc, MSc, and Ph.D degrees in computer science from Northeastern University, China, in 1989, 1992, and 1998, respectively. He is currently a Professor in the College of Information Science and Engineering, Northeastern University, China. His research interests are mainly on routing algorithms and protocols, QoS (Quality of Service) control schemes, fault-tolerance and survivability models, mobility management mechanisms and resource assignment methods in NGI (Next Generation Internet), IP over DWDM optical Internet and mobile Internet. He has published over 100 technical papers in the above areas. As one of the co-investigators, he has won the first-level science and technology advancement award of China ministry of education twice.
Lei Guo received the Ph.D. degree in communication and information systems from University of Electronic Science and Technology of China, Chengdu, China, in 2006. He is currently an Associate Professor in College of Information Science and Engineering, Northeastern University, Shenyang, China. His research interests include survivability, optical networking, and next generation Internet. He has published over 80 technical papers in the above areas. Dr. Guo is a member of IEEE and OSA. He was the recipient of the Best Paper Award from the International Conference on Communications, Circuits and Systems (ICCCAS’04). He is currently servicing as the Editorial Board Member of The Open Optics Journal.
Xuetao Wei received the B.S. degree from Hunan University, Changsha, China, in 2005, and received the M.S. degree from University of Electronic Science and Technology of China., Chengdu, China, in 2007. He is currently pursuing the Ph.D degree in the Department of Computer Science and Engineering, University of California, Riverside. His research interests include broadband networks and wireless networks.
Lan Pang received the B.S. degree in communication engineering from College of Information Science and Engineering, Northeastern University, Shenyang, China, in 2007. She is currently a postgraduate student at the same university. Her research interests include optical networking, survivability, and multicasting.
Tengfei Wu received the B.S. degree in communication engineering from College of Information Science and Engineering, Northeastern University, Shenyang, China, in 2006. He is currently a postgraduate student at the same university. His research interests include optical networking and survivability.
Juan Du received the B.S. degree in communication engineering from College of Information Science and Engineering, Northeastern University, Shenyang, China, in 2007. She is currently a postgraduate student at the same university. Her research interests include optical networking, routing and survivability.
Xuekui Wang is currently pursuing the B.S. degree in communication engineering from College of Information Science and Engineering, Northeastern University, Shenyang, China. His research interests include protection and restoration in optical networks.
- ☆
The preliminary work of this paper was presented at the International Conference on Advanced Communication Technology (ICACT) 2008. This work was supported in part by the National Natural Science Foundation of China (Nos. 60673159, 70671020), the National High-Tech Research and Development Plan of China (No. 2006AA01Z214), the Key Project of Chinese Ministry of Education (No. 108040), the Specialized Research Fund for the Doctoral Program of Higher Education (Nos. 20070145096, 20070145017, 20060145012), the Program for New Century Excellent Talents in University, and the Open Foundation of Key Laboratory of Broadband Optical Fiber Transmission and Communication Networks, Ministry of Education (UESTC), China.