Multi-Path Traffic Engineering Distributed VPLS Routing Algorithm

2005 ◽  
Author(s):  
N. AbuAli ◽  
H.T. Mouftah ◽  
S. Gazor
Keyword(s):  
Traffic Engineering ◽  
Routing Algorithm

scholarly journals QoS Supported IPTV Service Architecture over Hybrid-Tree-Based Explicit Routed Multicast Network

2012 ◽  
Vol 2012 ◽  
pp. 1-11 ◽  
Author(s):  
Chih-Chao Wen ◽  
Cheng-Shong Wu
Keyword(s):  
Traffic Engineering ◽  
Routing Algorithm ◽  
Video Stream ◽  
Ip Multicast ◽  
Channel Switching ◽  
High Quality ◽  
Service Architecture ◽  
Signaling Mechanism ◽  
Iptv Service ◽  
Standard Quality

With the rapid advance in multimedia streaming and multicast transport technology, current IP multicast protocols, especially PIM-SM, become the major channel delivery mechanism for IPTV system over Internet. The goals for IPTV service are to provide two-way interactive services for viewers to select popular program channel with high quality for watching during fast channel surfing period. However, existing IP multicast protocol cannot meet above QoS requirements for IPTV applications between media server and subscribers. Therefore, we propose a cooperative scheme of hybrid-tree based on explicit routed multicast, called as HT-ERM to combine the advantages of shared tree and source tree for QoS-supported IPTV service. To increase network utilization, the constrained shortest path first (CSPF) routing algorithm is designed for construction of hybrid tree to deliver the high-quality video stream over watching channel and standard quality over surfing channel. Furthermore, the Resource Reservation Protocol- Traffic Engineering (RSVP-TE) is used as signaling mechanism to set up QoS path for multicast channel admission control. Our simulation results demonstrated that the proposed HT-ERM scheme outperforms other multicast QoS-based delivery scheme in terms of channel switching delay, resource utilization, and blocking ratio for IPTV service.

An Efficient K-Shortest Paths Based Routing Algorithm

2012 ◽  
Vol 532-533 ◽  
pp. 1775-1779
Author(s):  
Jian Lian ◽  
Yan Zhang ◽  
Cheng Jiang Li
Keyword(s):  
Computer Networks ◽  
Shortest Path ◽  
Traffic Engineering ◽  
Routing Algorithm ◽  
Shortest Paths ◽  
Routing Algorithms ◽  
Dijkstra Algorithm ◽  
Link State

We present an efficient K-shortest paths routing algorithm for computer networks. This Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF and IS-IS, which are only focusing on finding the shortest path route by adopting Dijkstra algorithm. Its desire effect to achieve is through the use of K-shortest paths algorighm, which has been implemented successfully in some fileds like traffic engineering. The correctness of this Algorithm is discussed at the same time as long as the comparison with OSPF.

Sign in / Sign up

Export Citation Format

Share Document