Home   >   CSC-OpenAccess Library   >    Manuscript Information
Full Text Available

(72.79KB)
This is an Open Access publication published under CSC-OpenAccess Policy.
An Algorithm for Computing Average Packet Delay
M. R. Hassan
Pages - 10 - 16     |    Revised - 31-03-2011     |    Published - 04-04-2011
Volume - 3   Issue - 1    |    Publication Date - March / April 2011  Table of Contents
MORE INFORMATION
KEYWORDS
Computer Networks, QoS, Average Packet Delay
ABSTRACT
Average Packet delay is considered as a vital performance measure for a computer-communication network especially in the network designing problem. Average Packet delay evaluation depends on two main parts: the first part is the capacity of each link in the network, the last one is the flow of each link. The capacity of each link is assumed to be fixed but the flow of each link is computed by using routing algorithms and the traffic requirement matrix. The paper presents an algorithm based on FLOYD’s routing algorithm to calculate the flow of each link and then we can compute the average packet delay.
CITED BY (0)  
1 Google Scholar
2 CiteSeerX
3 refSeek
4 Socol@r
5 Scribd
6 Scribd
7 WorldCat
8 SlideShare
9 PdfSR
1 Tokumi Yokohira, Masashi Sugano and Hideo Miyahara, “Fault Tolerant Packet-Switched Network Design and Its Sensitivity”, IEEE Transactions on Reliability, 40(4):452-460, 1991.
2 Ahuja Sanjay P. and Kumar Anup “Reliability and Performance based measure for computer networks and distributed systems “, IEEE Southeastcon, Charlotte, NC,1993.
3 M. R. Girgis, A. Younes and M. R. Hassan, “An Algorithm for Computing Throughput of Computer Networks”, Egyptian Informatics Journal, 9(1):205-218, 2009.
4 Ahuja Sanjay P., “Performance based reliability Optimization for computer networks “, Engineering the New Century Conference Proceedings-IEEE-Southeastcon. IEEE, Piscataway, NJ, USA, 97CB36044, PP. 121-125, 1997.
5 Kumar Anup, Elmaghraby Adel S. and Auja Sanjay P., "Performance and reliability optimization for distributed computing systems", 3rd IEEE Symposium on Computers and Communications, Athens, Greece, pp. 611-615, 1998.
6 M. R. Girgis, A. Younes and M. R. Hassan, “Optimizing The Performance-Based Reliability For Computer Networks By Using Fuzzy Optimization With Genetic Algorithms”, International Journal of Computational and Applied Mathematics, 2(2):139– 148, 2007.
7 S. Pierre and A. Elgibaoui,” Improving Communication Network Topologies Using Tabu Search”, Proceedings of 22nd Annual Conference on Local Computer Networks, pp. 44- 53, 2-5 Nov 1997.
8 R. Beaubrun and S. Pierre, ” A Routing Algorithm for Distributed Communication Networks”, Proceedings of 22nd Annual Conference on Local Computer Networks, pp. 99-105, 2-5 Nov1997.
9 Peirre Samuel and Legault, “A genetic algorithm for designing distributed computer network topologies”, IEEE Transactions Systems , MAN and Cybernetics-Part B: Cybernetics, 28(2):249-258, 1998.
10 M. R. Girgis, A. Younes and M. R. Hassan, “Optimizing the transmission delay of a computer network by using fuzzy optimization with genetic algoritms”, International Journal of Intelligent Computing and Information Science, 8(1):163-171, 2008.
11 Gerla, M., and Kleinrock. L. “On theTopological Design of Distributed Computer Networks”. IEEE Transactions on communications,25(1): 48-60,1977.
12 MacIej M. Syslo, “Discrete Optimization Algorithms: With Pascal Programs”, Prentice Hall, (1983).
Dr. M. R. Hassan
- Egypt
m_r_hassan73@yahoo.com