We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministi...
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for sh...
Idris A. Rai, Guillaume Urvoy-Keller, Mary K. Vern...
Recently, several studies have analyzed the statistical properties of low power wireless links in real environments, clearly demonstrating the differences between experimentally o...
Alberto Cerpa, Jennifer L. Wong, Miodrag Potkonjak...
— Wireless routers equipped with smart antennas are capable of forming beams to neighboring devices to transmit/receive multiple packets simultaneously, hence achieving high netw...
This paper analyzes the asymptotic behavior of packet-train probing over a multi-hop network path carrying arbitrarily routed bursty cross-traffic flows. We examine the statistical...
Xiliang Liu, Kaliappa Nadar Ravindran, Dmitri Logu...