云存储系统中数据副本服务的可靠性保障研究

以数据节点与网络链路的可靠性因素分析为基础,提出了云存储系统的数据副本服务可靠性模型。根据访问可靠性与数据副本数量、用户访问量之间的关系,设计数据服务可靠性、副本生成时机、存储节点选择的确定方法,实现了副本分布、删除算法,并在云存储系统ERS-Cloud上进行一系列实验,结果表明该方法能够有效保障数据服务的可靠性,进一步降低副本的冗余存储数量。     

一种基于访问频率的非结构化P2P复制策略

旨在通过数据复制来提高非结构化P2P系统的数据访问效能,提出了基于访问频率的复制策略—AFRE算法,该算法通过赋予不同时间片的访问记录不同的权重,计算数据的局部访问频率,并将适量的数据副本放置到节点度较大的节点.实验证明,提出的复制策略在副本总数明显减少的情况下,能够获得较好的平均查询长度及优于其他常用复制策略的查询成功率.     

基于DDCT表的多副本完整性审计方案

在云存储环境下,云数据采用多副本存储已经成为一种流行的应用.针对恶意云服务提供商威胁云副本数据安全问题,提出一种基于DDCT（Dynamic Divide and Conquer Table）表的多副本完整性审计方案.首先引入DDCT表来解决数据动态操作问题,同时表中存储副本数据的块号、版本号和时间戳等信息;接下来为抵制恶意云服务商攻击,设计一种基于时间戳的副本数据签名认证算法;其次提出了包括区块头和区块体的副本区块概念,区块头存储副本数据基于时间戳识别认证的签名信息,区块体存放加密的副本数据;最后委托第三方审计机构采用基于副本时间戳的签名认证算法来审计云端多副本数据的完整性.通过安全性分析和实验对比,本方案不仅有效的防范恶意存储节点之间的攻击,而且还能防止多副本数据泄露给第三方审计机构.     

基于超级节点的P2P模型副本管理策略

随着计算机和网络技术的迅猛发展,对大容量分布式存储系统的研究已经成为当前热点.在分布式存储系统中,副本技术是一种最为常用的分布式数据管理机制.通过为系统中的文件增加副本,保存冗余的文件数据,可以十分有效地提高文件的可用性和可靠性.提出一种含超级节点的P2P模型,将大量分散的存储节点组织成一个逻辑存储网络.超级节点不仅用于存储"热点"文件的副本,而且还采用RAID技术进行数据备份,以进一步提高系统存储资源利用率和系统可靠性;针对一般节点的惰性,依据文件被查询到的概率,采用方根复制策略进行数据备份,在保证资源下载成功率的同时,进一步提高系统空间利用率.     

一种数据网格容灾存储模型及其数据失效模型

可靠性较高的数据网格多采用双副本容灾可以保证节点在灾难发生时进行有效恢复,但由于节点数据存储量较大,当节点发生灾难时,从一个节点进行数据恢复速度较慢,导致在数据恢复期备份节点发生失效的概率较大。针对这些问题,本文给出一个容灾存储模型,基于该模型推导出一个数据失效模型,理论证明该失效模型的数据失效概率明显小于双副本容灾方式的数据失效概率,同时在灾难发生时又能达到较快的恢复速度。设计了仿真实验,将模型的数据失效概率与双副本失效概率进行了比较,实验结果与理论推导一致,证明了存储模型和数据失效模型的正确性和有效性。最后给出进一步研究思路。     

Swift的哈希一致性副本数据备份节点自适应选取研究

冗余数据备份是云数据中心下数据可靠性的重要保障机制之一,OpenStack是一种开源的云计算IaaS层私有云服务搭建平台,目前已经在行业界广泛应用。OpenStack的Swift模块采用一致性哈希算法,通过Ring环选取副本备份节点的方式完成负载均衡和数据备份。通过对Swift的实现机理和代码进行分析研究,指出其在副本放置节点选取上的不足,进而提出优化选取策略ABS。该机制在实时监控当前存储节点的负载情况基础上,根据预先设定的阈值上、下限自适应选取最近可用的节点完成备份,以优化整体备份效率。通过与现有副本备份策略进行对比和实验验证表明,ABS在保持数据副本分配均衡性的基础上,将系统存储的四种读写性能分别提高了3.4%～9.1%,达到了优化存取的目的。     

基于 BFA 的云存储资源定位算法研究

为了实现云储存系统中高效的资源定位,首先提出了一种基于P2P网络的云存储结构,用具有小世界特性的全分布非结构化master网络取代GFS中单一master节点,并在此结构的基础上提出了基于细菌觅食算法的资源定位算法SBFA ,采用计数来取代细菌觅食算法的4层循环结构,打破了迁徙、复制和趋化之间的嵌套关系。实验结果表明,SBFA算法在保持高命中率的同时有效降低了平均访问节点数。     

数据网格中一种填空式副本分配算法

