Segmented patching broadcasting protocol for video data

In adaptive segment-based patching scheme, the video is divided into fixed number of segments, which are transmitted over the server channels. For efficient transmission of the video segments, the server channels are classified into two types – regular and patching channels. A regular channel generally transmits fixed number of segments and a patching channel helps transmitting those segments that cannot be provided by any regular channel to the users. The number of segments transmitted by the first regular channel is decided by the number of regular channels that are allocated to the video by the video server. Other regular channels transmit pre-specified number of segments. This scheme estimates the bandwidth of the patching channels based on the requests received at the video server in terms of fixed time intervals, called time slots. The bandwidth estimation in this scheme is less accurate because for multiple requests received in a time slot more than one patching channels are used. Second, the probability distribution considered in this scheme does not satisfy the basic rule, i.e., the sum of all probabilities is not 1. In this paper, we address these issues and propose a new protocol named as Segmented Patching Broadcasting Protocol for Video Data. The average server bandwidth allocated to the patching channels is much less as compared to the adaptive segment-based patching scheme because only one patching channel is sufficient for any number of requests received in a time slot.     

A speculative load adaptive streaming scheme for efficient video delivery

Video on demand services require video broadcast schemes to provide efficient and reliable performance under various client request loads. In this paper, we have developed an efficient request load adaptive broadcast scheme, speculative load adaptive streaming scheme (SLAS), that requires lower service bandwidth than previous approaches, regardless of request rate. We have provided both analysis and simulation to show the performance gain over previous schemes. In this paper, we provide the theoretic upper bound of the continuous segment allocations on channels. We found that the number of allocated segments of the SLAS is close to the theoretic upper bound when compared with other schemes over various numbers of stream channels. Our analysis of client waiting time is almost identical to simulation results about all client requests. By simulation, we compared the required service bandwidth and storage requirements of the SLAS scheme and other schemes and found the SLAS scheme is an efficient broadcast scheme as compared to well known seamless channel transition schemes.     

Efficient staircase scheme with seamless channel transition mechanism

Video applications require large amount of bandwidth and also storage space. The Fast Broadcasting (FB) scheme is one of the simplest schemes to provide video services, but it requires considerably large buffer storage. This scheme assumes constant video popularity and thus has fixed amount of bandwidth requirement. The popularity of videos generally does not remain the same. It varies over a period of time and accordingly the bandwidth allocation should be adjusted. The variability in bandwidth requirement for videos based on popularity is overcome by incorporating seamless channel transition mechanism in a broadcasting scheme. After incorporating seamless channel transition mechanism, the scheme still delivers continuous video data to old and new users without jerks and hiccups. The FB scheme with seamless channel transition mechanism requires less buffer storage than the FB scheme. The staircase scheme also allocates a fixed amount of bandwidth to a video. The FB and staircase schemes divide a video into same number of segments; thus have same user’s waiting time. The basic difference between the FB and staircase schemes is that in the staircase scheme the segments are further divided into subsegments in order to reduce the buffer requirement. To consider variability of video popularity in the staircase scheme, seamless channel transition for staircase (SCTS) scheme has been discussed. The SCTS scheme performs better than the seamless Fast Broadcasting scheme as regard the buffer storage, while maintaining the same user’s waiting time. In this paper, we propose an efficient staircase scheme with seamless channel transition mechanism that performs better than the SCTS scheme. In the proposed scheme, the video (ESS scheme) data is downloaded at slower rate than that in the SCTS scheme without disrupting the user services and requiring less buffer storage.     

无线城域网中MPEG视频传输的上行调度算法

针对现有无线城域网中MPEG视频传输的实时轮询服务算法的不足,提出了一种更为有效的媒体接入控制上行调度算法。该算法无需基站周期地提供带宽请求机会,而是在视频应用的连接建立以后,主动周期地分配固定带宽来传输视频数据的特定部分,剩余部分的带宽通过携带请求的方式获得,以此保证更好的服务质量。仿真中使用典型的视频测试源,结果表明,新算法在近似现有算法的信道利用率的情况下,具有更小的视频帧延迟和抖动。     

基于patching的P2P VoD频道间协作策略

