Routing Model for Computer Network

E.B. Awuah, F.J. Ogwu, S.D. Asare, and G.A. Aderoumu (Botswana)


Routing model, networks, data transmission


The quest for reliable data transmission in today’s computer networks and inter-networks forms the basis for which routing schemes need be improved upon. It is thus pertinent to conceptualize and model an appropriate routing scheme as an improvement over the existing schemes. A mathematical and analytical routing model framework is proposed. The model provides schemes typical of packet sources, queuing systems 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. This research endeavor however, leaves room for further work in the aspect of limited buffer and network scalability.

Important Links:

Go Back