default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbhijit K. Choudhury
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j12]Ellen L. Hahne, Abhijit K. Choudhury:
Dynamic queue length thresholds for multiple loss priorities. IEEE/ACM Trans. Netw. 10(3): 368-380 (2002)
1990 – 1999
- 1999
- [j11]Bernhard Suter, T. V. Lakshman, Dimitrios Stiliadis, Abhijit K. Choudhury:
Buffer management schemes for supporting TCP in gigabit routers with per-flow queueing. IEEE J. Sel. Areas Commun. 17(6): 1159-1169 (1999) - [c6]Santosh Krishnan, Abhijit K. Choudhury, Fabio M. Chiussi:
Dynamic Partitioning: A Mechanism for Shared-Memory Management. INFOCOM 1999: 144-152 - 1998
- [j10]Abhijit K. Choudhury, Ellen L. Hahne:
Dynamic queue length thresholds for shared-memory packet switches. IEEE/ACM Trans. Netw. 6(2): 130-140 (1998) - [c5]Bernhard Suter, T. V. Lakshman, Dimitrios Stiliadis, Abhijit K. Choudhury:
Design Considerations for Supporting TCP with Per-Flow Queueing. INFOCOM 1998: 299-306 - 1997
- [j9]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) - [j8]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
- [j7]Jack Brassil, Abhijit K. Choudhury, David M. Kristol, Aleta M. Lapone, Steven H. Low, Nicholas F. Maxemchuk, Lawrence O'Gorman:
SEPTEMBER - secure electronic publishing trial. IEEE Commun. Mag. 34(5): 48-55 (1996) - [j6]Abhijit K. Choudhury, Ellen L. Hahne:
New implementation of multi-priority pushout for shared memory ATM switches. Comput. Commun. 19(3): 245-256 (1996) - [c4]Abhijit K. Choudhury, Ellen L. Hahne:
Dynamic Queue Length Thresholds in a Shared Memory ATM Switch. INFOCOM 1996: 679-687 - 1995
- [j5]Abhijit K. Choudhury, Nicholas F. Maxemchuk, Sanjoy Paul
, Henning Schulzrinne:
Copyright protection for electronic publishing over computer networks. IEEE Netw. 9(3): 12-20 (1995) - [c3]Debashis Basak, Abhijit K. Choudhury, Ellen L. Hahne:
Sharing memory in multistage ATM switches. ICCCN 1995: 424 - 1994
- [j4]Jack Brassil, Abhijit K. Choudhury, Nicholas F. Maxemchuk:
The Manhattan Street Network: A High Performance, Highly Reliable Metropolitan Area Network. Comput. Networks ISDN Syst. 26(6-8): 841-858 (1994) - [j3]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) - [c2]Abhijit K. Choudhury, Ellen L. Hahne:
Buffer Management in a Hierarchical Shared Memory Switch. INFOCOM 1994: 1410-1419 - 1993
- [j2]Abhijit K. Choudhury, Victor O. K. Li:
An Approximate Analysis of the Performance of Deflection Routing in Regular Networks. IEEE J. Sel. Areas Commun. 11(8): 1302-1316 (1993) - 1992
- [j1]Ellen L. Hahne, Abhijit K. Choudhury, Nicholas F. Maxemchuk:
DQDB networks with and without bandwidth balancing. IEEE Trans. Commun. 40(7): 1192-1204 (1992) - 1990
- [c1]Ellen L. Hahne, Abhijit K. Choudhury, Nicholas F. Maxemchuk:
Improving the Fairness of Distributed-Queue-Dual-Bus Networks. INFOCOM 1990: 175-184
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-10-07 21:24 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:
