A Time-Sensitive Path Selection Algorithm for Connectionless Network
P. Calduwel Newton, L. Arockiam, Tai-hoon Kim · 2008
The performance of a computer network is mostly affected by heavy traffic. The upcoming networks are more sensitive to time. Especially in multimedia networks, time is an important factor. So, efficient mechanisms are needed to improve the performance of the network. Connectionless network uses multiple paths to send the packets and achieves higher bandwidth. But, Connection-oriented network uses the same/single path to send all the packets. In this paper, we have proposed an algorithm to send all the packets through i-paths instead of multiple paths. Here, i-paths denote intelligent paths. Our algorithm thinks differently and generates intelligent paths. As the time factor directly affects throughput, a time-sensitive path selection algorithm is need of the hour. The outcome of this paper gives better solutions to save time and to reduce congestion.