activity
20102022
most citedA versatile and accurate approximation for LRU cache performance

265 citations · 328 across the 12 of their papers we have counts for

collaborators

12 papers

cs.NI2022★ 2 cited

Size-based scheduling vs fairness for datacenter flows: a queuing perspective

James Roberts, Dario Rossi

Contrary to the conclusions of a recent body of work where approximate shortest remaining processing time first (SRPT) flow scheduling is advocated for datacenter networks, this pa…

cs.NI2020★ 2 cited

Performance Benchmarking of State-of-the-Art Software Switches for NFV

Tianzhu Zhang, Leonardo Linguaglossa, Paolo Giaccone +2

With the ultimate goal of replacing proprietary hardware appliances with Virtual Network Functions (VNFs) implemented in software, Network Function Virtualization (NFV) has been ga…

cs.NI2019

Cache Subsidies for an Optimal Memory for Bandwidth Tradeoff in the Access Network

Mahdieh Ahmadi, James Roberts, Emilio Leonardi +1

While the cost of the access network could be considerably reduced by the use of caching, this is not currently happening because content providers (CPs), who alone have the detail…

cs.NI2019★ 5 cited

Impact of Traffic Characteristics on Request Aggregation in an NDN Router

Mahdieh Ahmadi, James Roberts, Emilio Leonardi +1

The paper revisits the performance evaluation of caching in a Named Data Networking (NDN) router where the content store (CS) is supplemented by a pending interest table (PIT). The…

cs.NI2014★ 8 cited

Multi-resource fairness: Objectives, algorithms and performance

Thomas Bonald, James Roberts

Designing efficient and fair algorithms for sharing multiple resources between heterogeneous demands is becoming increasingly important. Applications include compute clusters share…

cs.NI2013★ 22 cited

Exploring the Memory-Bandwidth Tradeoff in an Information-Centric Network

James Roberts, Nada Sbihi

An information-centric network should realize significant economies by exploiting a favourable memory-bandwidth tradeoff: it is cheaper to store copies of popular content close to…