20 research outputs found

    Оптимизационная модель распределения потоков данных P2P-телевидения на гиперграфах

    No full text
    This article describes the problem of the distribution data streams process in P2P video streaming systems. It also discuss the case of watching TV channels by a lot of users in P2P system. The mathematical model is described in the language of the hypergraph theory in a multi-criterion formulation. The criteria are MINMAX and MINMIN, which allow taking into account the performance indicators such as the time of switching between channels, the interruption of the image and the minimum traffic load at the same time.В данной статье описана проблема процесса распределения потоков данных в одноранговых сетях передачи потокового видео. Рассмотрен случай просмотра телевизионных каналов множеством пользователей в P2P сетях. Математическая модель описана на языке теории гиперграфов в многокритериальной постановке. Критерии имеют вид MINMAX и MINMIN, которые позволяют одновременно учитывать показатели эффективности по времени переключения между каналами, прерывания изображения и минимальной загрузке трафика

    Оптимизационная модель распределения потоков данных P2P-телевидения на гиперграфах

    No full text
    This article describes the problem of the distribution data streams process in P2P video streaming systems. It also discuss the case of watching TV channels by a lot of users in P2P system. The mathematical model is described in the language of the hypergraph theory in a multi-criterion formulation. The criteria are MINMAX and MINMIN, which allow taking into account the performance indicators such as the time of switching between channels, the interruption of the image and the minimum traffic load at the same time.В данной статье описана проблема процесса распределения потоков данных в одноранговых сетях передачи потокового видео. Рассмотрен случай просмотра телевизионных каналов множеством пользователей в P2P сетях. Математическая модель описана на языке теории гиперграфов в многокритериальной постановке. Критерии имеют вид MINMAX и MINMIN, которые позволяют одновременно учитывать показатели эффективности по времени переключения между каналами, прерывания изображения и минимальной загрузке трафика

    An optimization model of distribution of P2P-TV data streams on hypergraphs

    No full text
    This article describes the problem of the distribution data streams process in P2P video streaming systems. It also discusses the case of watching TV channels by a lot of users in P2P system. Known probabilistic statements of this problem, which determine the various quality indicators the construction of a peer-To-peer network, for example, the probability of universal transmission. In our work, we propose a discrete formulation of this problem. It defines a lot of viewers, a lot of channels for viewing and a lot of streams, to which you can distribute channels. Each user that receives some streams is assigned to view a particular channel. The result of this assignment of streams by users should be the increase in the level of performance of the broadcasting system, in particular, the quality of servicing unpopular channels should not be much worse than the quality of service of channels that are more popular. The mathematical model is described in the language of the hypergraph theory in a two-criterion formulation. The criteria are MINMAX, which allow taking into account the performance indicators such as the time of switching between channels and the interruption of the image at the same time. © 2017 CEUR-WS. All rights reserved

    Fast numerical evaluation of flow fields with vortex cells

    No full text
    A vortex cell (in this paper) is an aerodynamically shaped cavity in the surface of a body, for example a wing, designed specially to trap the separated vortex within it, thus preventing large-scale unsteady vortex shedding from the wing. Vortex stabilisation can be achieved either by the special geometry, as has already been done experimentally, or by a system of active control. In realistic conditions the boundary and mixing layers in the vortex cell are always turbulent. In the present study a model for calculating the flow in a vortex cell was obtained by replacing the laminar viscosity with the turbulent viscosity in the known high-Reynolds-number asymptotic theory of steady laminar flows in vortex cells. The model was implemented numerically and was shown to be faster than solving the Reynolds-aver- aged Navier–Stokes equations. An experimental facility with a vortex cell was built and experiments performed. Comparisons of the experimental results with the predictions of the model are reasonably satisfactory. The results also indicate that at least for flows in near-circular vortex cells it is sufficient to have accurate turbulence models only in thin viscous layers, while outside the viscosity should only be small enough to make the flow effectively invisci
    corecore