Development of Heuristics for Permutation Routing in a General Network and Algorithms for Some Specific Networks.

Date of Submission

December 1998

Date of Award

Winter 12-12-1999

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Sinha, Bhabani Prasad (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

Presented here is a heuristic for routing permutations on a general network. Discussed also are some deterministic algorithms on some special kind of networks. Lincar array, Two-dimensional array, and hypercube are included in the special kind of networks. Both off-line and on-line routing problems are considered here. For a two dimensional ( NX N) array every permutation can be routed in 6N +°(N) steps with a queue size of only one.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.