Using Augmented Infinitesimal Perturbation Analysis for Capacity Planning in Intree ATM Networks

Augmented Infinitesimal Perturbation Analysis is used to determine asymptotically unbiased and strong consistent gradient estimates for use in the capacity planning of intree ATM networks. These gradients are used to determine the locally optimal minimum average network delay by applying a steepest descent algorithm with projection and an Armijo line search to solve the capacity assignment (CA) problem. The network capacities are governed by a linear cost constraint. It is assumed that input regulators (e.g., leaky bucket regulators) are used at the source of each virtual circuit. All virtual circuit external arrivals are modeled as independent Poisson processes. Regenerative simulation is used to determine gradient estimates.

[1]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[2]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[3]  M. W. McKinnon,et al.  On perturbation analysis of queueing networks with finitely supported service time distributions , 1991 .

[4]  R. Suri,et al.  Perturbation analysis: the state of the art and research issues explained via the GI/G/1 queue , 1989, Proc. IEEE.

[5]  L. Armijo.  Minimization of functions having Lipschitz continuous first partial derivatives. , 1966 .

[6]  Christos G. Cassandras,et al.  Perturbation analytic methodologies for design and optimization of communication networks , 1988, IEEE J. Sel. Areas Commun..

[7]  Philip Heidelberger,et al.  Effective Bandwidth and Fast Simulation of ATM Intree Networks , 1994, Perform. Evaluation.

[8]  Paul Glasserman,et al.  Gradient Estimation Via Perturbation Analysis , 1990 .

[9]  Mario Gerla,et al.  On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..

[10]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[11]  Christos G. Cassandras,et al.  Discrete event systems : modeling and performance analysis , 1993 .

[12]  Jay Cheng,et al.  Computable exponential bounds for intree networks with routing , 1995, Proceedings of INFOCOM'95.

[13]  Yorai Wardi,et al.  Application of descent algorithms with Armijo stepsizes to simulation-based optimization of queueing networks , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

[14]  Christos G. Cassandras,et al.  Efficient Parametric Analysis of Performance Measures for Communication Networks , 1990, IEEE J. Sel. Areas Commun..

[15]  J. Turner,et al.  New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.

[16]  Gerald S. Shedler.  Regenerative Stochastic Simulation , 1992 .

[17]  Xi-Ren Cao,et al.  Perturbation analysis of discrete event dynamic systems , 1991 .

[18]  Ramavarapu S. Sreenivas,et al.  Augmented infinitesimal perturbation analysis: An alternate explanation , 1992, Discret. Event Dyn. Syst..

[19]  Donald F. Towsley,et al.  Distributed routing with on-line marginal delay estimation , 1990, IEEE Trans. Commun..

[20]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[21]  Weibo Gong,et al.  Ill-conditioned performance functions of queueing systems , 1995 .

[22]  Bezalel Gavish,et al.  A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..

[23]  Xi-Ren Cao,et al.  Convergence properties of infinitesimal perturbation analysis , 1988 .

[24]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[25]  Hong Li,et al.  AND-ATM Network Design System , 1997, Proceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.