Jon C. R. Bennett

According to our database, Jon C. R. Bennett authored at least 8 papers between 1996 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2002

Supplemental Information for the New Definition of the EF PHB (Expedited Forwarding Per-Hop Behavior).

Anna Charny, Jon C. R. Bennett, Kent Benson, Jean-Yves Le Boudec, Angela L. Chiu, William F. Courtney, Shahram Davari, Victor Firoiu, Charles R. Kalmanek, K. K. Ramakrishnan

RFC, March, 2002

An Expedited Forwarding PHB (Per-Hop Behavior).

Bruce Davie, Anna Charny, Jon C. R. Bennett, Kent Benson, Jean-Yves Le Boudec, William F. Courtney, Shahram Davari, Victor Firoiu, Dimitrios Stiliadis

RFC, March, 2002

Delay jitter bounds and packet scale rate guarantee expedited forwarding.

Jon C. R. Bennett, Kent Benson, Anna Charny, William F. Courtney, Jean-Yves Le Boudec

IEEE/ACM Trans. Netw., 2002

1999

Packet reordering is not pathological network behavior.

Jon C. R. Bennett, Craig Partridge, Nicholas Shectman

IEEE/ACM Trans. Netw., 1999

Implementing scheduling algorithms in high-speed networks.

Donpaul C. Stephens, Jon C. R. Bennett, Hui Zhang

IEEE J. Sel. Areas Commun., 1999

1997

Hierarchical packet fair queueing algorithms.

Jon C. R. Bennett, Hui Zhang

IEEE/ACM Trans. Netw., 1997

High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks.

Jon C. R. Bennett, Donpaul C. Stephens, Hui Zhang

Proceedings of the 1997 International Conference on Network Protocols (ICNP '97), 1997

1996

WF²Q: Worst-Case Fair Weighted Fair Queueing.

Jon C. R. Bennett, Hui Zhang

Proceedings of the Proceedings IEEE INFOCOM '96, 1996