An Efficient Edge Servers Selection in Content Delivery Network Using Voronoi Diagram

Abstract

Handle on demand network popularity of the Content Delivery Network and solve the flash crowd problem, caching web content at the internet’s edge server has been emerged. To provide faster service of the web users, content come from nearby edge servers. Therefore nearest edge server finding of a particular web user is an open research problem and it ensures a faster response time and download time of the requested content due to reduced latency. Our simulation study and application to a real set of geographical coordinates of the edge servers which are geographically dispersed and a well-known geometric device, Voronoi diagram is used for decomposing the earth surface around each location of a particular edge server and closest edge servers of the requested web user is searched by the nearest neighbor queries using Delaunay triangulation property over the aforesaid decomposed earth surface.