Learn More
— In this paper, we present two dynamic routing algorithms based on path and neighborhood link congestion in all-optical networks. In such networks, a connection request encounters higher blocking probability than in circuit-switched networks because of the wavelength-continuity constraint. Much research has focused on the shortest-path routing and(More)
We consider the problem of establishing <i>dependable connections</i> in WDM networks with dynamic traffic demands. We call a connection with fault-tolerant requirements as a dependable connection (D-connection). We consider the <i>single-link failure model</i> in our study and recommend the use of a proactive approach, wherein a D-connection is identified(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)
Recent advances in photonic switching have paved the way for realizing all-optical time switched networks. The current technology of Wavelength Division Multiplexing (WDM) offers bandwidth granularity that matches peak electronic transmission speed by dividing the fiber bandwidth into multiple wavelengths. However, the bandwidth of a single wavelength is(More)
—Internet computing is emerging as an important new distributed computing paradigm in which resource intensive computing is integrated over Internet-scale networks. Over these large networks, different users and organizations share their computing resources, and computations take place in a distributed fashion. In such an environment, a framework is needed(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)