shortest path routing

Related Overviews


'shortest path routing' can also refer to...


More Like This

Show all results sharing this subject:

  • Computing


Show Summary Details

Quick Reference

A form of routing which attempts to send packets of data over a network in such a way that the path taken from the sending computer to the recipient computer is minimized. The path can be measured in either physical distance or in the number of hops. This form of routing uses a non-adaptive routing algorithm.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.