Unavailability analysis of long-haul networks

To, Marco Antonio; Neusy, P.

doi:10.1109/49.265709

Cited by 131 publications

(88 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For example, [16] reported that MTTF for 1,000 sheeth miles, and MTTR values are 2,000 hours and 12 hours, respectively. More recently, [17] (see also [3]) documented the average number of fiber cuts per 1,000 miles per year as 13 times and 3 times in metro and long haul networks, respectively.…”

Section: Network Availabilitymentioning

confidence: 99%

Efficient and Agile 1+N Protection

Kamal

Al-Kofahi

2011

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-This paper introduces an efficient implementation of the network coding-based 1+N protection. The strategy provides proactive protection to N link-disjoint full-duplex connections against single link failures. The implementation is efficient and uses a tree shaped minimum cost protection circuit. The protection circuit carries linear combinations of data units originally transmitted on the working circuits, and these linear combinations can be used to recover data units lost due to failures. This recovery is carried out with the assistance of one node on the protection tree, which is chosen to reduce the recovery time. This protection technique requires the same amount of protection resources used by 1:N protection, where the protection circuit is link disjoint from the protected connections. The paper also makes other contributions. It introduces an Integer Linear Program (ILP) formulation to evaluate the cost of protection using this technique, and compares it to the cost of 1+1 protection. The comparison shows that a significant saving in cost can be achieved, while recovering from failures within a short time. The performance of this scheme is further evaluated using an OPNET-based simulation, where it was shown that the recovery time conforms to acceptable industry standards. Availability analysis is also conducted.

show abstract

Section: Network Availabilitymentioning

confidence: 99%

Efficient and Agile 1+N Protection

Kamal

Al-Kofahi

2011

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…As we are interested in the availability of a connection, we need to define it first. The availability of a connection is defined as the probability that such connec-tion is "up" at any given time [9], and can be expressed as the proportion of time the connection is up during its entire service. If a connection is carried by a single unprotected path, its availability is equal to the path availability.…”

Section: The Mathematical Modelmentioning

confidence: 99%

A Priority-Aware Protection Technique for Quality of Service Enabled WDM Networks

Fawaz

Martignon

Chen

et al. 2005

NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

Abstract. Connection availability is considered as a critical metric, when providing differentiated services in WDM mesh networks. Indeed, one of the major concerns of optical network operators is related to improving the availability of services provided to their highest-class clients. Achieving this objective is possible through the use of the different classical protection schemes, namely the so-called dedicated and shared protection schemes. However, the majority of the work concerning protection schemes has considered the primary connections as equally important when contending for the use of the backup resources.As a main contribution in this paper, we therefore propose an improvement of the existing protection schemes through the introduction of relative priorities among the different primary connections contending for the access to the protection path. To evaluate numerically the benefits of the service differentiation feature introduced in our proposal, we first develop a mathematical model based on which we derive explicit expressions for the average connections availabilities that result from both the classical protection schemes and the proposed priority-aware one. Through this model, we show how the availability of the highest-class clients is improved when deploying the proposed priority-aware protection scheme.Finally, with the same objective in mind, we develop a simulation study, where a given set of connection demands with predefined availability requirements is provisioned, using different protection strategies. Through this study, we show that the priority-aware protection strategy satisfies service-availability requirements in a cost-effective manner compared with the classical protection schemes.

show abstract

“…Failures might cause significant losses, especially if they occur at the optical backbone networks due to the huge volume of traffic traversing their links [1]. In addition, this type of networks is expensive to deploy due to their size and it might take several years to complete them.…”

Section: Introductionmentioning

confidence: 99%

Strategies on 3-connected graphs optimization search for future ICT infrastructure

Gutiérrez

Riaz

Pedersen

2011

Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies

View full text Add to dashboard Cite

Usually, for economic reasons, the physical infrastructure for transmission networks is designed as 2-connected graphs, i.e. interconnected rings. However, the increment of both, the traffic and the dependency of our professional and personal lives on ICT, demands more reliable transmission and distribution networks. Network interconnection problems are in general costly and complex to solve, categorized as NP-hard computational complexity. In addition, structural constraints such as 3-connectivity increase the time and resources utilized in the optimization search process. This paper presents and evaluates novel strategies in order to simplify the optimization process when planning the physical network interconnection as 3-connected with nodal degree 3. These strategies are applied in a case study and the results, using this and other approaches, are compared in terms of path distances, path length, network length, processing time, and number of iterations to find the solution.

show abstract

Unavailability analysis of long-haul networks

Cited by 131 publications

References 0 publications

Efficient and Agile 1+N Protection

Efficient and Agile 1+N Protection

A Priority-Aware Protection Technique for Quality of Service Enabled WDM Networks

Strategies on 3-connected graphs optimization search for future ICT infrastructure

Contact Info

Product

Resources

About