Priority Queueing with Finite Buffer Size and Randomized Push-out Mechanism K.E. Avrachenkov INRIA Sophia Antipolis 2004, Route des Lucioles, B.P. 93 Sophia Antipolis Cedex, 06902, France N.O. Vilchevsky St.Petersburg State Polytechnic University 29, Polytekhnitcheskaya Str., St.Petersburg, 195251, Russia G.L. Shevlyakov St.Petersburg State Polytechnic University 29, Polytekhnitcheskaya Str., St.Petersburg, 195251, Russia kavratch@sophia.inria.fr Categories and Subject Descriptors vilch@kit.amd.stu.neva.ru shev@stat.hop.stu.neva.ru G.3 [Probability and Statistics]: Queueing Theory, Markov Processes; G.1.3 [Numerical Analysis]: Numerical Linear Algebra General Terms Algorithms, Performance, Theory Keywords Priority Queueing, Finite Bu er, Randomized Push-out, Packet Loss Probability, Di Serv e.g., Di erentiated Services (Di Serv) architecture for the Internet. In the context of the Di Serv Expedited Forwarding, the proposed scheme can be employed to guarantee the required Quality of Service level for the priority tra c and at the same time to prevent the non-priority tra c from starvation. The major part of tra c in the Assured Forwarding Di erentiated Service is carried by TCP, the protocol which adjusts its sending rate based on packet losses. Thus, the randomized push-out priority queueing which provides an easy control of the packet loss probabilities leads to simple and e cient di erentiation between AF tra c classes. 2.
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/priority-queueing-with-finite-buffer-size-and-randomized-push-out-lt4I1H43VW
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Priority queueing with finite buffer size and randomized push-out mechanism
Avrachenkov, K. E.; Vilchevsky, N. O.; Shevlyakov, G. L.
Follow ACM SIGMETRICS Performance Evaluation Review
, Volume 31 (1)
Association for Computing Machinery – Jun 10, 2003
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
