Learn More
The effects of an attack connection can propagate quickly to different parts of an all-optical transparent network. Such attacks affect the normal traffic and can either cause service degradation or outright service denial. Quick detection and localization of an attack source can avoid losing large amounts of data in an all-optical network. Attack monitors(More)
— This paper considers the problem of dynamically establishing dependable connections (D-connections) with specified failure restoration guarantees in wavelength-routed wavelength-division multiplexed (WDM) networks. We call a connection with fault tolerant requirements as a D-connection. We recommend using a pro-active approach to fault tolerance wherein a(More)
This paper describes an algorithm for optimally placing a given number of wavelength converters in All-Optical Networks(A0Ns) with arbitrary topologies. We first introduce the simple network model upon which the algorithm is based. We explain how the blocking performance of the network can be obtained when a given number of converters are placed at the(More)
In this paper we use game theory to study nodes' behavior in peer-to-peer networks when nodes receive service based on their reputation. Reputation is used as a mechanism to incentivize nodes to share resources and provide services to others. The probability of a node obtaining service is directly proportional to its current reputation, and the only way to(More)
Information integrity in cache memories is a fundamental requirement for dependable computing. Conventional architectures for enhancing cache reliability using check codes make it difficult to trade between the level of data integrity and the chip area requirement. We focus on transient fault tolerance in primary cache memories and develop new architectural(More)