Top results
balaji prabhakar coping with (exploiting) heavy tails balaji prabhakar departments of ee and cs stanford university [email protected] copyright 1999. all rights reserved…
balaji prabhakar ee384m network algorithms outline what is an internet router? what limits performance: memory access time the early days: modified computers programmable…
on horrible tcp performance over underwater links balaji prabhakar abdul kabbani, balaji prabhakar stanford university in defense of tcp balaji prabhakar abdul kabbani, balaji…
slide 1balaji prabhakar active queue management and bandwidth partitioning algorithms balaji prabhakar departments of ee and cs stanford university [email protected] slide…
scheduling multicast cells in an input-queued switch * nick mckeown departments of ee cs stanford university. email: [email protected]. abstract in this paper we consider…
slide 1 mohammad alizadeh adel javanmard and balaji prabhakar stanford university analysis of dctcp: stability, convergence, and fairness data center packet transport transport…
slide 1 balaji prabhakar mohammad alizadeh, abdul kabbani, and berk atikoglu stanford university stability analysis of qcn: the averaging principle outline quantized congestion…
ee384x: packet switch architectures handout 1: logistics and introduction professor balaji prabhakar [email protected] professor nick mckeown [email protected] outline…
an overview and a proposal jan 24, 2007 balaji prabhakar balaji prabhakar stanford university copyright 1999. all rights reserved outline a framework for congestion control…
load balancing with memory michael mitzenmacher harvard university [email protected] balaji prabhakar stanford university [email protected] devavrat shah stanford…
qcn: stably improving transient response abdul kabbani, rong pan, balaji prabhakar and mick seaman hig h p er fo rma n ce s witc h in g an d rou ti n g te leco m ce nter…
queueing syst 2012 71:247–292 doi 10.1007s11134-012-9311-0 asymptotic independence of queues under randomized load balancing maury bramson · yi lu · balaji prabhakar…
slide 1 slide 2 adaptive playout scheduling using time-scale modification yi liang, nikolaus färber bernd girod, balaji prabhakar slide 3 yi liangadaptive audio playout…
balaji prabhakar and mendel rosenblum departments of ee and cs, stanford self-‐driving networks 1960s—2000: packet-‐switching…
modern queueing theory, and internet address allocation clean slate workshop march 21, 2007 balaji prabhakar 21st century queueing theory, and internet address allocation…
proofs of the parisi and coppersmith-sorkin conjectures for the finite random assignment problem chandra nair balaji prabhakar mayank sharma stanford university. mchandra,balaji,[email protected]…
ee384x: packet switch architectures handout 1: logistics and introduction professor balaji prabhakar [email protected] professor nick mckeown [email protected] outline…
ieeeacm transactions on networking vol 13 no 5 october 2005 975 shrink: a method for enabling scaleable performance prediction and efficient network simulation rong pan balaji…
www.transformingtransportation.org a big data platform for things that move balaji prabhakar professor, stanford university and co-founder, urban engines presented at transforming…
network processor algorithms: design and analysis stochastic networks conference montreal july 22, 2004 balaji prabhakar balaji prabhakar stanford university copyright 1999.…