在数据网格应用中,数据会由于性能和可用性等原因进行复制.如何使数据复本合理分布以降低通信开销是数据网格系统需要解决的重要问题.本文针对一种简化的数据网格环境,考虑存储资源代理对数据的访问频率和代理间的网络性能,提出一种填空式数据副本分配算法(CDRDA).通过该算法得到的数据副本分配,构成多级虚拟存储架构.数据副本根据被存储资源代理访问的频率分布在访问开销小的节点上,从而使系统的整体访问效率达到近似最优.     

无线Ad-Hoc网络中P2P文件搜索机制的研究

对低移动性、频繁搜索文件的无线Ad-Hoc网络,提出一种新型P2P文件共享系统,介绍一种将文件查找和路由功能统一起来形成跨层的方案。所有共享文件采用全分布哈希表,在无线网络拓扑结构建立的同时存储和保留位置信息以及路由信息．通过节点间的树形逻辑结构解决共享文件的定位查询和下载问题。     

基于桌面云终端的无线即时通信系统设计

为实现有效共享IT系统信息,提出基于桌面云终端的无线即时通信系统设计。首先,利用集群服务器建立私有云环境,在此条件下即时通信系统可通过分层次异构融合的无线移动P2P构建完成,移动设备存储终端由云终端提供,将代理节点设置在无线P2P网络边界上并使其融入无线P2P网络中,在无线移动网络和云终端完成异构融合的基础上实现即时通信系统的分层分级管理;其次,在考虑即时通信性质的基础上,使用C/S模式和客户端间的点对点模式在网络通信中设计即时通信系统的客户登录模块以及状态控制模块等功能模块。通过测试实验表明,以建立在桌面云终端为基础的无线即时通信系统能够快速反应且稳定性较强。     

Markov models for the physical layer block error process in a WCDMA cellular system

In this paper, we investigate the possibility of using Markov chains to model the error process in the data blocks delivered by the physical layer of wideband code division multiple access a (WCDMA) cellular system. Suitable Markov models (MM) are designed to fulfil the two following objectives: First, an upper layer protocol supplied by the output obtained from the MM should behave as if it were running on the actual physical layer; second, MM parameters should be linked via simple relationships to the main physical layer parameters. Starting from the results on the error statistics obtained from a suitable simulation tool which jointly performs system and link level analysis, we first classify the users on the basis of performance level and burstiness, and then, we provide some guidelines for the design of Markov models in the different system and channel conditions. The performance of an automatic repeat request (ARQ) (Go-Back N) protocol at the link layer is taken as an example to test the accuracy of the proposed models. It is shown that the perspective of using simple error models in the analysis of upper layer protocols is feasible in many cases.     

Distributed probabilistic medium access with multipacket reception and Markovian traffic

Enabling multipacket reception (MPR) at the physical layer is a promising way to achieve higher bandwidth efficiency while reducing the complexity of the medium access control layer in distributed wireless networks. We study distributed probabilistic access where transmitting nodes access the shared wireless medium with a probability based on the node’s information about the aggregate traffic carried by the network. We model bursty traffic by rate-controlled two-state Markov sources and introduce a parameter that describes the “burstiness” level of the offered traffic. A throughput-optimal medium access strategy utilizing limited feedback is then described and its performance is examined for traffic with different levels of burstiness. It is shown that the bursty nature of the traffic in data networks allows for improvement of the bandwidth efficiency. Bounds on the system throughput are proposed and the queuing delay is analyzed.     

Modeling and analysis of access transparency and scalability in P2P distributed systems

Peer‐to‐peer (P2P) systems have been developed with the goal of providing support for transparent and efficient sharing of scalable distributed resources wherein size scalability is limited by the costs of all types of transparencies, especially data access transparency, which are due to the need for frequent data exchanges between peers and other related communication overheads. We present a model that formulates the relationship between scalability and data access transparency in P2P distributed systems to figure out how large these systems can be scaled up, given the overheads of establishing data access transparency. To validate our model and show how our model can be deployed in real life, we consider a real P2P distributed system as a case study and evaluate how CPU utilization, bandwidth, and data request frequency parameters of our model relate to the amount of effort required by the system management to establish data access transparency. We then calculate the strength of the coefficient of correlation of scalability and data access transparency in the system. The degree of strength of this coefficient allows the system designer to decide at design time whether to allow the use of the model in the management of system at runtime or not. Copyright © 2012 John Wiley & Sons, Ltd.     

Delay guaranteed MDP scheduling scheme for HCCA based on 802.11p protocol in V2R environments

In recent years, the vehicular ad hoc network has attracted worldwide attention from academe and industry. Many researches have been executed to improve the quality of services (QoS) of the intelligent transportation system. However, current existing channel access schemes at the medium access control layer specified in 802.11 protocol, including hybrid coordination function control channel access (HCCA) and enhanced distributed channel access, could not efficiently achieve the QoS requirements in some special situations. This paper proposes a delay guaranteed HCCA (DG‐HCCA) scheduling scheme, which works based on a Markov decision process model and the measurement of historic performance, to guarantee the QoS enhanced data transmission for vehicles to roadside unit. Besides, this paper also presents a performance analysis model to systematically evaluate the system performance of the channel utility and the average delay. The performance of the proposed delay guaranteed HCCA scheduling scheme is compared with that of original HCCA scheme specified in 802.11p standard and other 2 HCCA improved schemes by the simulation experiments. The simulation results demonstrate that the proposed solution could highly fulfill the transmission delay requirements with a better channel utility and less loss rates than those by the standard HCCA scheme and other 2 schemes.     

