Andere Kunden interessierten sich auch für
![Designing All Optical Parity with Non Linear Loop Tree Architecture]( "Designing All Optical Parity with Non Linear Loop Tree Architecture")
Designing All Optical Parity with Non Linear Loop Tree Architecture32,99 €![Optical Character Recognition Based Retrieval]( "Optical Character Recognition Based Retrieval")
Optical Character Recognition Based Retrieval36,99 €![Optical Fiber Communication]( "Optical Fiber Communication")
Optical Fiber Communication36,99 €![Optical Image Compression Techniques based on Wavelet Transform]( "Optical Image Compression Techniques based on Wavelet Transform")
Optical Image Compression Techniques based on Wavelet Transform45,99 €![Eye Talk]( "Eye Talk")
Eye Talk24,99 €![Security of Optical Telecommunication Networks Elements]( "Security of Optical Telecommunication Networks Elements")
Security of Optical Telecommunication Networks Elements24,99 €![LITERATURE REVIEW OF STANDARDS FOR OPEN OPTICAL NETWORKS]( "LITERATURE REVIEW OF STANDARDS FOR OPEN OPTICAL NETWORKS")
LITERATURE REVIEW OF STANDARDS FOR OPEN OPTICAL NETWORKS36,99 €
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.