在P2P点播系统中,“冷播”频道往往节点较少且分布分散,各个节点形成多个独立的“播放链”,服务器往往需要为每个播放链单独提供一路数据流,负载很大。为此,提出了一种P2P VoD冷热播频道间协作策略,通过利用“热播”频道中具有富余服务能力的节点为“冷播”频道节点提供patching服务,从而连接“冷播”频道各个独立的“播放链”,进而减轻了多频道P2P点播系统中由于频道冷热播的不均衡导致“冷播”频道给服务器带来巨大的负载压力。仿真结果证明了该策略能有效提高多频道点播系统的并发服务能力。     

Threshold-based multicast for continuous media delivery

In this paper, we propose and evaluate the performance of a continuous media delivery technique, called threshold-based multicast. Similar to patching, threshold-based multicast allows two clients that request the same video to share a channel without having to delay the earlier request. It ensures sharing by permitting the client with the later arrival time to join an ongoing multicast session initiated for the earlier request. However, threshold-based multicast does not allow a later arriving client to always join an ongoing multicast session. If it has been some time since the ongoing multicast session was started, a new multicast session is initiated. That is, a threshold is used to control the frequency at which new multicast sessions are started. We derive the optimal threshold that minimizes the server bandwidth required. Our analytical result shows that threshold-based multicast significantly reduces the server bandwidth requirement. Furthermore, we perform a simulation study demonstrating the performance gain of continuous media delivery by threshold-based multicast     

基于优先级的混合自动请求重传方法

提出了一种基于优先级的混合自动请求重传(HARQ)方法,该方法基于多用户N通道等停异步模式HARQ。无线视频传输时每个数据块有不同的时延要求,为了减少时延在物理层对数据块传输顺序进行调整,通过重传数据块等待的时间来决定其优先级,对等待时间较长的数据块优先传输。通过对这种方法的理论分析和仿真实验,证明其在基于QoS保障无线视频传输信道条件较差情况下能有效地减少端到端的时延和丢包率。     

基于免疫神经网络的陀螺仪漂移预测

BP神经网络可用于预测陀螺飘移误差，但容易陷入局部极值，训练速度很慢。针对上述缺点，该文提出了一种基于免疫算法的神经网络，以样本输出为抗原、神经网络权值矩阵为抗体，通过克隆、变异、抑制等步骤找到最优抗体，将最优抗体用于陀螺仪漂移预测。仿真试验显示，免疫训练算法能有效优化网络权值，基于该模型的漂移预测精度较高。     

可提供预约视频点播服务的一种加权入口控制算法

一个视频点播系统需要有大容量的存储空间和高速的输入／输出带宽,在视频点播的高峰时期,经常会出现系统资源供不应求的情况,这就需要有一种策略来决定如何管理用户请求,以及以什么样的顺序为用户提供服务,文中提出了一个新的入口控制算法：WMQL（Weighted Maximal Queue Length)调度,在选择要发送的视频段时,不仅考虑了视频的请求队列长度,还考虑了用户的请求等待时间。接着又提出了一个改进的调度方案：AWMQL（Advanced WMQL)调度,这种调度策略允许用户进行预约,而且尽量在用户的等待容忍度范围内满足用户请求,最后,进行了模拟试验,结果表明,AWMQL调度算法可以有效地增加系统的吞量,同时实现了较好的公平性。     

Proxy-assisted scalable periodic broadcasting of videos for heterogeneous clients

Periodic broadcasting (PB) is a scalable technique for providing video-on-demand services. It significantly reduces server input and output (I/O) and backbone network bandwidth requirements, but increases the clients’ need for storage space and network bandwidth. Traditional protocols assume homogeneous clients with identical resources. In practice, however, clients have very different bandwidths, which are usually not sufficient for video-on-demand service from a PB server. Existing work on heterogeneous clients has focused on devising broadcast schedules that cater to low-bandwidth clients; these schedules inevitably require additional backbone network bandwidth between the server and the clients. In this paper, we propose a scheme to significantly reduce the waiting time of all heterogeneous clients, without the need for any additional backbone bandwidth. This scheme uses a proxy buffer within video-on-demand systems using PB. In the proposed system, the server broadcasts a video using one of the traditional PB protocols. Simultaneously, the proxy receives the stream from the server and stores it in its local buffer, then broadcasts the stored data to the clients in its local network. Because the proxy provides extra, transparent channels to the server, clients are likely to reduce their reception bandwidth requirements through the use of efficient reception schedules using the extra channels.     

