CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Estimation of Buffer Size in Computer Networks

by Saleh A. Khawatreh, Bashar E. A. Badr
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 177 - Number 14
Year of Publication: 2019
Authors: Saleh A. Khawatreh, Bashar E. A. Badr
10.5120/ijca2019919445

Saleh A. Khawatreh, Bashar E. A. Badr . Estimation of Buffer Size in Computer Networks. International Journal of Computer Applications. 177, 14 ( Oct 2019), 28-31. DOI=10.5120/ijca2019919445

@article{ 10.5120/ijca2019919445,
author = { Saleh A. Khawatreh, Bashar E. A. Badr },
title = { Estimation of Buffer Size in Computer Networks },
journal = { International Journal of Computer Applications },
issue_date = { Oct 2019 },
volume = { 177 },
number = { 14 },
month = { Oct },
year = { 2019 },
issn = { 0975-8887 },
pages = { 28-31 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume177/number14/30967-2019919445/ },
doi = { 10.5120/ijca2019919445 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:45:52.876564+05:30
%A Saleh A. Khawatreh
%A Bashar E. A. Badr
%T Estimation of Buffer Size in Computer Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 177
%N 14
%P 28-31
%D 2019
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In computer networks, a message passes through several nodes to reach its destination. A message is delayed by different sources such as link bandwidth and buffer limitations. In this research, a mathematical model is implemented to compute the optimal number of buffers that should be available for each node so that none of the messages is lost. This model is based on a priority assignment strategy where processing of a message is preempted by the arrival of messages from higher priority nodes. The load generated by each node is measured by a load factor which is defined as the ratio between the maximum time needed to process the arriving message and the minimum interarrival time between messages. A case study is made on a star network in which a central node receives messages from n other nodes. The relation between the amount of buffer space needed and the load factor are made through computer simulation program. The analysis presented in this paper may help in designing reliable networks by making sure, early in the design stages, that a sufficient amount of buffer space is provided to avoid message loss and unnecessary delays thereby increasing the network throughput.

References
  1. Tanenbaum, A. S., “Computer Networks” Prentice-Hall, 2012.
  2. Bakry, S. H.,” Extended Computer Networks for Engineers and Scientist”Journal of Eng. Sci., Vol.8, No. 1, College of Engineering, King Saud University, 1982,PP. 91-98.
  3. Tanenbaum, A. S.,” Network Protocols” Computing Surveys, Vol. 13, No. 4, December 1981.
  4. A. Mahjoub, “On the Static Analysis of Distributed System Performance” Computer journal 27(3), 1994, PP. 201-208.
  5. Davies, D.W., and Barber, D. L. A “Communication Networks for Computers” Wiley, 1980.
  6. Kuo, F. F “Protocols and Techniques for Data Communication Networks” Prentice-Hall, 1981.
  7. Mcquillan, J. M., and Cref, V. G. “a Practical View of Computer Communications Protocols”, IEEE, Computer Society, 1978, PP. 76-85.
  8. Lam, S. S, and Reiser, M. “Congestion Control of Store-and-Forward Networks by Input Buffer Limits Analysis” IEEE Transaction on Communication, Vol. Com-27, No. 1, January 1979, PP.122-130.
  9. Schweitzer, P. J., and Lam, S. S “Buffer overflow in a Store-and-Forward Networks Nodes” IBM J. Res. Develop. November, 1976, PP. 58-67.
  10. Cheong, V. E., and HirsChhiem, R. A.” Local Area Networks” Wiley, 1983.
  11. Deitel, H. M. “An Introduction to Operating Systems” Addison Wesley, 2000.
  12. C. Kellett, R. Shorten, D. Leith. “Sizing internet buffers, Active queue management, and the Lur’e problem”. Proceedings of IEEE Conf on Decision and Control, 2006.
  13. Y. Ganjali, N. McKeown. “Update on Buffer Sizing in Internet Routers”. Computer Communications Review, October 2006.
  14. Silberschatz, A., Galvin P. B., and Gagne, G. " Operating System Concepts " John Wiley, 2016.
Index Terms

Computer Science
Information Sciences

Keywords

Computer networks buffer space delay priority load factor interarrival time response time.

Powered by PhDFocusTM