Traffic engineering for virtual private networks and random traffic demands in WDM optical core networks

2006 ◽  
Author(s):  
E.A. Doumith ◽  
M. Gagnaire ◽  
O. Audouin ◽  
N. Puech
Keyword(s):  
Traffic Engineering ◽  
Virtual Private Networks ◽  
Core Networks

Multiple Optimization of Network Carrier and Traffic Flow Goals Using a Heuristic Routing Decision System

2010 ◽  
pp. 113-137
Author(s):  
Wayne S. Goodridge ◽  
Shyamala C Sivakumar ◽  
William Robertson ◽  
William J. Phillips
Keyword(s):  
Traffic Engineering ◽  
Decision System ◽  
Network Resource ◽  
Core Networks ◽  
Novel Approach ◽  
Multiple Constraint ◽  
Preference Functions ◽  
Multiple Paths ◽  
Online Traffic ◽  
Network Carrier

This chapter presents a multiple constraint optimization algorithm called routing decision system (RDS) that uses the concept of preference functions to address the problem of selecting paths in core networks that satisfy traffic-oriented QoS requirements while simultaneously satisfying network resource-oriented performance goals. The original contribution lies in the use of strong scales employed for constructing a multiple criteria preference function in an affine space. The use of preference functions makes it possible for paths that match both traffic-oriented and resource-oriented goals to be selected by the algorithm. The RDS algorithm is used in conjunction with a heuristic path finding algorithm called Constraint Path Heuristic (CP-H) algorithm which is a novel approach to finding a set of constraint paths between source and destination nodes in a network. The CP-H algorithm finds multiple paths for each metric and then passes all the paths to the RDS algorithm. Simulation results showed that the CP-H/RDS algorithm has a success rate of between 93 and 96% when used in Waxman graph topologies, and is shown to be significantly better than other heuristic based algorithms under strict constraints. In addition, it is shown that the associated execution time of the CP-H/RDS algorithm is slightly higher than other heuristic based algorithms but good enough for use in an online traffic engineering (TE) application. Simulations to assess the performance of CP-H/RDS algorithm in a TE environment show that the algorithms has lower call block rates than other TE algorithms. It is also shown that the CP-H/RDS has a 96% probability of providing at least two distinct feasible backup paths in addition to the main QoS path. A framework for implementing the CP-H/RDS as a routing server is proposed. The routing decision system server (RDSS) framework is novel in that the complexity introduced by QoS awareness remains outside the network.

scholarly journals Class-Based Constraint-Based Routing with Implemented Fuzzy Logic in MPLS-TE Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Michal Pištek ◽  
Martin Medvecký
Keyword(s):  
Fuzzy Logic ◽  
Traffic Engineering ◽  
Service Providers ◽  
Shortest Paths ◽  
Multimedia Networks ◽  
Multiprotocol Label Switching ◽  
Core Networks ◽  
Lower Priority ◽  
Qos Parameters ◽  
Explicit Routing

The paper deals with constraint-based routing (CBR) in MPLS-TE networks and proposes a new CBR algorithm based on fuzzy logic called Fuzzy Class-Based Algorithm (FCBA). Multiprotocol label switching with traffic engineering (MPLS-TE) networks represent a popular mechanism to effectively use resources of service providers’ core networks. The paths can be either built by administrators (explicit routing) or built by using existing routing algorithms which mostly decide based on the shortest paths towards the destination which might not be sufficient in nowadays’ multimedia networks. To address this problem various CBR algorithms have emerged which take into consideration various aspects important to existing traffic like QoS parameters or administrative policies. FCBA makes routing decisions based on traffic classes and by using fuzzy logic we can assign normalized values to various constraints based on the traffic class’ preferences (e.g., low delay paths for voice traffic) and network administrator’s preferences (e.g., avoiding congested links). The paper provides comparison of FCBA with existing CBR approaches based on their ability to provide QoS parameters loss. The simulations show that FCBA provides the best results for the highest priority traffic where it uses lower priority traffic to efficiently utilize the network.

Operator-Friendly Traffic Engineering in IP/MPLS Core Networks

2014 ◽  
Vol 11 (3) ◽  
pp. 333-349 ◽  
Author(s):  
Vassilis Foteinos ◽  
Kostas Tsagkaris ◽  
Pierre Peloso ◽  
Laurent Ciavaglia ◽  
Panagiotis Demestichas
Keyword(s):  
Traffic Engineering ◽  
Core Networks

Problems in Telephone Traffic Enǵineerinǵ—I

1911 ◽  
Vol 72 (1864supp) ◽  
pp. 198-199
Author(s):  
F. P. Valentine
Keyword(s):  
Traffic Engineering ◽  
Telephone Traffic

Problems in Telephone Traffic Enǵineerinǵ.—II

1911 ◽  
Vol 72 (1865supp) ◽  
pp. 222-224
Author(s):  
F. P. Valentine
Keyword(s):  
Traffic Engineering ◽  
Telephone Traffic

Autonomous Traffic Engineering for Boosting Application Fidelity in Wireless Sensor Networks

2010 ◽  
Vol E93-B (11) ◽  
pp. 2990-3003 ◽  
Author(s):  
Md. Abdur RAZZAQUE ◽  
Choong Seon HONG ◽  
Sungwon LEE
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Traffic Engineering ◽  
Wireless Sensor
Sign in / Sign up

Export Citation Format

Share Document