Vertex cutsets of undirected graphs

Patvardhan, C.; Prasad, V.C.; Pyara, V. P.

doi:10.1109/24.387393

Cited by 20 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For illustrating the proposed algorithm, we consider the set Ck = {{2,3,4,5}[60]} and the set S = {{1,2} [5],{2,3} [12]…”

Section: Illustration Of the Proposed Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

An Improved Algorithm for Network Reliability based on Finding all Node Cutsets

Lamalem¹

2020

IJATCSE

View full text Add to dashboard Cite

We can define the network reliability as the ability of a network to carry out a desired operation such as communication. In the literature, several methods have been proposed to evaluate the reliability of networks. We can cite as an example state enumeration methods and cut/path set enumeration methods. The algorithm proposed by BRIJENDRA SINGH in his paper titled "ENUMERATION OF NODE CUTSETS FOR AN s-t NETWORK" belongs to the category of methods which are based on the enumeration of the minimal node cuts set. This paper is made for the purpose to improve the Singh's algorithm. The improvement includes the efficiency of the algorithm and the execution time.

show abstract

“…For illustrating the proposed algorithm, we consider the set Ck = {{2,3,4,5}[60]} and the set S = {{1,2} [5],{2,3} [12]…”

Section: Illustration Of the Proposed Algorithmmentioning

confidence: 99%

“…Few of the methods consider that the nodes are unreliable and the edges are perfectly reliable as Singh B. [13] , Prasad VC, Sankar V, Prasaka Rao KS [11] and Prasad VC [12].…”

Section: Introductionmentioning

confidence: 99%

An Improved Algorithm for Network Reliability based on Finding all Node Cutsets

Lamalem¹

2020

IJATCSE

View full text Add to dashboard Cite

show abstract

“…It consists in finding the minimal vertex cut set of the graph of the underlay elements composing the virtual links. In the current implementation, we use the solution proposed in [19] to compute this minimal vertex cut set. The protocol of ROSA ensures that any member of a lump is able to compute its density.…”

Section: B Rosamentioning

confidence: 99%

Robust Overlay Network with Self-Adaptive Topology: The Reliable File Storage Layer

Baud

2009

2009 IEEE-RIVF International Conference on Computing and Communication Technologies

View full text Add to dashboard Cite

A reliable storage system is a system that ensures the protection of data from loss. Such systems are needed in many critical fields. We cannot imagine that a financial institution looses data about one its clients. Moreover the exponential growing volumes of the data and its availability are crucial issues. A centralized storage system would be overloaded and be a single point of failure. That is why overlay network may provide the solution as they can be used to implement a distributed storage system over an information system. ROSA is an overlay network that was designed to combine a high scalability while maintaining a strong connectivity. The reliability of its topology, designs ROSA as a good platform for deploying such a reliable storage system. Nevertheless ROSA is an unstructured overlay network, this will decrease the efficiency of the storage system. In this article we first propose a structure, called chain of lumps, built upon ROSA. This structure will provide the advantage of a structured network to ROSA. Once ROSA endowed with the structure, we propose a reliable storage system deployed over ROSA. Consequently this system will benefit of the reliability of ROSA.

show abstract

“…The elements are found using utility like traceroute [20]. The solution presented in [21] is used to compute this minimal vertex cut set in the current implementation.…”

Section: B Rosa Principlementioning

confidence: 99%

ROSA: A step torwards a global virtual network

Baud

Bellot

2009

2009 International Conference on Ultra Modern Telecommunications &Amp; Workshops

View full text Add to dashboard Cite

ROSA is an overlay network which, deployed on a network, ensures a endogenous routing more resilient than IP. The ROSA routing detects and bypasses failures of routers,gateways and other underlay physical devices. Once installed on an information system, ROSA is completely autonomous, does not need any additional human intervention for its maintenance. ROSA has been proved scalable since it was shown in previous works that the cost in term of network overhead of the self-healing and self-maintenance of ROSA does not depend of the number of nodes of the overlay network. All these properties make ROSA a candidate for building a sole global virtual network that is astride over many physical networks. ROSA deployed over a large number of different network could unify them and could be the solution for the networks of the years to come and for the Next Generation Internet.

show abstract

Vertex cutsets of undirected graphs

Cited by 20 publications

References 5 publications

An Improved Algorithm for Network Reliability based on Finding all Node Cutsets

An Improved Algorithm for Network Reliability based on Finding all Node Cutsets

Robust Overlay Network with Self-Adaptive Topology: The Reliable File Storage Layer

ROSA: A step torwards a global virtual network

Contact Info

Product

Resources

About