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.

Heterogeneous Meshed Wireless Back-Haul Network Integrating Unidirectional Technologies

2011 ◽  
pp. 139-160 ◽  
Author(s):  
Mathias Kretschmer ◽  
Christian Niephaus ◽  
George Ghinea
Keyword(s):  
Traffic Engineering ◽  
Mesh Networks ◽  
Mobile Adhoc Network ◽  
Wireless Mesh ◽  
Novel Approach ◽  
Triple Play ◽  
High Bandwidth ◽  
Single Radio ◽  
Increasing Demand ◽  
Technology Level

Wireless Mesh Networks (WMNs) have matured in recent years and the visibility of WMN deployments has attracted commercial operators to investigate this technology for applicability in their networks. Having their roots in the Mobile Adhoc Network (MANET) world and rather cheap off-the-shelf single-radio WLAN routers, WMN routing protocols were not designed for applicability in carrier-grade back-haul networks. For example, protocols such as OLSR or B.A.T.M.A.N. can not address the QoS-requirements of a modern operator back-haul network with its increasing demand for triple-play content. Although numerous solutions have been proposed to introduce QoS-awareness at the protocol or the technology level, traditional WMNs fail to meet commercial operator requirements in terms of reliability, traffic engineering and QoS guarantees. This chapter proposes a novel approach combining an IEEE 802.21-based control plane and an MPLS-based data plane. To provide support for ubiquitous high-bandwidth multi-media services, it seamlessly integrates unidirectional broadcast technologies such as DVB into the heterogeneous multi-radio WiBACK architecture.

The Joint Optimization of Online Traffic Matrix Measurement and Traffic Engineering For Software-Defined Networks

2020 ◽  
Vol 28 (1) ◽  
pp. 234-247
Author(s):  
Xiong Wang ◽  
Qi Deng ◽  
Jing Ren ◽  
Mehdi Malboubi ◽  
Sheng Wang ◽  
...  
Keyword(s):  
Traffic Engineering ◽  
Joint Optimization ◽  
Software Defined Networks ◽  
Traffic Matrix ◽  
Online Traffic

scholarly journals Efficient Traffic Engineering in an NFV Enabled IoT System

Sensors ◽  
2020 ◽  
Vol 20 (11) ◽  
pp. 3198 ◽  
Author(s):  
Thi-Thuy-Lien Nguyen ◽  
Tuan-Minh Pham
Keyword(s):  
Traffic Engineering ◽  
Performance Metrics ◽  
Heuristic Algorithms ◽  
Programming Model ◽  
Smart Cities ◽  
Network Function Virtualization ◽  
Smart Manufacturing ◽  
Weight System ◽  
Link Weight ◽  
Multiple Paths

The Internet of Things (IoT) is increasingly creating new market possibilities in several industries’ sectors such as smart homes, smart manufacturing, and smart cities, to link the digital and physical worlds. A key challenge in an IoT system is to ensure network performance and cost-efficiency when a plethora of data is generated and proliferated. The adoption of Network Function Virtualization (NFV) technologies within an IoT environment enables a new approach of providing services in a more agile and cost-efficient way. We address the problem of traffic engineering with multiple paths for an NFV enabled IoT system (vIoT), taking into account the fluctuation of traffic volume in various time periods. We first formulate the problem as a mixed linear integer programming model for finding the optimal solution of link-weight configuration and traffic engineering. We then develop heuristic algorithms for a vIoT system with a large number of devices. Our solution enables a controller to adjust a link weight system and update a flow table at an NFV switch for directing IoT traffic through a service function chain in a vIoT system. The evaluation results under both synthetic and real-world datasets of network traffic and topologies show that our approach to traffic engineering with multiple paths remarkably improves several performance metrics for a vIoT system.

Software-Defined Networking’s Traffic Engineering Benefits the Improvement of Network Performance

2020 ◽  
Vol 17 (1) ◽  
pp. 27-31
Author(s):  
B. Naveen Chandar ◽  
N. Arivazhagan ◽  
K. Venkatesh
Keyword(s):  
Quality Of Service ◽  
Traffic Engineering ◽  
Traffic Management ◽  
Network Performance ◽  
Packet Delay ◽  
Software Defined Networking ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Network Resource

Quality of Service is considered as one of the important specifications in Software Defined Networking and we are focusing on Traffic Engineering which is capable of managing traffic characteristics like bandwidth for improving network performance. In this paper, performance evaluation of Quality of Service parameters such as Packet Delivery Ratio, Packet Delay and Packet Loss are performed with Network simulator 2 for all types of Software Defined Networking topologies. To do such evaluation on these parameters we use Traffic Engineering, which helps on improving the network performance, design mechanisms for routing to manage the traffic in network by improving the network resource usages and other major Quality of Service requisites. So in this proposed methodology, we use point-to-point topology related to traffic calculation which includes network parameters like general calculation of a framework, analyzing the traffic and future indication. Also the work process relevant to traffic management includes bandwidth of the traffic, scheduling of Quality of Service-assurance, saving power and management of traffic in Software Defined Networking. Existing technologies used for the above parameters are discussed below and our insights for future development on traffic engineering between the nodes in Software Defined Networking are offered.

Sign in / Sign up

Export Citation Format

Share Document