Solving the multi-commodity flow problem using an evolutionary routing algorithm in a computer network environment
Description
The continued increase in Internet traffic requires that routing algorithms make the best use of all available network resources. Most of the current deployed networks are not doing so due to their use of single path routing algorithms. In this work we propose the use of a multipath capable routing algorithm using Evolutionary Algorithms (EAs) that takes into account all the traffic going over the network and the link capacities by leveraging the information available at the Software Defined Networks (SDN) controller. The use of such information ensures that no link is used beyond its capacity, eliminating network congestion. We use EAs as true multi-objective solvers to provide a set of valid routing solutions from a single run of the algorithm. Modifications to the Multipath TCP (MPTCP) protocol are proposed to overcome the multipath problems associated with TCP.
Notes
Files
DataSet.zip
Files
(2.2 GB)
Name | Size | Download all |
---|---|---|
md5:a9977a7de62528fdea9d1cab4dec7842
|
2.2 GB | Preview Download |