Optimal node placement in an optical packet switching Manhattan street network

O. Komolafe, D.A. Harle

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)251-260
Number of pages9
JournalComputer Networks
Issue number2
Publication statusPublished - 2003


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

Fingerprint Dive into the research topics of 'Optimal node placement in an optical packet switching Manhattan street network'. Together they form a unique fingerprint.

Cite this