Michael Borokhovich

Michael Borokhovich

Auto-generated profile, based on publicly available information

Michael Borokhovich

Sunnyvale, CA USA

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 January 2021 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
MCMarco Chiesa
Marco Chiesa
RSRoshan Sedar
Roshan Sedar
GAGianni Antichi
Gianni Antichi
MBMichael Borokhovich
Michael Borokhovich
AKAndrzej Kamisinski
Andrzej Kamisinski
SSStefan Schmid
Stefan Schmid
Highly dependable communication networks usually rely on some kind of Fast Re-Route (FRR) mechanism which allows to quickly re-route traffic upon failures, entirely in the data plane. This paper studies the design of FRR mechanisms for emerging reconfigurable switches. Our main contribution is an FRR primitive for programmable data planes, PURR, which provides low failover latency and high switch throughput, by avoiding packet recirculation. PURR tolerates multiple concurrent failures and comes with minimal memory requirements, ensuring compact forwarding tables, by unveiling an intriguing connection to classic ``string theory'' (i.e., stringology), and in particular, the shortest common supersequence problem. PURR is well-suited for high-speed match-action forwarding architectures (e.g., PISA) and supports the implementation of a broad variety of FRR mechanisms. Our simulations and prototype implementation (on an FPGA and a Tofino switch) show that PURR improves TCAM memory occupancy by a factor of 1.5x-10.8x compared to a naïve encoding when implementing state-of-the-art FRR mechanisms. PURR also improves the latency and throughput of datacenter traffic up to a factor of 2.8x-5.5x and 1.2x-2x, respectively, compared to approaches based on recirculating packets.

7 August 2018
Verified
Conference Paper
Open access
RSRoshan Sedar
Roshan Sedar
MBMichael Borokhovich
Michael Borokhovich
MCMarco Chiesa
Marco Chiesa
GAGianni Antichi
Gianni Antichi
SSStefan Schmid
Stefan Schmid

28 September 2018 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Open access
MBMichael Borokhovich
Michael Borokhovich
YPYvonne-Anne Pignolet
Yvonne-Anne Pignolet
SSStefan Schmid
Stefan Schmid
GTGilles Tredan
Gilles Tredan
Reliable and highly available computer networks must implement resilient fast rerouting mechanisms: upon a link or node failure, an alternative route is determined quickly, without involving the network control plane. Designing such fast failover mechanisms capable of dealing with multiple concurrent failures, however, is challenging, as failover rules need to be installed proactively, i.e., ahead of time, without knowledge of the actual failures happening at runtime. Indeed, only little is known today about the design of resilient routing algorithms. This paper introduces a general framework to reason about and design local failover algorithms that minimize the resulting load after failover on dense networks, beyond destination-based routing. We show that due to the inherent locality of the failover decisions at runtime, the problem is fundamentally related to the field of distributed algorithms without coordination. We derive an intriguing lower bound on the inherent network load overhead any local fast failover scheme that will introduce in the worst case, even though globally seen, much more balanced traffic allocations exist. We then present different randomized and deterministic failover algorithms and analyze their overhead load. In particular, we build upon the theory of combinatorial designs and develop a novel deterministic failover mechanism based on symmetric block design theory, which tolerates a maximal number of link failures while ensuring low loads.

1 January 2017 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
CAChen Avin
Chen Avin
MBMichael Borokhovich
Michael Borokhovich
ZLZvi Lotker
Zvi Lotker
DPDavid Peleg
David Peleg

1 June 2015 in Theoretical Computer Science
Verified
Journal Article
Closed access
CAChen Avin
Chen Avin
MBMichael Borokhovich
Michael Borokhovich
BHBernhard Haeupler
Bernhard Haeupler
ZLZvi Lotker
Zvi Lotker

6 January 2013
Verified
Conference Paper
Closed access
CAChen Avin
Chen Avin
MBMichael Borokhovich
Michael Borokhovich
YHYoram Haddad
Yoram Haddad
EKErez Kantor
Erez Kantor
ZLZvi Lotker
Zvi Lotker
DPDavid Peleg
David Peleg