default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJon C. R. Bennett
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[e1]Jon C. R. Bennett, Mark Allman:
Proceedings of the ACM SIGCOMM Workshop on Network Troubleshooting - Research, Theory and Operations Practice Meet Malfunctioning Reality, NetT '04, Portland, Oregon, USA, September 3, 2004. ACM 2004 [contents]- 2002
- [j4]Jon C. R. Bennett, Kent Benson, Anna Charny, William F. Courtney, Jean-Yves Le Boudec:
Delay jitter bounds and packet scale rate guarantee expedited forwarding. IEEE/ACM Trans. Netw. 10(4): 529-540 (2002) - [i2]Bruce Davie, Anna Charny, Jon C. R. Bennett, Kent Benson, Jean-Yves Le Boudec, William F. Courtney, Shahram Davari, Victor Firoiu, Dimitrios Stiliadis:
An Expedited Forwarding PHB (Per-Hop Behavior). RFC 3246: 1-16 (2002) - [i1]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:
Supplemental Information for the New Definition of the EF PHB (Expedited Forwarding Per-Hop Behavior). RFC 3247: 1-24 (2002) - 2001
- [c4]Jon C. R. Bennett, Kent Benson, Anna Charny, William F. Courtney, Jean-Yves Le Boudec:
Delay Jitter Bounds and Packet Scale Rate Guarantee for Expedited Forwarding. INFOCOM 2001: 1502-1509
1990 – 1999
- 1999
- [j3]Donpaul C. Stephens, Jon C. R. Bennett, Hui Zhang:
Implementing scheduling algorithms in high-speed networks. IEEE J. Sel. Areas Commun. 17(6): 1145-1158 (1999) - [j2]Jon C. R. Bennett, Craig Partridge, Nicholas Shectman:
Packet reordering is not pathological network behavior. IEEE/ACM Trans. Netw. 7(6): 789-798 (1999) - 1997
- [j1]Jon C. R. Bennett, Hui Zhang:
Hierarchical packet fair queueing algorithms. IEEE/ACM Trans. Netw. 5(5): 675-689 (1997) - [c3]Jon C. R. Bennett, Donpaul C. Stephens, Hui Zhang:
High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks. ICNP 1997: 7-14 - 1996
- [c2]Jon C. R. Bennett, Hui Zhang:
WF2Q: Worst-Case Fair Weighted Fair Queueing. INFOCOM 1996: 120-128 - [c1]Jon C. R. Bennett, Hui Zhang:
Hierarchical Packet Fair Queueing Algorithms. SIGCOMM 1996: 143-156
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
