NDLI: Hierarchical packet fair queueing algorithms

Please wait, while we are loading the content...

The importance of long-range dependence of VBR video traffic in ATM traffic engineering: myths and realities

On the relevance of long-range dependence in network traffic

End-to-end routing behavior in the Internet

ASHs: Application-specific handlers for high-performance messaging

DPF: fast, flexible message demultiplexing using dynamic code generation

Generating efficient protocol code from an abstract specification

Analysis of techniques to improve protocol processing latency

Speeding up protocols for small messages

Masking the overhead of protocol layering

Efficient support of delay and rate guarantees in an internet

Receiver-driven layered multicast

A reliable and scalable striping protocol

Hierarchical packet fair queueing algorithms

Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

Phantom: a simple and effective flow control scheme

Multicasting protocols for high-speed, wormhole-routing local area networks

Simulation study of the capacity effects of dispersity routing for fault tolerant realtime channels

Routing high-bandwidth traffic in max-min fair share networks

A channel access scheme for large dense packet radio networks

Adaptive resource management algorithms for indoor mobile computing environments

Measurement and analysis of the error characteristics of an in-building wireless network

A comparison of mechanisms for improving TCP performance over wireless links

Improving the start-up behavior of a congestion control scheme for TCP

Forward acknowledgement: refining TCP congestion control

Removal policies in network caches for World-Wide Web documents

Measuring the performance of communication middleware on high-speed networks

Internet mobility 4×4

Hierarchical packet fair queueing algorithms

Content Provider	ACM Digital Library
Author	Zhang, Hui Bennett, Jon C. R.
Abstract	Hierarchical Packet Fair Queueing (H-PFQ) algorithms have the potential to simultaneously support guaranteed real-time service, rate-adaptive best-effort, and controlled link-sharing service. In this paper, we design practical H-PFQ algorithms by using one-level Packet Fair Queueing (PFQ) servers as basic building blocks, and develop techniques to analyze delay and fairness properties of the resulted H-PFQ servers. We demonstrate that, in order to provide tight delay bounds in a H-PFQ server, it is essential for the one-level PFQ servers to have small Worst-case Fair Indices (WFI). We propose a new one-level PFQ algorithm called $WF^{2}Q+$ that is the first to have all the following three properties: (a) providing the tightest delay bound among all PFQ algorithms; (b) having the smallest WFI among all PFQ algorithms; and (c) having a relatively low implementation complexity of O(log N). We show that practical H-PFQ algorithms can be implemented by using $WF^{2}Q+$ as the basic building block and prove that the resulting $H-WF^{2}Q+$ algorithms provide similar delay bounds and bandwidth distribution as those provided by a H-GPS server. Simulation experiments are presented to evaluate the proposed algorithm.
Starting Page	143
Ending Page	156
Page Count	14
File Format	PDF
ISBN	0897917901
DOI	10.1145/248156.248170
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1996-08-28
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Hierarchical Packet Fair Queueing Algorithms (1997)

Hierarchical Packet Fair Queueing Algorithms (1997)

Hierarchical packet fair queueing algorithms

Adapting packet fair queueing algorithms to wireless networks

Hierarchical fair queueing: A credit-based approach for hierarchical link sharing

Multi-resource fair queueing for packet processing

Abstract Hierarchical Packet Fair Queueing Algorithms

Hierarchical packet fair queueing algorithms

Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors (1998)

Hierarchical packet fair queueing algorithms

Similar Documents

Hierarchical Packet Fair Queueing Algorithms (1997)

Hierarchical Packet Fair Queueing Algorithms (1997)

Hierarchical packet fair queueing algorithms

Adapting packet fair queueing algorithms to wireless networks

Hierarchical fair queueing: A credit-based approach for hierarchical link sharing

Multi-resource fair queueing for packet processing

Abstract Hierarchical Packet Fair Queueing Algorithms

Hierarchical packet fair queueing algorithms

Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors (1998)

Hierarchical packet fair queueing algorithms