A stepwise optimization algorithm of clustered streaming media servers

The optimization of Clustered Streaming Media Servers (CSMS), which aims at using as few hardware resources and as cost-effective as possible, while providing satisfactory performance and QoS, has a great impact on the practicability and efficiency of CSMS. Based on the analysis and formulization of critical performance factors of CSMS and the relationship among the performance, QoS, and the costs in CSMS, a stepwise optimization algorithm is developed to solve the optimization problem efficiently. The algorithm is based on an approach that models the optimization problem into a directed acyclic graph and then addresses the complex optimization problem step by step. The algorithm applies a divide and conquer model that not only reduces the complexity of the optimization problem, but also accelerates the optimization process. Progressive information is collected in the process and used in solving the problem. Furthermore, a simulation system of CSMS is necessary for the optimization algorithm to generate the accurate information produced in the entire streaming service process. Thus, we designed and implemented such a simulation system based on the theoretical performance model of CSMS and the parameters measured in practical CSMS testbed. Finally, a case study of the optimization problem is given to demonstrate the process of the algorithm, and an appropriate plan for designing practical CSMS system is illustrated.     

An overlay multicast protocol for live streaming and delay-guaranteed interactive media

In many collaborative multimedia applications, there is often a requirement for simultaneously supporting live streaming and shareable interaction. A major challenge in designing such an application by overlay multicast is how to simultaneously provide scalable live streaming and delay-guaranteed interactive media. Live streaming by overlay multicast incurs additional application-layer latency, which conflicts with the delay-sensitive property of interactive media. To handle this dilemma, in this paper, we propose a layered degree-constrained overlay multicast protocol, which organizes the overlay multicast tree as a layered degree-constrained core tree and an extended tree. The core tree maintains available resources in its top layers for subsequent two-way interaction, whereas the extended tree expands the core tree for one-way live streaming. Our simulation and experimental results show that the proposed overlay multicast protocol can simultaneously provide delay-guaranteed interactive media as well as scalable live streaming.     

Analysis of a CDN–P2P hybrid architecture for cost-effective streaming media distribution

To distribute video and audio data in real-time streaming mode, two different technologies – Content Distribution Network (CDN) and Peer-to-Peer (P2P) – have been proposed. However, both technologies have their own limitations: CDN servers are expensive to deploy and maintain, and consequently incur a cost for media providers and/or clients for server capacity reservation. On the other hand, a P2P-based architecture requires sufficient number of seed supplying peers to jumpstart the distribution process. Compared with a CDN server, a peer usually offers much lower out-bound streaming rate and hence multiple peers must jointly stream a media data to a requesting peer. Furthermore, it is not clear how to determine how much a peer should contribute back to the system after receiving the media data, in order to sustain the overall media distribution capacity.In this paper, we propose and analyze a novel hybrid architecture that integrates both CDN- and P2P-based streaming media distribution. The architecture is highly cost-effective: it significantly lowers the cost of CDN capacity reservation, without compromising the media quality delivered. In particular, we propose and compare different limited contribution policies for peers that request a media data, so that the streaming capacity of each peer can be exploited on a fair and limited basis. We present: (1) in-depth analysis of the proposed architecture under different contribution policies, and (2) extensive simulation results which validate the analysis. Our analytical and simulation results form a rigorous basis for the planning and dimensioning of the hybrid architecture.     

A dynamic caching algorithm based on internal popularity distribution of streaming media

Most proxy caches for streaming videos do not cache the entire video but only a portion of it. This is partly due to the large size of video objects. Another reason is that the popularity of different parts of a video can be different, e.g., the prefix is generally more popular. Therefore, the development of efficient cache mechanisms requires an understanding of the internal popularity characteristics of streaming videos. This paper has two major contributions. Firstly, we analyze two 6-month long traces of RTSP video requests recorded at different streaming video servers of an entertainment video-on-demand provider, and show that the traces provide evidence that the internal popularity of the majority of the most popular videos obeys a k-transformed Zipf-like distribution. Secondly, we propose a caching algorithm which exploits this empirical internal popularity distribution. We find that this algorithm has similar performance compared with fine-grained caching but requires significantly less state information.     

基于VxWorks的流形鉴别仪的设计与实现

油气混输管道中,通常容易形成段塞流,这种流形对输油管线和油气处理设备的安全造成巨大的威胁,要消除这种威胁,必须掌握其特征参数,根据特征参数采取相应的措施,保障油气生产安全。为了鉴别油气混输管道中的流形,文中提出一种基于VxWorks的流形鉴别仪的设计与实现,能实时测量油气混输管道中的段塞流特征参数,从而为工程技术人员提供设计和操作参数。     

流媒体系统设计与实现

本文分析了基于CDN技术和基于P2P技术的流媒体系统设计方案,指出了它们的优缺点。给出了一种结合CDN技术和P2P技术的流媒体系统设计方案.     

Joint object placement and node dimensioning for Internet content distribution

