A coarse-grained differentiated routing algorithm in multi-protocol label switching traffic engineering

A new coarse-grained differentiated least interference routing algorithm(CDLI) with DiffServ-Aware was presented.This algorithm is composed of off-line and on-line stages,taking into account both real-time traffic and best-effort traffic.Off-line stage is to determine the shortest path set disjointed path(DP) database for real-time traffic,and to identify link critical value by traffic profile information of real-time traffic and DP database.On-line stage is at first to select route in the DP database for real-time traffic,if there is no path to meet the needs,the dynamic routing will be operated.On-line routing algorithm chooses the relatively short path for real-time traffic to meet their bandwidth requirements,and for best-effort traffic it chooses a lighter load path.The simulation results show that compared with the dynamic online routing algorithm(DORA) and constrained shortest path first(CSPF) algorithm,the new algorithm can significantly improve network throughput and reduce the average path length of real-time traffic.This guarantees quality of service(QoS) of real-time traffic while improving the utilization of network resources.

SUPPORTING MPLS VPN MULTICAST

MPLS(Multi-Protocol Label Switching) VPN(Virtual Private Network) traffic has been deployed widely, but currently only supports unicast. This paper briefly introduces several available MPLS VPN multicast approaches, and then analyzes their disadvantages. A novel mechanism that uses two-layer label stack to support MPLS VPN explicit multicast is proposed and the process is discussed in detail. The scalability and performance of the proposed mechanism are studied analytically. The result shows that our solution has great advantage over the currently available scheme in terms of saving core network bandwidth and improving the scalability.

Mobile Backhaul Solutions

In this paper, we give an overview of mobile backhaul solutions and propose an MPLS-centered solution that takes intoaccount timing synchronization, OAM, and protection： We also propose an evolved protection bandwidth allocation mechanism that makes the transport network as efficient as possible.

A subtree-based approach to failure detection and protection for multicast in SDN

Software-defined networking(SDN) has received tremendous attention from both industry and academia.The centralized control plane in SDN has a global view of the network and can be used to provide more effective solutions for complex problems,such as traffic engineering.This study is motivated by recent advancement in SDN and increasing popularity of multicasting applications.We propose a technique to increase the resiliency of multicasting in SDN based on the subtree protection mechanism.Multicasting is a group communication technology,which uses the network infrastructure efficiently by sending the data only once from one or multiple sources to a group of receivers that share a common path.Multicasting applications,e.g.,live video streaming and video conferencing,become popular,but they are delay-sensitive applications.Failures in an ongoing multicast session can cause packet losses and delay,which can significantly affect quality of service(Qo S).In this study,we adapt a subtree-based technique to protect a multicast tree constructed for Open Flow switches in SDN.The proposed algorithm can detect link or node failures from a multicast tree and then determines which part of the multicast tree requires changes in the flow table to recover from the failure.With a centralized controller in SDN,the backup paths can be created much more effectively in comparison to the signaling approach used in traditional multiprotocol label switching(MPLS) networks for backup paths,which makes the subtree-based protection mechanism feasible.We also implement a prototype of the algorithm in the POX controller and measure its performance by emulating failures in different tree topologies in Mininet.