Extension of practical channel transition broadcasting for near video-on-demand applications

Periodic broadcasting is a cost-effective solution for the large-scale distribution of popular videos. This strategy guarantees constant worst service latency to all clients, regardless of the number of video requests. The practical channel transition broadcasting (PCTB) scheme is an essential periodic broadcasting method that can dynamically add or release broadcasting channels (i.e., channel transition) according to video popularity. However, PCTB experiences bandwidth waste when performing channel transition. This study further finds that PCTB yields transition playback latency during channel addition. Therefore, an enhanced version referred to as PCTB+ is proposed to cause less bandwidth waste and lower transition playback latency. The applicability of this new scheme is verified, and an analytical evaluation is provided to demonstrate its performance advantage. The new scheme reduces bandwidth waste by 50 % to 100 % compared to the original PCTB scheme. Moreover, PCTB+ yields 50 % smaller transition playback latency than PCTB. The proposed scheme outperforms the seamless fast broadcasting (SFB) scheme for bandwidth waste under most conditions. No extra startup latency and client buffer demand are required when using PCTB+.     

Two neuro-fuzzy control schemes for a traffic-regulating buffer in wireless technology

Bluetooth wireless operates in 2.4-GHz Industrial Scientific and Medicine (ISM) frequency, which may interfere with other devices functioning within the same frequency band, such as WiFi. Furthermore, Moving Picture Expert Group (MPEG) variable bit rate (VBR) video demands larger and more stable bandwidth and may cause data loss and time delay as a result of the high variation in bit rate in Bluetooth channels with limited bandwidth. To address these issues, two new neuro-fuzzy schemes are developed to control the input and output of a buffer referred to here as the traffic-regulating buffer. Regarding the input of this buffer, a rule-based fuzzy scheme is introduced and supervised by a neural network technique as a master controller to monitor the arrival rate to the buffer. The output of the traffic-regulating buffer is observed by another rule-based fuzzy scheme and is supervised by a second neural network to monitor the departure rate. Computer simulation results demonstrate that the two proposed neuro-fuzzy models reduce standard deviation and excessive data loss, and they also show an improved picture quality as compared with conventional MPEG VBR video over a Bluetooth channel.     

A General Framework of Time-Variant Bandwidth Allocation in the Data Broadcasting Environment

Data broadcast is an advanced technique to realize large scalability and bandwidth utilization in a mobile computing environment. In this environment, the channel bandwidth of each channel is variant with time in real cases. However, traditional schemes do not consider time-variant bandwidth of each channel to schedule data items. Therefore, the above drawback degrades the performance in generating broadcast programs. In this paper, we address the problem of generating a broadcast program to disseminate data via multiple channels of time-variant bandwidth. In view of the characteristics of time-variant bandwidth, we propose an algorithm using adaptive allocation on time-variant bandwidth to generate the broadcast program to avoid the above drawback to minimize average waiting time. Experimental results show that our approach is able to generate the broadcast programs with high quality and is very efficient in a data broadcasting environment with the time-variant bandwidth.     

Geometrico-Harmonic Broadcasting Scheme With Continuous Redundancy

The harmonic broadcasting scheme has the best performance for the user latency. It, however, does not always provide the video data in time to the users. To provide the video data reliably, its two main variants - cautious and quasi-harmonic schemes have been proposed. They require more bandwidth than the harmonic scheme. The cautious and quasi-harmonic schemes need 0.50 b and 0.1771 b more bandwidth, respectively, than the harmonic scheme in limiting case. In this paper, a new broadcasting scheme: geometrico-harmonic scheme with continuous redundancy is proposed. This scheme provides the video data in time unlike the harmonic scheme, and its bandwidth requirement can be had as close to that of the harmonic scheme as we please. Moreover, the extra bandwidth required in this scheme can be evaluated at any point of time, that is, it can be estimated for a fractional size of a segment and/or subsegment. The bandwidth is a scarce resource and its requirement for any fractional size of segments (or subsegments) may be helpful while dealing with the variable bandwidth rate-encoded videos. In the proposed scheme, the user latency can be made arbitrarily close to that of the harmonic scheme. In comparison to the cautious and the quasi-harmonic schemes, it has better performance for the user latency as well as the buffer storage. For disk transfer rate, it performs better than the quasi-harmonic scheme and in comparison to the cautious harmonic scheme its performance is same     

