3 resultados para media performance
em Boston University Digital Common
Resumo:
This dissertation describes a model for acoustic propagation in inhomogeneous flu- ids, and explores the focusing by arrays onto targets under various conditions. The work explores the use of arrays, in particular the time reversal array, for underwater and biomedical applications. Aspects of propagation and phasing which can lead to reduced focusing effectiveness are described. An acoustic wave equation was derived for the propagation of finite-amplitude waves in lossy time-varying inhomogeneous fluid media. The equation was solved numerically in both Cartesian and cylindrical geometries using the finite-difference time-domain (FDTD) method. It was found that time reversal arrays are sensitive to several debilitating factors. Focusing ability was determined to be adequate in the presence of temporal jitter in the time reversed signal only up to about one-sixth of a period. Thermoviscous absorption also had a debilitating effect on focal pressure for both linear and nonlinear propagation. It was also found that nonlinearity leads to degradation of focal pressure through amplification of the received signal at the array, and enhanced absorption in the shocked waveforms. This dissertation also examined the heating effects of focused ultrasound in a tissue-like medium. The application considered is therapeutic heating for hyperther- mia. The acoustic model and a thermal model for tissue were coupled to solve for transient and steady temperature profiles in tissue-like media. The Pennes bioheat equation was solved using the FDTD method to calculate the temperature fields in tissue-like media from focused acoustic sources. It was found that the temperature-dependence of the medium's background prop- erties can play an important role in the temperature predictions. Finite-amplitude effects contributed excess heat when source conditions were provided for nonlinear ef- fects to manifest themselves. The effect of medium heterogeneity was also found to be important in redistributing the acoustic and temperature fields, creating regions with hotter and colder temperatures than the mean by local scattering and lensing action. These temperature excursions from the mean were found to increase monotonically with increasing contrast in the medium's properties.
Resumo:
Internet streaming applications are adversely affected by network conditions such as high packet loss rates and long delays. This paper aims at mitigating such effects by leveraging the availability of client-side caching proxies. We present a novel caching architecture (and associated cache management algorithms) that turn edge caches into accelerators of streaming media delivery. A salient feature of our caching algorithms is that they allow partial caching of streaming media objects and joint delivery of content from caches and origin servers. The caching algorithms we propose are both network-aware and stream-aware; they take into account the popularity of streaming media objects, their bit-rate requirements, and the available bandwidth between clients and servers. Using realistic models of Internet bandwidth (derived from proxy cache logs and measured over real Internet paths), we have conducted extensive simulations to evaluate the performance of various cache management alternatives. Our experiments demonstrate that network-aware caching algorithms can significantly reduce service delay and improve overall stream quality. Also, our experiments show that partial caching is particularly effective when bandwidth variability is not very high.
Resumo:
We consider the problem of delivering popular streaming media to a large number of asynchronous clients. We propose and evaluate a cache-and-relay end-system multicast approach, whereby a client joining a multicast session caches the stream, and if needed, relays that stream to neighboring clients which may join the multicast session at some later time. This cache-and-relay approach is fully distributed, scalable, and efficient in terms of network link cost. In this paper we analytically derive bounds on the network link cost of our cache-and-relay approach, and we evaluate its performance under assumptions of limited client bandwidth and limited client cache capacity. When client bandwidth is limited, we show that although finding an optimal solution is NP-hard, a simple greedy algorithm performs surprisingly well in that it incurs network link costs that are very close to a theoretical lower bound. When client cache capacity is limited, we show that our cache-and-relay approach can still significantly reduce network link cost. We have evaluated our cache-and-relay approach using simulations over large, synthetic random networks, power-law degree networks, and small-world networks, as well as over large real router-level Internet maps.