Traditional network disruption approaches focus on disconnecting or lengthening paths in the network. We present a new framework for network disruption that attempts to reroute flow through critical vertices via vertex deletion, under the assumption that this will render those vertices vulnerable to future attacks. We define the load on a critical vertex to be the number of paths in the network...

Saul: "And it came to pass, when the evil spirit from God was upon Saul, that David took an harp* and played with his hand; so Saul was refreshed and was well, and the evil spirit departed from him." Music was a treatment for meflt3 diseases in ancient Egypt and Greec. The present interest in therapy dates from 1947. Sir SteUa Wilson, then Music Director of ^ Arts Council, pointed out tP, altho...

A comparative study of routing techniques is carried out for LEO constellations interconnecting high speed terrestrial networks assuming Poison and Self-Similar input traffic. Shortest path routing as well as optimal routing (flow deviation) methods are applied for balanced and unbalanced traffic load and for uniform and non uniform distribution of the earth stations. The performance of flow de...

Tracer responses in gas-liquid, two-phase flow through a fractured layer are discussed. Experiments were carried out using a glass bead bed in a cylinder. In the results, over a wide range of flow conditions of particle size, fluids-flow velocity, and water saturation (Sw), one of three types of liquidand gas-flow pattern was obtained: a single-phase (water) flow with entrapped gases, a bubble ...

We propose a modified version of the Flow Deviation method of Fratta, Gerla and Kleinrock to solve multicommodity problems with minimal congestion and a bounded number of active paths. We discuss the approximation of the min-max objective function by a separable convex potential function and give a mixed-integer non linear model for the constrained routing problem. A heuristic control of the pa...

3 Minimum cost network flow problem 5 3.1 Transportation problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 The maximum flow problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.3 The shortest path problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.4 The single source shortest paths . . . . . . . . . . . . . . . . ...

Datacenter networks typically have multiple paths connecting each host pair to achieve higher bisection bandwidth. However, existing transport and routing protocols have little support for multipath in the scale of a datacenter. We advocate to design practical datacenter architectures for easy operation, i.e., an architecture should be reliable, capable of improving bisection bandwidth, scalabl...

3 Minimum cost network flow problem 5 3.1 Transportation problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 The maximum flow problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.3 The shortest path problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.4 The single source shortest paths . . . . . . . . . . . . . . . . ...

TCP's burstiness is usually regarded as harmful, or at best, inconvenient. Instead, this thesis suggests a new perspective and examines whether TCP's burstiness is useful for certain applications. It claims that burstiness can be harnessed to insulate traffic from packet reordering caused by route change. We introduce the use of flowlets, a new abstraction for a burst of packets from a particul...

3 Minimum cost network flow problem 5 3.1 Transportation problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 The maximum flow problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.3 The shortest path problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.4 The single source shortest paths . . . . . . . . . . . . . . . . ...