DMCA
Maximization of Single Hop Traffic with Greedy Heuristics (2002)
Cached
Download Links
BibTeX
@MISC{Hyytiä02maximizationof,
author = {Esa Hyytiä},
title = {Maximization of Single Hop Traffic with Greedy Heuristics},
year = {2002}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Maximization of the single hop traffic has been proposed as an computationally feasible approximation to the logical topology design problem in wavelength routed networks. In this paper we consider a class of greedy heuristic algorithms for solving the maximization of the single hop traffic problem. The greedy heuristics configure a lightpath at a time onto the network. In this paper two new variations of the previously proposed heuristic algorithm are presented and evaluated. Especially, it is shown by numerical examples that by using an appropriately chosen order on how the lightpaths are configured onto the network it is possible to find reasonably good configurations which do not waste the network resources unnecessarily.
