Effectiveness of optimal node assignments in wavelength division multiplexing networks with fixed regular virtual topologies

Computer Networks

Volumn 38, Issue 1, 2002, Pages 61-74

  Siu, Fai ^a   Chang, Rocky K C ^a  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Combinatorial optimization; Optical networks; Optimal node assignment; Quadratic assignment problem; Simulated annealing; Wavelength division multiplexing

Indexed keywords

COMPUTER NETWORKS; OPTIMIZATION; PATTERN MATCHING; SIMULATED ANNEALING; TELECOMMUNICATION TRAFFIC; TOPOLOGY;

VIRTUAL TOPOLOGIES; WAVELENGTH DIVISION MULTIPLEXING NETWORKS;

WAVELENGTH DIVISION MULTIPLEXING;

EID: 0037107717     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1389-1286(01)00240-7     Document Type: Article

References (25)

1. WDM-based local lightwave networks. Part II: Multihop systems
2. Load balancing algorithms for WDM-based IP networks
3. Heuristic algorithms for constructing optimized structures for linear multihop lightwave networks
4. The photonic ring: Algorithm for optimized node arrangements
5. Algorithms for optimized node arrangements in Shufflenet based multihop lightwave networks
6. Active node placement in Shufflenets
7. Multihop lightwave networks based on de Bruijn graphs
8. Regular mesh topologies in local and metropolitan area networks
9. GEMNET: A generalized, shuffle-exchange-based, regular, scalable, modular, multihop, WDM lightwave network
10. Traffic optimization and reconfiguration management of multiwavelength multihop broadcast lightwave networks
11. Dynamic load balancing in WDM packet networks with and without wavelength constraints
12. Logically rearrangeable multihop lightwave networks
13. Quadratic assignment problems
14. Design of the wavelength-division optical network
15. Some principles for designing a wide-area WDM optical network
16. Rearrangeable multihop lightwave networks: Congestion minimization on regular topologies
17. Some recent advances in quadratic assignment problems
18. P-complete approximation problems
19. Optimization by simulated annealing: An experimental approach. Part I: Graph partitioning
20. The time complexity of maximum matching by simulated annealing
21. Solving quadratic assignment problems by simulated annealing
22. A note on asymptotic properties of the quadratic assignment problem
23. Asymptotic properties of the quadratic assignment problem