An adaptive multi-path computation framework for centrally controlled networks

The Adaptive Dynamic Multi-Path Computation Framework (ADMPCF) is to provide an integrated resource control and management platform with an adequate set of management applications for better routing and resource allocation in centrally controlled or loosely coupled distributed software defined netwo...

Full description

Saved in:
Bibliographic Details
Published in:Computer networks (Amsterdam, Netherlands : 1999) Vol. 83; pp. 30 - 44
Main Authors: Luo, Min, Zeng, Yulong, Li, Jianfei, Chou, Wu
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 04.06.2015
Elsevier Sequoia S.A
Subjects:
Adequacy
Algorithms
Automatic load balancing
Computation
Computer networks
Data collection
Dynamical systems
Fail-over
Fragments
Frame analysis
Infrastructure
Intelligence
Multi-path
Network topologies
Networking
Networks
Openflow
Optimization
Optimization algorithms
Path DB
Reaction time
Resource allocation
Resource management
Route optimization
Routing
Routing (telecommunications)
Software defined networking (SDN)
Studies
Traffic flow
Path DB
Multi-path
Fail-over
Openflow
Resource allocation
Software defined networking (SDN)
Automatic load balancing
Routing
ISSN:1389-1286, 1872-7069
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Adaptive Dynamic Multi-Path Computation Framework (ADMPCF) is to provide an integrated resource control and management platform with an adequate set of management applications for better routing and resource allocation in centrally controlled or loosely coupled distributed software defined networking (SDN), especially for large network systems. As an open and extensible solution framework, it can provide the necessary infrastructure and integrates data collection and analytics, network performance evaluation, and various optimization algorithms. ADMPCF utilizes a set of complementary algorithms that work together in an adaptive and intelligent fashion that enable global routing and resource allocation optimization. It can also be easily extended to incorporate new algorithms through some open APIs. Such an approach would be able to efficiently and effectively adapt to the rapid changes in network topology, states, and most importantly application traffic, while it is often infeasible for a single optimization algorithm to get satisfactory solution for multiple nonlinear optimization objectives and constraints for a large and centrally controlled network. As it would be costly for centrally controlled global optimization algorithms to calculate good routes dynamically with adequate response time, the proposed ADMPCF framework takes advantage of many hidden patterns of the network information fragments in the combinations of network topology, states, and traffic flows. Therefore, it can lead to a much improved data structure for fast search and match that avoids the expensive re-optimization whenever possible.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2015.02.004