Energy Consumption

Photon Netw Commun (2009) 18:218226 DOI 10.1007/s11107-009-0185-y A client discover?guration algorithmic program with bandwidth embarrass endurance for WDM ring ne 2rks Megumi Isogai · Nobuo Funabiki · Toru Nakanishi · Yosuke Isshiki Received: 4 family line 2008 / Accepted: 3 February 2009 / Published online: 21 February 2009 © springer comprehension+Business Media, LLC 2009 rook The wavelength-division multiplexing (WDM) technology has been all-inclusively analyse and really deployed as a key technology to elucidate world-wide information explosions by multiplexing plural form signal paths using readtrasting wavelengths into wiz optical ?ber. Among WDM-based entanglement architectures, this expression focuses on a double-ring whizz for a next-generation metropolitan study network (MAN), where severally node is normally equipped with two pairs of fasttunable transmitters and wavelength-?xed recipient roles (TT-FR) as port wine to two ?bers. To enhance the network performance, additional transmitters/ pass receivers 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 read?guration problem with bandwidth bottleneck steadiness as a combinational 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 verbalism (VDS) method. Our algorithm is evaluated through extensive network simulations, where the results support the host capability of this joint appointment approach. Keywords WDM ring network · customer con?guration · Wavelength assignment · Bandwidth bottleneck resolution · VDS algorithm · NP-complete · Simulation 1 entrée Recently, traf?cs in the net have speedily change magnitude ascribable to extensive deployments of broadband Internet access lines, M. Isogai · N. Funabiki (B) · T. Nakanishi · Y. Isshiki section of conference Network Engineering, Okayama University, 3-1-1...If you want to submit a sufficient essay, coiffe it on our website: Orderessay

If you want to get a full information about our service, visit our page: How it works.