Amitabha Chakrabarty

Learn More
—This paper presents a nonblocking routing algorithm for Beneš networks. Such networks are of potential interest in implementing large scale optical cross-connects, but their complex routing algorithm limits their applications. We use a simple approach to determine the routing tags for a conflict free routing. Available methods proposed in the literature(More)
In the recent years, reconstructing 3D liver and its vessels from abdominal CT volume images becomes an inevitable and necessary research field. In this paper, a method of 3D reconstruction of liver with its vessels has been implemented, which involves volume preprocessing, de-noising, segmentation, contouring, and combination of different modalities. An(More)
The Bene¿s network is a long established method to connect large switching networks. This network has the characteristic of providing multiple paths for same output request. In this paper, we present a new routing algorithm that can route data from given input to the desired output. Our method uses one of the available paths for Input/Output request(More)
Transferring messages or packets through a network using human mobility as a means, requires intelligent routing decisions. Throughout an opportunistic network, nodes travel with a few messages and searches for an opportunity to deliver the message. A good delivery rate of such messages in these sort of networks is a challenge which might require complex(More)
Rearrangeable switching networks have been a topic of interest for a long time among the research community. Routing algorithms for this class of networks have attracted lots of researchers along with other related areas, such as modification of the networks structure, crosspoints reduction etc. In this paper a new routing algorithm is presented for(More)
I Declaration We hereby declare that this thesis is based on the results we found by our work. Contents of work found by other researcher(s) are mentioned by reference. This thesis has never been previously submitted for any degree neither in whole nor in part. II Acknowledgement We would like to thank God almighty for giving us the opportunity and ability(More)
Routing algorithms for symmetric rearrange able networks have been an open issue from the time of their inception. Most of the studied algorithms are nonblocking and work for full active permutations. Nonblocking algorithms compromise time complexities to get high throughput from the network. Blocking algorithms have much lower time complexities than(More)