We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 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

An Efficient Edge Server Selection in Content Delivery Network using Dijkstra's Shortest Path Routing Algorithm with Euclidean Distance

by Sougata Chakraborty, Debabrata Sarddar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 117 - Number 4
Year of Publication: 2015
Authors: Sougata Chakraborty, Debabrata Sarddar
10.5120/20544-2915

Sougata Chakraborty, Debabrata Sarddar . An Efficient Edge Server Selection in Content Delivery Network using Dijkstra's Shortest Path Routing Algorithm with Euclidean Distance. International Journal of Computer Applications. 117, 4 ( May 2015), 24-26. DOI=10.5120/20544-2915

@article{ 10.5120/20544-2915,
author = { Sougata Chakraborty, Debabrata Sarddar },
title = { An Efficient Edge Server Selection in Content Delivery Network using Dijkstra's Shortest Path Routing Algorithm with Euclidean Distance },
journal = { International Journal of Computer Applications },
issue_date = { May 2015 },
volume = { 117 },
number = { 4 },
month = { May },
year = { 2015 },
issn = { 0975-8887 },
pages = { 24-26 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume117/number4/20544-2915/ },
doi = { 10.5120/20544-2915 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:58:27.559392+05:30
%A Sougata Chakraborty
%A Debabrata Sarddar
%T An Efficient Edge Server Selection in Content Delivery Network using Dijkstra's Shortest Path Routing Algorithm with Euclidean Distance
%J International Journal of Computer Applications
%@ 0975-8887
%V 117
%N 4
%P 24-26
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The performance enhancement of the edge server in Content Delivery Network is the budding area of the research in the fields of modern Information Technology and Communication Engineering so that the web users or the cloud users across the network get faster service irrespective of any geographic locations during browsing over internet and at the same time downloading multimedia contents. As an aftermath, several approaches and aspects have been introduced so far with the efflux of time. Therefore, our main objective is to facilitate this area of improvement by finding the selection of an appropriate edge server which will provide the multimedia contents and ensuring a faster response time and downloading time of the requested content due to reduced latency to the web users as well. Our proposed method will show the efficient technique for choosing the appropriate edge server with comparatively less complexity.

References
  1. E. Nygren, R. K. Sitaraman and J. Sun. Article: The Akamai Network: A Platform for High-Performance Internet Applications. ACM SIGOPSOSR, vol. 44, no. 3, pp. 2–19, 2010.
  2. T. Repantis, J. Cohen, S. Smith and J. Wein. Article: Scaling a Monitoring Infrastructure for the Akamai Network. ACM SIGOPS Operating Systems Review, vol. 44, no. 3, July 2010.
  3. J. Parikh, H. Prokop, R. Sitaraman, J. Dilley, B. Maggs and B. Weihl. Article: Globally Distributed Content Delivery. IEEE INTERNET COMPUTING, pp. 50-58, September-October 2002.
  4. Debabrata Sarddar, Sandip Roy and Rajesh Bose. Article: An Efficient Edge Servers Selection in Content Delivery Network Using Voronoi Diagram. International Journal on Recent and Innovation Trends in Computing and Communication Volume: 2 Issue: 8. ISSN: 2321-8169.
  5. Jun Li, Snigdha Verma and Kumar Ramaswamy. Patent: Centralized scheduler for content delivery network. Link: http://www. google. co. in/patents/WO2007111588A1?cl=en Publication Number: WO2007111588 A1.
  6. J. Pan et al. Article: An overview of DNS-based server selections in content distribution networks. Elsevier Computer Networks 43 (2003) 695–711.
  7. P. Danzig, K. Obraczka and A. Kumar. Article: An analysis of wide area name server traffic: a study of the Internet domain name system. In: Proc. ACM SIGCOMM'92, 1992, pp. 281–292.
  8. K. Johnson, J. Carr, M. Day and M. Kaashoek. Article: The measured performance of content distribution networks. In: Proc. IEEE WCW'01, Boston, MA, 2001.
  9. B. Krishnamurthy, C. Wills and Y. Zhang. Article: On the use and performance of content distribution networks. In: Proc. 1st ACM IGCOMM Internet Measurement Workshop (IMW'01), San Francisco, CA, 2001.
  10. A. Shaikh, R. Tewari and M. Agrawal. Article: On the effectiveness of DNS-based server selection. In: Proc. IEEE INFOCOM'01, 2001, pp. 1801–1810.
  11. Debabrata Sarddar, Sandip Roy and Rajesh Bose. Article: A Tool based Edge Server Selection Technique using Spatial Data Structure. Global Journal of Computer Science and Technology: G Interdisciplinary. Volume 14 Issue 3 Version 1. 0 Year 2014. Type: Double Blind Peer Reviewed International Research Journal. Publisher: Global Journals Inc. (USA). Online ISSN: 0975-4172 & Print ISSN: 0975-4350.
  12. Debabrata Sarddar, Sandip Roy and Rajesh Bose. Article: Queueing Based Edge Server Selection in Content Delivery Network Using Haversine Distance. International Journal of Electronics Communication and Computer Technology (IJECCT). Volume 4 Issue 5 (September 2014). ISSN: 2249-7838.
  13. P. Christy. Article: The network provider's business case for Internet content delivery. Internet Research Group. Link: http://www. irgintl. com/ , 1999.
Index Terms

Computer Science
Information Sciences

Keywords

Edge Server Cloud user Content Delivery Network Shortest Path Routing Algorithm Nearest Neighbor Edge Server

Powered by PhDFocusTM