基于移动Agent的双层结构P2P系统模型

根据目前P2P系统的特点及其存在的问题提出了一个适用性比较广泛的基于双层结构的P2P系统模型。该模型第一层在簇内基于IP多播实现CN与SN间发现与信息交互，第二层在簇外使用移动Agent实现SN问发现与信息交互。文中论述了采用该模型的优势、系统使用的关键技术以及基于JXTA协议的实现方案。     

P2P移动电子商务模式研究

针对当前电子商务的发展情况,分析了几种模式下电子商务的缺点和不足,提出了一种新的商务模式-P2P模式。随着3G移动网络的到来,P2P模式的移动电子商务必然成为未来电子商务发展的趋势。在这一前提下给出了一种P2P移动电子商务机制。     

一种轻量级P2P 协议框架的设计与实现

目前互联网发展迅速,网络及网络应用覆盖广泛,网络服务与网络请求数量不断增多。如何有效地利用有限 的计算机资源,提供最大的网络服务是一个值得思考的问题。对等网络作为解决这个问题的一种手段,在开发和使用上存在 一定的局限性。主要表现在平台相对独立,平台数据无法直接共享;移动节点的移动性导致网络的连通不稳定。本文在前人 基础上,提出一种轻量级的P2P 协议框架,通过JXTA 协议将不同的平台联系起来,同时对JXTA 框架进行简化,使它成为一个 能处理移动节点随机移动的轻量级框架。     

基于JXTA的P2P网络技术研究

JXTA是P2P网络的一个开放平台。由于其独立于编程语言、系统平台和网络平台,很可能会成为将来P2P网络的标准。本文简要介绍了JXTA的体系结构及协议内容、JXTA提供的安全技术及应用。     

JXTA框架下P2P即时消息传输过程的实现研究

首先介绍JXTA平台,包括其概念、核心构件和协议,然后介绍了JXTA框架下即时消息的接收和发送的几种方式并实现了其中的两种,最后介绍了消息安全性的问题。     

P2P网络多媒体实时共享系统

提出一个基于三层模型的点对点(P2P)网络多媒体实时共享系统。P2P网络层基于JXTA协议实现对等点对资源的搜索和发布。服务层实现请求信息的解析并根据解析出的信息查找请求的媒体资源。媒体应用层基于JMF实现视频音频流的传输和播放,并创建副本资源向P2P网络发布资源通告。系统采用沿节点缓存,加快资源的搜索,同时提出对等点服务评估参数的概念,以此来动态的选择最优点作为服务提供者,避免P2P网络中热点的出现,平衡网络负载。     

新一代网络计算模型——P2P及其JXTA体系结构的设计与实现

提出了P2P网络计算模型同传统的计算模型之间的区别，它所具有的许多吸引人的新特性和广阔的应用前景，简要地论述了JXTA体系结构在实现P2P计算模型时的特点，设计原则，核心构造块，核心协议，主要的参考实现及潜在的应用。     

JXTA框架下P2P即时通信系统的设计

首先介绍JXTA平台,包括其概念、核心构件和协议,然后设计一个基于JXTA的P2P应用程序开发框架,最后针对这种框架实现一个即时通信系统.     

JXTA框架下P2P应用系统的研究与开发

P2P计算被Intel工作组喻为第三代网络,其应用日渐流行.JXTA是SUN公司推出的,旨在建立P2P通用技术的平台基础.文章介绍了P2P的特点和应用,阐述了JXTA技术,包括其设计目标、层次结构和安装与配置,最后说明了基于JXTA框架的P2P典型应用系统及发展.     

基于随机微分方程的通用P2P文件分发模型*

提出一种基于随机微分方程的流模型来描述对等（P2P）文件分发系统的动态行为。根据实际系统分类节点,分别对各类节点进行量化分析,建立系统的动态模型。所建模型抽象邻居选择策略和节点到达率,能够支持各种邻居选择算法和不同的节点到达率。基于所建模型分析了现有的邻居选择策略和节点到达率。通过与实际系统的跟踪数据进行对比,所提出的模型能够准确描述现有的P2P协作式文件共享系统,是一种通用、实用的模型。该模型有助于评估现有的方案,设计优化的系统。     

Improving robustness of P2P applications in mobile environments

Mobile P2P networks possess particular characteristics which make accessibility of services deployed on peers a challenge. This has to be taken into account when considering robustness of applications that depend on successfully accessing a set of services. While ensuring robustness is traditionally handled through replication or redundancy, those solutions are not readily applicable to decentralized and dynamic networks. Instead, current solutions are based on efficient P2P structure maintenance or unstructured network search algorithms. A novel and alternative method proposed in this paper is based on the observation that some redundancy may exist between services offered on the network, a fact which could be used to recreate an unavailable service from services accessible to a peer. Instead of adding redundancy to the system, our solution exploits the already existing redundancy to improve robustness of mobile P2P applications. We model the interaction with services as finite-state transducers and propose a heuristic to obtain redundancy between any pair of services. Then, a set of algorithms that uses this inter-service redundancy to recreate the interaction with one service from the other is discussed. The computational cost is polynomial with respect to services’ size, and in practice, the non-redundant functionality and related control need to be implemented locally.

A distributed trust management model for mobile P2P networks

