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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

An AIMD Distributed Control Law for Load Balancing in Content Delivery Networks

by Akash B. Rathod, Pallavi Kulkarni
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 108 - Number 18
Year of Publication: 2014
Authors: Akash B. Rathod, Pallavi Kulkarni
10.5120/19009-0458

Akash B. Rathod, Pallavi Kulkarni . An AIMD Distributed Control Law for Load Balancing in Content Delivery Networks. International Journal of Computer Applications. 108, 18 ( December 2014), 5-8. DOI=10.5120/19009-0458

@article{ 10.5120/19009-0458,
author = { Akash B. Rathod, Pallavi Kulkarni },
title = { An AIMD Distributed Control Law for Load Balancing in Content Delivery Networks },
journal = { International Journal of Computer Applications },
issue_date = { December 2014 },
volume = { 108 },
number = { 18 },
month = { December },
year = { 2014 },
issn = { 0975-8887 },
pages = { 5-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume108/number18/19009-0458/ },
doi = { 10.5120/19009-0458 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:43:17.430325+05:30
%A Akash B. Rathod
%A Pallavi Kulkarni
%T An AIMD Distributed Control Law for Load Balancing in Content Delivery Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 108
%N 18
%P 5-8
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Content Delivery Networks (CDN) is the best for overcoming the inherited problems face by internet in modern days. The major idea at the basis of this technology is the delivery at edge points of the network, in proximity to the request areas, to advance the user's perceived performance while off-putting the overheads. Literature shows that in Content Delivery Network how this demanding problem of defining and implementing an effective law for load balancing is model. But this system has some drawback, like even if the queue length of server is low they redirect loads to another server to only balance the overall load. Due to this request processing overhead and delay increases. Algorithm model in paper can help to reduce this delay by putting one equilibrium point to request queue. In CDN, the source adjusts its rate using a modified Additive Increase and Multiplicative Decrease (AIMD) algorithm. AIMD has been demonstrated to be sufficient and essential of efficiency and fairness under certain general conditions.

References
  1. H. Yin, X. Liu, G. Min, and C. Lin, "Content Delivery Networks: a Bridge between Emerging Applications and Future IP Networks," IEEE Network, vol. 24, no. 4, pp. 52–56, July-August 2010.
  2. A. Barbir, B. Cain, and R. Nair, "Known content network (CN) request routing mechanisms," IETF, RFC 3568 Internet Draft, Jul. 2003 [Online]. Available: http://tools. ietf. org/html/rfc3568.
  3. T. Brisco, "DNS support for load balancing," IETF, RFC 1794 Internet Draft, Apr. 1995 [Online]. Available: http://www. faqs. org/rfcs/rfc1794. html.
  4. M. Colajanni, P. S. Yu, and D. M. Dias, "Analysis of task assignment policies in scalable distributedWeb-server systems," IEEE Trans. Parallel Distrib. Syst. , vol. 9, no. 6, pp. 585–600, Jun. 1998.
  5. D. M. Dias, W. Kish, R. Mukherjee, and R. Tewari, "A scalable and highly availableWeb server," in Proc. IEEE Comput. Conf. , Feb. 1996,pp. 85–92.
  6. "Adaptive AIMD Congestion Control" Alex Kesselman School of Computer Science TelAviv University TelAviv, Israel.
  7. S. Meng, L. Liu, and J. Yin, "Scalable and reliable iptv service through collaborative request dispatching," in Proceedings of IEEE International Conference on Web Services – ICWS 2010, July 2010, pp. 179–186.
  8. M. Dahlin, "Interpreting stale load information," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 10, pp. 1033–1047, October 2000.
  9. M. D. Mitzenmacher, "The power of two choices in randomized load balancing," IEEE Transactions on Parallel and Distributed Systems,vol. 12, no. 10, pp. 1094–1104, October 2001.
  10. V. Cardellini, E. Casalicchio, M. Colajanni, and P. S. Yu, "The state of the art in locally distributed web-server systems," ACM ComputingSurveys, vol. 34, no. 2, pp. 263–311, June 2002.
  11. C. V. Hollot, V. Misra, D. Towsley, and W. Gong, "Analysis and design of controllers for aqm routers supporting tcp flows," IEEE Transactions on Automatic Control, vol. 47, no. 6, pp. 945–959, June 2002.
  12. C. V. Hollot, V. Misra, D. Towsley, and W. bo Gong, "A control heoretic analysis of red," in Proceedings of IEEE International Conference onComputer Communications - INFOCOM '01, 2001, pp. 1510–1519.
  13. F. Blanchini, R. L. Cigno, and R. Tempo, "Robust rate control for integrated services packet networks," IEEE/ACM Transactions on Networking, vol. 10, no. 5, pp. 644–652, October 2002.
  14. V. Misra, W. Gong, W. bo Gong, and D. Towsley, "Fluid-based analysis of a network of aqm routers supporting tcp flows with an application to red," in Proceedings of ACM SIGCOMM '00, 2000, pp. 151–160.
  15. D. Cavendish, M. Gerla, and S. Mascolo, "A control theoretical pproach to congestion control in packet networks," IEEE/ACM Transactions on Networking, vol. 12, no. 5, pp. 893–906, October 2004.
  16. Sabato Manfredi, Francesco Oliviero, Simon Pietro Romano, "A Distributed Control Law for Load Balancing in Content Delivery Networks ", Ieee/Acm Transactions On Networking, Vol. 21, No. 1, February 2013 55-68.
Index Terms

Computer Science
Information Sciences

Keywords

Equilibrium point to Server queues load balancing Algorithm Additive Increase and Multiplicative Decrease (AIMD).

Powered by PhDFocusTM