Destroying networks for fun (and profit)

Shelly, Nick; Tschaen, Brendan; Förster, Klaus-Tycho; Chang, Michael Alan; Benson, Theophilus; Vanbever, Laurent

doi:10.1145/2834050.2834099

Cited by 14 publications

(3 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Encouraged by the success of testing techniques in distributed systems, Shelly et al [167] designed and implemented Armageddon [168], which introduces systematic chaos into SDN networks. Armageddon introduces failures (e.g., some ports being down) without violating network invariants.…”

Section: Techniques For Networkmentioning

confidence: 99%

A Survey on Network Verification and Testing With Formal Methods: Approaches and Challenges

Yin

Wang

et al. 2019

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Networks have grown increasingly complicated. Violations of intended policies can compromise network availability and network reliability. Network operators need to ensure that their policies are correctly implemented. This has inspired a research field, network verification and testing, that enables users to automatically detect bugs and systematically reason their network. Furthermore, techniques ranging from formal modeling to verification and testing have been applied to help operators build reliable systems in electronic design automation and software. Inspired by its success, network verification has recently seen increased attention in the academic and industrial communities. As an area of current interest, it is an interdisciplinary subject (with fields including formal methods, mathematical logic, programming languages, and networks), making it daunting for a nonprofessional. We perform a comprehensive survey on well-developed methodologies and tools for data plane verification, control plane verification, data plane testing and control plane testing. This survey also provides lessons gained from existing solutions and a perspective of future research developments.

show abstract

Section: Techniques For Networkmentioning

confidence: 99%

A Survey on Network Verification and Testing With Formal Methods: Approaches and Challenges

Yin

Wang

et al. 2019

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

show abstract

“…Network administrators must know whether the network is correct [24], e.g., whether destination t is reachable from source s, or whether the forwarding rules present in the network imply that packets may potentially be sent in a cycle. Often such network properties are checked by constantly sending probe packets into the network, or, alternatively, by sending the state of all nodes in the network to a central location where all the data is then verified.…”

Section: Introductionmentioning

confidence: 99%

Local checkability, no strings attached

Foerster

Luedi

Seidel

et al. 2016

Proceedings of the 17th International Conference on Distributed Computing and Networking

View full text Add to dashboard Cite

In this work we study local checkability of network properties like s-t reachability, or whether the network is acyclic or contains a cycle. A structural property S of a graph G is locally checkable, if there is a prover-and-verifier pair (P, V) as follows. The prover P assigns a label to each node in graphs satisfying S. The verifier V is a constant time distributed algorithm that returns Yes at all nodes if G satisfies S and was labeled by P, and No for at least one node if G does not satisfy S, regardless of the node labels. The quality of (P, V) is measured in terms of the label size.We obtain (asymptotically) tight bounds for the bit complexity of the latter two problems for undirected as well as directed networks, where in the directed case we consider one-way and two-way communication, i.e., we distinguish whether communication is possible only in the edge direction or not. For the one-way case we obtain a new asymptotically tight lower bound for the bit complexity of s-t reachability. For the two-way case we devise an emulation technique that allows us to transfer a previously known s-t reachability upper bound without asymptotic loss in the bit complexity. CCS ConceptsNetworks → Network properties; Computer systems organization → Dependable and fault-tolerant systems and networks; Theory of computation → Models of computation; Computing methodologies → Distributed computing methodologies;

show abstract

“…Although most DCN topologies are symmetrical, in practice, DCNs turn out to be often asymmetrical because of frequent failures of network elements (e.g., switches, links, and ports); for example, up to 40 link failures per day [15,16]. However, the performance of some load-balancing schemes depending on symmetrical characteristic of topology deteriorates significantly under asymmetrical topologies (e.g., equal-cost multi-path (ECMP) [3] and Presto [8]).…”

mentioning

confidence: 99%

QALL: Distributed Queue-Behavior-Aware Load Balancing Using Programmable Data Planes

Liu,

Cai,

Ling

et al. 2024

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Existing load-balancing methods used in data center networks involve some shortcomings such as excessively large decision delays during reactions to microbursts and large overheads involved in active probing. Programmable data planes have provided new opportunities for local decision-making on switches to address these issues. We observe that queue behavior (i.e., queue occupancy, queuing trend, and dequeue time interval) in switches can reflect the current or future congestion degree on a network. Furthermore, following data-driven experiments, we found an accurate fitting function of congestion degree to queue behavior. Thus, we propose an in-network load-balancing scheme based on a programmable switch, called queue-behavior-aware localized load balancing (QALL). In QALL, each switch independently selects egress ports probabilistically according to fine-grained-measured local queue behavior. The key concept of QALL is to take account the evolutionary process of reaching the current queue state into its decision basis for load balancing. Experimental results under actual DCN workloads (including web search and data mining workloads) demonstrate the effectiveness of QALL. In terms of flow completion time, decision delay, network shock, load sharing accuracy, and packet reordering, QALL outperformed recent perpacket (DRILL), per-flowlet (LetFlow and CONGA), and per-flow (ECMP) load balancers, particularly under heavy load. For example, under asymmetrical topology with 90% load level, the flow completion time of QALL was lower than that of ECMP, LetFlow, CONGA, and DRILL by up to 54.7%, 46.5%, 38.9%, and 18.9%, respectively.

show abstract

Destroying networks for fun (and profit)

Cited by 14 publications

References 25 publications

A Survey on Network Verification and Testing With Formal Methods: Approaches and Challenges

A Survey on Network Verification and Testing With Formal Methods: Approaches and Challenges

Local checkability, no strings attached

QALL: Distributed Queue-Behavior-Aware Load Balancing Using Programmable Data Planes

Contact Info

Product

Resources

About