Abstract
The Bandwidth Guaranteed Prioritized Queuing (BGPQ) algorithm provides both the advantages of priority and weighted fair queuing. The BGPQ provides minimum bandwidth guarantees to different traffic classes and then priority class services on the residual bandwidth. However, this functionality cannot be achieved by simple hierarchical combination of fair and priority queuing. We ran some simulations to verify the performance of the BGPQ algorithm. We also present two methods of implementations: one for quick prototyping and one for implementations with low complexity.
| Original language | English |
|---|---|
| Pages | 1445-1449 |
| Number of pages | 5 |
| Publication status | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3) - Phoenix, AZ, USA Duration: 3 Nov 1997 → 8 Nov 1997 |
Conference
| Conference | Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3) |
|---|---|
| City | Phoenix, AZ, USA |
| Period | 3/11/97 → 8/11/97 |