Fast Rerouting Against Multi-Link Failures Without Topology Constraint - 2018


Multi-link failures might incur heavy packet loss and degrade the network performance. Fast rerouting has been proposed to address this issue by enabling routing protections. However, the effectiveness and potency issues of fast rerouting are not well addressed. In particular, the protection performance of existing approaches isn't satisfactory whether or not the overhead is high, and topology constraints need to be met for the approaches to realize a whole protection. To optimize the efficiency, we tend to first answer the question that whether label-free routing will provide a complete protection against arbitrary multi-link failures in any networks. We propose a model for interface-specific-routing that will be seen as a general label-free routing. We tend to analyze the conditions underneath that a multi-link failure will induce routing loops. And then, we tend to present that there exist some networks in that no interface-specific-routing (ISR) will be created to shield the routing against any k-link failures (k = 2). Then, we tend to propose a tunneling on demand (TOD) approach, that covers most failures with ISR, and activate tunneling solely when failures can't be detoured around by ISR. We tend to develop algorithms to compute ISR properly so as to minimize the quantity of activated tunnels, and compute the protection tunnels if necessary. We prove that TOD will defend routing against any single-link failures and twin-link failures. We tend to evaluate TOD by simulations with real-world topologies. The results show that TOD will achieve a near one hundredp.c protection ratio with small tunneling overhead for multi-link failures, creating a better tradeoff than the state-of-the-art label-based mostly approaches.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :In-Memory Stream Indexing of Massive and Fast Incoming Multimedia Content - 2018ABSTRACT:In this text, a media storm indexing mechanism is presented, where media storms are outlined as quick incoming batches. We
PROJECT TITLE :Fast Low-Rank Bayesian Matrix Completion With Hierarchical Gaussian Prior Models - 2018ABSTRACT:The problem of low-rank matrix completion is taken into account in this Project. To use the underlying low-rank structure
PROJECT TITLE :A Fast Converging Channel Estimation Algorithm for Wireless Sensor Networks - 2018ABSTRACT:A group-membership affine projection algorithm is proposed which will estimate a complicated-valued channel matrix using
PROJECT TITLE :Fast Cell Discovery in mm-Wave 5G Networks with Context Information - 2018ABSTRACT:The exploitation of mm-wave bands is one amongst the key-enabler for 5G mobile radio networks. However, the introduction of mm-wave
PROJECT TITLE :Fast and Reliable Restoration Method of Virtual Resources on OpenStack - 2018ABSTRACT:We propose a quick and reliable restoration technique of virtual resources on OpenStack when physical servers or virtual machines

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry