|
|||||
|
|
| A TABU SEARCH APPROACH TOWARDS CONGESTION AND TOTAL FLOW MINIMIZATION IN OPTICAL NETWORKS | |
| 作者姓名： | Valter BOLJUNCIC Darko SKORIN-KAPOV Jadranka SKORIN-KAPOV |
| 作者单位： | Faculty of Economics and Tourism“Dr.Mijo Mirkovic”Pula University of Rijeka，Preradoviceva 1/1，52100 Pula，Croatia School of Business Adelphi University，Garden City，NY，11530，USA W.A.Harriman School for Management and Policy State University of New York at Stony Brook，Stony Brook，NY 11794-3775，USA，Faculty of Economics and Tourism“Dr.Mijo Mirkovic”Pula University of Rijeka，Preradoviceva 1/1，52100 Pula，Croatia School of Business Adelphi University，Garden City，NY，11530，USA W.A.Harriman School for Management and Policy State University of New York at Stony Brook，Stony Brook，NY 11794-3775，USA，Faculty of Economics and Tourism“Dr.Mijo Mirkovic”Pula University of Rijeka，Preradoviceva 1/1，52100 Pula，Croatia School of Business Adelphi University，Garden City，NY，11530，USA W.A.Harriman School for Management and Policy State University of New York at Stony Brook，Stony Brook，NY 11794-3775，USA |
| 基金项目： | This work was supported partly by the National Science Foundation Grant ANI 9814014，the project 036033-Architectural Elements for Regional Information Infrastructure, funded jointly by the Ministry of Science, Education and Sports of the Republic of Cr |
| 摘 要： | This paper considers rearrangeable multihop lightwave networks whereby each network node is equipped with a number p of transmitters and receivers, and a spectrum of wavelengths is accessible by, and shared among, all nodes by using the Wavelength Division Multiplexing (WDM). Depending on input traffic flow, nodal transmitters and receivers can be re-tuned to create virtual connectivity best suited with respect to a given optimization criterion. We present an efficient heuristic algorithm that combines two criteria for optimization: throughput maximization, as well as total flow minimization. Throughput maximization criterion is equivalent to congestion minimization, while minimizing total flow under the assumption of having links with equal lengths implies minimization of the average number of hops. Taking into account lengths of the links (i.e. link costs proportional with distances), the total flow minimization becomes equivalent to the total delay minimization. Tabu search is implemented as a two-ph |
| 关 键 词： | 波长分度多路复用技术 重排光网络 最小全流 拥塞 启发式可解性 禁忌搜索 多次反射 最大吞吐量 |
A tabu search approach towards congestion and total flow minimization in optical networks |
|
| Valter BOLJUNCIC,Darko SKORIN-KAPOV,Jadranka SKORIN-KAPOV.A TABU SEARCH APPROACH TOWARDS CONGESTION AND TOTAL FLOW MINIMIZATION IN OPTICAL NETWORKS[J].Journal of Systems Science and Systems Engineering,2004,13(2):180-201. | |
| Authors: | Valter Boljun?i? Darko Skorin-Kapov Jadranka Skorin-Kapov |
| Institution: | 1. Faculty of Economics and Tourism "Dr. Mijo Mirkovi(c)" Pula University of Rijeka, Preradovi(c)eva 1/1, 52100 Pula, Croatia School of Business 2. Adelphi University, Garden City, NY, 11530, USA 3. W.A.Harriman School for Management and Policy State University of New York at Stony Brook, Stony Brook, NY 11794-3775, USA |
| Abstract: | This paper considers rearrangeable multihop lightwave networks whereby each network node is equipped with a number p of transmitters and receivers, and a spectrum of wavelengths is accessible by, and shared among, all nodes by using the Wavelength Division Multiplexing (WDM). Depending on input traffic flow, nodal transmitters and receivers can be re-tuned to create virtual connectivity best suited with respect to a given optimization criterion. We present an efficient heuristic algorithm that combines two criteria for optimization: throughput maximization, as well as total flow minimization. Throughput maximization criterion is equivalent to congestion minimization, while minimizing total flow under the assumption of having links with equal lengths implies minimization of the average number of hops. Taking into account lengths of the links (i.e. link costs proportional with distances), the total flow minimization becomes equivalent to the total delay minimization. Tabu search is implemented as a two-phase strategy dealing with diversification as well as intensification of search. Computational experiments include consecutive runs with different sets of weights associated with the two criteria. Results for a benchmark set of problems are presented. |
| Keywords: | Heuristic solvability tabu search multihop rearrangeable optical networks minimal total flow maximal throughput |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ | |