Advanced search
1 file | 450.01 KB

Policy-compliant maximum network flows

Pieter Audenaert (UGent) , Didier Colle (UGent) and Mario Pickavet (UGent)
(2019) APPLIED SCIENCES-BASEL. 9(5). p.1-16
Author
Organization
Abstract
Computer network administrators are often interested in the maximal bandwidth that can be achieved between two nodes in the network, or how many edges can fail before the network gets disconnected. Classic maximum flow algorithms that solve these problems are well-known. However, in practice, network policies are in effect, severely restricting the flow that can actually be set up. These policies are put into place to conform to service level agreements and optimize network throughput, and can have a large impact on the actual routing of the flows. In this work, we model the problem and define a series of progressively more complex conditions and algorithms that calculate increasingly tighter bounds on the policy-compliant maximum flow using regular expressions and finite state automata. To the best of our knowledge, this is the first time that specific conditions are deduced, which characterize how to calculate policy-compliant maximum flows using classic algorithms on an unmodified network.
Keywords
communication networks, maximum flow, network policies, algorithms

Downloads

  • 7398.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 450.01 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Audenaert, Pieter, Didier Colle, and Mario Pickavet. 2019. “Policy-compliant Maximum Network Flows.” Applied Sciences-basel 9 (5): 1–16.
APA
Audenaert, P., Colle, D., & Pickavet, M. (2019). Policy-compliant maximum network flows. APPLIED SCIENCES-BASEL, 9(5), 1–16.
Vancouver
1.
Audenaert P, Colle D, Pickavet M. Policy-compliant maximum network flows. APPLIED SCIENCES-BASEL. Basel: Mdpi; 2019;9(5):1–16.
MLA
Audenaert, Pieter, Didier Colle, and Mario Pickavet. “Policy-compliant Maximum Network Flows.” APPLIED SCIENCES-BASEL 9.5 (2019): 1–16. Print.
@article{8612871,
  abstract     = {Computer network administrators are often interested in the maximal bandwidth that can be achieved between two nodes in the network, or how many edges can fail before the network gets disconnected. Classic maximum flow algorithms that solve these problems are well-known. However, in practice, network policies are in effect, severely restricting the flow that can actually be set up. These policies are put into place to conform to service level agreements and optimize network throughput, and can have a large impact on the actual routing of the flows. In this work, we model the problem and define a series of progressively more complex conditions and algorithms that calculate increasingly tighter bounds on the policy-compliant maximum flow using regular expressions and finite state automata. To the best of our knowledge, this is the first time that specific conditions are deduced, which characterize how to calculate policy-compliant maximum flows using classic algorithms on an unmodified network.},
  articleno    = {863},
  author       = {Audenaert, Pieter and Colle, Didier and Pickavet, Mario},
  issn         = {2076-3417},
  journal      = {APPLIED SCIENCES-BASEL},
  language     = {eng},
  number       = {5},
  pages        = {863:1--863:16},
  publisher    = {Mdpi},
  title        = {Policy-compliant maximum network flows},
  url          = {http://dx.doi.org/10.3390/app9050863},
  volume       = {9},
  year         = {2019},
}

Altmetric
View in Altmetric
Web of Science
Times cited: