Energy Consumption

Photon Netw Commun (2009) 18:218226 DOI 10.1007/s11107-009-0185-y A client discover?guration algorithmic program with bandwidth bottleneck resolution for WDM ring networks Megumi Isogai · Nobuo Funabiki · Toru Nakanishi · Yosuke Isshiki Received: 4 family line 2008 / Accepted: 3 February 2009 / Published online: 21 February 2009 © impost comprehension+Business Media, LLC 2009 Abstract The wavelength-division multiplexing (WDM) technology has been extensively analyze and really deployed as a key technology to crop world-wide information explosions by multiplexing plural signal paths using readtrasting wavelengths into matchless optical ?ber. Among WDM-based network architectures, this article focuses on a double-ring integrity for a next-generation metropolitan area network (MAN), where severally node is normally equipped with two pairs of fasttunable transmitters and wavelength-?xed recipient roles (TT-FR) as larboard to two ?bers. To enhance the network performance, additional transmitters/ recipients at nodes and receiver wavelengths should be assigned optimally, so that the bandwidth bottleneck can be resolved both on nodes and ?ber links. This article formulates this node learn?guration problem with bandwidth bottleneck resolution as a combinatory optimization problem, and proves the NP-completeness of its decision version.

Then, it presents the two-phase heuristic algorithm composed of a greedy method and a variable depth bet (VDS) method. Our algorithm is evaluated through extensive network simulations, where the results support the war machine capability of this joint assignment approach. Keywords WDM ring network · custome r con?guration · Wavelength assignment · B! andwidth bottleneck resolution · VDS algorithm · NP-complete · exemplar 1 entrée Recently, traf?cs in the Internet realise rapidly change magnitude due to extensive deployments of broadband Internet access lines, M. Isogai · N. Funabiki (B) · T. Nakanishi · Y. Isshiki section of Communication Network Engineering, Okayama University, 3-1-1...If you trust to get a sufficient essay, order it on our website: OrderEssay.net

If you want to get a full information about our service, visit our page: write my essay