File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/24.295014
- Scopus: eid_2-s2.0-0028445524
- WOS: WOS:A1994NW83300025
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Order-P: An algorithm to order network partitionings
Title | Order-P: An algorithm to order network partitionings |
---|---|
Authors | |
Issue Date | 1994 |
Citation | Ieee Transactions On Reliability, 1994, v. 43 n. 2, p. 310-320 How to Cite? |
Abstract | A network partitioning occurs when failures fragment the network into at least 2 sub-networks. This causes the network performance to degrade; many techniques have been proposed to combat this degradation. The number of possible partitionings in a fully connected network of n nodes is greater than 2n, for large n. Thus, analysis of partitioning-resilient algorithms is extremely difficult due to the difficulty of computing the probabilities of occurrence of the partitionings. We propose an algorithm that orders network partitionings in decreasing order of probability. This algorithm is similar to the Most Probable State Enumeration (MPSE) algorithm of Li & Silvester. By looking at only the most probable partitionings, the performance of the network can be estimated well. This approach also gives bounds on the network performance. Two distinct equally-important goals have been attained in this paper: Algorithm Order-P is proposed; it generates network partitionings in the order of their decreasing probabilities of occurrence. We are not aware of any other algorithm that specifically orders network partitionings. However, three algorithms (Order, Order-II, NewOrder) that generate network states in order of their decreasing state probabilities are known, for dual-mode (up/down) components. We improvised these algorithms to generate the most probable network partitionings and then compared them with Order-P. Order-P has a lower computational complexity than all of the three improvised algorithms. Order-P is applied in the real world and demonstrates its value in performance modeling of distributed systems. With this algorithm, performance modeling of fairly large systems, hitherto unattempted due to large computational costs, is feasible. Although the probabilities of occurrence of various partitionings obtained using Order-P are estimates, we believe that the approximation is close enough, and we substantiate this with an example. A methodology to compute performance measures under conditions of network partitioning has also been proposed, and corroborated with examples in the domain of distributed database systems. |
Persistent Identifier | http://hdl.handle.net/10722/155002 |
ISSN | 2015 Impact Factor: 2.287 2015 SCImago Journal Rankings: 1.930 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Banerjee, Sujata | en_US |
dc.contributor.author | Li, Victor OK | en_US |
dc.date.accessioned | 2012-08-08T08:31:28Z | - |
dc.date.available | 2012-08-08T08:31:28Z | - |
dc.date.issued | 1994 | en_US |
dc.identifier.citation | Ieee Transactions On Reliability, 1994, v. 43 n. 2, p. 310-320 | en_US |
dc.identifier.issn | 0018-9529 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/155002 | - |
dc.description.abstract | A network partitioning occurs when failures fragment the network into at least 2 sub-networks. This causes the network performance to degrade; many techniques have been proposed to combat this degradation. The number of possible partitionings in a fully connected network of n nodes is greater than 2n, for large n. Thus, analysis of partitioning-resilient algorithms is extremely difficult due to the difficulty of computing the probabilities of occurrence of the partitionings. We propose an algorithm that orders network partitionings in decreasing order of probability. This algorithm is similar to the Most Probable State Enumeration (MPSE) algorithm of Li & Silvester. By looking at only the most probable partitionings, the performance of the network can be estimated well. This approach also gives bounds on the network performance. Two distinct equally-important goals have been attained in this paper: Algorithm Order-P is proposed; it generates network partitionings in the order of their decreasing probabilities of occurrence. We are not aware of any other algorithm that specifically orders network partitionings. However, three algorithms (Order, Order-II, NewOrder) that generate network states in order of their decreasing state probabilities are known, for dual-mode (up/down) components. We improvised these algorithms to generate the most probable network partitionings and then compared them with Order-P. Order-P has a lower computational complexity than all of the three improvised algorithms. Order-P is applied in the real world and demonstrates its value in performance modeling of distributed systems. With this algorithm, performance modeling of fairly large systems, hitherto unattempted due to large computational costs, is feasible. Although the probabilities of occurrence of various partitionings obtained using Order-P are estimates, we believe that the approximation is close enough, and we substantiate this with an example. A methodology to compute performance measures under conditions of network partitioning has also been proposed, and corroborated with examples in the domain of distributed database systems. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | IEEE Transactions on Reliability | en_US |
dc.title | Order-P: An algorithm to order network partitionings | en_US |
dc.type | Article | en_US |
dc.identifier.email | Li, Victor OK:vli@eee.hku.hk | en_US |
dc.identifier.authority | Li, Victor OK=rp00150 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1109/24.295014 | en_US |
dc.identifier.scopus | eid_2-s2.0-0028445524 | en_US |
dc.identifier.volume | 43 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.spage | 310 | en_US |
dc.identifier.epage | 320 | en_US |
dc.identifier.isi | WOS:A1994NW83300025 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Banerjee, Sujata=7404545046 | en_US |
dc.identifier.scopusauthorid | Li, Victor OK=7202621685 | en_US |