Proactive replication for rare objects in unstructured peer-to-peer networks

Unstructured peer-to-peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. The search efficiency problem in unstructured P2P networks has not been adequately addressed so far, especially concerning search for rare objects. In this paper, we propose a proactive replication strategy to improve search efficiency for rare objects. It uses an object-probing technique for peers to decide whether or not to establish replications for their objects when they join the network. This strategy can effectively increase the popularity of rare objects in order to enhance search efficiency. We also present a rare object search algorithm to reduce the overhead caused by the replication strategy. When a peer forwards a search request, the forward probability is calculated according to its neighbors' degrees and the number of neighbors' objects. Therefore, the search request is forwarded to the peers more likely containing target objects. Simulations show that our proactive replication strategy greatly improves search efficiency for rare objects with moderate communication overhead. The rare object search algorithm not only improves search efficiency for rare objects, but also achieves load balance in search.     

OAZE: A network-friendly distributed zapping system for peer-to-peer IPTV

IPTV systems attracting millions of users are now commonly deployed on peer-to-peer (P2P) infrastructures and provide an appealing alternative to multicast-based systems. Typically, a P2P overlay network is associated with each channel, composed of users who receive, watch and redistribute this channel. Yet, channel surfing (aka as zapping) involves switching overlays and may introduce delays, potentially hurting the user experience when compared to multicast-based IPTV. In this paper, we present a distributed system called OAZE (Overlay Augmentation for Zapping Experience) which speeds up the switching process and reduces the overall cross-domain traffic generated by the IPTV system. In OAZE, each peer maintains connections to other peers, not only in a given channel, but also in a subset of all channels to which the associated user is likely to zap. More specifically, we focus on the channel assignment problem, i.e. determining, in a given P2P overlay, the optimal distribution of the responsibility to maintain contact peers to other channels. We propose an approximate algorithm providing guaranteed performances, and a simpler and more practical one. Our experimental results show that OAZE leads to substantial improvements on the connections between peers, resulting in less switching delay and lower network cost; it then represents an appealing add-on for existing P2P IPTV systems.     

Usable optimistic fair exchange

Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be achieved without a trusted third party (called the Arbiter). Yet, even with a trusted party, it is still non-trivial to come up with an efficient solution, especially one that can be used in a p2p file sharing system with a high volume of data exchanged.We provide an efficient optimistic fair exchange mechanism for bartering digital files, where receiving a payment in return for a file (buying) is also considered fair. The exchange is optimistic, removing the need for the Arbiter’s involvement unless a dispute occurs. While the previous solutions employ costly cryptographic primitives for every file or block exchanged, our protocol employs them only once per peer, therefore achieving an O(n) efficiency improvement when n blocks are exchanged between two peers. Our protocol uses very efficient cryptography, making it perfectly suitable for a p-2-p file sharing system where tens of peers exchange thousands of blocks and they do not know beforehand which ones they will end up exchanging. Therefore, our system yields up to one-to-two orders of magnitude improvement in terms of both computation and communication (40 s vs. 42 min, 1.6 MB vs. 200 MB). Thus, for the first time, a provably secure (and privacy-respecting when payments are made using e-cash) fair exchange protocol can be used in real bartering applications (e.g., BitTorrent) [14] without sacrificing performance.     

Integer-multiple-spacing-based scheduling for multimedia applications in IEEE 802.11e HCCA wireless networks

This paper is concerned with improving bandwidth utilization while guaranteeing quality-of-service (QoS) requirements for multimedia applications in IEEE 802.11e HCCA wireless networks. We propose two integer-multiple-spacing-based (IMS-based) designs: the IMS-based-δ and IMS-based-l designs. In the IMS-based designs, the scheduling spacing of any traffic must be an integer multiple of the minimum spacing. The IMS-based designs have more potential to improve the bandwidth utilization because they schedule traffic with longer spacings compared with the prior designs. Besides the improvement of the bandwidth utilization, the IMS-based-δ design can guarantee the packet delay requirements, where a δ factor is introduced to ensure that the bandwidth utilization must benefit from longer spacings, while the IMS-based-l design can guarantee the packet loss requirements. Numerical results show that the improvement of the bandwidth utilization for the IMS-based-δ and -l designs can be up to 7.7% and 56% or more, respectively, compared with the prior designs.     

一种新的结构化对等网负载均衡算法

研究结构化对等网(P2P)中的负载均衡问题,P2P网络的节点、延迟和处理能力差异性很大,当前负载均衡算法忽略节点差异性,造成网络负载极不平衡,容易出现"热点"问题,使负载变化大。为了更好的均衡P2P负载,提出一种新的网络负载均衡算法。算法充分考虑节点之间的差异性,对物理节点的地址空间进行动态分配,对于热点资源下载采用局部搜索算法找到邻居节点,并自动把负载转移到轻载节点上,保证节点间负载均衡。仿真结果表明,新网络负载均衡算法加快了负载均衡速度,使P2P网络负载均衡更加均衡,能够很好保持系统稳定性。     

流媒体直播系统的多路并发流自适应传输控制

为了解决流媒体直播在Internet中传输带宽不足、用户接入多样性等问题,本文探讨了流媒体在IP网络中一般的传输控制技术,提出了一种基于联播的流媒体实时传输控制策略以适应网络带宽的动态变化。首先通过组播方式以及RTP/RTCP协议实现流媒体的实时传输;之后对自适应传输的算法进行了详细的分析和设计,并采用多线程技术实现了网络状况监测和实时码流切换控制;最后通过研究及实验数据分析对比,证明该方案可提高多路并发流传输效率的有效性,并且可以给客户端用户带来较好的用户体验。     

面向应用层的流媒体性能测量指标*

介绍了一种从流媒体接收者的角度对流媒体性能进行测量的方法,提出了相应的应用层评价指标。利用已有的商业化流媒体服务软件,通过改变网络环境在不同的条件下对指标进行测量,最后通过实验数据来验证这些指标的有效性。     

基于SIP的网络视频监控系统*

介绍了初始会话协议SIP.在SIP和一般视频监控系统模型的基础上,提出了一种基于SIP的网络视频监控系统,给出了分层网络模型,并对其各功能模块的作用进行了重点阐述.该分层网络模型的建立使得构建数字化、网络化、智能化、多媒体化视频监控系统成为可能.     

纳滤膜流动电位及Zeta电位的研究

应用自主研发的测试装置对荷电纳滤膜的荷电性能进行了研究。根据流动电位的测试原理,以不同浓度、不同成分的盐溶液为荷电纳滤膜表面流动电位的测量介质,研究了不同浓度、不同的压力条件下对纳滤膜表面流动电位及Zeta电位测量的影响。     

基于Cortex-A8处理器的车牌识别系统设计

随着车辆数量的日益增多,交通管理的压力日趋增大,越来越多的场合需要实时车牌识别。针对此问题,本文设计一种基于Cortex-A8处理器的实时车牌识别系统。该系统以Coretx-A8嵌入式处理器为核心,通过V4L2接口进行视频流的采集,然后运行基于改进的OpenCV车牌识别算法,最后通过MJPG-streamer和Socket编程进行视频流和车牌数据的传输。测试结果表明,该系统具有较强的稳定性和实时性,具有较强的实用价值。