【24h】

Optimal Resource Allocation in Distributed Multimedia Servers for Video-Audio Streams Access

机译:用于视频-音频流访问的分布式多媒体服务器中的最佳资源分配

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we present a theoretical model of resource contention problem encountered in conventional distributed multimedia servers and propose an optimal algorithm to solve the problem. Demands for multimedia streams retrieving from Internet impose a challenge problem on multimedia servers to deliver the real-time streams seamlessly and maximize system throughput. Especially, for a large scale of multimedia servers consisting of tens/hundreds of nodes interconnected with an interconnection network, the problem becomes more stringent. To serve requests of audio/video stream retrieval, proper system resource (e.g. computing power of the server node and the network bandwidth of the links alone the path to deliver the stream) should be allocated. Improper resource allocation would lead to hot-spot problems on the shared resources. It thus results in low system utilization and throughput. We consider heterogeneous types of requests in this paper. In addition, without lost of generality, we do not restrict topology of underlining interconnection network to any particular configuration. We model the problem as a networkflow problem and proposed a two-pass flow (TPF) algorithm to deal with the flow problem involving multiple flow types.
机译:在本文中,我们提出了常规分布式多媒体服务器中遇到的资源争用问题的理论模型,并提出了解决该问题的最佳算法。从Internet检索多媒体流的需求给多媒体服务器带来了挑战性问题,以无缝地交付实时流并最大化系统吞吐量。特别地,对于由与互连网络互连的数十/数百个节点组成的大规模多媒体服务器,该问题变得更加严格。为了满足音频/视频流检索的请求,应分配适当的系统资源(例如,服务器节点的计算能力和仅链路的网络带宽,即传递流的路径)。资源分配不当会导致共享资源出现热点问题。因此,这导致较低的系统利用率和吞吐量。我们在本文中考虑异类请求。另外,在不失一般性的前提下,我们不将强调互连网络的拓扑限制为任何特定配置。我们将该问题建模为网络流问题,并提出了两遍流(TPF)算法来处理涉及多种流类型的流问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号