default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 29 matches
- 2005
- Hitesh Ballani, Paul Francis:
Towards a global IP anycast service. SIGCOMM 2005: 301-312 - Steve Bishop, Matthew Fairbairn, Michael Norrish, Peter Sewell, Michael Smith, Keith Wansbrough:
Rigorous specification and conformance testing techniques for network protocols, as applied to TCP, UDP, and sockets. SIGCOMM 2005: 265-276 - Sanjit Biswas, Robert Tappan Morris:
ExOR: opportunistic multi-hop routing for wireless networks. SIGCOMM 2005: 133-144 - Bob Briscoe, Arnaud Jacquet, Carla Di Cairano-Gilfedder, Alessandro Salvatori, Andrea Soppera, Martin Koyabe:
Policing congestion response in an internetwork using re-feedback. SIGCOMM 2005: 277-288 - Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasamy, Anthony LaMarca, Scott Shenker, Joseph M. Hellerstein:
A case study in building layered DHT applications. SIGCOMM 2005: 97-108 - Nick Feamster, Ramesh Johari, Hari Balakrishnan:
Implications of autonomy for the expressiveness of policy routing. SIGCOMM 2005: 25-36 - Timothy G. Griffin, João L. Sobrinho:
Metarouting. SIGCOMM 2005: 1-12 - Jahangir Hasan, T. N. Vijaykumar:
Dynamic pipelining: making IP-lookup truly scalable. SIGCOMM 2005: 205-216 - Qi He, Constantinos Dovrolis, Mostafa H. Ammar:
On the predictability of large transfer TCP throughput. SIGCOMM 2005: 145-156 - Martin Heusse, Franck Rousseau, Romaric Guillier, Andrzej Duda:
Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs. SIGCOMM 2005: 121-132 - Sushant Jain, Michael J. Demmer, Rabin K. Patra, Kevin R. Fall:
Using redundancy to cope with failures in a delay tolerant network. SIGCOMM 2005: 109-120 - Srikanth Kandula, Dina Katabi, Bruce S. Davie, Anna Charny:
Walking the tightrope: responsive yet stable traffic engineering. SIGCOMM 2005: 253-264 - Thomas Karagiannis, Konstantina Papagiannaki, Michalis Faloutsos:
BLINC: multilevel traffic classification in the dark. SIGCOMM 2005: 229-240 - Aleksandar Kuzmanovic:
The power of explicit congestion notification. SIGCOMM 2005: 61-72 - Anukool Lakhina, Mark Crovella, Christophe Diot:
Mining anomalies using traffic feature distributions. SIGCOMM 2005: 217-228 - Karthik Lakshminarayanan, Anand Rangarajan, Srinivasan Venkatachary:
Algorithms for advanced packet classification with ternary CAMs. SIGCOMM 2005: 193-204 - Boon Thau Loo, Joseph M. Hellerstein, Ion Stoica, Raghu Ramakrishnan:
Declarative routing: extensible routing with declarative queries. SIGCOMM 2005: 289-300 - Paul V. Mockapetris:
The internet and identifiers. SIGCOMM 2005: 325 - Sylvia Ratnasamy, Scott Shenker, Steven McCanne:
Towards an evolvable internet architecture. SIGCOMM 2005: 313-324 - Sean C. Rhea, Brighten Godfrey, Brad Karp, John Kubiatowicz, Sylvia Ratnasamy, Scott Shenker, Ion Stoica, Harlan Yu:
OpenDHT: a public DHT service and its uses. SIGCOMM 2005: 73-84 - Injong Rhee, Lisong Xu:
Limitations of equation-based congestion control. SIGCOMM 2005: 49-60 - Joel Sommers, Paul Barford, Nick G. Duffield, Amos Ron:
Improving accuracy in end-to-end packet loss measurement. SIGCOMM 2005: 157-168 - Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turner, John W. Lockwood:
Fast hash table lookup using extended bloom filter: an aid to network processing. SIGCOMM 2005: 181-192 - Lakshminarayanan Subramanian, Matthew Caesar, Cheng Tien Ee, Mark Handley, Zhuoqing Morley Mao, Scott Shenker, Ion Stoica:
HLP: a next generation inter-domain routing protocol. SIGCOMM 2005: 13-24 - Bernard Wong, Aleksandrs Slivkins, Emin Gün Sirer:
Meridian: a lightweight network location service without virtual coordinates. SIGCOMM 2005: 85-96 - Yong Xia, Lakshminarayanan Subramanian, Ion Stoica, Shivkumar Kalyanaraman:
One more bit is enough. SIGCOMM 2005: 37-48 - Kuai Xu, Zhi-Li Zhang, Supratik Bhattacharyya:
Profiling internet backbone traffic: behavior models and applications. SIGCOMM 2005: 169-180 - Xiaowei Yang, David Wetherall, Thomas E. Anderson:
A DoS-limiting network architecture. SIGCOMM 2005: 241-252 - Roch Guérin, Ramesh Govindan, Greg Minshall:
Proceedings of the ACM SIGCOMM 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Philadelphia, Pennsylvania, USA, August 22-26, 2005. ACM 2005, ISBN 1-59593-009-4 [contents]
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-30 08:11 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint