105 research outputs found
Resilient routing in the internet
Although it is widely known that the Internet is not prone to random failures, unplanned failures due to
attacks can be very damaging. This prevents many organisations from deploying beneficial operations
through the Internet. In general, the data is delivered from a source to a destination via a series of
routers (i.e routing path). These routers employ routing protocols to compute best paths based on routing
information they possess. However, when a failure occurs, the routers must re-construct their routing
tables, which may take several seconds to complete. Evidently, most losses occur during this period.
IP Fast Re-Route (IPFRR), Multi-Topology (MT) routing, and overlays are examples of solutions
proposed to handle network failures. These techniques alleviate the packet losses to different extents,
yet none have provided optimal solutions. This thesis focuses on identifying the fundamental routing
problem due to convergence process. It describes the mechanisms of each existing technique as well as
its pros and cons. Furthermore, it presents new techniques for fast re-routing as follows.
Enhanced Loop-Free Alternates (E-LFAs) increase the repair coverage of the existing techniques,
Loop-Free Alternates (LFAs). In addition, two techniques namely, Full Fast Failure Recovery (F3R) and
fast re-route using Alternate Next Hop Counters (ANHC), offer full protection against any single link
failures. Nevertheless, the former technique requires significantly higher computational overheads and
incurs longer backup routes. Both techniques are proved to be complete and correct while ANHC neither
requires any major modifications to the traditional routing paradigm nor incurs significant overheads.
Furthermore, in the presence of failures, ANHC does not jeopardise other operable parts of the network.
As emerging applications require higher reliability, multiple failures scenarios cannot be ignored.
Most existing fast re-route techniques are able to handle only single or dual failures cases. This thesis
provides an insight on a novel approach known as Packet Re-cycling (PR), which is capable of handling
any number of failures in an oriented network. That is, packets can be forwarded successfully as long
as a path between a source and a destination is available. Since the Internet-based services and applications
continue to advance, improving the network resilience will be a challenging research topic for the
decades to come
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
International audienceThe Cologne-Twente Workshop (CTW) on Graphs and Combinatorial Optimization started off as a series of workshops organized bi-annually by either Köln University or Twente University. As its importance grew over time, it re-centered its geographical focus by including northern Italy (CTW04 in Menaggio, on the lake Como and CTW08 in Gargnano, on the Garda lake). This year, CTW (in its eighth edition) will be staged in France for the first time: more precisely in the heart of Paris, at the Conservatoire National d’Arts et Métiers (CNAM), between 2nd and 4th June 2009, by a mixed organizing committee with members from LIX, Ecole Polytechnique and CEDRIC, CNAM
Self-Evaluation Applied Mathematics 2003-2008 University of Twente
This report contains the self-study for the research assessment of the Department of Applied Mathematics (AM) of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente (UT). The report provides the information for the Research Assessment Committee for Applied Mathematics, dealing with mathematical sciences at the three universities of technology in the Netherlands. It describes the state of affairs pertaining to the period 1 January 2003 to 31 December 2008
Recommended from our members
Harnessing Simulated Data with Graphs
Physically accurate simulations allow for unlimited exploration of arbitrarily crafted environments. From a scientific perspective, digital representations of the real world are useful because they make it easy validate ideas. Virtual sandboxes allow observations to be collected at-will, without intricate setting up for measurements or needing to wait on the manufacturing, shipping, and assembly of physical resources. Simulation techniques can also be utilized over and over again to test the problem without expending costly materials or producing any waste.
Remarkably, this freedom to both experiment and generate data becomes even more powerful when considering the rising adoption of data-driven techniques across engineering disciplines. These are systems that aggregate over available samples to model behavior, and thus are better informed when exposed to more data. Naturally, the ability to synthesize limitless data promises to make approaches that benefit from datasets all the more robust and desirable.
However, the ability to readily and endlessly produce synthetic examples also introduces several new challenges. Data must be collected in an adaptive format that can capture the complete diversity of states achievable in arbitrary simulated configurations while too remaining amenable to downstream applications. The quantity and zoology of observations must also straddle a range which prevents overfitting but is descriptive enough to produce a robust approach. Pipelines that naively measure virtual scenarios can easily be overwhelmed by trying to sample an infinite set of available configurations. Variations observed across multiple dimensions can quickly lead to a daunting expansion of states, all of which must be processed and solved. These and several other concerns must first be addressed in order to safely leverage the potential of boundless simulated data.
In response to these challenges, this thesis proposes to wield graphs in order to instill structure over digitally captured data, and curb the growth of variables. The paradigm of pairing data with graphs introduced in this dissertation serves to enforce consistency, localize operators, and crucially factor out any combinatorial explosion of states. Results demonstrate the effectiveness of this methodology in three distinct areas, each individually offering unique challenges and practical constraints, and together showcasing the generality of the approach. Namely, studies observing state-of-the-art contributions in design for additive manufacturing, side-channel security threats, and large-scale physics based contact simulations are collectively achieved by harnessing simulated datasets with graph algorithms
- …