Glosor


distance vector algorithmsearch for term

An algorithm that finds best-path routes among routers by calculating total distance over which a packet would travel on each alternative route. Usually the shortest distance is the preferred route, but different routing levels, if defined, are considered as well.Distance vector algorithms are included in ISO's Interdomain Routing Protocol (IDRP), and routing information protocols (RIPs) in both TCP/IP and in IPX/SPX.

© 2013 Novell