Survivability performance analysis of rerouting strategies in an ATM/VP DCS survivable mesh network

Kyandoghere, K.

doi:10.1145/303297.303303

Cited by 3 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another important property of a system is survivability, which has been defined in several different ways in the literature [8,14,18,22]. However, since these definitions either are qualitative thus they cannot be used for quantitative analysis of survivability, or are defined for a specific environment, e.g., survivability of networks, none of them can be directly applied here.…”

Section: System Propertiesmentioning

confidence: 99%

Specifying and using intrusion masking models to process distributed operations

Liu

Zang

2005

JCS

View full text Add to dashboard Cite

It is important for critical applications to provide critical services without any integrity or availability degradation in the presence of intrusions. This requirement can be satisfied by intrusion masking techniques under some situations. Compared with intrusion tolerance techniques, where some integrity or availability degradations are usually caused, intrusion masking techniques use substantial replications to avoid such degradations. Existing intrusion masking techniques, such as the state machine approach, can effectively mask intrusions when processing requests from a client using a server replica group, but they are fairly limited in processing a (multi-stage) distributed operation across multiple server replica groups. As more and more applications (e.g., supply chain management, distributed banking) need to process distributed operations in an intrusion-masking fashion, it is in urgent need to overcome the limitations of existing intrusion masking techniques. In this paper, we specify and compose two intrusion-masking models for inter-replica-group distributed computing. Using these two models, a variety of applications can mask (numerous kinds of) intrusions. Our intrusion masking models overcome the limitations of existing intrusion masking techniques. The survivability of our intrusion-masking models is quantitatively analyzed. A simple yet practical implementation method of our intrusion-masking models is proposed and applied to build two intrusion-masking two-phase-commit (2PC) protocols, and the corresponding efficiency is analyzed. The two intrusion-masking 2PC protocols and the analysis results show that the proposed intrusion-masking models have good utility, practicality, and survivability. Finally, the composition methodology developed in this paper can also be used to develop other intrusion-masking distributed computing models.

show abstract

Section: System Propertiesmentioning

confidence: 99%

Specifying and using intrusion masking models to process distributed operations

Liu

Zang

2005

JCS

View full text Add to dashboard Cite

show abstract

Prioritized traffic restoration in connection oriented QoS based networks

Jæger

Tipper

2003

Computer Communications

View full text Add to dashboard Cite

Connection oriented quality-of-service (QoS) based networks offer several service classes each designed to handle connections supporting various types of applications. A network failure will typically result in a large number of disrupted connections in each service class, all of which need to be restored simultaneously. In this paper we propose a distributed fault recovery priority scheme for dynamic restoration of connections. The proposed scheme exploits available network resources immediately after a failure together with properties of typical applications carried by the connections in order to give the applications sufficient network performance. The scheme is formulated within the context of switched virtual circuit routing in ATM networks, but it is applicable to ATM virtual path restoration as well and to other class based QoS networks like DiffServ MPLS based networks. The priority based restoration scheme is formulated as a centralized path flow integer programming optimization problem serving as a comparison benchmark for suboptimal distributed schemes. We propose a distributed heuristic scheme and give numerical results illustrating the quality of the proposed distributed scheme in comparison to the centralized optimal approach. Our numerical results show that the proposed distributed scheme can significantly improve utilization of network resources and enhance network performance after a failure. q

show abstract

Rerouting Strategy Based on Distance of Information-State Transition in a Vehicle Network

Xiao-chao

Liu

2009

2009 Second International Conference on Intelligent Computation Technology and Automation

View full text Add to dashboard Cite

Survivability performance analysis of rerouting strategies in an ATM/VP DCS survivable mesh network

Cited by 3 publications

References 12 publications

Specifying and using intrusion masking models to process distributed operations

Specifying and using intrusion masking models to process distributed operations

Prioritized traffic restoration in connection oriented QoS based networks

Rerouting Strategy Based on Distance of Information-State Transition in a Vehicle Network

Contact Info

Product

Resources

About