On resource management in multi-service network

In the present work we address a problem of optimal resource partitioning in high-speed networks with heterogeneous traffic classes and differentiated QoS requirements. The problem arguments are bandwidth and network-edge buffer space allocations for end-to-end connections. The problem formulation can take into account sensitivity variation of application performance for both aggregated and single service requests. The proposed method is recursive and solves two problems on each iteration step. The first step defines optimal relations between network media, equipment performance parameters and selected routing scheme in accordance with generalized mean of links and network nodes loads. Mutual influence of flows in the network is considered in this stage. The second stage is intended to provide optimal bandwidth and buffer size allocation parameters under network resource and QoS constraints. At this stage, stochastic resource allocation problem formulation with piecewise linearization of nonlinear constraints is applied. We use connection request distribution, average connection duration time and quantity of information exchange as sensitive parameters in post optimal analysis to improve solution convergence to optimal tradeoff between resource allocation and acceptable application performance.

[1]  Azer Bestavros,et al.  Load Profiling Based Routing for Guaranteed Bandwidth Flows , 1999, Eur. Trans. Telecommun..

[2]  F. Kelly.  Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.

[3]  Michel Loève,et al.  Probability Theory I , 1977 .

[4]  Zbigniew Dziong,et al.  A framework for bandwidth management in ATM networks—aggregate equivalent bandwidth estimation approach , 1997, TNET.

[5]  Catherine Rosenberg,et al.  Fairness and Aggregation: A Primal Decomposition Study , 2000, NETWORKING.

[6]  Ward Whitt,et al.  Extending the effective bandwidth concept to networks with priority classes , 1998 .

[7]  Douglas S. Reeves,et al.  QoS Rewards and Risks: A Multi-market Approach to Resource Allocation , 2000, NETWORKING.

[8]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[9]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

[10]  Pravin Varaiya,et al.  Correction to "A new approach to service provisioning in ATM networks" , 1993, TNET.

[11]  D. Mitra.  Stochastic theory of a fluid model of producers and consumers coupled by a buffer , 1988, Advances in Applied Probability.

[12]  Lily Cheng.  Quality of services based on both call admission and cell scheduling , 1997, Comput. Networks ISDN Syst..

[13]  Debasis Mitra,et al.  Effective bandwidth of general Markovian traffic sources and admission control of high speed networks , 1993, TNET.

[14]  Theodora Varvarigou,et al.  Optimal Pricing Strategies in Noncooperative Networks , 1997 .

[15]  Gustavo de Veciana,et al.  Resource Allocation in Multi-Service Networks via Pricing: Statistical Multiplexing , 1998, Comput. Networks.

[16]  Ariel Orda,et al.  The role of the manager in a noncooperative network , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[17]  Pravin Varaiya,et al.  Throughput in multiple service, multiple resource communication networks , 1991, IEEE Trans. Commun..

[18]  Aurel A. Lazar,et al.  Virtual path control for ATM networks with call level quality of service guarantees , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.