Open AccessAn Efficient Edge Server Selection in Content Delivery Network using Dijkstra's Shortest Path Routing Algorithm with Euclidean Distance
Author(s) -
Subhendu Chakraborty,
Debabrata Sarddar
Publication year - 2015
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/20544-2915
Subject(s) - dijkstra's algorithm , computer science , shortest path problem , selection (genetic algorithm) , yen's algorithm , k shortest path routing , euclidean distance , path (computing) , enhanced data rates for gsm evolution , algorithm , suurballe's algorithm , routing (electronic design automation) , theoretical computer science , computer network , artificial intelligence , graph