Cooling schedules for optimal annealing
Mathematics of Operations Research
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Lightwave networks based on de Bruijn graphs
IEEE/ACM Transactions on Networking (TON)
Node placement optimization in ShuffleNets
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking - 01/14/2002
ONDM '01 Proceedings of the IFIP TC6 Fifth Working Conference on Optical Network Design and Modeling: Towards an Optical Internet: New Visions in Optical Network Design and Modelling
Research: Kautz graphs as attractive logical topologies in multihop lightwave networks
Computer Communications
An holistic framework for regular virtual topology design
IEEE/ACM Transactions on Networking (TON)
MC-ANT: a multi-colony ant algorithm
EA'09 Proceedings of the 9th international conference on Artificial evolution
Hi-index | 0.00 |
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.