On Analysis of Traffic Flow Demultiplexing Effectiveness

DOI10.18255/1818-1015-2019-1-170-190OpenAlexW2921649344MaRDI QIDQ5866325

Evgeniĭ Pavlovich Stepanov

Publication date: 21 September 2022

Published in: Modeling and Analysis of Information Systems (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mais671

zbMATH Keywords

quality of servicemultipath routingMPTCP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)

Cites Work

• A note on two problems in connexion with graphs
• Adjoint and self-adjoint boundary value problems on a geometric graph
• Neighbor set for the existence of \((g,f,n)\)-critical graphs
• A quick method for finding shortest pairs of disjoint paths

This page was built for publication: On Analysis of Traffic Flow Demultiplexing Effectiveness