z-logo
open-access-imgOpen Access
An Efficient Edge Server Selection in Content Delivery Network using Dijkstra's Shortest Path Routing Algorithm with Euclidean Distance
Author(s) -
Sougata 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom