In this paper, the congestion control in store and forward computer com-munication networks is studied, the method employed consists of a combination of a dynamic routing policy that minimizes the delay, and buffer nianagement schemes to control the flow of data. Simulation using liner programming has been carried out, under balanced and transient traffic conditions, on a simple 3–node network , the relative merits and drawbacks of each approach are discussed. Irland [2], showed that with static routing, the SQRT scheme improves the switch performance. In this paper it is shown that in the case of dynamic routing, the SQRT is an excellent solution to remedy the performance degradation caused by CP and CS schemes