 |
|
|||
| Authors: | Thomas Erlebach |
| Group: | Theory of Communication Networks |
| Type: | PhD Thesis |
| Title: | Scheduling Connections in Fast Networks |
| Year: | 1999 |
| Pub-Key: | E99 |
| Keywords: | call scheduling, path coloring, edge-disjoint paths |
| School: | Technische Universität München |
| Abstract: | In order to achieve an efficient utilization of modern communication networks (in particular, networks with bandwidth reservation and all-optical networks), NP-hard optimization problems regarding the allocation of resources to connection requests must be solved. These problems are modeled as path coloring problems and scheduling problems. The complexity of different variants of the problems is determined, and efficient approximation algorithms are presented. |
| Resources: | [BibTeX] |
