International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 4, No. 4, 8 May 2012
Cover page and Table of Contents: PDF (size: 257KB)
Author(s)
O. Osunade
1,*
Index Terms
Network communications, routers, priority control scheme, routing model, traffic analysis
Abstract
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.
Cite This Paper
O. Osunade, "A Packet Routing Model for Computer Networks", International Journal of Computer Network and Information Security(IJCNIS), vol.4, no.4, pp.13-20, 2012. DOI:10.5815/ijcnis.2012.04.02
Reference
[1]Ray Horak (2000). Communications Systems and Networks, M & T Books, An imprint of IDG Books Worldwide, Inc., California.
[2]Tittel E., Hudson K. and Stewart J.M. (2000). Networking Essentials. Exam 70-058. 3rd Edition. Coriolis. USA.
[3]Yashpaul Singh E.R., and Swarup A. (2009). Analysis of Equal cost Adaptive Routing Algorithms using Connection-Oriented and Connectionless Protocols. World Academy of Science, Engineering and Technology 51 2009, pp.299-302.
[4]Halabi, S. and McPherson, D. (2000). Internet Routing Architectures. 2nd Edition. CISCO Press. Indianapolis, USA.
[5]Malhotra, Ravi (2002). IP Routing. First Edition. O’Reilly & Associates, Inc. USA.
[6]Lonnberg Jan, 2002. Routing algorithms. Based on G. Tel: Introduction to Distributed Algorithms, chapter 4.Retrieved online at www.tcs.hut.fi/Studies/T-79.192/.../lonnberg_slides_021002.pdf- Routing algorithms
[7]Mak R. H. (2011). Routing Algorithms 1. ISE 435: Distributed Algorithms in Network Communication. Retrieved online at www2.kinneret.ac.il/mjmay/ise435/435-Lecture-12-Routing1.pdf
[8]Joyner, D., Nguyen, M. V. and Cohen, N. (2010). Algorithmic Graph Theory. Version 3.0 (Electronc version). Available at “graph-theory-algorithms-book.googlecode.com”
[9]Varvarigos E.M. and Yeh C.H. (1999). Networking Routing Algorithms, In: Wiley Encyclopedia of Electrical and Electronics Engineering. Webster J.G. (ed), John Wiley & Sons, Inc., New York, Vol. 14, pp.222 – 227.
[10]Tommiska Matti and Skytta Jorma (2001). Dijkstra’s Shortest Path Routing Algorithm in Reconfigurable Hardware. Proceedings of the 11th Conference on Field-Programmable Logic and Applications (FPL 2001). Belfast, Northern Ireland, UK, 27-29 August 2001, pages 653-657.
[11]Lonnberg Jan, 2002. Routing algorithms. Based on G. Tel: Introduction to Distributed Algorithms, chapter 4.Retrieved online at www.tcs.hut.fi/Studies/T-79.192/.../lonnberg_slides_021002.pdf- Routing algorithms
[12]Adan, I. and Resing, J. (2002). Queueing Theory. Department of Mathematics and Computing Science Eindhoven University of Technology, the Netherlands.
[13]Azizoğlu, M. and Barry, R.A. (1999). Network Performance and Queueing Models, In: Wiley Encyclopedia of Electrical and Electronics Engineering. Webster J.G. (ed), John Wiley & Sons, Inc., New York, Vol. 14, pp.204 – 214.
[14]Chen, F. (2006). Admission Control and Routing in Multi-priority Systems. A dissertation University of North Carolina at Chapel Hill.