Show simple item record

dc.contributor.authorZhang Y.
dc.contributor.authorPiunovskiy A.
dc.contributor.authorAyesta U.
dc.contributor.authorAvrachenkov K.
dc.date.accessioned2017-02-21T08:11:14Z
dc.date.available2017-02-21T08:11:14Z
dc.date.issued2010-12-31
dc.identifier.issn0140-3664
dc.identifier.urihttp://hdl.handle.net/20.500.11824/383
dc.description.abstractWe study the interaction between the MIMD (Multiplicative Increase Multiplicative Decrease) congestion control and a bottleneck router with Drop Tail buffer. We consider the problem in the framework of deterministic hybrid models. We study conditions under which the system trajectories converge to limiting cycles with a single jump. Following that, we consider the problem of the optimal buffer sizing in the framework of multi-criteria optimization in which the Lagrange function corresponds to a linear combination of the average throughput and the average delay in the queue. As case studies, we consider the Slow Start phase of TCP New Reno and Scalable TCP for high speed networks. © 2009 Elsevier B.V. All rights reserved.
dc.formatapplication/pdf
dc.languageeng
dc.publisherComputer Communications
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/es/
dc.subjectDeterministic hybrid model
dc.subjectOptimization
dc.subjectPareto set
dc.subjectStability
dc.titleConvergence of trajectories and optimal buffer sizing for MIMD congestion control
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.identifier.doi10.1016/j.comcom.2009.08.008
dc.relation.publisherversionhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-72249121902&doi=10.1016%2fj.comcom.2009.08.008&partnerID=40&md5=bf53357f1cac139b650887285864345c


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

info:eu-repo/semantics/openAccess
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess