DIVERSE ROUTING IN NETWORKS WITHOUT DISJOINTNESS CONSTRAINT USING PROBABILISTIC FAILURES

Abstract

To develop a various routing theme for coping with multiple, presumably related to failures. Isolated single link failures is effectively restrained disjoint path protection, however mechanisms for sick from multiple failures isn't warranted. especially, events like natural disasters or intentional attacks will result in multiple related to failures, that recovery mechanisms don't seem to be well understood. so as to agitate these problems, a probabilistic read of network failures are created wherever multiple failure events will occur at the same time, and supported this, sure algorithms are developed that is employed for locating various routes with minimum joint failure chance. Therefore, a Probabilistic Shared Risk Link cluster (PSRLG) framework is developed for modeling related to failures. during this context, the matter of finding two methods with minimum joint failure chance is developed as associate number Non-Linear Program (INLP), and additionally the approximations and linear relaxations which will realize nearly best solutions in most cases are developed.

Authors and Affiliations

K. SOMASUNDARAM

Keywords

Related Articles

Annotation of web pages using semantic tagging and ranking model to effective information retrieval

Due to continuous growth of World Wide Web (WWW), huge number of web documents is published in web servers providing plentiful information. Because of the structure of web pages and huge amount of information, retrieving...

A Comprehensive Study on Providing Services based on User Interest in Online Social Networks

In recent years, Online Social Networks (OSNs) are one of the most popular interactive medium to communicate, share and distribute a considerable amount of human life information. The best entertainment for the people is...

A Review of various statestical methods for Outlier Detection

Outlier Detection has many applications. Outlier is instance of the data set which has exceptional characteristics compare to other instance of data and exhibits unusual behavior of the system. There are many methods use...

A Brief Introduction of Different type of Security Attacks found in Mobile Ad-hoc Network

A structure less network is called the mobile ad-hoc network, where all the nodes are independent. In MANET, there is a collection of mobile nodes that from temporary network. Those nodes are act like a host or like a ro...

Comparative study of Gradient based image denoising methods

Images are playing very key role in various applications like medical imaging, remote sensing, and scientificresearch and in all these applications image clarity plays a major role. Any image that is captured has to be p...

Download PDF file
  • EP ID EP88041
  • DOI -
  • Views 141
  • Downloads 0

How To Cite

K. SOMASUNDARAM (2013). DIVERSE ROUTING IN NETWORKS WITHOUT DISJOINTNESS CONSTRAINT USING PROBABILISTIC FAILURES. International Journal of Computer Science & Engineering Technology, 4(12), 1417-1421. https://europub.co.uk./articles/-A-88041