Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563898
A. Graves, Bruce Wallace, S. Periyalwar, Carlo Riccardi
Healthcare is adopting information technology as an integral part of clinical workflows and processes themselves. This places substantial demands upon the performance and behavior of such networks, especially as the paper records systems are retired, leading to the fundamental attributes of clinical grade networks for healthcare.
{"title":"Clinical grade - a foundation for healthcare communications networks","authors":"A. Graves, Bruce Wallace, S. Periyalwar, Carlo Riccardi","doi":"10.1109/DRCN.2005.1563898","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563898","url":null,"abstract":"Healthcare is adopting information technology as an integral part of clinical workflows and processes themselves. This places substantial demands upon the performance and behavior of such networks, especially as the paper records systems are retired, leading to the fundamental attributes of clinical grade networks for healthcare.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121956256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563909
O. Klopfenstein
In multi-protocol label switching (MPLS) networks, traffic demands can be routed along tunnels called label switched paths (LSPs). One tunnel is characterized by a path in the network and a reserved bandwidth. These tunnels can be created and deleted dynamically, depending on traffic demand arrivals or departures. After several operations of this type, the network resources utilization can be unsatisfactory, with for instance congestion or too long routing paths. One way to improve it is to reroute tunnels. Different rerouting procedures may be applied, breaking tunnels or using make-before-break. This has to be adapted to the LSP quality of service (QoS) requirements. Moreover, for network management purposes, we would like to control the number of rerouting operations to perform. A global rerouting framework is proposed, which enables to consider independently each class of LSPs. Then, a mathematical model is introduced. As it appears very hard to solve to optimality, a heuristic based on randomized rounding is proposed. Finally, the designed tool has enabled a numerical study on the proportion of tunnels to reroute in order to reach near-optimal network states.
{"title":"A randomized rounding heuristic to reroute tunnels in MPLS networks","authors":"O. Klopfenstein","doi":"10.1109/DRCN.2005.1563909","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563909","url":null,"abstract":"In multi-protocol label switching (MPLS) networks, traffic demands can be routed along tunnels called label switched paths (LSPs). One tunnel is characterized by a path in the network and a reserved bandwidth. These tunnels can be created and deleted dynamically, depending on traffic demand arrivals or departures. After several operations of this type, the network resources utilization can be unsatisfactory, with for instance congestion or too long routing paths. One way to improve it is to reroute tunnels. Different rerouting procedures may be applied, breaking tunnels or using make-before-break. This has to be adapted to the LSP quality of service (QoS) requirements. Moreover, for network management purposes, we would like to control the number of rerouting operations to perform. A global rerouting framework is proposed, which enables to consider independently each class of LSPs. Then, a mathematical model is introduced. As it appears very hard to solve to optimality, a heuristic based on randomized rounding is proposed. Finally, the designed tool has enabled a numerical study on the proportion of tunnels to reroute in order to reach near-optimal network states.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126009464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563897
G. O'Reilly, H. Uzunalioglu, S. Conrad, W. Beyeler
Critical national infrastructures for power, emergency services, finance, and other basic industries rely heavily on information and telecommunications networks (voice, data, Internet) to provide services and conduct business. While these networks tend to be highly reliable, outages do occur which can have cascading effects to other infrastructures. This paper describes a dynamic simulation model of a power outage which cascades to impact telecom for services without power back-up, which cascades to impact emergency services 911 calling, which causes increased severity of injuries.
{"title":"Inter-infrastructure simulations across telecom, power, and emergency services","authors":"G. O'Reilly, H. Uzunalioglu, S. Conrad, W. Beyeler","doi":"10.1109/DRCN.2005.1563897","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563897","url":null,"abstract":"Critical national infrastructures for power, emergency services, finance, and other basic industries rely heavily on information and telecommunications networks (voice, data, Internet) to provide services and conduct business. While these networks tend to be highly reliable, outages do occur which can have cascading effects to other infrastructures. This paper describes a dynamic simulation model of a power outage which cascades to impact telecom for services without power back-up, which cascades to impact emergency services 911 calling, which causes increased severity of injuries.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121767223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563895
G. Shen, W. Grover
The problem of automatic provisioning of survivable service paths in a transport network in the face of random arrivals and departures, and fundamental traffic uncertainty, is a challenging and interesting problem for research. Essentially to date, only one basic approach is considered, that of provisioning a working path and then explicitly arranging a shared disjoint backup path for protection. This is done on every new connection arrival and is heavily dependent on synchronized network state databases and state dissemination to keep such databases current. The authors described an alternate approach to simplify the process of automatic survivable service provisioning scheme from the end users point of view. Under an adaptive protected working capacity envelope (AP-WCE), statistically stationary but random demand patterns require little or no state dissemination and protected service routing is no different than shortest path working routing. But under non-stationary evolution of the traffic load both spatially and temporally, a slow-acting background process of APWCE reoptimization occurs which keeps the logical configuration of both working envelope and protection overlay always as well matched to the actual traffic load pattern as possible within the finite amount of total as-built transmission capacity. The scheme is attractive as it is easily implemented by existing network control systems and is inherently more scalable to large networks and fast random demands than the current shared-backup scheme because no signaling or state update relating to protection is required on the timescale of individual connection requests. Any such signaling arises only on the timescale of the non-stationary evolution of the traffic load pattern itself.
{"title":"Automatic lightpath service provisioning with an adaptive protected working capacity envelope based on p-cycles","authors":"G. Shen, W. Grover","doi":"10.1109/DRCN.2005.1563895","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563895","url":null,"abstract":"The problem of automatic provisioning of survivable service paths in a transport network in the face of random arrivals and departures, and fundamental traffic uncertainty, is a challenging and interesting problem for research. Essentially to date, only one basic approach is considered, that of provisioning a working path and then explicitly arranging a shared disjoint backup path for protection. This is done on every new connection arrival and is heavily dependent on synchronized network state databases and state dissemination to keep such databases current. The authors described an alternate approach to simplify the process of automatic survivable service provisioning scheme from the end users point of view. Under an adaptive protected working capacity envelope (AP-WCE), statistically stationary but random demand patterns require little or no state dissemination and protected service routing is no different than shortest path working routing. But under non-stationary evolution of the traffic load both spatially and temporally, a slow-acting background process of APWCE reoptimization occurs which keeps the logical configuration of both working envelope and protection overlay always as well matched to the actual traffic load pattern as possible within the finite amount of total as-built transmission capacity. The scheme is attractive as it is easily implemented by existing network control systems and is inherently more scalable to large networks and fast random demands than the current shared-backup scheme because no signaling or state update relating to protection is required on the timescale of individual connection requests. Any such signaling arises only on the timescale of the non-stationary evolution of the traffic load pattern itself.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134458980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563855
L. Rapp
Gain-flattened erbium-doped fiber amplifiers (EDFAs) have become key components for optical communication systems and networks. A failure of one of these devices interrupts data transmission on the affected link completely and causes significant loss of income to the carrier. Therefore, detection of the EDFA's performance degradation is mandatory, since amplifiers can be replaced before they fail. State of the art techniques can only detect aging of the pump laser. In this paper, a novel algorithm is presented that allows for the detection of various degradation mechanisms. The algorithm allows to supervise the complete optical path within the EDFA and is based on appropriate modeling of the gain characteristics of the erbium-doped fiber. Thus, aging effects can be detected for arbitrary channel loads and power distributions at the input of the amplifier stage. Since the effect of pump excited state absorption (ESA) is included in the model, the algorithm is also applicable to amplifier stages using high power pumps.
{"title":"Quality surveillance algorithm for erbium-doped fiber amplifiers","authors":"L. Rapp","doi":"10.1109/DRCN.2005.1563855","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563855","url":null,"abstract":"Gain-flattened erbium-doped fiber amplifiers (EDFAs) have become key components for optical communication systems and networks. A failure of one of these devices interrupts data transmission on the affected link completely and causes significant loss of income to the carrier. Therefore, detection of the EDFA's performance degradation is mandatory, since amplifiers can be replaced before they fail. State of the art techniques can only detect aging of the pump laser. In this paper, a novel algorithm is presented that allows for the detection of various degradation mechanisms. The algorithm allows to supervise the complete optical path within the EDFA and is based on appropriate modeling of the gain characteristics of the erbium-doped fiber. Thus, aging effects can be detected for arbitrary channel loads and power distributions at the input of the amplifier stage. Since the effect of pump excited state absorption (ESA) is included in the model, the algorithm is also applicable to amplifier stages using high power pumps.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"92 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113997064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563858
A. Giorgetti, N. Andriolli, L. Valcarenghi, P. Castoldi
In a multi-class traffic scenario spare resources can be utilized, under normal network conditions, for the transmission of low class traffic. In this way network resource utilization is improved but, upon failure occurrence, low class connections are preempted by recovered high class connections. On the other hand spare resources, allocated to protect high class connections but not utilized (i.e., idle) in a specific failure scenario, can be employed to recover failed low class connections. In this case low class connections resort to dynamic restoration because they carry traffic that tolerates not to be recovered or to experience long recovery time. In this study a scenario is envisioned where, besides high (i.e., gold) class connections, which are shared path protected, two alternative low class connections are present in the network: silver and bronze class connections. Both silver and bronze connections exploit dynamic restoration to overcome failures. The main difference is that silver connections utilize high class spare resources just after failure occurrence while bronze connections utilize high class spare resources before and after the failure. Numerical results show a tradeoff between provisioning and restoration performance of the different connection classes in the considered scenarios. If spare resources are exploited only after the failure (i.e., gold-silver scenario), low class connection survivability is high. If spare resources are used also during normal network operation (i.e., gold-bronze scenario), the provisioning performance of both connection classes is improved, but, upon failure occurrence, the low class survivability is low. In both scenarios, the inaccurate network state information after the failure slightly degrades survivability performance.
{"title":"Impact of idle protection capacity reuse on multi-class optical networks","authors":"A. Giorgetti, N. Andriolli, L. Valcarenghi, P. Castoldi","doi":"10.1109/DRCN.2005.1563858","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563858","url":null,"abstract":"In a multi-class traffic scenario spare resources can be utilized, under normal network conditions, for the transmission of low class traffic. In this way network resource utilization is improved but, upon failure occurrence, low class connections are preempted by recovered high class connections. On the other hand spare resources, allocated to protect high class connections but not utilized (i.e., idle) in a specific failure scenario, can be employed to recover failed low class connections. In this case low class connections resort to dynamic restoration because they carry traffic that tolerates not to be recovered or to experience long recovery time. In this study a scenario is envisioned where, besides high (i.e., gold) class connections, which are shared path protected, two alternative low class connections are present in the network: silver and bronze class connections. Both silver and bronze connections exploit dynamic restoration to overcome failures. The main difference is that silver connections utilize high class spare resources just after failure occurrence while bronze connections utilize high class spare resources before and after the failure. Numerical results show a tradeoff between provisioning and restoration performance of the different connection classes in the considered scenarios. If spare resources are exploited only after the failure (i.e., gold-silver scenario), low class connection survivability is high. If spare resources are used also during normal network operation (i.e., gold-bronze scenario), the provisioning performance of both connection classes is improved, but, upon failure occurrence, the low class survivability is low. In both scenarios, the inaccurate network state information after the failure slightly degrades survivability performance.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126104746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563904
O. Wittner, B. Helvik, V. Nicolat
'Link and node failures in the Internet are handled by restoration, i.e. by finding a new routing pattern. This may incur a considerable delay before the traffic flow may be reestablished. An immediate fault handling, i.e. protection, is desirable and required by some services and users. Protection cycles are a well known dependability measure and commonly applied In SDH networks with ring topologies. Applying protection cycles (known as p-cycles) in meshed network has recently been shown to provide good protection against failures. To be consistent with the Internet operational strategy, it is necessary to establish such rings dynamically, on line and In a distributed manner. Swarm intelligence is a distributed system construction concept which has shown promising results when applied to problems within the area of network and operational management. Swarm Intelligence systems are fully distributed (without central components), have high redundancy, are adaptable, and can find near optimal solutions to NP-hard problems. This paper describes a new swarm intelligence system based on the CE-ant algorithm developed by Helvik and Wittner. The system Is capable of finding near optimal Hamiltonian protection cycles in meshed networks. These are suited for protection in small to medium sized networks (ASs). To test and stress the concept, a case study is carried out mainly based on the topology, link loads and capacities of a real, diverse and rather large network. Results indicate that the agent system has a good ability to find good candidate p-cycles, and that in the network used as a case, approximately 80% of the link failures may be fully protected by the otherwise unused capacity in the network. With a good choice of p-cycle, even the very high capacity and high load links may have a substantial protection. Indexc Terms-Dependability, Protection in Internet, p-Cycles, Swarm Intelligence, CE-ants.
{"title":"Internet failure protection using hamiltonian p-cycles found by ant-like agents","authors":"O. Wittner, B. Helvik, V. Nicolat","doi":"10.1109/DRCN.2005.1563904","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563904","url":null,"abstract":"'Link and node failures in the Internet are handled by restoration, i.e. by finding a new routing pattern. This may incur a considerable delay before the traffic flow may be reestablished. An immediate fault handling, i.e. protection, is desirable and required by some services and users. Protection cycles are a well known dependability measure and commonly applied In SDH networks with ring topologies. Applying protection cycles (known as p-cycles) in meshed network has recently been shown to provide good protection against failures. To be consistent with the Internet operational strategy, it is necessary to establish such rings dynamically, on line and In a distributed manner. Swarm intelligence is a distributed system construction concept which has shown promising results when applied to problems within the area of network and operational management. Swarm Intelligence systems are fully distributed (without central components), have high redundancy, are adaptable, and can find near optimal solutions to NP-hard problems. This paper describes a new swarm intelligence system based on the CE-ant algorithm developed by Helvik and Wittner. The system Is capable of finding near optimal Hamiltonian protection cycles in meshed networks. These are suited for protection in small to medium sized networks (ASs). To test and stress the concept, a case study is carried out mainly based on the topology, link loads and capacities of a real, diverse and rather large network. Results indicate that the agent system has a good ability to find good candidate p-cycles, and that in the network used as a case, approximately 80% of the link failures may be fully protected by the otherwise unused capacity in the network. With a good choice of p-cycle, even the very high capacity and high load links may have a substantial protection. Indexc Terms-Dependability, Protection in Internet, p-Cycles, Swarm Intelligence, CE-ants.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116361305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563912
G. Agrawal, Dijiang Huang, D. Medhi
In this paper, we consider the problem of designing partially and fully survivable explicit label switched paths for MPLS networks. We model the problems as mixed integer linear programs. Furthermore, we present a survivability assessment of the models. We also evaluate the performance of the models presented in the paper, in terms of total used capacity in the network.
{"title":"Network protection design for MPLS networks","authors":"G. Agrawal, Dijiang Huang, D. Medhi","doi":"10.1109/DRCN.2005.1563912","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563912","url":null,"abstract":"In this paper, we consider the problem of designing partially and fully survivable explicit label switched paths for MPLS networks. We model the problems as mixed integer linear programs. Furthermore, we present a survivability assessment of the models. We also evaluate the performance of the models presented in the paper, in terms of total used capacity in the network.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130112119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563873
E. Kubilinskas, M. Pióro
Design problems related to the next generation Internet core networks can be difficult to solve in an exact way. Hence, for large networks they may require approximate algorithms. The paper considers two optimization problems for off-line design of robust NGI core networks carrying elastic traffic with a two-layer IP/MPLS over WDM architecture. The problems are NP-hard and are formulated as mixed-integer programs. An efficient approximate iterative method based on separate design of the two layers is proposed for solving the problems; the method is illustrated with numerical examples
与下一代互联网核心网相关的设计问题可能很难以精确的方式解决。因此，对于大型网络，它们可能需要近似算法。本文考虑了两层IP/MPLS over WDM架构下承载弹性流量的鲁棒NGI核心网离线优化设计的两个问题。这些问题是np困难的，并被表述为混合整数规划。提出了一种基于两层分离设计的高效近似迭代方法;通过数值算例说明了该方法
{"title":"Two design problems for the IP/MLPS over WDM networks","authors":"E. Kubilinskas, M. Pióro","doi":"10.1109/DRCN.2005.1563873","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563873","url":null,"abstract":"Design problems related to the next generation Internet core networks can be difficult to solve in an exact way. Hence, for large networks they may require approximate algorithms. The paper considers two optimization problems for off-line design of robust NGI core networks carrying elastic traffic with a two-layer IP/MPLS over WDM architecture. The problems are NP-hard and are formulated as mixed-integer programs. An efficient approximate iterative method based on separate design of the two layers is proposed for solving the problems; the method is illustrated with numerical examples","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128814888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563849
J. Galtier, A. Laugier, P. Pons
We consider problems of network reliability: the two-terminal network reliability consists, given an undirected graph G/spl equiv/(V, E), and a series of independent edge failure events, in computing the probability that two nodes remain connected. The all-terminal network reliability is the probability that the whole network remains connected. We present in the following two different approaches to compute two-terminal and all-terminal reliability, with various characteristics on the precision level of the result. We give an exact algorithm to compute the reliability in O([V]f(w)/sup 2/ + [E]f(w)) with f(x)/spl equiv/ and w is the tree-width of G. We also present polynomial methods to give bounds on the reliability. We discuss methods to optimize the mean time to repair of the components.
{"title":"Algorithms to evaluate the reliability of a network","authors":"J. Galtier, A. Laugier, P. Pons","doi":"10.1109/DRCN.2005.1563849","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563849","url":null,"abstract":"We consider problems of network reliability: the two-terminal network reliability consists, given an undirected graph G/spl equiv/(V, E), and a series of independent edge failure events, in computing the probability that two nodes remain connected. The all-terminal network reliability is the probability that the whole network remains connected. We present in the following two different approaches to compute two-terminal and all-terminal reliability, with various characteristics on the precision level of the result. We give an exact algorithm to compute the reliability in O([V]f(w)/sup 2/ + [E]f(w)) with f(x)/spl equiv/ and w is the tree-width of G. We also present polynomial methods to give bounds on the reliability. We discuss methods to optimize the mean time to repair of the components.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131236056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：