Please use this identifier to cite or link to this item:
Title: Quality of Service on Services Selection using Anycast Techniques: a Convergence Analysis
Authors: Adami, L. J.
Estrella, J. C.
Reiff-Marganiec, Stephan
Libardi, R. M. D. O.
First Published: 2-Jul-2015
Presented at: IFIP/IEEE IM 2015, Ottawa, Canada
Start Date: 11-May-2015
End Date: 15-May-2015
Citation: Integrated Network Management (IM), 2015 IFIP/IEEE International Symposium on
Abstract: Anycast is an effective technique to select system servers among many and by spreading client requests achieve high performance and scalability. In our previous work, we presented the Global Application Layer Anycast (GALA) system. By combining real time network distances measures and geolocation, it performed better than its inherited algorithm, GAA. In this work we analyze how fast the GALA algorithm can find the best server to attend a client request and comparing its convergence to GAA. Using simulations, we show that it converges much faster and we propose a maximum selection time metric to be used in the selection process. Experimental results reveal that the GALA algorithm is two times better than the GAA considering the metric proposed.
DOI Link: 10.1109/INM.2015.7140381
ISSN: 1573-0077
Version: Post-print
Status: Peer-reviewed
Type: Conference Paper
Rights: Copyright 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Archived with reference to IEEE PSPB Operations Manual. Publication of record:
Appears in Collections:Conference Papers & Presentations, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
lasdpc_2014_master_Lucas_paper_Anycast_IM-2.pdfPost-review (final submitted)179.25 kBAdobe PDFView/Open

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.