流内容分送中的媒体后缀动态缓存技术研究

基于带前缀缓存的流调度方案OBP(optimized batch patching)提出了媒体后缀的增量缓存算法IC-BP和预分配缓存算法PA-BP,推导出两种算法下传输单一流媒体对象各自所需的平均骨干带宽、服务器平均使用输出通道数和代理所需最大缓存容量,并分析了以上两种缓存算法的综合传输代价.结果表明,两种缓存算法均有效降低了骨干带宽消耗和服务器负载,传输代价均明显低于带前缀缓存的OBP. 而PA-BP克服了IC-BP算法中每次批处理调度时都至少需请求一个批处理长度补丁的缺点,因而具有更低的传输代价,其性能优于IC-BP缓存算法.     

一种新的视频点播方案——扩展幂级方案

提出一种适合于热门节目的分块广播(partition broadcasting)方案——扩展幂级方案，分析了该方案的资源需求包括服务器信道、用户端缓存、用户端I／O带宽等，并根据方案的周期性分析了用户点播时间与缓存空间及用户端I／O带宽的关系．结论表明它比现有的许多其它同类方案有着更好的兼容性，能很好地权衡用户端的I／O带宽及缓存空间，而且更易于实现。     

基于网络流量预测的DASH系统优化

近年来基于超文本传输协议（HTTP）的自适应视频流量大幅上升,传统HTTP动态自适应流（DASH）速率算法无法准确预测网络吞吐量,导致网络带宽波动,使传输控制协议慢启动并触发抛弃规则,从而降低视频质量。提出一种基于网络流量预测的改进DASH速率算法。将DASH算法分为视频质量选择阶段、视频下载阶段和请求等待阶段,在视频质量选择阶段引入支持向量回归模型和长短期记忆网络预测网络吞吐量,结合缓冲时长选择更优质量的视频片段,在视频下载阶段通过预测实时吞吐量降低触发抛弃规则的次数。仿真结果表明,该算法可自适应流速率并减少抛弃规则的命中次数,有效提高视频体验质量。     

Adaptive video-on-demand broadcasting in ubiquitous computing environment

Video-on-demand (VOD) is a service that allows users to view any video program from a server at the time of their choice, such kind of services are expected to be popular in future ubiquitous computing environment. Lots of broadcasting protocols for VOD services have been proposed, but they usually focus only on the tradeoff between bandwidth and delay, thus they are usually not efficient for the local storage. Since the ubiquitous network is heterogeneous and users will have different resource and communication capability, we need to address the storage issue in VOD systems. In this paper, we present several new effective broadcasting schemes, which can intelligently adjust the solution according to available bandwidth and local storage to achieve an ideal waiting time.     

跨层反馈在无线视频自适应编码中的应用

为提高压缩后视频在无线信道中的容错能力,结合当前无线通信系统中广泛使用的自适应调制编码(AMC)技术和自动重传请求(ARQ)技术,提出一种新的基于跨层反馈的自适应编码方案。利用该设计方案,应用层可以利用底层的反馈信息感知到当前的信道变化并调整相应的码控策略来提高视频传输的鲁棒性。实验结果表明,与没有利用跨层反馈的其他方法相比,本文编码策略能提供更好的视频传输质量。     

Content-Aware Prediction Algorithm With Inter-View Mode Decision for Multiview Video Coding

3-D video will become one of the most significant video technologies in the next-generation television. Due to the ultra high data bandwidth requirement for 3-D video, effective compression technology becomes an essential part in the infrastructure. Thus multiview video coding (MVC) plays a critical role. However, MVC systems require much more memory bandwidth and computational complexity relative to mono-view video coding systems. Therefore, an efficient prediction scheme is necessary for encoding. In this paper, a new fast prediction algorithm, content-aware prediction algorithm (CAPA) with inter-view mode decision, is proposed. By utilizing disparity estimation (DE) to find corresponding blocks between different views, the coding information, such as rate-distortion cost, coding modes, and motion vectors, can be effectively shared and reused from the coded view channel. Therefore, the computation for motion estimation (ME) in most view channels can be greatly reduced. Experimental results show that compared with the full search block matching algorithm (FSBMA) applied to both ME and DE, the proposed algorithm saves 98.4–99.1% computational complexity of ME in most view channels with negligible quality loss of only 0.03–0.06 dB in PSNR.