ACM Home Page
Please provide us with feedback. Feedback
Self-optimizing block transfer in web service grids
Full text PdfPdf (218 KB)
Source
Workshop On Web Information And Data Management archive
Proceedings of the 9th annual ACM international workshop on Web information and data management table of contents
Lisbon, Portugal
SESSION: P2P and system design issues table of contents
Pages 49-56  
Year of Publication: 2007
ISBN:978-1-59593-829-9
Authors
Anastasios Gounaris  University of Cyprus, Nicosia, Cyprus
Christos Yfoulis  ATEI of Thessaloniki, Thessaloniki, Greece
Rizos Sakellariou  University of Manchester, Manchester, United Kngdm
Marios D. Dikaiakos  University of Cyprus, Nicosia, Cyprus
Sponsors
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 33,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1316902.1316911
What is a DOI?

ABSTRACT

Nowadays, 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 size; as 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 model; (ii) the presence of noise, which incurs local minima; (iii) the volatility of the environment, which results into a moving optimum operating point; and (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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
T. F. Abdelzaher, A. Stankovic, C. Lu, R. Zhang, and Y. Lu. Feedback performance control in software services. IEEE Control Systems Magazine, 23(3), 2003.
 
3
M. N. Alpdemir, A. Mukherjee, N. W. Paton, P. Watson, A. A. A. Fernandes, A. Gounaris, and J. Smith. Service-based distributed querying on the grid. In Proc. of 1st Int. Conf. on Service Oriented Computing - ICSOC, pages 467--482. Springer, 2003.
 
4
N. Alpdemir, A. Gounaris, A. Mukherjee, D. Fitzgerald, N. W. Paton, P. Watson, R. Sakellariou, A. A. Fernandes, and J. Smith. Experience on Performance Evaluation with OGSA-DQP. In Proceedings of the UK e-Science All Hands Meeting, 2005.
 
5
 
6
 
7
K. J. Aström and B. Wittenmark. Adaptive Control. Addison-Wesley, Reading, MA, USA, 1995.
 
8
Y. Diao, F. Eskesen, S. Forehlich, J. Hellerstein, L. Spainhower, and M. Surendra. Generic online optimization of multiple configuration parameters with application to a database server. DSOM, pages 3--15, 2003.
 
9
 
10
B. Dobrzelecki, M. Antonioletti, J. Schopf, A. Hume, M. Atkinson, N. C. Hong, M. Jackson, K. Karasavvas, A. Krause, M. Parsons, T. Sugden, and E. Theocharopoulos. Profiling OGSA-DAI Performance for Common Use Patterns. In Proceedings of the UK e-Science All Hands Meeting, 2006.
 
11
O. Flardh, K. Johansson and M. Johansson. A new feedback control mechanism for error correction in packet-switched networks. pages 488--493, 2005. IEEE Conference on Decision and Control.
 
12
 
13
 
14
A. Gounaris, J. Smith, N. W. Paton, R. Sakellariou, A. A. A. Fernandes, and P. Watson. Adapting to changing resource performance in grid query processing. In Data Management in Grids, First VLDB Workshop, DMG 2005, pages 30--44, 2005.
 
15
J. Hellerstein, Y. Diao, S. Parekh, and D. Tilbury. Control engineering for computing systems. IEEE Control Systems Magazine, 25(6):56--68, 2005.
16
 
17
X. Liu, L. Sha, Y. Diao, S. Froehlich, J. L. Hellerstein, and S. S. Parekh. Online response time optimization of apache web server. In IWQoS, pages 461--478, 2003.
 
18
 
19
 
20
 
21
Y. Raghavachari, D. Reimer, and R. Johnson. The deployer's problem: Configuring application servers for performance and reliability. pages 3--15, 2003. ICSE.
 
22
 
23


Collaborative Colleagues:
Anastasios Gounaris: colleagues
Christos Yfoulis: colleagues
Rizos Sakellariou: colleagues
Marios D. Dikaiakos: colleagues