Shortest path evaluation

Full Title

Routing or path finding of packets in data switching networks (routing or path finding in wireless networks H04W40/00) > Shortest path evaluation

Child Classifications

Navigate with arrow keys, Enter to open

• H04L 45/121 by minimising delays
• H04L 45/122 by minimising distances, e.g. by selecting a route with minimum of number of hops
• H04L 45/123
• H04L 45/124
• H04L 45/125 based on throughput or bandwidth
• H04L 45/126
• H04L 45/127
• H04L 45/128 for finding disjoint paths