Name
Abstract | ||
|---|---|---|
How many links can be cut before a network is bisected? What is the maximal bandwidth that can be pushed between two nodes of a network? These questions are closely related to network resilience, path choice for multipath routing or bisection bandwidth estimations in data centers. The answer is quantified using metrics such as the number of edge-disjoint paths between two network nodes and the cumulative bandwidth that can flow over these paths. In practice though, such calculations are far from simple due to the restrictive effect of network policies on path selection. Policies are set by network administrators to conform to service level agreements, protect valuable resources or optimize network performance. In this work, we introduce a general methodology for estimating lower and upper bounds for the policy-compliant path diversity and bisection bandwidth between two nodes of a network, effectively quantifying the effect of policies on these metrics. Exact values can be obtained if certain conditions hold. The approach is based on regular languages and can be applied in a variety of use cases. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/INFOCOM.2015.7218436 | 2015 IEEE Conference on Computer Communications (INFOCOM) |
Keywords | Field | DocType |
policy compliant path diversity,network resiliency,multipath routing,bisection bandwidth estimations,data center,edge disjoint paths,network policies | Average path length,Multipath routing,Computer science,Computer network,Node (networking),Bisection bandwidth,Dynamic bandwidth allocation,Network traffic control,Bandwidth management,Distributed computing,Network performance | Conference |
Volume | ISSN | Citations |
abs/1611.02842 | 0743-166X | 5 |
PageRank | References | Authors |
0.41 | 15 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rowan Klöti | 1 | 44 | 3.14 |
| Vasileios Kotronis | 2 | 142 | 12.38 |
| Bernhard Ager | 3 | 381 | 21.20 |
| Xenofontas Dimitropoulos | 4 | 1015 | 79.84 |