Abstract

For widely distributed data analysis applications over that run the Internet, both the instability of the data transfer time and the dynamics of data processing rate require a more sophisticated data provisioning scheme to maximize parallel efficiency, in particular, under conditions in which real-time and limited data buffer (storage) constraints are given. In this letter, we propose a synchronized data provisioning scheme that implicitly avoids the data buffer overflow as well as explicitly controls the data buffer underflow by optimally adjusting the buffer resilience. In order to guarantee the designated quality of service, we further exploit an adaptive buffer resilience control algorithm based on sample path analysis of the state of the data buffer and the demand queue. The simulation results show that the proposed scheme is suitably efficient to apply to an environment that can not postulate the stochastic characteristics of the data transfer time and data processing rate.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.