Εμφάνιση απλής εγγραφής

dc.creatorSarkar, S.en
dc.creatorTassiulas, L.en
dc.date.accessioned2015-11-23T10:47:00Z
dc.date.available2015-11-23T10:47:00Z
dc.date.issued2005
dc.identifier10.1109/tnet.2004.842234
dc.identifier.issn1063-6692
dc.identifier.urihttp://hdl.handle.net/11615/32887
dc.description.abstractWe study fairness of resource allocation in multirate, multicast networks. In multirate networks, different receivers of the same multicast session can receive service at different rates. We develop a mathematical framework to model the maxmin fair allocation of bandwidth with minimum and maximum rate constraints. We present a necessary and sufficient condition for a rate allocation to be maxmin fair in a multirate, multicast network. We propose a distributed algorithm for computing the maxmin fair rates allocated to various source-destination pairs. This algorithm has a low message exchange overhead, and is guaranteed to converge to the maxmin fair rates in finite time.en
dc.source.uri<Go to ISI>://WOS:000227483700011
dc.subjectalgorithmsen
dc.subjectcomplexity theoryen
dc.subjectfairnessen
dc.subjectmulticasten
dc.subjectVIDEO SIGNALSen
dc.subjectATMen
dc.subjectComputer Science, Hardware & Architectureen
dc.subjectComputer Science, Theory &en
dc.subjectMethodsen
dc.subjectEngineering, Electrical & Electronicen
dc.subjectTelecommunicationsen
dc.titleFair distributed congestion control in multirate multicast networksen
dc.typejournalArticleen


Αρχεία σε αυτό το τεκμήριο

ΑρχείαΜέγεθοςΤύποςΠροβολή

Δεν υπάρχουν αρχεία που να σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στις ακόλουθες συλλογές

Εμφάνιση απλής εγγραφής