A Framework for Solving Logical Topology Design Problems Within Constrained Computation Time
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 499-501 |
Journal / Publication | IEEE Communications Letters |
Volume | 7 |
Issue number | 10 |
Publication status | Published - Oct 2003 |
Externally published | Yes |
Link(s)
Abstract
We present a framework for solving logical topology design (LTD) problems in a constrained amount of computation time. Our framework uses a search space dimensionality (SSD) reduction technique that exploits a tradeoff between computation time and solution quality. We have demonstrated that our framework offers improved solution quality in comparison to an existing SSD reduction technique reported in the literature.
Research Area(s)
- Logical topology design, Mixed integer linear programming, Optical networks, Routing
Citation Format(s)
A Framework for Solving Logical Topology Design Problems Within Constrained Computation Time. / Zalesky, Andrew; Vu, Hai Le; Zukerman, Moshe et al.
In: IEEE Communications Letters, Vol. 7, No. 10, 10.2003, p. 499-501.
In: IEEE Communications Letters, Vol. 7, No. 10, 10.2003, p. 499-501.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review