Perfect sets of paths in the full graph of SDN switches

DOI10.1134/S0361768821070033MaRDI QIDQ2064402zbMATH OpenOpenAlexFDO

Authors I. B. Burdonov, E. M. Vinarskii, N. V. Yevtushenko, A. S. Kossatchev

Publication date 5 January 2022

Published in Programming and Computer Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0361768821070033

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal consistent network updates in polynomial time
• An approximation algorithm for path computation and function placement in SDNs
• scientific article; zbMATH DE number 1332662
• On-line path computation and function placement in SDNs
• On-line path computation and function placement in SDNs

Cites work

• A survey of methods for constructing covering arrays
• Families of \(k\)-independent sets
• Structures and lower bounds for binary covering arrays

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: Perfect sets of paths in the full graph of SDN switches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064402)