The static and semi-dynamic routing problems in the Wavelength Division Multiplexing (WDM) networks are generally very complicated. Finding the exact optima for most of these optimization problems is usually impossible with today's computation facility even for the medium size networks. Therefore, finding a sub-optimal solution within a reasonable computation time is the only choice, while knowing the proximity of the sub-optimal solution to the exact-optimum would be an additional advantage. Different from most of the existing heuristic approaches, this book provides strict formulations and mathematical solutions with polynomial complexities for various optimization problems, including Min-Cost Problem, Max-RWA Problem, Traffic Grooming Routing Problem, and Semi-Dynamic Optimization Problem. The results are compared with other state-of-the-art solutions, such as LP-relaxation and branch-and-bound methods. The solution framework provided in this book has been proven to be very computationally efficient, while generating results with good optimality, at the same time providing tight theoretical bounds. The computation time can be further reduced by reusing the optimized results.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Dr. J. Y. Zhang has worked on various areas including the optimization of computer networks and manufacturing processes, object tracking, pattern recognition, machine learning, high-speed digital hardware design, human language processing and biometrics. He has published ten journal papers in the area of the optical network optimization.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 28,96 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiEUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiDa: moluna, Greven, Germania
Kartoniert / Broschiert. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Zhang James YimingDr. J. Y. Zhang has worked on various areas including thenoptimization of computer networks and manufacturing processes,nobject tracking, pattern recognition, machine learning,nhigh-speed digital hardware design, hu. Codice articolo 4964720
Quantità: Più di 20 disponibili
Da: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9783639180640
Quantità: Più di 20 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9783639180640
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783639180640_new
Quantità: Più di 20 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9783639180640
Quantità: Più di 20 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The static and semi-dynamic routing problems in theWavelength Division Multiplexing (WDM) networks aregenerally very complicated. Finding the exact optimafor most of these optimization problems is usuallyimpossible with today s computation facility even forthe medium size networks. Therefore, finding asub-optimal solution within a reasonable computationtime is the only choice, while knowing the proximityof the sub-optimal solution to the exact-optimumwould be an additional advantage.Different from most of the existing heuristicapproaches, this book provides strict formulationsand mathematical solutions with polynomialcomplexities for various optimization problems,including Min-Cost Problem, Max-RWA Problem, TrafficGrooming Routing Problem, and Semi-DynamicOptimization Problem. The results are compared withother state-of-the-art solutions, such asLP-relaxation and branch-and-bound methods.The solution framework provided in this book has beenproven to be very computationally efficient, whilegenerating results with good optimality, at the sametime providing tight theoretical bounds. Thecomputation time can be further reduced by reusingthe optimized results. Codice articolo 9783639180640
Quantità: 2 disponibili
Da: Chiron Media, Wallingford, Regno Unito
Paperback. Condizione: New. Codice articolo 6666-IUK-9783639180640
Quantità: 10 disponibili
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLING22Oct2817100450352
Quantità: Più di 20 disponibili
Da: Mispah books, Redhill, SURRE, Regno Unito
Paperback. Condizione: Like New. Like New. book. Codice articolo ERICA758363918064X6
Quantità: 1 disponibili