Delta modulation based prediction for access control in integratedvoice/data CDMA systems

In this paper, we propose access control protocols for integrated voice/data code division multiple access (CDMA) systems that are based on estimating the residual capacity available for data users. The data model considered in the analysis is suitable for non-transparent services (e.g., e-mail, file transfer, store-and-forward facsimile, etc.). The residual capacity is derived from the feasibility condition for power control using an adaptive prediction technique based on delta modulation. The analysis is extended for the case of imperfect power control. Two access control protocols are considered: modified delta modulation with scheduled access (MDM-S) and modified delta modulation with random access (MDM-R). Comparisons with earlier proposed protocols reveal a better performance in terms of average throughput for data for a given system capacity and outage probability     

Dynamic random access code assignment for prioritized packet data transmission in WCDMA networks

We propose a measurement-based dynamic random access (RA) code assignment procedure for prioritized packet data transmission in wideband code-division multiple access (WCDMA) networks. This dynamic adaptation process is based on analytical performance results derived for random packet access under Rayleigh fading in WCDMA networks. The performance of the proposed measurement-based RA code assignment procedure with three different adaptation methods is evaluated by using computer simulations. The performance of the proposed scheme is compared with those of a retransmission control-based and static channel allocation-based prioritized packet access scheme. An integrated (physical layer and link layer) delay-throughput performance model is presented for finite population RA WCDMA systems. The proposed dynamic RA code assignment procedure can be used in an adaptive quality of service (QoS) framework for dynamically adjusting the QoS of prioritized RA data traffic in the evolving WCDMA-based differentiated services wireless Internet protocol networks.     

VLC-WiFi异构网络QoS感知的跨层动态资源分配

VLC-WiFi异构网络已经成为广受欢迎的短距离无线通信方式之一。然而,有限的频谱资源导致VLC-WiFi异构网络容量难以满足井喷式增长的用户数据带宽需求。该文结合物理层的动态链路传输性能以及媒体访问控制层的队列缓冲延迟性能,定义链路传输性能和链路服务质量(QoS)感知等级评估公式,根据用户数据包QoS需求,设计QoS感知的跨层动态资源分配(QoS-CLDRA)方法,并引入非正交多址接入的用户匹配与功率分配策略,进一步提升系统的吞吐量。仿真结果表明:所提方法能够有效提升系统吞吐量和降低缓冲队列长度。     

基于无线自组网的网络层交换软件设计与实现

研究了一种应用于无线自组网的网络层交换软件,通过系统模型的抽象和建立,将网络层需要实现的功能独立出来,进而制定了本地及全局路由的建立与维护、网络层数据交换等关键策略,综合运用了多线程设计、网络编程、驱动设计等多种编程技术,在高速ARM平台上,基于嵌入式Linux操作系统实现了网络层交换系统软件,使标准网络设备无需任何改变即可接入自组网节点设备,并能够通过无线自组网进行通信,解决了接入设备的数据寻路与数据交换问题。     

基于自相似业务模型的WCDMA接入性能分析

随机接入技术对WCDMA网络数据业务性能优化具有较大影响,文提出基于自相似业务模型的WCDMA接入技术并进行性能分析。仿真结果表明基于自相似业务模型的WCDMA网络数据业务接入性能与分形系数H值、网络负载G等参数有关。文章还提出了基于WCDMA的业务接入自相似均衡协议(TASEP),能明显改善WCDMA网络数据业务的接入性能。     

基于访问控制的Hypervisor非控制数据完整性保护

在虚拟化技术广泛应用的同时虚拟层的安全问题引起了国内外研究人员的密切关注。现有的虚拟机管理器(Hypervisor)完整性保护方法主要针对代码和控制数据的完整性保护,无法抵御非控制数据攻击;采用周期性监控无法提供实时的非控制数据完整性保护。针对现有方法的不足,该文提出了基于UCON的Hypervisor非控制数据完整性保护模型UCONhi。该模型在非控制数据完整性保护需求的基础上简化了UCON模型,继承了UCON模型的连续性和易变性实现非控制数据的实时访问控制。根据攻击样例分析攻击者和攻击对象确定主客体减少安全策略,提高了决策效率;并基于ECA描述UCONhi安全策略,能够有效地决策非控制数据访问合法性。在Xen系统中设计并实现了相应的原型系统Xen-UCONhi,通过实验评测Xen-UCONhi的有效性和性能。结果表明,Xen-UCONhi能够有效阻止针对虚拟机管理器的攻击,且性能开销在10%以内。