Zobrazeno 1 - 10
of 176
pro vyhledávání: '"Nick McKeown"'
Autor:
Israel Cidon, Sujata Banerjee, Sylvia Ratnasamy, Ethan Katz-Bassett, Ion Stoica, Arvind Krishnamurthy, David E. Culler, Scott Shenker, David Tennenhouse, Murphy McCauley, Ellen Zegura, Nick McKeown, Michael Schapira, Aurojit Panda, Amin Vahdat, Deborah Estrin, Hari Balakrishnan, Jennifer Rexford
Publikováno v:
ACM SIGCOMM Computer Communication Review. 51:18-24
There is now a significant and growing functional gap between the public Internet, whose basic architecture has remained unchanged for several decades, and a new generation of more sophisticated private networks. To address this increasing divergence
Publikováno v:
ACM SIGCOMM Computer Communication Review. 50:82-88
Controlling an opaque system by reading some "dials" and setting some "knobs," without really knowing what they do, is a hazardous and fruitless endeavor, particularly at scale. What we need are transparent networks, that start at the top with a high
Publikováno v:
SOSR
Transport protocols can be implemented in NIC (Network Interface Card) hardware to increase throughput, reduce latency and free up CPU cycles. If the ideal transport protocol were known, the optimal implementation would be simple: bake it into fixed-
Publikováno v:
Internet Measurement Conference
When developing a new networking algorithm, it is established practice to run a randomized experiment, or A/B test, to evaluate its performance. In an A/B test, traffic is randomly allocated between a treatment group, which uses the new algorithm, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3d4fd71acb6ee829cd114b68118f88f
http://arxiv.org/abs/2110.00118
http://arxiv.org/abs/2110.00118
Publikováno v:
ACM SIGCOMM Computer Communication Review. 49:92-95
We briefly describe the history behind the Ethane paper and its ultimate evolution into SDN and beyond.
Publikováno v:
ACM SIGCOMM Computer Communication Review. 49:69-74
The queueing delay faced by a packet is arguably the largest source of uncertainty during its journey. It therefore seems crucial that we understand how big the buffers should be in Internet routers. Our 2004 Sigcomm paper revisited the existing rule
Autor:
Oguz Sunay, Larry L. Peterson, Nick McKeown, Amin Vahdat, Thomas Anderson, Jennifer Rexford, Sachin Katti, Mahadev Satyanarayanan, Guru Parulkar
Publikováno v:
ACM SIGCOMM Computer Communication Review. 49:31-36
The cloud and telecommunications industry is in the midst of a transition towards the edge. There is a tremendous opportunity for the research community to influence this transformation, but doing so requires understanding industry momentum, and maki
Autor:
Chris Piech, Ana Saavedra, Nick McKeown, Eliška Šestáková, Lisa Yan, Baris Bozkurt, Lisa Einstein, Ondrej Guth
Publikováno v:
L@S
Programming is fast becoming a required skill set for students in every country. We present CS Bridge, a model for cross-border co-teaching of CS1, along with a corresponding open-source course-in-a-box curriculum made for easy localization. In the C
Autor:
Nick McKeown, Serhat Arslan
Publikováno v:
BS
Deployed congestion control algorithms rely on end hosts to figure out how congested the network is. Initially, for TCP, the congestion signal was packet drops; a binary signal that kicks in only after the congestion is well underway. More recently,
Publikováno v:
Performance Evaluation. 151:102232
Routers have packet buffers to reduce packet drops during times of congestion. It is important to correctly size the buffer: make it too small, and packets are dropped unnecessarily and the link may be underutilized; make it too big, and packets may