Free delivery for orders over 69.99 euro.

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 69.99 €

DPD courier 5.99 € Bpost point 7.99 € Bpost 7.49 € DPD point 3.49 € GLS courier 4.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Free delivery for orders over 69.99 euro.

An Efficient Algorithm for Cost effective Mechanism in WDM Network

Name: An Efficient Algorithm for Cost effective Mechanism in WDM Network
Brand: LAP Lambert Academic Publishing
SKU: 10961207
Price: 35.68 EUR
Availability: InStock
Author: Punam Patil
ISBN: 9783659875601

Punam Patil

Bhushan Patil

Language

English

Book Paperback

Libristo code: 10961207

Publishers LAP Lambert Academic Publishing, May 2016

In this project, we have proposed an efficient re-routing algorithm by dynamic routing in Bi-directi... Full description

Libristo code: 10961207

86 b

35.68 €

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

Labyrintem Normalizace. Židovská obec jako zrcadlo většinové společnosti Martin Šmok

Paperback

5.75 €

Ich war zuhause, aber ... Angela Schanelec

DVD

22.03 €

Kontingenz und Literatur im Prozess der Modernisierung Stella Butter

Paperback

69.36 €

Paul, Lisa & Co PLUS A1.2, m. 1 Buch, m. 1 Beilage Monika Bovermann

Paperback

11.01 €

In this project, we have proposed an efficient re-routing algorithm by dynamic routing in Bi-directional WDM optical network. In wavelength division multiplexing network, a heuristic algorithm is used for routing and wavelength assignment. The main objective of this is to minimize the requirement of wavelength and hop length between S-D nodes in the traffic. In this project we have to considering a wavelength routed WDM optical network and then implementing Heuristic algorithm on it. We have to divide our work mainly into two phases. In the first phase, existing routing is performed using Dijkstra's algorithm and in second phase of algorithm proposed algorithm is performed to reduce the number of wavelengths required in the first phase of the network which minimizes the hop count of each route.