Остановите войну!
for scientists:
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 26 matches
- 2002
- Aditya Akella, Srinivasan Seshan, Richard M. Karp, Scott Shenker, Christos H. Papadimitriou:
Selfish behavior and stability of the internet: a game-theoretic analysis of TCP. SIGCOMM 2002: 117-130 - Suman Banerjee, Bobby Bhattacharjee, Christopher Kommareddy:
Scalable application layer multicast. SIGCOMM 2002: 205-217 - Anindya Basu, Chih-Hao Luke Ong, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong:
Route oscillations in I-BGP with route reflection. SIGCOMM 2002: 235-247 - Micah Beck, Terry Moore, James S. Plank:
An end-to-end approach to globally scalable network storage. SIGCOMM 2002: 339-346 - John W. Byers, Jeffrey Considine, Michael Mitzenmacher, Stanislav Rost:
Informed content delivery across adaptive overlay networks. SIGCOMM 2002: 47-60 - Kenneth L. Calvert, Jim Griffioen, Su Wen:
Lightweight network support for scalable end-to-end services. SIGCOMM 2002: 265-278 - David D. Clark, John Wroclawski, Karen R. Sollins, Robert Braden:
Tussle in cyberspace: defining tomorrow's internet. SIGCOMM 2002: 347-356 - Edith Cohen, Scott Shenker:
Replication strategies in unstructured peer-to-peer networks. SIGCOMM 2002: 177-190 - Cristian Estan, George Varghese:
New directions in traffic measurement and accounting. SIGCOMM 2002: 323-336 - Timothy Griffin, Gordon T. Wilfong:
On the correctness of IBGP configuration. SIGCOMM 2002: 17-29 - Sundar Iyer, Rui Zhang, Nick McKeown:
Routers with a single stage of buffering. SIGCOMM 2002: 251-264 - Manish Jain, Constantinos Dovrolis:
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput. SIGCOMM 2002: 295-308 - Dina Katabi, Mark Handley, Charles E. Rohrs:
Congestion control for high bandwidth-delay product networks. SIGCOMM 2002: 89-102 - Angelos D. Keromytis, Vishal Misra, Dan Rubenstein:
SOS: secure overlay services. SIGCOMM 2002: 61-72 - Michael Luby, Vivek K. Goyal, Simon Skaria, Gavin B. Horn:
Wave and equation based rate control using multicast round trip time. SIGCOMM 2002: 191-204 - Olaf Maennel, Anja Feldmann:
Realistic BGP traffic for test labs. SIGCOMM 2002: 31-44 - Ratul Mahajan, David Wetherall, Thomas E. Anderson:
Understanding BGP misconfiguration. SIGCOMM 2002: 3-16 - Zhuoqing Morley Mao, Ramesh Govindan, George Varghese, Randy H. Katz:
Route flap damping exacerbates internet routing convergence. SIGCOMM 2002: 221-233 - Alberto Medina, Nina Taft, Kavé Salamatian, Supratik Bhattacharyya, Christophe Diot:
Traffic matrix estimation: existing techniques and new directions. SIGCOMM 2002: 161-174 - Neil T. Spring, Ratul Mahajan, David Wetherall:
Measuring ISP topologies with rocketfuel. SIGCOMM 2002: 133-145 - Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana:
Internet indirection infrastructure. SIGCOMM 2002: 73-86 - Hongsuda Tangmunarunkit, Ramesh Govindan, Sugih Jamin, Scott Shenker, Walter Willinger:
Network topology generators: degree-based vs. structural. SIGCOMM 2002: 147-159 - Milan Vojnovic, Jean-Yves Le Boudec:
On the long-run behavior of equation-based rate control. SIGCOMM 2002: 103-116 - Jun (Jim) Xu, Richard J. Lipton:
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. SIGCOMM 2002: 279-292 - Yin Zhang, Lee Breslau, Vern Paxson, Scott Shenker:
On the characteristics and origins of internet flow rates. SIGCOMM 2002: 309-322 - Matthew Mathis, Peter Steenkiste, Hari Balakrishnan, Vern Paxson:
Proceedings of the ACM SIGCOMM 2002 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 19-23, 2002, Pittsburgh, PA, USA. ACM 2002, ISBN 1-58113-570-X [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-04-26 18:13 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