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.
Libardi, R. M. D. O.
|Presented at:||IFIP/IEEE IM 2015, Ottawa, Canada|
|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.|
|Embargo on file until:||1-Jan-10000|
|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:
|lasdpc_2014_master_Lucas_paper_Anycast_IM-2.pdf||Post-review (final submitted)||179.25 kB||Adobe PDF||View/Open|
Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.