Optimal node placement in an optical packet switching Manhattan street network

O. Komolafe, D.A. Harle

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The judicious allocation of traffic matrix sources/destinations to nodes of an exemplar optical packet switching architecture, the Manhattan street network, is studied in this paper. The node placement optimisation (NPO) problem is intractable, hence simulated annealing is used to find (near) optimal solutions expeditiously. A number of non-uniform traffic patterns are considered, facilitating the study of the innate parameters of a traffic matrix that affect the optimisation results. A salient finding is that, regardless of the underlying traffic pattern, the efficacy of NPO is correlated to the coefficient of variation of the traffic matrix.
LanguageEnglish
Pages251-260
Number of pages9
JournalComputer Networks
Volume42
Issue number2
DOIs
Publication statusPublished - 2003

Fingerprint

Packet switching
Simulated annealing

Keywords

  • Manhattan street network
  • optical packet switching
  • combinatorial optimisation
  • multi-processor interconnection architectures

Cite this

@article{8d5a812c8dd94e959154f5d55cb8732c,
title = "Optimal node placement in an optical packet switching Manhattan street network",
abstract = "The judicious allocation of traffic matrix sources/destinations to nodes of an exemplar optical packet switching architecture, the Manhattan street network, is studied in this paper. The node placement optimisation (NPO) problem is intractable, hence simulated annealing is used to find (near) optimal solutions expeditiously. A number of non-uniform traffic patterns are considered, facilitating the study of the innate parameters of a traffic matrix that affect the optimisation results. A salient finding is that, regardless of the underlying traffic pattern, the efficacy of NPO is correlated to the coefficient of variation of the traffic matrix.",
keywords = "Manhattan street network, optical packet switching, combinatorial optimisation, multi-processor interconnection architectures",
author = "O. Komolafe and D.A. Harle",
year = "2003",
doi = "10.1016/S1389-1286(03)00192-0",
language = "English",
volume = "42",
pages = "251--260",
journal = "Computer Networks",
issn = "1389-1286",
number = "2",

}

Optimal node placement in an optical packet switching Manhattan street network. / Komolafe, O.; Harle, D.A.

In: Computer Networks, Vol. 42, No. 2, 2003, p. 251-260.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Optimal node placement in an optical packet switching Manhattan street network

AU - Komolafe, O.

AU - Harle, D.A.

PY - 2003

Y1 - 2003

N2 - The judicious allocation of traffic matrix sources/destinations to nodes of an exemplar optical packet switching architecture, the Manhattan street network, is studied in this paper. The node placement optimisation (NPO) problem is intractable, hence simulated annealing is used to find (near) optimal solutions expeditiously. A number of non-uniform traffic patterns are considered, facilitating the study of the innate parameters of a traffic matrix that affect the optimisation results. A salient finding is that, regardless of the underlying traffic pattern, the efficacy of NPO is correlated to the coefficient of variation of the traffic matrix.

AB - The judicious allocation of traffic matrix sources/destinations to nodes of an exemplar optical packet switching architecture, the Manhattan street network, is studied in this paper. The node placement optimisation (NPO) problem is intractable, hence simulated annealing is used to find (near) optimal solutions expeditiously. A number of non-uniform traffic patterns are considered, facilitating the study of the innate parameters of a traffic matrix that affect the optimisation results. A salient finding is that, regardless of the underlying traffic pattern, the efficacy of NPO is correlated to the coefficient of variation of the traffic matrix.

KW - Manhattan street network

KW - optical packet switching

KW - combinatorial optimisation

KW - multi-processor interconnection architectures

UR - http://dx.doi.org/10.1016/S1389-1286(03)00192-0

U2 - 10.1016/S1389-1286(03)00192-0

DO - 10.1016/S1389-1286(03)00192-0

M3 - Article

VL - 42

SP - 251

EP - 260

JO - Computer Networks

T2 - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 2

ER -