%0 Journal Article
%T A Packet Routing Model for Computer Networks
%A O. Osunade
%J International Journal of Computer Network and Information Security
%D 2012
%I MECS Publisher
%X The quest for reliable data transmission in today¡¯s computer networks and internetworks forms the basis for which routing schemes need be improved upon. The persistent increase in the size of internetwork leads to a dwindling performance of the present routing algorithms which are meant to provide optimal path for forwarding packets from one network to the other. A mathematical and analytical routing model framework is proposed to address the routing needs to a substantial extent. The model provides schemes typical of packet sources, queuing system within a buffer, links and bandwidth allocation and time-based bandwidth generator in routing chunks of packets to their destinations. Principal to the choice of link are such design considerations as least-congested link in a set of links, normalized throughput, mean delay and mean waiting time and the priority of packets in a set of prioritized packets. These performance metrics were targeted and the resultant outcome is a fair, load-balanced network.
%K Network communications
%K routers
%K priority control scheme
%K routing model
%K traffic analysis
%U http://www.mecs-press.org/ijcnis/ijcnis-v4-n4/v4n4-2.html