Zobrazeno 1 - 10
of 210
pro vyhledávání: '"McKeown, Nick"'
Autor:
Ibanez, Stephen, Mallery, Alex, Arslan, Serhat, Jepsen, Theo, Shahbaz, Muhammad, Kim, Changhoon, McKeown, Nick
Many recent papers have demonstrated fast in-network computation using programmable switches, running many orders of magnitude faster than CPUs. The main limitation of writing software for switches is the constrained programming model and limited sta
Externí odkaz:
http://arxiv.org/abs/2212.06658
The granularity of distributed computing is limited by communication time: there is no point in farming out smaller and smaller tasks if the communication overhead dominates the decrease in processing time due to the added parallelism. In this work,
Externí odkaz:
http://arxiv.org/abs/2204.12615
Autor:
Spang, Bruce, Hannan, Veronica, Kunamalla, Shravya, Huang, Te-Yuan, McKeown, Nick, Johari, Ramesh
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:
http://arxiv.org/abs/2110.00118
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
Externí odkaz:
http://arxiv.org/abs/2109.11693
Autor:
Ibanez, Stephen, Mallery, Alex, Arslan, Serhat, Jepsen, Theo, Shahbaz, Muhammad, McKeown, Nick, Kim, Changhoon
The nanoPU is a new networking-optimized CPU designed to minimize tail latency for RPCs. By bypassing the cache and memory hierarchy, the nanoPU directly places arriving messages into the CPU register file. The wire-to-wire latency through the applic
Externí odkaz:
http://arxiv.org/abs/2010.12114
Autor:
Sivaraman, Anirudh, Subramanian, Suvinay, Agrawal, Anurag, Chole, Sharad, Chuang, Shang-Tse, Edsall, Tom, Alizadeh, Mohammad, Katti, Sachin, McKeown, Nick, Balakrishnan, Hari
Switches today provide a small set of scheduling algorithms. While we can tweak scheduling parameters, we cannot modify algorithmic logic, or add a completely new algorithm, after the switch has been designed. This paper presents a design for a progr
Externí odkaz:
http://arxiv.org/abs/1602.06045
Autor:
Sivaraman, Anirudh, Budiu, Mihai, Cheung, Alvin, Kim, Changhoon, Licking, Steve, Varghese, George, Balakrishnan, Hari, Alizadeh, Mohammad, McKeown, Nick
Many algorithms for congestion control, scheduling, network measurement, active queue management, security, and load balancing require custom processing of packets as they traverse the data plane of a network switch. To run at line rate, these data-p
Externí odkaz:
http://arxiv.org/abs/1512.05023
To provide a better streaming experience, video clients today select their video rates by observing and estimating the available capacity. Recent work has shown that capacity estimation is fraught with difficulties because of complex interactions bet
Externí odkaz:
http://arxiv.org/abs/1401.2209
Autor:
Bosshart, Pat, Daly, Dan, Izzard, Martin, McKeown, Nick, Rexford, Jennifer, Schlesinger, Cole, Talayco, Dan, Vahdat, Amin, Varghese, George, Walker, David
P4 is a high-level language for programming protocol-independent packet processors. P4 works in conjunction with SDN control protocols like OpenFlow. In its current form, OpenFlow explicitly specifies protocol headers on which it operates. This set h
Externí odkaz:
http://arxiv.org/abs/1312.1719
Publikováno v:
Hot Interconnects V, Stanford University, August 1996; IEEE Micro Jan/Feb 1997, pp 26-33
The objective is to design and build a small, high-bandwidth switch.
Comment: 13 pages, 10 figures
Comment: 13 pages, 10 figures
Externí odkaz:
http://arxiv.org/abs/cs/9810006