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

International Journal of Computer Applications
doi 10.5120/20544-2915
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Foundation of Computer Science

Related search

Dijkstra Shortest Path Algorithm Using Global Position System

International Journal of Computer Applications
2014English

An Efficient Euclidean Distance Transform

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

An Approximated Selection Algorithm for Combinations of Content With Virtual Local Server for Traffic Localization in Peer-Assisted Content Delivery Networks

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2013English

Efficient Processing of Which-Edge Questions on Shortest Path Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Approximate Algorithm for Searching Shortest Path in Multiservice Network With Constrained Resource

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

Energy Efficient Multi-Path Routing Algorithm Using Gray System Theory for Improvement of Routing and Network Stability in Internet of Things

2020English

Performance Routing With Shortest Path Exploration in Wireless Mesh Networks

Kongunadu Research Journal
2020English

An Algorithm of Searching for the Shortest Path

2017English

Smart Helmet for Accident Prevention Using Shortest Path Algorithm

International Journal for Research in Applied Science and Engineering Technology
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy