Heuristic algorithms for configuration of the ATM-layer over optical networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

A general model and algorithms are presented for the optimal configuration of the ATM layer on top of mostly optical networks. The topology of the physical layer is assumed given with the predefined paths for each node-pair. The output is the size of required ATM switches, and the configuration of both, ATM and optical switches. The obtained result is optimal in sense of reduced resource usage on ATM level, i.e., reduced electrical processing, subject to capacity and connectivity constraints. The results are derived for WDM networks and generalized for networks with optical cables where multiple fibers per cable are used (Space Division Multiplexing). The idea of layered design is also introduced. Since the problem is discrete by nature with multiple local optima and constraints, non-deterministic constrained discrete global optimization algorithms are used. The running time and the probability of finding global optimum are compared for these algorithms.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
PublisherIEEE
Pages1164-1168
Number of pages5
Volume3
Publication statusPublished - 1997
EventProceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3) - Montreal, Can
Duration: Jun 8 1997Jun 12 1997

Other

OtherProceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3)
CityMontreal, Can
Period6/8/976/12/97

Fingerprint

Automatic teller machines
Heuristic algorithms
Fiber optic networks
Optical cables
Optical switches
Global optimization
Wavelength division multiplexing
Multiplexing
Cables
Switches
Topology
Fibers
Processing

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Cinkler, T. (1997). Heuristic algorithms for configuration of the ATM-layer over optical networks. In IEEE International Conference on Communications (Vol. 3, pp. 1164-1168). IEEE.

Heuristic algorithms for configuration of the ATM-layer over optical networks. / Cinkler, T.

IEEE International Conference on Communications. Vol. 3 IEEE, 1997. p. 1164-1168.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cinkler, T 1997, Heuristic algorithms for configuration of the ATM-layer over optical networks. in IEEE International Conference on Communications. vol. 3, IEEE, pp. 1164-1168, Proceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3), Montreal, Can, 6/8/97.
Cinkler T. Heuristic algorithms for configuration of the ATM-layer over optical networks. In IEEE International Conference on Communications. Vol. 3. IEEE. 1997. p. 1164-1168
Cinkler, T. / Heuristic algorithms for configuration of the ATM-layer over optical networks. IEEE International Conference on Communications. Vol. 3 IEEE, 1997. pp. 1164-1168
@inproceedings{3fc08b997e464ce087ea25545f6e000b,
title = "Heuristic algorithms for configuration of the ATM-layer over optical networks",
abstract = "A general model and algorithms are presented for the optimal configuration of the ATM layer on top of mostly optical networks. The topology of the physical layer is assumed given with the predefined paths for each node-pair. The output is the size of required ATM switches, and the configuration of both, ATM and optical switches. The obtained result is optimal in sense of reduced resource usage on ATM level, i.e., reduced electrical processing, subject to capacity and connectivity constraints. The results are derived for WDM networks and generalized for networks with optical cables where multiple fibers per cable are used (Space Division Multiplexing). The idea of layered design is also introduced. Since the problem is discrete by nature with multiple local optima and constraints, non-deterministic constrained discrete global optimization algorithms are used. The running time and the probability of finding global optimum are compared for these algorithms.",
author = "T. Cinkler",
year = "1997",
language = "English",
volume = "3",
pages = "1164--1168",
booktitle = "IEEE International Conference on Communications",
publisher = "IEEE",

}

TY - GEN

T1 - Heuristic algorithms for configuration of the ATM-layer over optical networks

AU - Cinkler, T.

PY - 1997

Y1 - 1997

N2 - A general model and algorithms are presented for the optimal configuration of the ATM layer on top of mostly optical networks. The topology of the physical layer is assumed given with the predefined paths for each node-pair. The output is the size of required ATM switches, and the configuration of both, ATM and optical switches. The obtained result is optimal in sense of reduced resource usage on ATM level, i.e., reduced electrical processing, subject to capacity and connectivity constraints. The results are derived for WDM networks and generalized for networks with optical cables where multiple fibers per cable are used (Space Division Multiplexing). The idea of layered design is also introduced. Since the problem is discrete by nature with multiple local optima and constraints, non-deterministic constrained discrete global optimization algorithms are used. The running time and the probability of finding global optimum are compared for these algorithms.

AB - A general model and algorithms are presented for the optimal configuration of the ATM layer on top of mostly optical networks. The topology of the physical layer is assumed given with the predefined paths for each node-pair. The output is the size of required ATM switches, and the configuration of both, ATM and optical switches. The obtained result is optimal in sense of reduced resource usage on ATM level, i.e., reduced electrical processing, subject to capacity and connectivity constraints. The results are derived for WDM networks and generalized for networks with optical cables where multiple fibers per cable are used (Space Division Multiplexing). The idea of layered design is also introduced. Since the problem is discrete by nature with multiple local optima and constraints, non-deterministic constrained discrete global optimization algorithms are used. The running time and the probability of finding global optimum are compared for these algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0030721192&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030721192&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0030721192

VL - 3

SP - 1164

EP - 1168

BT - IEEE International Conference on Communications

PB - IEEE

ER -