Bandwidth guaranteed prioritized queuing and its implementations

K. L. Eddie Law

Bandwidth guaranteed prioritized queuing and its implementations

K. L. Eddie Law

Nortel Networks Inc.

研究成果: Paper › 同行評審

10 引文斯高帕斯（Scopus）

摘要

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.

原文	English
頁面	1445-1449
頁數	5
出版狀態	Published - 1997
對外發佈	是
事件	Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3) - Phoenix, AZ, USA 持續時間: 3 11月 1997 → 8 11月 1997

Conference

Conference	Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3)
城市	Phoenix, AZ, USA
期間	3/11/97 → 8/11/97

其它文件與鏈接

Link to publication in Scopus

引用此

@conference{400c67c202b44e658d3492c40d8e4045,

title = "Bandwidth guaranteed prioritized queuing and its implementations",

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.",

author = "\{Eddie Law\}, \{K. L.\}",

year = "1997",

language = "English",

pages = "1445--1449",

note = "Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3) ; Conference date: 03-11-1997 Through 08-11-1997",

}

TY - CONF

T1 - Bandwidth guaranteed prioritized queuing and its implementations

AU - Eddie Law, K. L.

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0031359698

M3 - Paper

AN - SCOPUS:0031359698

SP - 1445

EP - 1449

T2 - Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3)

Y2 - 3 November 1997 through 8 November 1997

ER -

Bandwidth guaranteed prioritized queuing and its implementations

摘要

Conference

其它文件與鏈接

指紋

引用此