共查询到20条相似文献,搜索用时 109 毫秒
1.
2.
3.
4.
基于流媒体的小型分布式视频点播系统研究 总被引:1,自引:1,他引:0
针对视频点播系统中存在的高带宽、高存储、低并发性等问题,提出了一种基于流媒体的小型分布式的视频点播系统,通过把视频进行分段并动态分布到不同的服务器实现了分布式存储.通过文件共享机制并在数据库中纪录和维护视频信息实现对不同视频服务器上视频资料的统一管理.仿真测试结果表明,该方案能大大提高视频点播系统的并发访问量,并可动态添加视频服务器以满足日益增长的视频点播需求. 相似文献
5.
6.
7.
8.
9.
10.
11.
嵌入式系统要求对异常及中断处理器能快速响应。文中分析了ARM体系结构下异常处理特点,提出一种基于ARM处理器的高效异常处理解决方案,以LPC3250硬件平台为基础,对该方案进行了设计与实现。测试结果表明,该方案的异常处理更为高效。 相似文献
12.
13.
14.
Recent developments on Social TV point to an evolution from traditional IPTV services towards more social experiences. Newer applications and services have appeared wherein groups of people in different locations can watch multimedia content while synchronously communicating with each other. We name such applications as synchronous shared experiences. Realization of these shared experiences requires that users feel that they are coherently communicating with each other. This paper identifies and analyzes challenges that need to be tackled to achieve coherence: quality of service, mobility and distributed media synchronization. Furthermore, universal session handling is required to setup these sessions. We then present our solution to one of these challenges: distributed media synchronization. Our design uses the local lag mechanism over a distributed control or master-slave signaling architecture. We validate our implementation via experiments performed with one client located in Amsterdam and the other in Seoul. The experiments demonstrate a bound in play-out skew of 500 ms across these locations. Our results from user tests, presented elsewhere, show that this value is well within tolerance limits. 相似文献
15.
We develop a new class of asynchronous distributed algorithms for the explicit rate control of elastic sessions in an integrated packet network. Sessions can request for minimum guaranteed rate allocations (e.g., minimum cell rates in the ATM context), and, under this constraint, we seek to allocate the max-min fair rates to the sessions. We capture the integrated network context by permitting the link bandwidths available to elastic sessions to be stochastically time varying. The available capacity of each link is viewed as some statistic of this stochastic process [e.g., a fraction of the mean, or a large deviations-based equivalent service capacity (ESC)]. The ESC is obtained so as to satisfy an overflow probability constraint on the buffer length. For fixed available capacity at each link, we show that the vector of max-min fair rates can be computed from the root of a certain vector equation. A distributed asynchronous stochastic approximation technique is then used to develop a provably convergent distributed algorithm for obtaining the root of the equation, even when the link flows and the available capacities are obtained from on-line measurements. The switch algorithm does not require per connection monitoring, nor does it require per connection marking of control packets. A virtual buffer based approach for on-line estimation of the ESC is utilized. We also propose techniques for handling large variations in the available capacity owing to the arrivals or departures of CBR/VBR sessions. Finally, simulation results are provided to demonstrate the performance of this class of algorithms in the local and wide area network context 相似文献
16.
Panagakis A. Dukkipati N. Stavrakakis I. Kuri J. 《Networking, IEEE/ACM Transactions on》2004,12(5):865-878
The problem of call admission control (CAC) is considered for leaky bucket constrained sessions with deterministic service guarantees (zero loss and finite delay bound) served by a generalized processor sharing scheduler at a single node in the presence of best effort traffic. Based on an optimization process, a CAC algorithm capable of determining the (unique) optimal solution is derived. The derived algorithm is also applicable, under a slight modification, in a system where the best effort traffic is absent and is capable of guaranteeing that if it does not find a solution to the CAC problem, then a solution does not exist. The numerical results indicate that the CAC algorithm can achieve a significant improvement on bandwidth utilization as compared to a (deterministic) effective bandwidth-based CAC scheme. 相似文献
17.
Search biases in constrained evolutionary optimization 总被引:6,自引:0,他引:6
T.P. Runarsson Xin Yao 《IEEE transactions on systems, man and cybernetics. Part C, Applications and reviews》2005,35(2):233-243
A common approach to constraint handling in evolutionary optimization is to apply a penalty function to bias the search toward a feasible solution. It has been proposed that the subjective setting of various penalty parameters can be avoided using a multiobjective formulation. This paper analyzes and explains in depth why and when the multiobjective approach to constraint handling is expected to work or fail. Furthermore, an improved evolutionary algorithm based on evolution strategies and differential variation is proposed. Extensive experimental studies have been carried out. Our results reveal that the unbiased multiobjective approach to constraint handling may not be as effective as one may have assumed. 相似文献
18.
Taekyoung Kwon 《Communications Letters, IEEE》2002,6(8):358-360
Two-factor authentication is favorable to securely identifying remote users in a communications network. Lately cryptographic camouflage was applied for the purpose by software-only techniques. However it can be vulnerable to impersonation attacks via interleaved sessions if a single server is compromised. This article brings to light such a hidden weak point and suggests a possible solution. 相似文献
19.
有效的传输机制是保障多媒体远程教学系统这样的分布式多媒体系统应用需求的关键。针对分布式多媒体应用,结合流媒体的传输控制协议,提出了一种远程教学系统实时传输解决方案:通过RTSP(实时流传输协议)建立和控制多媒体会话,RTP(实时传输协议)承载实时信息的传输,RTCP(实时传输控制协议)监控数据的传输状态,RSVP(资源预留协议)预约传输所需的Internet资源保证服务质量。该传输方案不仅适用于远程教学系统,也适用于其他基于Internet的实时多媒体应用系统。 相似文献
20.
提出M估计与不确定度评定相结合的多传感器数据加权融合方法,克服了现有的数据评价函数加权法中存在的大噪声及成片野值处理能力的局限性。通过静态数据仿真结果,表明基于M估计的多传感器数据稳健加权融合算法明显优于最小二乘法。 相似文献