This paper studies a resource allocation problem in a graph, concerning the joint optimization of capacity allocation decisions and object placement decisions, given a single capacity constraint. This problem has applications in Internet content distribution and other domains. The solution to the problem comes through a multi-commodity generalization of the single commodity k-median problem. A two-step algorithm is developed that is capable of solving the multi-commodity case optimally in polynomial time for the case of tree graphs, and approximately (within a constant factor of the optimal) in polynomial time for the case of general graphs.     

Building a peer-to-peer content distribution network with high performance,scalability and robustness

Content distribution networks (CDN) are fundamental, yet expensive technologies for distributing the content of web-servers to large audiences. The P2P model is a perfect match to build a low-cost and scalable CDN infrastructure for popular websites by exploiting the underutilized resources of their user communities. However, building a P2P-based CDN is not a straightforward endeavor. In contrast to traditional CDNs, peers are autonomous and volunteer participants with their own heterogeneous interests that should be taken into account in the design of the P2P system. Moreover, churn rate is much higher than in dedicated CDN infrastructures, which can easily destabilize the system and severely degrade the performance. Finally and foremostly, while many P2P systems abstract any topological information about the underlying network, a top priority of a CDN is to incorporate locality-awareness in query routing in order to locate close-by content. This paper aims at building a P2P CDN with high performance, scalability and robustness. Our proposed protocols combine DHT efficiency with gossip robustness and take into account the interests and localities of peers. In short, Flower-CDN provides a hybrid and locality-aware routing infrastructure for user queries. PetalUp-CDN is a highly scalable version of Flower-CDN that dynamically adapts to variable rates of participation and prevent overload situations. In addition, we ensure the robustness of our P2P CDN via low-cost maintenance protocols that can detect and recover from churn and dynamicity. Our extensive performance evaluation shows that our protocols yield high performance gains under both static and highly dynamic environments. Furthermore, they incur acceptable and tunable overhead. Finally we provide main guidelines to deploy Flower-CDN for the public use.     

Towards capacity and profit optimization of video-on-demand services in a peer-assisted IPTV platform

This paper studies the conditions under which peer-to-peer (P2P) technology may be beneficial in providing IPTV services over typical network architectures. It has three major contributions. First, we contrast two network models used to study the performance of such a system: a commonly used logical “Internet as a cloud” model and a “physical” model that reflects the characteristics of the underlying network. Specifically, we show that the cloud model overlooks important architectural aspects of the network and may drastically overstate the benefits of P2P technology. Second, we propose an algorithm called Zebra that pre-stripes content across multiple peers during idle hours to speed up P2P content delivery in an IPTV environment with limited upload bandwidth. We also perform simulations to measure Zebra’s effectiveness at reducing load on the content server during peak hours. Third, we provide a cost-benefit analysis of P2P video content delivery, focusing on the profit trade-offs for different pricing/incentive models rather than purely on capacity maximization. In particular, we find that under high volume of video demand, a P2P built-in incentive model performs better than any other model, while the conventional no-P2P model generates more profits when the request rate is low. The flat-reward model generally falls in between the usage-based model and the built-in model in terms of profitability except for low request rates. We also find that built-in and flat-reward models are more profitable than the usage-based model for a wide range of subscriber community sizes. Funding for J. Rahe’s research has been provided by AT&T Labs, the State of California under the MICR Oprogram, and by the Toshiba Corporation. Zhen Xiao is partially supported by China MOST project (2006BAH02A10).     

基于用户QoE的流媒体系统性能测评模型设计

影响流媒体用户服务质量体验QoE(Quality of Experience)的因素有很多,如何对用户QoE进行量化判别是一个复杂的问题。为此,以媒体传输指标MDI为基础,研究了用于测量流媒体用户QoE的基本指标,并提出了相关测量数据的获取方法。以流媒体用户的实际体验质量为依据,提出了一种有效的流媒体系统性能评价模型,该模型为流媒体系统的性能分析和优化调整提供了理论基础,具有广泛的应用价值。     

Searching performance of a real-coded genetic algorithm using biased probability distribution functions and mutation

One excellent crossover method for the real-coded genetic algorithm (RGA) is the unimodal normal distribution crossover method (UNDX). The UNDX is superior to the blend crossover method (BLX). The UNDX uses Gaussian distribution functions based on the main and sub searching lines. In this article, we present a method of improving the searching performance of the RGA. We propose the use of biased probability distribution functions (BPDFs) based on the main and sub searching lines in the crossover process. The crossover with BPDFs frequently produces offspring that are close to the best individuals in the current generation, and it is highly likely that these offspring will offer the best solution to the problem. Furthermore, we propose a mutation that has a constant and extended range that is wider than that of the UNDX. Simulations show the efficiency of the proposed method. This work was presented in part at the 11th International Symposium on Artificial Life and Robotics, Oita, Japan, January 23–25, 2006     

Exact algorithms for the joint object placement and request routing problem in content distribution networks

