Related papers: Fast emergency paths schema to overcome transient …
In operational networks, nodes are connected via multiple links for load sharing and redundancy. This is done to make sure that a failure of a link does not disconnect or isolate some parts of the network. However, link failures have an…
Routing in wireless meshes must detour around holes. Extant routing protocols often underperform in minimally connected networks where holes are larger and more frequent. Minimal density networks are common in practice due to deployment…
Multipath transport protocols like MPTCP transfer data across multiple routes in parallel and deliver it in order at the receiver. When the delay on one or more of the paths is variable, as is commonly the case, out of order arrivals are…
The past century of telecommunications has shown that failures in networks are prevalent. Although much has been done to prevent failures, network nodes and links are bound to fail eventually. Failure recovery processes are therefore…
Supercomputers getting ever larger and energy-efficient is at odds with the reliability of the used hardware. Thus, the time intervals between component failures are decreasing. Contrarily, the latencies for individual operations of…
Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, \textit{Forward Error Correction} (FEC) is applied across multiple independent…
To achieve fast recovery from link failures, most modern communication networks feature fully decentralized fast re-routing mechanisms. These re-routing mechanisms rely on pre-installed static re-routing rules at the nodes (the routers),…
The overwhelming majority of survivable (fault-tolerant) network design models assume a uniform scenario set. Such a scenario set assumes that every subset of the network resources (edges or vertices) of a given cardinality $k$ comprises a…
A fast and scalable iterative methodology for solving the security-constrained optimal power flow (SCOPF) problem is proposed using problem decomposition and the inverse matrix modification lemma. The SCOPF formulation tackles system…
A reliable and scalable mechanism to provide protection against a link or node failure has additional requirements in the context of SDN and OpenFlow. Not only it has to minimize the load on the controller, but it must be able to react even…
Interconnection networks are key actors that condition the performance of current large datacenter and supercomputer systems. Both topology and routing are critical aspects that must be carefully considered for a competitive system network…
The overwhelming majority of survivable (fault-tolerant) network design models assume a uniform fault model. Such a model assumes that every subset of the network resources (edges or vertices) of a given cardinality $k$ may fail. While this…
Realizing delay-capacity in intermittently connected mobile networks remains a largely open question, with state-of-the-art routing schemes typically focusing either on delay or on capacity. We show the feasibility of routing with both high…
Feedback dynamic routing is a commonly used control strategy in transportation systems. This class of control strategies relies on real-time information about the traffic state in each link. However, such information may not always be…
Erasure resilient FEC codes in off-line packetized streaming rely on time diversity. This requires unrestricted buffering time at the receiver. In real-time streaming the playback buffering time must be very short. Path diversity is an…
Energy saving is currently one of the most challenging issues for the Internet research community. Indeed, the exponential growth of applications and services induces a remarkable increase in power consumption and hence calls for novel…
Resilient operation of the power system during ongoing wildfires is challenging because of the uncertain ways in which the fires impact the electric power infrastructure (multiple arc-faults, complete melt-down). To address this challenge,…
In this work, we address reliable communication of low-latency packets in the presence of a full-duplex adversary that is capable of executing a jamming attack while also being able to measure the power levels on various frequency bands.…
Link capacity dimensioning is the periodic task where ISPs have to make provisions for sudden traffic bursts and network failures to assure uninterrupted operations. This provision comes in the form of link working capacities with…
This paper proposes a robust transient stability constrained optimal power flow problem that addresses renewable uncertainties by the coordination of generation re-dispatch and power flow router (PFR) tuning.PFR refers to a general type of…