On delay versus congestion in designing rearrangeable multihop lightwave networks

Valter Boljuncic; Darko Skorin-Kapov; Jadranka Skorin-Kapov

doi:10.1109/ITI.2001.938033

On delay versus congestion in designing rearrangeable multihop lightwave networks

Valter Boljuncic
, Darko Skorin-Kapov
, Jadranka Skorin-Kapov

Dean's Office, College of Business

Stony Brook University

University of Rijeka
Stony Brook University
Adelphi University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We investigate design issues of optical networks in light of two conflicting criteria: throughput maximization (or equivalently, congestion minimization) versus delay minimization. We assume the network has an arbitrary topology, the flow can be split and sent via different routes, and it can be transferred via intermediate nodes. Tabu search heuristic is used to compare solutions with different weights assigned to each of the two criteria. The approach is tested on a benchmark data set, the 14-dimensional NSFNET T1 network with traffic from 1993. The results suggest that: (1) some connectivity matrices are quite robust and desirable regarding both criteria simultaneously; (2) forcing minimization of total delay unconditionally can result in significantly inferior throughput. Some decision strategies are outlined.

Original language	English
Title of host publication	ITI 2001 - Proceedings of the 23rd International Conference on Information Technology Interfaces
Publisher	University of Zagreb
Pages	297-303
Number of pages	7
ISBN (Print)	9539676932, 9789539676931
DOIs	https://doi.org/10.1109/ITI.2001.938033
State	Published - 2001
Event	23rd International Conference on Information Technology Interfaces, ITI 2001 - Pula, Croatia Duration: Jun 19 2001 → Jun 22 2001

Publication series

Name	Proceedings of the International Conference on Information Technology Interfaces, ITI

Conference

Conference	23rd International Conference on Information Technology Interfaces, ITI 2001
Country/Territory	Croatia
City	Pula
Period	06/19/01 → 06/22/01

Keywords

heuristic solvability
maximal throughput
minimal delay
multihop
rearrangeable optical networks
tabu search

Access to Document

10.1109/ITI.2001.938033

Cite this

Boljuncic, V., Skorin-Kapov, D., & Skorin-Kapov, J. (2001). On delay versus congestion in designing rearrangeable multihop lightwave networks. In ITI 2001 - Proceedings of the 23rd International Conference on Information Technology Interfaces (pp. 297-303). Article 938033 (Proceedings of the International Conference on Information Technology Interfaces, ITI). University of Zagreb. https://doi.org/10.1109/ITI.2001.938033

Boljuncic, Valter ; Skorin-Kapov, Darko ; Skorin-Kapov, Jadranka. / On delay versus congestion in designing rearrangeable multihop lightwave networks. ITI 2001 - Proceedings of the 23rd International Conference on Information Technology Interfaces. University of Zagreb, 2001. pp. 297-303 (Proceedings of the International Conference on Information Technology Interfaces, ITI).

@inproceedings{bae893670f78437db7200ba9329a60fc,

title = "On delay versus congestion in designing rearrangeable multihop lightwave networks",

abstract = "We investigate design issues of optical networks in light of two conflicting criteria: throughput maximization (or equivalently, congestion minimization) versus delay minimization. We assume the network has an arbitrary topology, the flow can be split and sent via different routes, and it can be transferred via intermediate nodes. Tabu search heuristic is used to compare solutions with different weights assigned to each of the two criteria. The approach is tested on a benchmark data set, the 14-dimensional NSFNET T1 network with traffic from 1993. The results suggest that: (1) some connectivity matrices are quite robust and desirable regarding both criteria simultaneously; (2) forcing minimization of total delay unconditionally can result in significantly inferior throughput. Some decision strategies are outlined.",

keywords = "heuristic solvability, maximal throughput, minimal delay, multihop, rearrangeable optical networks, tabu search",

author = "Valter Boljuncic and Darko Skorin-Kapov and Jadranka Skorin-Kapov",

year = "2001",

doi = "10.1109/ITI.2001.938033",

language = "English",

isbn = "9539676932",

series = "Proceedings of the International Conference on Information Technology Interfaces, ITI",

publisher = "University of Zagreb",

pages = "297--303",

booktitle = "ITI 2001 - Proceedings of the 23rd International Conference on Information Technology Interfaces",

note = "23rd International Conference on Information Technology Interfaces, ITI 2001 ; Conference date: 19-06-2001 Through 22-06-2001",

}

