default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEllen L. Hahne
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j11]Ellen L. Hahne, Abhijit K. Choudhury:
Dynamic queue length thresholds for multiple loss priorities. IEEE/ACM Trans. Netw. 10(3): 368-380 (2002)- 2001
- [c7]Ellen L. Hahne, Alexander Kesselman, Yishay Mansour:
Competitve buffer management for shared-memory switches. SPAA 2001: 53-58 - 2000
- [j10]Ping Pan, Ellen L. Hahne, Henning Schulzrinne:
BGRP: Sink-tree-based aggregation for inter-domain reservations. J. Commun. Networks 2(2): 157-167 (2000)
1990 – 1999
- 1998
- [j9]Abhijit K. Choudhury, Ellen L. Hahne:
Dynamic queue length thresholds for shared-memory packet switches. IEEE/ACM Trans. Netw. 6(2): 130-140 (1998) - 1997
- [j8]Debashis Basak, Abhijit K. Choudhury, Ellen L. Hahne:
Sharing Memory in Banyan-Based ATM Switches. IEEE J. Sel. Areas Commun. 15(5): 881-891 (1997) - [j7]Terence D. Todd, Ellen L. Hahne:
Multi-access mesh (multimesh) networks. IEEE/ACM Trans. Netw. 5(2): 181-189 (1997) - [j6]Abhijit K. Choudhury, Ellen L. Hahne:
A new buffer management scheme for hierarchical shared memory switches. IEEE/ACM Trans. Netw. 5(5): 728-738 (1997) - 1996
- [j5]Abhijit K. Choudhury, Ellen L. Hahne:
New implementation of multi-priority pushout for shared memory ATM switches. Comput. Commun. 19(3): 245-256 (1996) - [c6]Abhijit K. Choudhury, Ellen L. Hahne:
Dynamic Queue Length Thresholds in a Shared Memory ATM Switch. INFOCOM 1996: 679-687 - 1995
- [c5]Debashis Basak, Abhijit K. Choudhury, Ellen L. Hahne:
Sharing memory in multistage ATM switches. ICCCN 1995: 424 - 1994
- [j4]Abhijit K. Choudhury, Ellen L. Hahne:
A Simulation Study of Space Priorities in a Shared Memory ATM Switch. J. High Speed Networks 3(4): 491-512 (1994) - [c4]Abhijit K. Choudhury, Ellen L. Hahne:
Buffer Management in a Hierarchical Shared Memory Switch. INFOCOM 1994: 1410-1419 - 1993
- [j3]Ellen L. Hahne, Charles R. Kalmanek, Stephen P. Morgan:
Dynamic Window Flow Control on a High-Speed Wide-Area Data Network. Comput. Networks ISDN Syst. 26(1): 29-41 (1993) - 1992
- [j2]Ellen L. Hahne, Abhijit K. Choudhury, Nicholas F. Maxemchuk:
DQDB networks with and without bandwidth balancing. IEEE Trans. Commun. 40(7): 1192-1204 (1992) - 1991
- [j1]Ellen L. Hahne:
Round-Robin Scheduling for Max-Min Fairness in Data Networks. IEEE J. Sel. Areas Commun. 9(7): 1024-1039 (1991) - [c3]Ellen L. Hahne, Nicholas F. Maxemchuk:
Fair Access of Multi-Priority Traffic to Distributed-Queue Dual-Bus Networks. INFOCOM 1991: 889-900 - 1990
- [c2]Ellen L. Hahne, Abhijit K. Choudhury, Nicholas F. Maxemchuk:
Improving the Fairness of Distributed-Queue-Dual-Bus Networks. INFOCOM 1990: 175-184
1980 – 1989
- 1986
- [b1]Ellen L. Hahne:
Round robin scheduling for fair flow control in data communication networks. Massachusetts Institute of Technology, Cambridge, MA, USA, 1986 - [c1]Ellen L. Hahne, Robert G. Gallager:
Round Robin Scheduling for Fair Flow Control in Data Communication Networks. ICC 1986: 103-107
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-25 05:52 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:
