The joint problem of routing and flow control in packet switched networks is considered in the paper. The goal is to obtain a procedure that will choose "best" paths between the source and destination pairs, and at the same time, will keep the excess load out of the network. The proposed algorithm finds the flow augmenting paths in the network and makes adjustments of the input load to the capabilities of the bottleneck links. Directions for further analyses and investigations of the tehnique are also presented.