COMPARISON OF p-CYCLE CONFIGURATION METHODS FOR DYNAMIC NETWORKS

Abstract: Dynamic optical networks which are protected by p-cycles can be operated by different p-cycle configuration methods. We compare the blocking probability of two dynamic p-cycle configuration approaches and one static p-cycle configuration approach (protected working capacity envelope). 1

Capacity Efficiency and Restorability of Path Protection and Rerouting in WDM Networks Subject to Dual Failures

Resilient optical networks are predominately designed to protect against single failures of fiber links

Securing Passive Optical Networks Against Signal Injection Attacks

Abstract. Passive optical access networks are susceptible to intended attacks and unintended failures. This paper discusses intrusion by user-side signalinjection resulting in reduced network accessibility and it proposes possible countermeasures. The central function is that an intruding signal can be switched off when it is present. 1

Multidomain Optical Networks: Issues and Challenges

Today, many leading organizations are undertaking extensive research on a very broad range of new and evolving optical networking technologies. These efforts carry particular significance, especially in light of the “postbubble” dynamics of the optical networking market and have led to the investigation of various cost-efficient optical technologies. Today’s telecom carriers operate several independent optical domains based on diverse technologies, control solutions, standards, and protocols, making interdomain and intercarrier interworking extremely difficult. Standardized interworking across diverse multigranularity network interfaces, and interoperability across disparate vendor equipments and carrier domains are crucial to provisioning end-to-end services and achieving cost-efficient network operation. Needless to say, having an interoperable and standard control plane across multidomain optical networks can benefit carriers through the availability of a wide selection of network elements, platforms, and multiple vendor solutions resulting in faster deployment and reduced CAPEX and OPEX charges

C) 2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new

Based on queuing theory we develop analytical approximations for the average packet transfer time of a store-and-forward and a cutthrough buffer insertion ring with two client traffic priorities. These types of rings are architectural alternatives for resilient packet rings (RPR) which transport data (e.g., IP) packets over optical media. We use the approximations for a delay comparison of both ring architectures. It turns out that high priority traffic is more delayed in the cut-through architecture than in the store-and-forward architecture whereas low priority traffic performs similarly in both architectures