IEEE

Maximum Concurrent Flow Problem in MPLS-Based Software Defined Networks

Abstract: Multi-protocol label switching (MPLS) is supported by OpenFlow version 1.2 or higher and widely used in software defined networking (SDN) to achieve higher performance and flexibility. Due ...
GitHub

An interactive Dinic’s Algorithm visualizer that computes maximum flow in networks and shows flow distribution.

There was an error while loading. Please reload this page. Dinic’s Algorithm Visualizer 🚀: An interactive tool to visualize Dinic’s Algorithm for solving the ...
NextBigFuture

MIT, Yale and USC have a better max-flow algorithm which improve networks and logistics

The maximum-flow problem, or max flow, is one of the most basic problems in computer science. MIT researchers, together with colleagues at Yale and the University of Southern California, have ...
IEEE

Quantum Multi-Path Communication Protocol Based on Maximum Flow Theory

Abstract: Quantum networks are an actively researched and promising field, aiming to achieve efficient quantum information transmission by interconnecting quantum nodes. In large-scale quantum ...
Live Science

'Absurdly fast' algorithm solves 70-year-old logjam — speeding up network traffic in areas from airline scheduling to the internet

Network slowdowns could soon be a thing of the past, thanks to a superfast new algorithm. The breakthrough offers a dramatically faster solution to a problem that has been plaguing computer scientists ...