An Efficient Implementation of A Hierarchical Weighted Fair Queue Packet Scheduler
Name
MIT-LCS-TM-509.pdf
Size
5.3 MB
Format
Adobe PDF
Checksum (MD5)
34c6a5f0fb2a00a2aaa11557d69c63a1
Author(s)
Ndiaye, Oumar
Advisor(s)
Clark, David D.
Date Issued
May 1994
Series/Report no.
MIT-LCS-TM-509
Abstract
The technical developments in computer networks in recent years have spawned the possibility of merging different services into a single Integrated Service Packet Network (ISPN). The types of service quality required by each of the individual services in an ISPN often differ greatly. Thus, the packet scheduling algorithms used in such networks must be flexible enough to allocate the available link shares according to the service quality requirements of the different services.
Persistent DSpace Link
