A Tool Based Edge Server Selection Technique using Spatial Data Structure

Authors

  • Sandip Roy

  • Debabrata Sarddar

  • Rajesh Bose

Keywords:

content delivery network, K-d tree, least response time, load balancing, nearest neighbor search, spatial data structure

Abstract

Space partitioning is the process of dividing a Euclidean space into a non-overlapping regions. Kdimensional tree is such space-partitioning data structure for partitioning a Euclidean plane like the surface of earth. This paper describes a tool-based logically partitioning technique of earth surface using K-dimensional tree to segregate the edge servers over the earth surface into a nonoverlapping regions for the particular Content Delivery Network. Consequently selecting an edge server based on Least Response Time lo ad balancing algorithm is introduced to improve end-user response time and fault tolerance of the host server.

How to Cite

Sandip Roy, Debabrata Sarddar, & Rajesh Bose. (2014). A Tool Based Edge Server Selection Technique using Spatial Data Structure. Global Journal of Computer Science and Technology, 14(G3), 13–17. Retrieved from https://computerresearch.org/index.php/computer/article/view/1102

A Tool Based Edge Server Selection Technique using Spatial Data Structure

Published

2014-05-15