A Tool Based Edge Server Selection Technique using Spatial Data Structure

1
Sandip Roy
Sandip Roy
2
Debabrata Sarddar
Debabrata Sarddar
3
Rajesh Bose
Rajesh Bose
1 W.B.U.T

Send Message

To: Author

GJCST Volume 14 Issue G3

Article Fingerprint

ReserarchID

9589K

A Tool Based Edge Server Selection Technique using Spatial Data Structure Banner
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

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.

14 Cites in Articles

References

  1. Erik Nygren,Ramesh Sitaraman,Jennifer Sun (2010). The Akamai network.
  2. J Parikh,H Prokop,R Sitaraman,J Dilley,B Maggs,B Weihl (2002). Globally Distributed Content Delivery.
  3. T Repantis,J Cohen,S Smith,J Wein (2010). Scaling a Monitoring Infrastructure for the Akamai Network.
  4. J Bentley (1975). Multidimensional binary search trees used for associative searching.
  5. S Chandran Introduction to kd-trees.
  6. J Rosenberg (1985). Geographical Data Structures Compared: A Study of Data Structures Supporting Region Queries.
  7. Moore Clarkson,K (1983). Fast algorithms for the all nearest neighbors problem.
  8. Pravin Vaidya (1989). AnO(n logn) algorithm for the all-nearest-neighbors Problem.
  9. D Sarddar,S Roy,R Bose (2014). An Efficient Edge Servers Selection in Content Delivery Network Using Voronoi Diagram.
  10. Jerome Friedman,Jon Bentley,Raphael Finkel (1977). An Algorithm for Finding Best Matches in Logarithmic Expected Time.
  11. P Vemulapalli (2010). Retrieved from MATLAB CENTRAL website.
  12. V Patel,H Patel,J Patel (2012). A Survey on Load Balancing in Cloud Computing.
  13. F Kherani,J Vania (2014). Load Balancing in cloud computing.
  14. R Mata-Toledo,P Gupta (2010). Green data center: how green can we perform.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

Sandip Roy. 2014. \u201cA Tool Based Edge Server Selection Technique using Spatial Data Structure\u201d. Global Journal of Computer Science and Technology - G: Interdisciplinary GJCST-G Volume 14 (GJCST Volume 14 Issue G3): .

Download Citation

Issue Cover
GJCST Volume 14 Issue G3
Pg. 13- 17
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Classification
Not Found
Version of record

v1.2

Issue date

October 15, 2014

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 8991
Total Downloads: 2303
2026 Trends
Research Identity (RIN)
Related Research

Published Article

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.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

A Tool Based Edge Server Selection Technique using Spatial Data Structure

Debabrata Sarddar
Debabrata Sarddar
Sandip Roy
Sandip Roy W.B.U.T
Rajesh Bose
Rajesh Bose

Research Journals