File Name: routing and wavelength assignment in all optical networks .zip
Skip to Main Content. A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity. Use of this web site signifies your agreement to the terms and conditions. Routing and wavelength assignment in optical networks Abstract: The problem of routing and wavelength assignment RWA is critically important for increasing the efficiency of wavelength-routed all-optical networks. Given the physical network structure and the required connections, the RWA problem is to select a suitable path and wavelength among the many possible choices for each connection so that no two paths sharing a link are assigned the same wavelength. In work to date, this problem has been formulated as a difficult integer programming problem that does not lend itself to efficient solution or insightful analysis. In this work, we propose several novel optimization problem formulations that offer the promise of radical improvements over the existing methods.
Skip to search form Skip to main content You are currently offline. Some features of the site may not work correctly. DOI: Ramaswami and K. Ramaswami , K. Considers routing connections in a reconfigurable optical network using WDM.
The routing and wavelength assignment RWA problem in wave-length-division multiplexing optical networks is critically important for increasing the efficiency of wavelength-routed all-optical networks. Given the physical network structure and a set of connection requests, the problem aims to establishing routes for the requests and assigning a wavelength to each of them, subject to the wavelength continuous and wavelength clash constraints. The objective is to minimize he number of required wavelengths to satisfy all requests. In this paper, an algorithm based on the maximum edge-disjoint paths is proposed to tackle the RWA problem. Its performance is verified by experiments on some realistic network topologies.
The routing and wavelength assignment RWA problem, known to be an NP-complete problem, seeks to optimally establish routes and adequate wavelengths for the requested connections according to an objective function. This paper presents the use of a novel approach based on a differential evolution DE algorithm to the RWA problem in wavelength-routed dense division multiplexing DWDM optical networks. The proposed approach is evaluated for test bench optical networks with up to 40 nodes. The presented DE-RWA model is simple to implement and could also be extended by adding other features such as impairment-aware, energy efficient, survivability among others in optical networks. This is a preview of subscription content, access via your institution. Rent this article via DeepDyve.
In this paper, we study two different problems related to WDM networks: topology design (TD) problem where we search to minimize the number.
Фонтейн, видимо, размышлял. Сьюзан попробовала что-то сказать, но Джабба ее перебил: - Чего вы ждете, директор. Позвоните Танкадо. Скажите, что вы согласны на его условия. Нам нужен этот шифр-убийца, или все здесь провалится сквозь землю.
Но мысли Сьюзан были далеко от политических последствий создания Цифровой крепости. Она пыталась осознать истинный смысл случившегося. Всю свою жизнь она посвятила взламыванию шифров, отвергая саму возможность разработки абсолютно стойкого шифра. Любой шифр можно взломать - так гласит принцип Бергофского.
Слава Богу, разрешено хоть. Стратмор требовал запретить всяческий доступ, но Фонтейн настоял на. - В шифровалке нет камер слежения? - удивился Бринкерхофф.
Skip to search form Skip to main content You are currently offline.Reply
Pankaj jalote software project management in practice pearson 2002 pdf describe the structure and function of mitochondria pdfReply
Skip to Main Content.Reply
Samsung ml 2165w manual pdf pankaj jalote software project management in practice pearson 2002 pdfReply