Computing Minimal Update Sequences for Graceful Router-Wide Reconfigurations


Manageability and high availability are essential properties for IP networks. Unfortunately, with link-state routing protocols commonly employed in such networks, topological changes result in transient forwarding loops inducing service disruption. This reduces the frequency at which operators can adapt their network. Previous works proved that it's possible to avoid disruptions thanks to the planned reconfiguration of a link by progressively changing its weight, leading to a answer that does not need changing protocol specification. In this paper, we tend to study the additional general problem of gracefully modifying the logical state of multiple interfaces of a router, while minimizing the amount of weight updates. Compared to single-link modifications, the router update downside is k-dimensional for a router having k neighbors. We have a tendency to also show that multidimensional updates might trigger new sorts of disruptions that create the problem additional difficult than the only-link case. We have a tendency to then gift and evaluate efficient algorithms that compute minimal sequences of weights enabling disruption-free router reconfigurations. Based mostly on analysis of real IP network topologies, we have a tendency to show that each the scale of such sequences and the computing time taken by our algorithms are limited.

Did you like this research project?

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

PROJECT TITLE :Big Data Based Security Analytics for Protecting Virtualized Infrastructures in Cloud Computing - 2018ABSTRACT:Virtualized infrastructure in cloud computing has become an enticing target for cyberattackers to
PROJECT TITLE :Exploiting Non-Causal CPU-State Information for Energy-Efficient Mobile Cooperative Computing - 2018ABSTRACT:Scavenging the idling computation resources at the large variety of mobile devices, ranging from tiny
PROJECT TITLE :Computation Rate Maximization for Wireless Powered Mobile-Edge Computing With Binary Computation Offloading - 2018ABSTRACT:Finite battery lifetime and low computing capability of size-constrained wireless devices
PROJECT TITLE :Channel Estimation for TDD/FDD Massive MIMO Systems With Channel Covariance Computing - 2018ABSTRACT:In this Project, we have a tendency to propose a new channel estimation scheme for TDD/FDD large MIMO systems
PROJECT TITLE :Joint Resource Allocation for Software-Defined Networking, Caching, and Computing - 2018ABSTRACT:Although some glorious works have been done on networking, caching, and computing, these 3 important areas have traditionally

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

Project Enquiry