Show simple item record

dc.contributor.authorLestas, Mariosen
dc.contributor.authorIoannou, Petros A.en
dc.contributor.authorPitsillides, Andreasen
dc.creatorLestas, Mariosen
dc.creatorIoannou, Petros A.en
dc.creatorPitsillides, Andreasen
dc.date.accessioned2019-11-13T10:40:58Z
dc.date.available2019-11-13T10:40:58Z
dc.date.issued2004
dc.identifier.isbn0-7803-8335-4
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/54390
dc.description.abstractThis paper deals with the congestion control problem in computer networks which is viewed as a resource allocation problem constrained by the additional requirement that the queue sizes need to be bounded. We propose a distributed algorithm which converges to the max-min fair allocation of resources among the users of the network and at the same time ensures that the buffers are either empty or track a reference queue size. The problem is formulated mathematically and the proposed algorithm is shown analytically to fulfil the design objectives. The local asymptotic stability of the equilibrium point is established. The problem can be viewed as a hybrid system with changing affine dynamics in different regions of the state space. The transient performance of the proposed algorithm is evaluated through simulations using Matlab. The algorithm can form the basis for the development of an end-to-end communication protocol since it requires no maintenance of per flow states within the network.en
dc.sourceProceedings of the American Control Conferenceen
dc.sourceProceedings of the 2004 American Control Conference (AAC)en
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-8744305708&doi=10.1109%2fACC.2004.183028&partnerID=40&md5=85ee6994d5897fff6d978e637fa31307
dc.subjectMathematical modelsen
dc.subjectResource allocationen
dc.subjectAlgorithmsen
dc.subjectBandwidthen
dc.subjectTelecommunication networksen
dc.subjectComputer networksen
dc.subjectNetwork protocolsen
dc.subjectDistributed algorithmsen
dc.subjectNetwork topologyen
dc.subjectCongestion control (communication)en
dc.subjectQueueing networksen
dc.subjectConstant matricesen
dc.subjectProjection algorithmsen
dc.titleA congestion control algorithm for max-min resource allocation and bounded queue sizesen
dc.typeinfo:eu-repo/semantics/conferenceObject
dc.identifier.doi10.1109/ACC.2004.183028
dc.description.volume2
dc.description.startingpage1683
dc.description.endingpage1688
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeConference Objecten
dc.description.notes<p>Sponsors: American Automatic Control Councilen
dc.description.notesInternational Federation of Automation Control, IFACen
dc.description.notesConference code: 63912en
dc.description.notesCited By :1</p>en
dc.contributor.orcidPitsillides, Andreas [0000-0001-5072-2851]
dc.gnosis.orcid0000-0001-5072-2851


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