Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Multi-disciplinary Studies | en_US |
| dc.contributor | Department of Computing | en_US |
| dc.creator | Chan, Kam-wing | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/1482 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Performance optimization of WDM lightwave networks | en_US |
| dcterms.abstract | In this dissertation, we consider percentages of improvement of WDM multihop lightwave network for non-uniform traffic. Our goal is to maximize the throughput of a store-and-forward network with infinite buffer in the nodes. The objective is the same as minimizing the largest link flow of the network. To achieve the goal, our work includes two parts. In the first part, we consider optimal node assignment problem (ONAP) for regular topologies. By optimal assigning the network nodes to network locations, we expect to obtain the minimum value of the largest link flow of the network. We solve the problem by formulating it as a quadratic assignment problem (QAP). By applying simulated annealing algorithm, we obtain a significant reduction in the largest link flow of the network. We study the percentage of improvement of four different regular topologies for four non-uniform traffic patterns. The results show that percentage of improvement is largely dependent on the number of routing paths between nodes and also the matching between topological structure and traffic pattern. In the second part, we study the link assignment problem (OLAP) for arbitrary topology. Through the optimal node assignment problem in the first part, we have conjectured that network throughput can be increased if there is a matching between traffic pattern and topology. We study the conjecture by formulating an optimal link assignment problem (OLAP) which studies the percentage of improvement of the largest link flow of the network between a randomly chosen topology and an optimal topology. By optimal assigning the logical links between nodes, an optimal topology with a minimal largest link flow is found. We solve the problem by formulating it as a Quadratic Assignment Problem. By applying simulated annealing algorithm, we show that the problem is NP-Hard. The largest link flow of the network decreases as the network size increases. Results also show that the optimal link assignment approach can have a large reduction to the largest link flow for four non-uniform store-and-forward traffic patterns. | en_US |
| dcterms.extent | iii, 82 leaves : ill. ; 30 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 1999 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Optical communications | en_US |
| dcterms.LCSH | Laser communication systems | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b14792849.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 2.55 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/1482