Saturation Routing for Asynchronous Transfer Mode (atm) Networks

The objective of this paper is to show that saturation routing, ofien in the past considered inefficient, can in fact be a viable approach to use in many important applications and services over an ATM network This is demonstrated by showing that the ratio, de$ned as J of routing overhead cells over information cells is small even for large networkx f is calculated using typical network parameters, with analysis as well as simulation. An A4!D/1 queuing model is used to prove that the eflect of saturation routing in degrading network pe~ormance is insigrdjicant for the expected ATM network trafic. Also, the constraints on network parameters are derived and stated as: ~=C I, f< cI, and f< C(P A)/A; where p,, p, and A are the link utilization factor with saturation routing, the cell service rate, and the mean cell arrival rate, respectively.