Title :
Optimal utilization of equivalent paths in computer networks with static routing
Author :
Avresky, D. ; Shurbanov, V. ; Natchev, N. ; Zuccarino, E. ; Mehra, P.
Author_Institution :
Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA
Abstract :
Focuses on the utilization of alternative communication paths in local and system area networks with static routing. A lot of research work has been devoted to employing such paths for fault tolerance, but the issue of utilizing them for performance enhancement has been largely neglected, especially for static routing networks. This work formally proves that the throughput of multiple paths is maximal if the traffic is uniformly distributed over them. Based on this, a procedure for destination partitioning in static routing networks is introduced. It is applicable to arbitrary multi-path topologies and traffic patterns that lend themselves to partitioning. The procedure is applied to several topologies with different degree of equivalent paths coverage and their performance is evaluated through simulations. The results demonstrate that the network performance is significantly improved when the proposed partitioning procedure is applied
Keywords :
graph theory; local area networks; network topology; probability; telecommunication network routing; arbitrary multi-path topologies; communication paths; computer networks; destination partitioning; equivalent paths; local area networks; performance enhancement; static routing; system area networks; traffic patterns; uniform distribution; Computer network reliability; Computer networks; Delay; Electronic mail; Fault tolerance; Intelligent networks; Network topology; Routing; Telecommunication traffic; Throughput;
Conference_Titel :
Network Computing and Applications, 2001. NCA 2001. IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7695-1432-4
DOI :
10.1109/NCA.2001.962525
