Availability analysis of span-restorable mesh networks

The most common aim in designing a survivable network is to achieve restorability against all single span failures, with a minimal investment in spare capacity. This leaves dual-failure situations as the main factor to consider in quantifying how the availability of services benefit from the investment in restorability. We approach the question in part with a theoretical framework and in part with a series of computational routing trials. The computational part of the analysis includes all details of graph topology, capacity distribution, and the details of the restoration process, effects that were generally subject to significant approximations in prior work. The main finding is that a span-restorable mesh network can be extremely robust under dual-failure events against which they are not specifically designed. In a modular-capacity environment, an adaptive restoration process was found to restore as much as 95% of failed capacity on average over all dual-failure scenarios, even though the network was designed with minimal spare capacity to assure only single-failure restorability. The results also imply that for a priority service class, mesh networks could provide even higher availability than dedicated 1+1 APS. This is because there are almost no dual-failure scenarios for which some partial restoration level is not possible, whereas with 1+1 APS (or rings) there are an assured number of dual-failure scenarios for which the path restorability is zero. Results suggest conservatively that 20% or more of the paths in a mesh network could enjoy this ultra-high availability service by assigning fractional recovery capacity preferentially to those paths upon a dual failure scenario     

Diagnosing At-Speed Scan BIST Circuits Using a Low Speed and Low Memory Tester

Numerous solutions have been proposed to reduce test data volume and test application time during manufacturing testing of digital devices. However, time to market challenge also requires a very efficient debug phase. Error identification in the test responses can become impractically slow in the debug phase due to large debug data, slow tester speed, and limited memory of the tester. In this paper, we investigate the problems and solutions related to using a relatively slow and limited memory tester to observe the at-speed behavior of fast circuits. Our method can identify all errors in at-speed scan BIST environment without any aliasing and using only little extra overhead by way of a multiplexer and masking circuit for diagnosis. Our solution takes into account the relatively slower speed of the tester and the reload time of the expected data to the tester memory due to limited tester memory while reducing the test/debug cost. Experimental results show that the test application time by our method can be reduced by a factor of 10 with very little hardware overhead to achieve such advantage.     

Availability Analysis and Enhanced Availability Design in <Emphasis Type="Italic">p</Emphasis>-Cycle-Based Networks

p-Cycle protection is a fairly new survivability scheme that has the interesting properties of offering restoration speeds essentially the same as those offered by ring protection while requiring almost as little redundant capacity as adaptive mesh restoration [D. Stamatelakis, W.D. Grover, IEEE Transactions on Communications, vol. 48, no. 8, (August 2000), pp. 1262–1265]. This paper presents the first analytical consideration of the availability of paths in a network protected by p-cycles. Results confirm the importance that cycle sizes play in terms of availability and suggests principles or strategies for achieving high availability of paths in a network protected by p-cycles. Based on these insights, two new formulations for joint service path provisioning and capacity planning are proposed. The first one offers a way to improve the availability of selected service paths by using a different routing strategy for them than for regular service paths. The second formulation enables a new class of service paths that are offered two protection options instead of just one. That class of service paths is expected to see its availability improved in a quantum step way relative to the availability of paths having only one protection option.     

Span-Restorable Mesh Networks with Multiple Quality of Protection (QoP) Service Classes

In the modern business environment there is considerable interest in being able to support a range of different transport service classes in an optical network, and charge accordingly. In this work we consider the capacity design problem for a mesh-restorable optical network supporting any mixture of four basic quality of protection (QoP) classes. The service definitions are (gold): assured restorability, (silver): best efforts, (bronze): non-protected and (economy): preemptible service. We give design models for optimal capacity design of span-restorable (or corresponding link-protected) mesh networks having any particular mixture of these service classes. We also apply and test the design models under several multi-QoP test case scenarios to gain insights about various strategies and options possible in a multi-QoP design environment. An interesting finding is that in some test cases, 15 to 30% of all demand can be in the gold class enjoying 100% restorability solely through preemption of economy class service capacity. This suggests the potential to design and operate mesh-based networks that have no spare capacity at all in the conventional sense: all capacity is bearing service of some paying type. The resulting frequency of preemption in the economy class services is also studied. Results also show typically high levels of best-efforts restorability in the silver class occurring in networks that are strictly designed only for the restorability of the gold class services. High restorability of best effort services, however, requires the preemption of economy services. These methods and findings can be used by network and business planners to evaluate a number of different service structuring, pricing, and capacity-design strategies that may offer advantages to them and new options for their customers.     

Mesh-Restorable Networks with Enhanced Dual-Failure Restorability Properties

We consider extensions of the most common mesh-restorable network capacity design formulation that enhance the dual-failure restorability of the designs. A significant finding is that while design for complete dual-failure restorability can require up to triple the spare capacity, dual failure restorability can be provided for a fairly large set of priority paths with little or no more spare capacity than required for single-failure restorability. As a reference case we first study the capacity needs under complete dual-failure restorability. This shows extremely high spare capacity penalties. A second design model allows a user to specify a total capacity (or budget) limit and obtain the highest average dual-failure restorability possible for that investment limit. This formulation, and a relationship between dual-failure restorability and availability, can be used to trace-out the capacity-versus-availability trade-off curve for a mesh network. A third design strategy supports multiple-restorability service class definitions ranging from best-efforts-only to an assurance of complete single and dual-failure restorability on a per-demand basis. This lets a network operator tailor the investment in protection capacity to provide ultra-high availability on a service-selective basis, while avoiding the very high investment that would be required to support complete dual-failure restorability of the network as a whole.     

New options and insights for survivable transport networks

This article is devoted to a selection of recent topics in survivable networking. New ideas in capacity design and ring-to-mesh evolution are given, as well as a systematic comparison of the capacity requirements of several mesh-based schemes showing how they perform over a range of network graph connectivity. The work provides new options and insights to address the following questions. How does one evolve from an existing ring-based network to a future mesh network? If the facilities graph is very sparse, how can mesh efficiency be much better than rings? How do the options for mesh protection or restoration rank in capacity requirements? How much is efficiency increased if we enrich our network connectivity? We also outline p-cycles, showing this new concept can realize ring-like speed with meshlike efficiency. The scope is limited to conveying basic ideas with an understanding that they could be further adapted for use in IP or DWDM layers with GMPLS-type protocols or a centralized control plane     

Photon antibunching in the fluorescence of a single dye molecule embedded in a thin polymer film

We used scanning confocal microscopy to study the fluorescence from a single terrylene molecule embedded in a thin polymer film of polymethyl methacrylate, at room temperature, with a high signal-to-background ratio. The photon-pair correlation function g((2))(tau) exhibits perfect photon antibunching at tau = 0 and a limit of 1.3, compatible with bunching associated with the molecular triplet state. Application of this molecular system to a triggered single-photon source based on single-molecule fluorescence is investigated.     

Sensor Deployment Strategy for Detection of Targets Traversing a Region

Sensing devices can be deployed to form a network for monitoring a region of interest. This paper investigates detection of a target traversing the region being monitored by using collaborative target detection algorithms among the sensors. The objective of the study is to develop a low cost sensor deployment strategy to meet a performance criteria. The paper defines a path exposure metric as a measure of goodness of deployment. It then gives a problem formulation for the random sensor deployment and defines cost functions that take into account the cost of single sensors and the cost of deployment. A sequential sensor deployment approach is then developed. The paper illustrates that the overall cost of deployment can be minimized to achieve the desired detection performance by appropriately choosing the number of sensors deployed in each step of the sequential deployment strategy.