Networking

Strength Pareto Evolutionary Algorithm Based Multi-Objective Optimization for Shortest Path Routing Problem in Computer Networks

Free registration required

Executive Summary

A computer network is an interconnected group of computers with the ability to exchange data. Today, computer networks are the core of modern communication. Routing problem is one of the important research issues in communication networks. An ideal routing algorithm should strive to find an optimal path for packet transmission within a specified time so as to satisfy the Quality of Service (QoS). The objective functions related to cost, time, reliability and risk are appropriated for selecting the most satisfactory route in many communication network optimization problems. Traditionally, the routing problem has been a single-objective problem of minimization of either cost or delay.

  • Format: PDF
  • Size: 197.55 KB