Abhijit Sengupta

Learn More
This paper analyzes the diagnosability and diagnosis problems for a model introduced in [21 of a self-diagnosable tasks performed by other processors in the system. In this paper, a set of criteria is given for determining whether the processors in the system can be diagnosed on the basis of the comparisons, and a polynomial-time algorithm is presented to(More)
ÐIn this paper, the properties of Kautz digraphs are studied to evaluate their suitability as topology for optical networks. The properties are compared to those of other topologies proposed in the literature and it has been shown these topologies have better performance in terms of queuing delay in a multihop network. For a given degree of each node and a(More)
In this paper, we have studied a number of algorithms for routing in all-optical wavelength routed networks. We have considered situations where a lightpath is dynamically created in response to a request for communication and the WDM channels constituting the lightpath are reclaimed when the communication is over. We have looked at two schemes for dynamic(More)
This paper considers wavelength routed WDM networks where multiple fibers are used for each communication link. For such networks, the effect of wavelength translation can be achieved without explicit use of wavelength translators. We call this as virtual wavelength translation and study the routing issues considering dynamic lightpath allocation. Using(More)
We study a variant of the multi-candidate Hotelling–Downs model that recognizes that politicians, even after declaring candidacy, have the option of withdrawing from the electoral contest before the election date and saving the cost of continuing campaign. We find that this natural variant significantly alters equilibrium predictions. We give conditions for(More)
In this paper, we show that in an n-dimensional hypercuhe Qn with fn faulty nodes and fe faulty edges, such that f,+f,<n-l,aringoflength2” 2f,, can be embedded avoiding the faulty elements when fn B 0 or fe -c n 1. When fn = 0 and fe = n 1, if all the faulty edges are not incident on the same node, a Hamiltonian cycle can be embedded avoiding the faulty(More)