scholarly journals Alternate path routing algorithm for traffic engineering in the Internet

2004 ◽  
Author(s):  
S. Subramanian ◽  
V. Muthukumar
Keyword(s):  
Traffic Engineering ◽  
Routing Algorithm ◽  
The Internet

Topology Aggregating Routing Architecture (TARA)

2014 ◽  
pp. 98-125
Author(s):  
Heiner Hummel
Keyword(s):  
Traffic Engineering ◽  
The Internet ◽  
Dynamic Update

TARA (Topology Aggregating Routing Architecture) is a novel architecture which allows to generate a map of the Internet. TARA allows to maintain and compute a precise topology of the near surrounding and lesser zoomed topologies the more remote they are. In the context of TARA, nodes are identified with “locators” which are derived from longitude/latitude degrees/minutes/seconds. TARA is designed to satisfy advanced traffic engineering such as computing QoS-inferred paths or non congested paths. TARA achieves these goals without requiring an increase of RIBs and FIBs. TARA solves also the issues of dynamic update churn as currently experienced in BGP-based Internet. TARA is also designed with mobility requirements in mind. Indeed, Mobility is supported without requiring dependency on home agents or care-of-address servers. Note, the Time-To-Live mechanism is neither needed nor used in TARA-forwarding. TARA supports various multicast, broadcast, MP2P (multipoint-to-point), anycast and MP2MP (multipoint-to-multipoint) communication schemes. In particular a stateless concept for multicast is outlined; this concept may serve as a pattern for anycast and MP2MP applications. TARA is fully prepared to cope with the IPv4-unicast address depletion issue.

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.

A MULTIPLE-OBJECTIVES EVOLUTIONARY PERSPECTIVE TO INTERDOMAIN TRAFFIC ENGINEERING

2005 ◽  
Vol 05 (02) ◽  
pp. 215-230 ◽  
Author(s):  
STEVE UHLIG
Keyword(s):  
Traffic Engineering ◽  
Practical Problem ◽  
Multiple Objectives ◽  
The Internet ◽  
Real Problem ◽  
Evolutionary Perspective ◽  
The Real ◽  
Evolutionary Optimisation ◽  
Bgp Routing

We present an application of multiple-objectives evolutionary optimisation to the problem of engineering the distribution of the interdomain traffic in the internet. We show that this practical problem requires such a heuristic due to the potentially conflicting nature of traffic-engineering objectives. Furthermore, having to work on the parameter's space (BGP routing) of the real problem makes such techniques as evolutionary optimisation very easy to use. We show the successful application of our algorithm to two practically relevant problems in interdomain traffic engineering.

Sign in / Sign up

Export Citation Format

Share Document