Show simple item record

dc.contributor.authorAvrachenkov, K.
dc.contributor.authorAyesta, U.
dc.contributor.authorPiunovskiy, A.
dc.date.accessioned2017-02-21T08:11:14Z
dc.date.available2017-02-21T08:11:14Z
dc.date.issued2010-12-31
dc.identifier.issn0166-5316
dc.identifier.urihttp://hdl.handle.net/20.500.11824/386
dc.description.abstractWe study the interaction between the AIMD (Additive Increase Multiplicative Decrease) multi-socket congestion control and a bottleneck router with Drop Tail buffer. We consider the problem in the framework of deterministic hybrid models. First, we show that trajectories always converge to limiting cycles. We characterize the cycles. Necessary and sufficient conditions for the absence of multiple jumps in the same cycle are obtained. Then, we propose an analytical framework for the optimal choice of the router buffer size. We formulate this problem as a multi-criteria optimization problem, in which the Lagrange function corresponds to a linear combination of the average goodput and the average delay in the queue. Our analytical results are confirmed by simulations performed with MATLAB Simulink.
dc.formatapplication/pdf
dc.language.isoengen_US
dc.rightsReconocimiento-NoComercial-CompartirIgual 3.0 Españaen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/es/en_US
dc.subjectAIMD congestion control
dc.subjectHybrid model
dc.subjectIP router buffer sizing
dc.subjectMulti-socket TCP
dc.subjectMulticriteria optimization
dc.titleConvergence of trajectories and optimal buffer sizing for AIMD congestion control
dc.typeinfo:eu-repo/semantics/articleen_US
dc.identifier.doi10.1016/j.peva.2010.01.004
dc.relation.publisherversionhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-77955308829&doi=10.1016%2fj.peva.2010.01.004&partnerID=40&md5=b646d016473f0176d3e1e7131750b9f2
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessen_US
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersionen_US
dc.journal.titlePerformance Evaluationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Reconocimiento-NoComercial-CompartirIgual 3.0 España
Except where otherwise noted, this item's license is described as Reconocimiento-NoComercial-CompartirIgual 3.0 España