{"title":"Stochastic approximation and transaction-level model for IP network design","authors":"Linhai He, J. Walrand","doi":"10.1109/CDC.2000.912135","DOIUrl":null,"url":null,"abstract":"We investigate the use of simulation and transaction level models for transmission control protocol (TCP) in Internet Protocol (IP) network design. More specifically, we focus on the transaction level dynamics of TCP and approximate it by max-min fair sharing. Based on this model, we formulate a network dimensioning problem as a nonlinear constrained optimization problem. The constraints and their gradients, which do not have analytical forms, are estimated through fluid simulation of the transaction-level model of TCP. The problem is solved by a gradient descent type of algorithm, with additional heuristics based techniques to improve its convergence. The performance of the proposed algorithm is evaluated through experimental studies on example networks. Results show that the methods are promising and can help the design of networks.","PeriodicalId":217237,"journal":{"name":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2000.912135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We investigate the use of simulation and transaction level models for transmission control protocol (TCP) in Internet Protocol (IP) network design. More specifically, we focus on the transaction level dynamics of TCP and approximate it by max-min fair sharing. Based on this model, we formulate a network dimensioning problem as a nonlinear constrained optimization problem. The constraints and their gradients, which do not have analytical forms, are estimated through fluid simulation of the transaction-level model of TCP. The problem is solved by a gradient descent type of algorithm, with additional heuristics based techniques to improve its convergence. The performance of the proposed algorithm is evaluated through experimental studies on example networks. Results show that the methods are promising and can help the design of networks.