Change search
ReferencesLink to record
Permanent link

Direct link
Efficient weighted fair queuing
1999 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

The Internet grows in both capacity and use every day, but even so, usage continues to outgrow capacity. This leads to contention, congested routers and ultimately, packet loss. A lot of research has been done to discover how to alleviate this problem. This paper discusses an efficient implementation of Weighted Fair Queuing (WFQ) as a partial solution. Using a specialized algorithm, we present an implementation that reduces both memory accesses and computer instructions

Place, publisher, year, edition, pages
1999.
Keyword [en]
Technology, WFQ, Weighted Fair Queuing, Effnet, network congestions, network contention
Keyword [sv]
Teknik
Identifiers
URN: urn:nbn:se:ltu:diva-49691ISRN: LTU-EX--99/228--SELocal ID: 7019d002-471a-4132-b56c-3e1e0b02bfc1OAI: oai:DiVA.org:ltu-49691DiVA: diva2:1023038
Subject / course
Student thesis, at least 30 credits
Educational program
Civil Engineering programmes 1997-2000, master's level
Examiners
Note
Validerat; 20101217 (root)Available from: 2016-10-04 Created: 2016-10-04Bibliographically approved

Open Access in DiVA

No full text

Search outside of DiVA

GoogleGoogle Scholar

Total: 2 hits
ReferencesLink to record
Permanent link

Direct link