Main flow chart of NSGA algorithm 2.2.1.Fast non-dominant sorting For NSGA algorithm, the population size is n and there are m optimization objectives. In order to find all non dominated solutions, each optimization objective of each population needs to be compared with other populations, and the computational complexity is   mn 

Main flow chart of NSGA algorithm 2.2.1.Fast non-dominant sorting For NSGA algorithm, the population size is n and there are m optimization objectives. In order to find all non dominated solutions, each optimization objective of each population needs to be compared with other populations, and the computational complexity is   mn 

Source publication
Article
Full-text available
The network candidate routing data stream is restricted to reroute the data stream of same origin and same destination, which brings great limitation to the application of the algorithm. This paper proposes a multi-objective optimization oriented rerouting algorithm for congested data streams. The algorithm detects and aggregates data streams on co...

Similar publications

Preprint
Full-text available
Software-Defined Networking (SDN) has become one of the most promising paradigms to manage large scale networks. Distributing the SDN Control proved its performance in terms of resiliency and scalability. However, the choice of the number of controllers to use remains problematic. A large number of controllers may be oversized inducing an overhead...