This paper describes two exact algorithms for the joint problem of object placement and request routing in a content distribution network (CDN). A CDN is a technology used to efficiently distribute electronic content throughout an existing Internet Protocol network. The problem consists of replicating content on the proxy servers and routing the requests for the content to a suitable proxy server in a CDN such that the total cost of distribution is minimized. An upper bound on end-to-end object transfer time is also taken into account. The problem is formulated as a nonlinear integer programming formulation which is linearized in three different ways. Two algorithms, one based on Benders decomposition and the other based on Lagrangean relaxation and decomposition, are described for the solution of the problem. Computational experiments are conducted by comparing the proposed linearizations and the two algorithms on randomly generated Internet topologies.     

Characterising and exploiting workloads of highly interactive video-on-demand

This paper presents a detailed characterisation of user behaviour for a series of interactive video experiments over a 12 month period, in which we served popular sporting and musical content. In addition to generic VCR-like features, our custom-built video-on-demand application provides advanced interactivity features such as bookmarking. The dramatic impact of such functionality on how users consume content is studied and analysed. We discuss in detail how this user behaviour can be exploited by content distributors to improve user experience. Specifically, we study how simple dynamic bookmark placement and interactivity-aware content pre-fetching and replication can reduce the impact of highly interactive media on CDN performance.     

Design and evaluation of a collaborative learning environment

Collaboration becomes an essential competency in the current knowledge society. In this study, a collaborative learning environment was designed to facilitate students in group collaboration. Instructional support strategies of friendship and meaningful learning tasks were applied to promote collaboration. Scaffolding strategies such as writing progress reports and developing product versions were used to coordinate and monitor the collaborative learning environment. In addition, the online file sharing tool DriveHQ was used to facilitate collaboration. Four classes of students used the learning environment to complete their final project in pairs. Results showed friendship and meaningful learning tasks helped to promote individual accountability and positive interdependence, and the use of progress reports and product versions was useful for coordinating and monitoring the learning process. However, additional strategies might be needed for more effective collaboration to take place. Issues involved in this study are discussed.     

Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution

In 1993, Beimel and Chor presented an unconditionally secure interactive protocol which allows a subset of users in a network to establish a common key. This scheme made use of a key predistribution scheme due to Blom. In this paper, we describe some variations and generalizations of the Beimel-Chor scheme, including broadcast encryption schemes as well as interactive key distribution schemes. Our constructions use the key predistribution scheme of Blundo et al., which is a generalization of the Blom scheme. We obtain families of schemes in which the amount of secret information held by the network users can be traded off against the amount of information that needs to be broadcast. We also consider lower bounds for protocols of these types, using the concept of entropy as our main tool. Some of our schemes are optimal (or close to optimal) with respect to the bounds we prove.     

基于P2P的流媒体直播系统研究与设计

传统的流媒体系统建立在客户-服务器模式的基础上,系统伸缩性差,服务器常成为系统的瓶颈.根据当前流媒体播放系统存在的问题,设计了基于对等网络模式的流媒体直播系统,其中每个节点既是服务的消费者同时又是提供者,克服了当前流媒体系统的服务器瓶颈问题。     

蓝牙车载音频流播放器的设计与实现

设计了一款在车载娱乐系统中使用的蓝牙音频流播放器,采用A2DP实现音乐数字音频流的传输,采用AVRCP实现对音乐的远程控制和信息读取,介绍了该播放器的若干设计技术.     

高校校园网带宽优化管理的实践与探讨

随着校园网用户增多和P2P应用的不断丰富,校园网带宽资源也日益紧张。如何在有限的资金条件对现有的带宽资源进行优化是高校校园网建设中需要重点考虑的问题。该文结合实例对校园网带宽优化管理方案进行了探讨。     

Design and evaluation of flow handoff signalling for multihomed mobile nodes in wireless overlay networks

With the increasing deployment of wireless overlay networks, a mobile node with a range of network interfaces can be connected to multiple heterogeneous or homogeneous access networks simultaneously. Such host multihoming technology can be exploited to distribute (or hand off) application flows among the most appropriate interfaces and access networks dynamically to achieve end-to-end seamless, robust and even quality-of-service-aware communications for mobile users. It is essential that an efficient and effective flow handoff signalling scheme be in place. Nevertheless, little prior work has addressed this problem sufficiently in a systematic way and little performance evaluation is readily available. We propose a set of signalling procedures for a comprehensive, flexible yet standard-oriented flow handoff solution. Two candidate schemes are designed by extending and optimising related IETF work based on Mobile IPv6 or Network Mobility (NEMO). Theoretical analyses are performed and numerical results are then presented with a focus on signalling loads to compare the two proposals and to demonstrate that the designs can largely meet the requirements on desired signalling performance. Preliminary implementations and experimental results are also reported to validate the concepts of the designs, investigate the flow handoff signalling delays and verify the effectiveness of the policy-based flow handoff support for typical real-time and non-real-time applications.