Why (and how) networks should run themselves

N Feamster, J Rexford - arXiv preprint arXiv:1710.11583, 2017 - arxiv.org
The proliferation of networked devices, systems, and applications that we depend on every
day makes managing networks more important than ever. The increasing security …

Optimizing virtual backup allocation for middleboxes

Y Kanizo, O Rottenstreich, I Segall… - IEEE/ACM Transactions …, 2017 - ieeexplore.ieee.org
In enterprise networks, network functions, such as address translation, firewall, and deep
packet inspection, are often implemented in middleboxes. Those can suffer from temporary …

Bloom filter with a false positive free zone

SZ Kiss, É Hosszu, J Tapolcai, L Rónyai… - … on Network and …, 2021 - ieeexplore.ieee.org
Bloom filters and their variants are widely used as space-efficient probabilistic data
structures for representing sets and are very popular in networking applications. They …

Mobility management for intro/inter domain handover in software-defined networks

Y Bi, G Han, C Lin, M Guizani… - IEEE Journal on Selected …, 2019 - ieeexplore.ieee.org
To provide satisfactory Quality of Service (QoS) on the move, efficient mobility management
is indispensable to provide mobile users with seamless and ubiquitous wireless …

RDNA: Residue-defined networking architecture enabling ultra-reliable low-latency datacenters

A Liberato, M Martinello, RL Gomes… - … on Network and …, 2018 - ieeexplore.ieee.org
Datacenter (DC) design has been moved toward the edge computing paradigm motivated
by the need of bringing cloud resources closer to end users. However, the software defined …

Enforcing fairness in blockchain transaction ordering

A Orda, O Rottenstreich - Peer-to-peer Networking and Applications, 2021 - Springer
In Blockchain networks involving multiple applications, the quality of service of an
application is affected by the transaction ordering. For instance, upon issuing payment …

Avoiding flow size overestimation in Count-Min sketch with Bloom filter constructions

O Rottenstreich, P Reviriego, E Porat… - … on Network and …, 2021 - ieeexplore.ieee.org
The Count-Min sketch is the most popular data structure for flow size estimation, a basic
measurement task required in many networks. Typically the number of potential flows is …

Revive: A reliable software defined data plane failure recovery scheme

I Haque, MA Moyeen - 2018 14th International Conference on …, 2018 - ieeexplore.ieee.org
In Software-Defined Networking (SDN) links and switches (nodes) from data plane suffer
from failure and impact network operations. In the presence of such failures, switches can …

Constructions and applications for accurate counting of the bloom filter false positive free zone

O Rottenstreich, P Reviriego, E Porat… - Proceedings of the …, 2020 - dl.acm.org
Bloom filters are used in many networking applications to answer set membership queries at
low cost but suffer from false positives. We study Bloom filter constructions that when …

BigMaC: Reactive network-wide policy caching for SDN policy enforcement

B Yan, Y Xu, HJ Chao - IEEE Journal on Selected Areas in …, 2018 - ieeexplore.ieee.org
Enforcing network policies is critical for service deployments over software-defined networks
(SDN). Most existing studies suggest proactively compiling policies into flow entries in the …