Isbn: 9783844312096 - simulation of all-optical network with deflection routing: algorithmic approach (6 risultati)

Taschenbuch. Condizione: Neu. Simulation of All-Optical Network with Deflection Routing | Algorithmic Approach | Armando Borrero Molina | Taschenbuch | 172 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783844312096 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.…

Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Deflection routing algorithms dont explain how to choose packets to be misdirected, nor even how many packets. There are efficient graph algorithms, which provide optimal solutions in term of number of deflections at each time slot. However to implement them is quite complex. Although their complexity is polynomial, they dont fulfill the time requirements of the optical switches. We have created some algorithms to choose, at every step, the optimal path that packets must follow, from origin to destination. These methods have the property of reducing the number of deflections that the packets undergo. We have proved a distributed algorithm which deflects the smallest number of customers in every node of the net. We have called it Minimal Deflection Algorithm and we have evaluated its performance in an all-optical network. Every node sends the packets to their optimal routes, the shortest path to their destination, the path with the minimum number of deflections. We have also developped the Scale Routing algorithm, which minimize the number of deflections on the total trajectory to find the optimal route, even if packets were deflected. 172 pp. Englisch.…

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Deflection routing algorithms dont explain how to choose packets to be misdirected, nor even how many packets. There are efficient graph algorithms, which provide optimal solutions in term of number of deflections at each time slot. However to implement them is quite complex. Although their complexity is polynomial, they dont fulfill the time requirements of the optical switches. We have created some algorithms to choose, at every step, the optimal path that packets must follow, from origin to destination. These methods have the property of reducing the number of deflections that the packets undergo. We have proved a distributed algorithm which deflects the smallest number of customers in every node of the net. We have called it Minimal Deflection Algorithm and we have evaluated its performance in an all-optical network. Every node sends the packets to their optimal routes, the shortest path to their destination, the path with the minimum number of deflections. We have also developped the Scale Routing algorithm, which minimize the number of deflections on the total trajectory to find the optimal route, even if packets were deflected.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Borrero Molina ArmandoSystems Engineer, University of Los Andes, ULA, Venezuela. Master of Science in Bussiness Administration, ULA, Venezuela. Ph.D. in Informatics, University of Versailles, France. Associate Professor at the Fac. …

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Deflection routing algorithms dont explain how to choose packets to be misdirected, nor even how many packets. There are efficient graph algorithms, which provide optimal solutions in term of number of deflections at each time slot. However to implement them is quite complex. Although their complexity is polynomial, they dont fulfill the time requirements of the optical switches. We have created some algorithms to choose, at every step, the optimal path that packets must follow, from origin to destination. These methods have the property of reducing the number of deflections that the packets undergo. We have proved a distributed algorithm which deflects the smallest number of customers in every node of the net. We have called it Minimal Deflection Algorithm and we have evaluated its performance in an all-optical network. Every node sends the packets to their optimal routes, the shortest path to their destination, the path with the minimum number of deflections. We have also developped the Scale Routing algorithm, which minimize the number of deflections on the total trajectory to find the optimal route, even if packets were deflected.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 172 pp. Englisch.…