الفهرس 
Routing in Computer NetworksOnly 14 pages are availabe for public view
 |  | from | 109 |  |  |
| | | from | 109 | | |
Abstract
Due to rapid advances in the communication technologies and the increased demand for various kinds of communication services, many new applications in networks require the support of multicast communication. Finding a route from a source to a group of destinations is referred as multicast routing.
The objective of multicast routing is to find a tree that either has a minimum total cost, which called the Steiner tree or has a minimum cost for every path from source to each destination, which is called shortest path tree. With the rapid evolution of real time and multimedia applications like audio/video conferencing, interactive distributed games and real time remote control system, certain quality of services, QoS, need to be guaranteed in underlying network. Multicast routing algorithms should support the required QoS.
In this thesis we consider two important QoS parameters that need to be guaranteed in order to support the real time and multimedia applications. Firstly, we consider the delay parameter where the data sent from source need to reach destinations within a certain time limit. The problem is formulated as a delay constrained multicast Steiner tree problem. Secondly, in addition to the delay constraint, we add the delay variation constraint. The delay variation constraint is a bound on the delay difference between any two destinations. The problem is formulated as shortest path routing under delay and delay variation constraints
A genetic algorithm is a biologically inspired method for function optimization that is loosely based on the theory of evolution. It is typically used when there is little knowledge of the solution space or when the search space is prohibitively large. Recently, the genetic algorithms (GAs) are gaining an increasing interest for solving complex problems.