55 citations · 300 across the 28 of their papers we have counts for
3 papers · 1 filter
Indirect Coflow Scheduling
Alexander Lindermayr, Kirk Pruhs, Andréa W. Richa +1
We consider routing in reconfigurable networks, which is also known as coflow scheduling in the literature. The algorithmic literature generally (perhaps implicitly) assumes that t…
Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands
Anya Chaturvedi, Chandra Chekuri, Mengxue Liu +4
Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem -- the all-or-nothing multicommodity flo…
AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming
Andrea Richa, Christian Scheideler, Stefan Schmid +1
Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often simple and…