Optimal node placement in an optical packet switching Manhattan street network

Komolafe, O. and Harle, D.A. (2003) Optimal node placement in an optical packet switching Manhattan street network. Computer Networks, 42 (2). pp. 251-260. ISSN 1389-1286 (http://dx.doi.org/10.1016/S1389-1286(03)00192-0)

Full text not available in this repository.Request a copy

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.

ORCID iDs

Komolafe, O. and Harle, D.A. ORCID logoORCID: https://orcid.org/0000-0002-0534-1096;
CORE (COnnecting REpositories)