Show simple item record

dc.contributor.authorGounaris, A.en
dc.contributor.authorDikaiakos, Marios D.en
dc.contributor.authorYfoulis, C.en
dc.contributor.authorSakellariou, R.en
dc.creatorGounaris, A.en
dc.creatorDikaiakos, Marios D.en
dc.creatorYfoulis, C.en
dc.creatorSakellariou, R.en
dc.description.abstractNowadays, Web Services (WSs) play an increasingly important role in Web data management solutions, since they offer a practical solution for accessing and manipulating data sources spanning administrative domains. Nevertheless, they are notoriously slow and transferring large data volumes across WSs becomes the main bottleneck in such WS-based applications. This paper deals with the problem of minimizing at runtime, in a self-managing way, the datatransfer cost of a WS encapsulating a data source. To reducethe transfer cost, the data volume is typically divided intoblocks. In this case, response time exhibits a quadratic-like, non-linear behavior with regards to the block sizeen
dc.description.abstractas such, minimizing the transfer cost entails finding the optimum block size. This situation is encountered in several systems, such as WS Management Systems (WSMSs) for DBMS-like data management over wide area service-based networks, and WSs for accessing and integrating traditional DBMSs. The main challenges in this problem include (i) the unavailability of an analytical modelen
dc.description.abstract(ii) the presence of noise, which incurs local minimaen
dc.description.abstract(iii) the volatility of the environment, which results into a moving optimum operating pointen
dc.description.abstractand (iv) the requirements for fast convergence to the optimal size of the request from the side of the client rather than of the server, and for low overshooting. This paper presents two novel solutions for detecting the optimum block size during data transmission, thus yielding lower response times. The solutions are inspired by the broader areas of runtime optimization and switching extremum control. They incorporate heuristics to avoid local optimal points, and address all the afore-mentioned challenges. The effectiveness andeffciency of the solutions is verified through empirical evaluation in real cases. Copyright 2007 ACM.en
dc.sourceInternational Conference on Information and Knowledge Management, Proceedingsen
dc.source9th Annual ACM International Workshop on Web Information and Data Management, WIDM '07, Co-located with the 16th ACM Conference on Information and Knowledge Management, CIKM '07en
dc.subjectDistributed computer systemsen
dc.subjectManagement scienceen
dc.subjectTechnical presentationsen
dc.subjectService Orienteden
dc.subjectWeb servicesen
dc.subjectData managementen
dc.subjectResponse time (computer systems)en
dc.subjectAutonomic computingen
dc.subjectData Griden
dc.subjectData gridsen
dc.subjectKnowledge managementen
dc.subjectService-oriented data managementen
dc.subjectWeb service performanceen
dc.subjectWide area networksen
dc.titleSelf-optimizing block transfer in web service gridsen
dc.description.endingpage56 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeConference Objecten
dc.description.notes<p>Sponsors: Universidade de Lisboaen
dc.description.notesConference code: 79925en
dc.description.notesCited By :2</p>en
dc.contributor.orcidDikaiakos, Marios D. [0000-0002-4350-6058]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record