Technology, Data Communication Terms, Glossary and Dictionary
Ford-Fulkerson Algorithm, also known as Bellman-Ford Routing Algorithm, is used as an algorithm by distance vector routing protocols such as RIP, BGP, ISO IDRP, NOVELL IPX. Routers that use this algorithm have to maintain the distance tables (which is a one-dimension array -- "a vector"), which tell the distances and shortest path to sending packets to each node in the network. The information in the distance table is always updated by exchanging information with the neighboring nodes. The number of data in the table equals to that of all nodes in networks (excluded itself). The columns of table represent the directly attached neighbors whereas the rows represent all destinations in the network. Each data contains the path for sending packets to each destination in the network and distance/or time to transmit on that path (we call this as "cost"). The measurements in this algorithm are the number of hops, latency, the number of outgoing packets, etc.