{"title":"On resource management in multi-service network","authors":"V. Kaminsky, Lev Kacnelson, I. Gerlovin","doi":"10.1109/LCN.2001.990770","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2001.990770","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
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.