In this paper we propose a distributed Trust Management Model (DTMM) for constructing much shorter and more robust trust chains in mobile p2p networks. With DTMM, each moving object within the same group tends to have a high probability of keeping stable distances from each other. The main contribution of this model is to predict the future availability of wireless links and lead to fast generating valid trust evidences. A major difference between DTMM and many existing models in trust literature is that DTMM does not rely on any fixed networking infrastructure, and therefore is able to adapt to both high mobility environments. Our work appears to be the first attempt to research the relationship between mobile patterns and trust management of peers in mobile P2P network. The simulation results show that our model is highly robust and scalable in the dynamic environment of mobile networks.     

一种移动环境中的P2P网络信任模型

针对移动P2P网络大规模分布式和高度动态性的特点,提出一种基于动态反馈机制的信任模型.该模型引入了距离因子和推荐因子两个参数来控制推荐信任链的规模,提高推荐信任度的准确性.模型将反馈机制和惩罚机制集成到节点间的近期信任度和长期信任度的更新计算之中,提高了模型随时间和历史变化的动态适应性.模拟实验表明,该模型具有很好的动态适应能力,能够有效隔离恶意节点.     

Dynamic cloud resource management for efficient media applications in mobile computing environments

Single-instruction-set architecture (Single-ISA) heterogeneous multi-core processors (HMP) are superior to Symmetric Multi-core processors in performance per watt. They are popular in many aspects of the Internet of Things, including mobile multimedia cloud computing platforms. One Single-ISA HMP integrates both fast out-of-order cores and slow simpler cores, while all cores are sharing the same ISA. The quality of service (QoS) is most important for virtual machine (VM) resource management in multimedia mobile computing, particularly in Single-ISA heterogeneous multi-core cloud computing platforms. Therefore, in this paper, we propose a dynamic cloud resource management (DCRM) policy to improve the QoS in multimedia mobile computing. DCRM dynamically and optimally partitions shared resources according to service or application requirements. Moreover, DCRM combines resource-aware VM allocation to maximize the effectiveness of the heterogeneous multi-core cloud platform. The basic idea for this performance improvement is to balance the shared resource allocations with these resources requirements. The experimental results show that DCRM behaves better in both response time and QoS, thus proving that DCRM is good at shared resource management in mobile media cloud computing.     

移动P2P分布式信任模型设计

移动P2P网络的开放性和松耦合特性使得节点恶意攻击行为普遍存在,而现有基于声誉的信任模型大都基于“信誉值高的节点评价推荐越可信”的假设,无法识别恶意节点动态策略性攻击行为。针对这一问题,将社会网络相关理论引入信任系统,提出一种基于社会距离的信任模型（SD2Trust）。该模型区分了服务可信度和推荐评价可信度,用多维结构同型性描述向量刻画节点网络地位和行为特征,根据社会距离确定推荐节点集和推荐信誉计算权重,综合信任考虑了诋毁风险。理论分析和实验结果表明,该模型能有效对抗恶意节点动态策略攻击行为。     

P2P环境下改进的基于信誉的信任模型

现有的基于信誉的信任模型对于节点在进行信誉反馈时的行为突然改变不能做出迅速反应,针对该问题,在保留TBRM(mast-bascd reputatlion model)优势的基础上,提出了一种改进的基于信誉的信任模型.该模型引入了惩罚因子加大对节点在进行信誉反馈时的动态摇摆行为的惩罚力度,并且细化了模型的分布式存储策略.仿真实验结果表明,在P2P文件共享网络中,该模型能有效遏制恶意节点的动态摇摆行为,提高真实文件的下载成功率.     

Service and P2P based secure media sharing in mobile commerce environments

Service technology is slowly evolving to be a promising technology for developing applications in open, loosely coupled and distributed computing environments, e.g., in mobile commerce (m-commerce). Services technology can shield the heterogeneous platforms and is suitable for m-commerce applications. Peer-to-Peer (P2P) technology becomes more and more popular for mobile commerce applications. For secure media distribution in m-commerce applications, the security and P2P rights management become more and more urgent. New schemas and architectures for secure P2P based m-commerce applications, which are expected to function automatically or semi-automatically, are expected. In this paper, a secure media service system is presented, which can trace illegal distributors in m-commerce applications. In this scheme, the decryption operation and fingerprint embedding operation are combined together, which avoids the leakage of clear media content in mobile transfer. Additionally, these operations are implemented by the peer, which makes the scheme compliant with existing Peer-to-Peer Digital Rights Management (DRM) systems and very proper for secure media distribution in m-commerce applications. The architectures and modes of secure media distribution in m-commerce environment are presented and discussed.     

移动P2P网络中的多粒度信任模型

移动P2P网络的应用越来越广泛,随之而来的是大量欺诈等恶意行为,使系统的有效性和可用性难以保证。现有模型大多针对固定网络,忽略了终端类型对节点信任值的影响,而且不能很好地解决节点在不同领域、不同方面的可信度计算问题。针对上述问题,利用聚类思想和时间因子的概念,提出一种多粒度信任模型MGT（Multiple Granularity Trust Model）,并给出基于该模型的资源选择协议的工作流程。分析结果表明,模型能够有效地抵御恶意节点的破坏,增强P2P网络的安全性。     

Adversarial android malware detection for mobile multimedia applications in IoT environments

Multimedia Tools and Applications - In this paper, we propose two defense methods against adversarial attack to a malware detection system for mobile multimedia applications in IoT environments....