Title :
Routing and path length algorithm for cost effective modified four tree network
Author :
Himanshu, Aggarwal ; Pk, B.
Author_Institution :
Fac. of Professional Courses, Punjabi Univ., Patiala, India
Abstract :
In this paper a new irregular network named the modified four tree network has been proposed and analyzed in terms of connectivity, fault-tolerance, cost-effectiveness and simplicity of design.
Keywords :
fault tolerant computing; multistage interconnection networks; network routing; network topology; trees (mathematics); connectivity; cost effective network; design simplicity; fault-tolerance; irregular network; modified four tree network; multi-stage interconnection network; path length algorithm; routing; Binary trees; Computer science; Costs; Electronic mail; Fault tolerance; Multiplexing; Multiprocessor interconnection networks; Paper technology; Routing; Switches;
Conference_Titel :
TENCON '02. Proceedings. 2002 IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering
Print_ISBN :
0-7803-7490-8
DOI :
10.1109/TENCON.2002.1181272
