Packet switching systems are commonly used in many computer communication networks for their efficient resources sharing, fast delivery of information and higher throughput. In packet switched networks, messages are segmented into packets of appropriate size and each packet is transmitted independently using the store and forward (S/F) technique. In the given network topology, a routing problem must be solved, i.e., routes must be selected so as to accomodate the external traffic requirements and optimize network performance-usually measured in terms of packet or message delay-that results in higher network reliability.
Buffer design is also an important consideration in planning the switching nodes for the systems. Some basic problems occurring in such systems are the interrelationship between the overflow probability and the buffer size at various traffic circumstances. Overflow, which may be defined as the average fraction of the data rejected, cause invalid transmission and degradation of performance.
In this paper, Isolated Bias Update (IBU) algorithm which estimates the network traffic and takes routes using the indirect information of neighbor nodes is proposed. Without exchanging the traffic information, it has a good performance for overall traffics. And various routing algorithms including IBU are compared using simulation method for small sized packet switched networks. Secondly, buffer size optimization with routing problem for the given system parameters and traffic conditions are also considered in a 3-node packet switching system.
