Title :
The bandwidth guaranteed prioritized queuing and its implementations
Author_Institution :
Nortel, Ottawa, Ont., Canada
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
Keywords :
multimedia communication; queueing theory; telecommunication traffic; BGPQ algorithm; bandwidth guaranteed prioritized queuing; low complexity; minimum bandwidth guarantees; multimedia networks; priority class services; priority queueing; quick prototyping; residual bandwidth; traffic classes; weighted fair queuing; Bandwidth; Communication system traffic control; Delay; Prototypes; Radio access networks; Resource management; Scheduling algorithm; Switches; Throughput; Traffic control;
Conference_Titel :
Global Telecommunications Conference, 1997. GLOBECOM '97., IEEE
Conference_Location :
Phoenix, AZ
Print_ISBN :
0-7803-4198-8
DOI :
10.1109/GLOCOM.1997.644374