Boljuncic, V, Skorin-Kapov, D & Skorin-Kapov, J 2001, On delay versus congestion in designing rearrangeable multihop lightwave networks. in ITI 2001 - Proceedings of the 23rd International Conference on Information Technology Interfaces., 938033, Proceedings of the International Conference on Information Technology Interfaces, ITI, University of Zagreb, pp. 297-303, 23rd International Conference on Information Technology Interfaces, ITI 2001, Pula, Croatia, 06/19/01. https://doi.org/10.1109/ITI.2001.938033

On delay versus congestion in designing rearrangeable multihop lightwave networks. / Boljuncic, Valter; Skorin-Kapov, Darko; Skorin-Kapov, Jadranka.
ITI 2001 - Proceedings of the 23rd International Conference on Information Technology Interfaces. University of Zagreb, 2001. p. 297-303 938033 (Proceedings of the International Conference on Information Technology Interfaces, ITI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On delay versus congestion in designing rearrangeable multihop lightwave networks

AU - Boljuncic, Valter

AU - Skorin-Kapov, Darko

AU - Skorin-Kapov, Jadranka

PY - 2001

Y1 - 2001

N2 - We investigate design issues of optical networks in light of two conflicting criteria: throughput maximization (or equivalently, congestion minimization) versus delay minimization. We assume the network has an arbitrary topology, the flow can be split and sent via different routes, and it can be transferred via intermediate nodes. Tabu search heuristic is used to compare solutions with different weights assigned to each of the two criteria. The approach is tested on a benchmark data set, the 14-dimensional NSFNET T1 network with traffic from 1993. The results suggest that: (1) some connectivity matrices are quite robust and desirable regarding both criteria simultaneously; (2) forcing minimization of total delay unconditionally can result in significantly inferior throughput. Some decision strategies are outlined.

AB - We investigate design issues of optical networks in light of two conflicting criteria: throughput maximization (or equivalently, congestion minimization) versus delay minimization. We assume the network has an arbitrary topology, the flow can be split and sent via different routes, and it can be transferred via intermediate nodes. Tabu search heuristic is used to compare solutions with different weights assigned to each of the two criteria. The approach is tested on a benchmark data set, the 14-dimensional NSFNET T1 network with traffic from 1993. The results suggest that: (1) some connectivity matrices are quite robust and desirable regarding both criteria simultaneously; (2) forcing minimization of total delay unconditionally can result in significantly inferior throughput. Some decision strategies are outlined.

KW - heuristic solvability

KW - maximal throughput

KW - minimal delay

KW - multihop

KW - rearrangeable optical networks

KW - tabu search

UR - https://www.scopus.com/pages/publications/84898900495

U2 - 10.1109/ITI.2001.938033

DO - 10.1109/ITI.2001.938033

M3 - Conference contribution

SN - 9539676932

SN - 9789539676931

T3 - Proceedings of the International Conference on Information Technology Interfaces, ITI

SP - 297

EP - 303

BT - ITI 2001 - Proceedings of the 23rd International Conference on Information Technology Interfaces

PB - University of Zagreb

T2 - 23rd International Conference on Information Technology Interfaces, ITI 2001

Y2 - 19 June 2001 through 22 June 2001

ER -

Boljuncic V, Skorin-Kapov D, Skorin-Kapov J. On delay versus congestion in designing rearrangeable multihop lightwave networks. In ITI 2001 - Proceedings of the 23rd International Conference on Information Technology Interfaces. University of Zagreb. 2001. p. 297-303. 938033. (Proceedings of the International Conference on Information Technology Interfaces, ITI). doi: 10.1109/ITI.2001.938033

On delay versus congestion in designing rearrangeable multihop lightwave networks

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this