In order to solve the problem that the existing data scheduling algorithm cannot make full use of neighbors' bandwidth resources when allocating data request among several senders in the multisender based P2P stre...In order to solve the problem that the existing data scheduling algorithm cannot make full use of neighbors' bandwidth resources when allocating data request among several senders in the multisender based P2P streaming system,a peer priority based scheduling algorithm is proposed.The algorithm calculates neighbors' priority based on peers' historical service evaluation as well as how many wanted data that the neighbor has.The data request allocated to each neighbor is adjusted dynamically according to the priority when scheduling.Peers with high priority are preferred to allocate more data request.Experiment shows the algorithm can make full use of neighbors' bandwidth resources to transmit data to reduce server pressure effectively and improve system scalability.展开更多
In the past decade,online Peer-to-Peer(P2P)lending platforms have transformed the lending industry,which has been historically dominated by commercial banks.Information technology breakthroughs such as big data-based ...In the past decade,online Peer-to-Peer(P2P)lending platforms have transformed the lending industry,which has been historically dominated by commercial banks.Information technology breakthroughs such as big data-based financial technologies(Fintech)have been identified as important disruptive driving forces for this paradigm shift.In this paper,we take an information economics perspective to investigate how big data affects the transformation of the lending industry.By identifying how signaling and search costs are reduced by big data analytics for credit risk management of P2P lending,we discuss how information asymmetry is reduced in the big data era.Rooted in the lending business,we propose a theory on the economics of big data and outline a number of research opportunities and challenging issues.展开更多
Peer-to-peer (P2P) networking is a distributed architecture that partitions tasks or data between peer nodes. In this paper, an efficient Hypercube Sequential Matrix Partition (HS-MP) for efficient data sharing in P2P...Peer-to-peer (P2P) networking is a distributed architecture that partitions tasks or data between peer nodes. In this paper, an efficient Hypercube Sequential Matrix Partition (HS-MP) for efficient data sharing in P2P Networks using tokenizer method is proposed to resolve the problems of the larger P2P networks. The availability of data is first measured by the tokenizer using Dynamic Hypercube Organization. By applying Dynamic Hypercube Organization, that efficiently coordinates and assists the peers in P2P network ensuring data availability at many locations. Each data in peer is then assigned with valid ID by the tokenizer using Sequential Self-Organizing (SSO) ID generation model. This ensures data sharing with other nodes in large P2P network at minimum time interval which is obtained through proximity of data availability. To validate the framework HS-MP, the performance is evaluated using traffic traces collected from data sharing applications. Simulations conducting using Network simulator-2 show that the proposed framework outperforms the conventional streaming models. The performance of the proposed system is analyzed using energy consumption, average latency and average data availability rate with respect to the number of peer nodes, data size, amount of data shared and execution time. The proposed method reduces the energy consumption 43.35% to transpose traffic, 35.29% to bitrev traffic and 25% to bitcomp traffic patterns.展开更多
Pull-based P2P live streaming is a promising solution for the large scale streaming systems, like PPStream, PPlive, due to its high scalability, low cost and high resilience. However, they usually suffer from bad dela...Pull-based P2P live streaming is a promising solution for the large scale streaming systems, like PPStream, PPlive, due to its high scalability, low cost and high resilience. However, they usually suffer from bad delay performance. In this paper, we seek to improve the delay performance under ensuring video display quality stemming from chunk scheduling. And so we model Pull-based chunk scheduling problem as a multi-objective optimization problem to minimize the video delay and maximize video display quality in the environment of heterogeneous upload bandwidths, heterogeneous and dynamic propagation delays. Finally we put up with a greedy Pull-based scheduling approach(GPSA) to solve the optimization problem. The evaluation shows GPSA can outperform two classical chunk scheduling approaches and adapt to dynamic variance of propagation delays.展开更多
In order to reduce the traffic load and improve the availability of the shared resources in unstructured P2P networks, a caching scheme combining alternative index and adaptive replication （AIAR） is presented. AIAR ...In order to reduce the traffic load and improve the availability of the shared resources in unstructured P2P networks, a caching scheme combining alternative index and adaptive replication （AIAR） is presented. AIAR uses random walk mechanism to disperse the caching information of resources in the network based on its power-law characteristic, and dynamically adjusts replicas according to the visit frequency on resources and the degree information of peers. Subsequent experimental results show that the proposed AIAR scheme is beneficial to improve the search performance of success rate and respond speed. In addition, compared to some existing caching scheme, AIAR can perform much better in success rate, especially in a dynamic environment.展开更多
To relieve the negative effect brought by the intricate wireless network environment and unstable user behavior in layered mobile peer-to peer（P2P） streaming service, an evolved layered P2P （E-LP2P） data schedulin...To relieve the negative effect brought by the intricate wireless network environment and unstable user behavior in layered mobile peer-to peer（P2P） streaming service, an evolved layered P2P （E-LP2P） data scheduling scheme in the process of service delivery is introduced in this paper. The data in base layer is scheduled according to its importance in streaming play to guarantee the basic play of streaming. The data in enhancement layer is scheduled according to the characters of streaming data, including its position and amount in server peer set in a multiple tied way towards the data in enhancement layer. To cope with the layer jitter caused by the fluctuation of bandwidth, jitter prevent mechanism is used to adjust the highest layer dynamically during the process of data scheduling. Simulation results show that the E-LP2P can provide good quality of service（QoS） performance in terms of throughput, layer delivery ratio, server load and useless packet ratio.展开更多
P2P流媒体cache是一种有效减少带宽开销、提高对象利用率的技术,通常采用FIFO,LRU等算法置换内容.然而,流媒体不同于Web对象,P2P网络也有别于客户/服务器模式.在分布式应用中这些算法可能影响系统的性能,为此,分析了FIFO和LRU置换算法,...P2P流媒体cache是一种有效减少带宽开销、提高对象利用率的技术,通常采用FIFO,LRU等算法置换内容.然而,流媒体不同于Web对象,P2P网络也有别于客户/服务器模式.在分布式应用中这些算法可能影响系统的性能,为此,分析了FIFO和LRU置换算法,提出了基于供求关系的SD算法,以及基于分片副本数量的REP算法,并对其进行评估和比较.针对不同的节点到达间隔,将SD和REP同FIFO,LRU进行比较,发现在启动延迟、媒体副本数量和根节点依赖度方面SD和REP几乎均优于FIFO和LRU.同LSB(least sent bytes)算法相比,某些场景中SD的启动延迟减少了约40%,而REP在副本数量方面远远超过LSB的结果,说明在P2P网络流媒体服务中使用SD和REP缓存置换算法有助于提高系统性能.展开更多
A hierarchical peer-to-peer（P2P）model and a data fusion method for network security situation awareness system are proposed to improve the efficiency of distributed security behavior monitoring network.The single po...A hierarchical peer-to-peer（P2P）model and a data fusion method for network security situation awareness system are proposed to improve the efficiency of distributed security behavior monitoring network.The single point failure of data analysis nodes is avoided by this P2P model,in which a greedy data forwarding method based on node priority and link delay is devised to promote the efficiency of data analysis nodes.And the data fusion method based on repulsive theory-Dumpster/Shafer（PSORT-DS）is used to deal with the challenge of multi-source alarm information.This data fusion method debases the false alarm rate.Compared with improved Dumpster/Shafer（DS）theoretical method based on particle swarm optimization（PSO）and classical DS evidence theoretical method,the proposed model reduces false alarm rate by 3%and 7%,respectively,whereas their detection rate increases by 4%and 16%,respectively.展开更多
Multidimensional data query has been gaining much interest in database research communities in recent years, yet many of the existing studies focus mainly on ten tralized systems. A solution to querying in Peer-to-Pee...Multidimensional data query has been gaining much interest in database research communities in recent years, yet many of the existing studies focus mainly on ten tralized systems. A solution to querying in Peer-to-Peer（P2P） environment was proposed to achieve both low processing cost in terms of the number of peers accessed and search messages and balanced query loads among peers. The system is based on a balanced tree structured P2P network. By partitioning the query space intelligently, the amount of query forwarding is effectively controlled, and the number of peers involved and search messages are also limited. Dynamic load balancing can be achieved during space partitioning and query resolving. Extensive experiments confirm the effectiveness and scalability of our algorithms on P2P networks.展开更多
This paper presents a resource scheduling approach in grid computing environment. Using P2P technology, this novel approach can schedule dynamic grid computing resources efficiently. Grid computing resources in differ...This paper presents a resource scheduling approach in grid computing environment. Using P2P technology, this novel approach can schedule dynamic grid computing resources efficiently. Grid computing resources in different domains are organized into a structured P2P overlay network. Available resource information is published in type of grid services. Task requests for computational resources are also presented as grid services. Problem of resources scheduling is translated into services discovery. Different from central scheduling approaches that collect available resources information, this Chord-based approach forwards task requests in the overlay network and discovers satisfied resources for these tasks. Using this approach, the computational resources of a grid system can be scheduled dynamically according to the real- time workload on each peer. Furthermore, the application of this approach is introduced into DDG, a grid system for drug discovery and design, to evaluate the performance. Experimental results show that computational resources of a grid system can be managed efficiently, and the system can hold a perfect load balance state and robustness.展开更多
A P2P approaches to extend the ability of Video on Demand systems to serve more users. In the proposed system users share with each other the media data obtained and the media server is no longer the only source to ge...A P2P approaches to extend the ability of Video on Demand systems to serve more users. In the proposed system users share with each other the media data obtained and the media server is no longer the only source to get data from, thereby, the load on the media server could be greatly alleviated and the overall system capacity increases and more users could be served. The P2P streaming system introduces efficient searching;data transfer dynamically monitoring and initial buffering to maintain a high quality of playback. Its provider selection policy helps to reduce the load of the underlying network by avoiding remote data transfer.展开更多
基金Supported by the National High Technology Research and Development Program of China(No.2009AA01A339,2008AA01A317)the National Natural Science Foundation of China for Distinguished Young Scholars(No.60903218F0208)the Science and Technology Support Plan of China(No.2008BAH28B04)
文摘In order to solve the problem that the existing data scheduling algorithm cannot make full use of neighbors' bandwidth resources when allocating data request among several senders in the multisender based P2P streaming system,a peer priority based scheduling algorithm is proposed.The algorithm calculates neighbors' priority based on peers' historical service evaluation as well as how many wanted data that the neighbor has.The data request allocated to each neighbor is adjusted dynamically according to the priority when scheduling.Peers with high priority are preferred to allocate more data request.Experiment shows the algorithm can make full use of neighbors' bandwidth resources to transmit data to reduce server pressure effectively and improve system scalability.
文摘In the past decade,online Peer-to-Peer(P2P)lending platforms have transformed the lending industry,which has been historically dominated by commercial banks.Information technology breakthroughs such as big data-based financial technologies(Fintech)have been identified as important disruptive driving forces for this paradigm shift.In this paper,we take an information economics perspective to investigate how big data affects the transformation of the lending industry.By identifying how signaling and search costs are reduced by big data analytics for credit risk management of P2P lending,we discuss how information asymmetry is reduced in the big data era.Rooted in the lending business,we propose a theory on the economics of big data and outline a number of research opportunities and challenging issues.
文摘Peer-to-peer (P2P) networking is a distributed architecture that partitions tasks or data between peer nodes. In this paper, an efficient Hypercube Sequential Matrix Partition (HS-MP) for efficient data sharing in P2P Networks using tokenizer method is proposed to resolve the problems of the larger P2P networks. The availability of data is first measured by the tokenizer using Dynamic Hypercube Organization. By applying Dynamic Hypercube Organization, that efficiently coordinates and assists the peers in P2P network ensuring data availability at many locations. Each data in peer is then assigned with valid ID by the tokenizer using Sequential Self-Organizing (SSO) ID generation model. This ensures data sharing with other nodes in large P2P network at minimum time interval which is obtained through proximity of data availability. To validate the framework HS-MP, the performance is evaluated using traffic traces collected from data sharing applications. Simulations conducting using Network simulator-2 show that the proposed framework outperforms the conventional streaming models. The performance of the proposed system is analyzed using energy consumption, average latency and average data availability rate with respect to the number of peer nodes, data size, amount of data shared and execution time. The proposed method reduces the energy consumption 43.35% to transpose traffic, 35.29% to bitrev traffic and 25% to bitcomp traffic patterns.
基金supported by National Key Basic Research Program of China(973 Program)(2009CB320504)the Foundation for Innovative Research Groups of the National Natural Science Foundation of China (Grant No. 60821001)+1 种基金Beijing Municipal Commission of Education to build the project special,Research Fund for the Doctoral Program of Higher Education of China (20090005120012)National Natural Science Foundation (60672121)
文摘Pull-based P2P live streaming is a promising solution for the large scale streaming systems, like PPStream, PPlive, due to its high scalability, low cost and high resilience. However, they usually suffer from bad delay performance. In this paper, we seek to improve the delay performance under ensuring video display quality stemming from chunk scheduling. And so we model Pull-based chunk scheduling problem as a multi-objective optimization problem to minimize the video delay and maximize video display quality in the environment of heterogeneous upload bandwidths, heterogeneous and dynamic propagation delays. Finally we put up with a greedy Pull-based scheduling approach(GPSA) to solve the optimization problem. The evaluation shows GPSA can outperform two classical chunk scheduling approaches and adapt to dynamic variance of propagation delays.
基金The National Natural Science Foundationof China (Nos.60403027, 60773191,and 60873225) the National High Technology Research and Development Program of China (863 Program) (No.2007AA01Z403)
文摘In order to reduce the traffic load and improve the availability of the shared resources in unstructured P2P networks, a caching scheme combining alternative index and adaptive replication （AIAR） is presented. AIAR uses random walk mechanism to disperse the caching information of resources in the network based on its power-law characteristic, and dynamically adjusts replicas according to the visit frequency on resources and the degree information of peers. Subsequent experimental results show that the proposed AIAR scheme is beneficial to improve the search performance of success rate and respond speed. In addition, compared to some existing caching scheme, AIAR can perform much better in success rate, especially in a dynamic environment.
基金supported by the National Natural Science Foundation of China (60902047)the Fundamental Research Funds for the Central Universities (BUPT 2009RC0120)
文摘To relieve the negative effect brought by the intricate wireless network environment and unstable user behavior in layered mobile peer-to peer（P2P） streaming service, an evolved layered P2P （E-LP2P） data scheduling scheme in the process of service delivery is introduced in this paper. The data in base layer is scheduled according to its importance in streaming play to guarantee the basic play of streaming. The data in enhancement layer is scheduled according to the characters of streaming data, including its position and amount in server peer set in a multiple tied way towards the data in enhancement layer. To cope with the layer jitter caused by the fluctuation of bandwidth, jitter prevent mechanism is used to adjust the highest layer dynamically during the process of data scheduling. Simulation results show that the E-LP2P can provide good quality of service（QoS） performance in terms of throughput, layer delivery ratio, server load and useless packet ratio.
文摘P2P流媒体cache是一种有效减少带宽开销、提高对象利用率的技术,通常采用FIFO,LRU等算法置换内容.然而,流媒体不同于Web对象,P2P网络也有别于客户/服务器模式.在分布式应用中这些算法可能影响系统的性能,为此,分析了FIFO和LRU置换算法,提出了基于供求关系的SD算法,以及基于分片副本数量的REP算法,并对其进行评估和比较.针对不同的节点到达间隔,将SD和REP同FIFO,LRU进行比较,发现在启动延迟、媒体副本数量和根节点依赖度方面SD和REP几乎均优于FIFO和LRU.同LSB(least sent bytes)算法相比,某些场景中SD的启动延迟减少了约40%,而REP在副本数量方面远远超过LSB的结果,说明在P2P网络流媒体服务中使用SD和REP缓存置换算法有助于提高系统性能.
基金Supported by the National Natural Science Foundation of China(61370212)the Research Fund for the Doctoral Program of Higher Education of China(20122304130002)+1 种基金the Natural Science Foundation of Heilongjiang Province(ZD 201102)the Fundamental Research Fund for the Central Universities(HEUCFZ1213,HEUCF100601)
文摘A hierarchical peer-to-peer（P2P）model and a data fusion method for network security situation awareness system are proposed to improve the efficiency of distributed security behavior monitoring network.The single point failure of data analysis nodes is avoided by this P2P model,in which a greedy data forwarding method based on node priority and link delay is devised to promote the efficiency of data analysis nodes.And the data fusion method based on repulsive theory-Dumpster/Shafer（PSORT-DS）is used to deal with the challenge of multi-source alarm information.This data fusion method debases the false alarm rate.Compared with improved Dumpster/Shafer（DS）theoretical method based on particle swarm optimization（PSO）and classical DS evidence theoretical method,the proposed model reduces false alarm rate by 3%and 7%,respectively,whereas their detection rate increases by 4%and 16%,respectively.
基金Supported by the Natural Science Foundation ofJiangsu Province(BG2004034)
文摘Multidimensional data query has been gaining much interest in database research communities in recent years, yet many of the existing studies focus mainly on ten tralized systems. A solution to querying in Peer-to-Peer（P2P） environment was proposed to achieve both low processing cost in terms of the number of peers accessed and search messages and balanced query loads among peers. The system is based on a balanced tree structured P2P network. By partitioning the query space intelligently, the amount of query forwarding is effectively controlled, and the number of peers involved and search messages are also limited. Dynamic load balancing can be achieved during space partitioning and query resolving. Extensive experiments confirm the effectiveness and scalability of our algorithms on P2P networks.
文摘This paper presents a resource scheduling approach in grid computing environment. Using P2P technology, this novel approach can schedule dynamic grid computing resources efficiently. Grid computing resources in different domains are organized into a structured P2P overlay network. Available resource information is published in type of grid services. Task requests for computational resources are also presented as grid services. Problem of resources scheduling is translated into services discovery. Different from central scheduling approaches that collect available resources information, this Chord-based approach forwards task requests in the overlay network and discovers satisfied resources for these tasks. Using this approach, the computational resources of a grid system can be scheduled dynamically according to the real- time workload on each peer. Furthermore, the application of this approach is introduced into DDG, a grid system for drug discovery and design, to evaluate the performance. Experimental results show that computational resources of a grid system can be managed efficiently, and the system can hold a perfect load balance state and robustness.
文摘A P2P approaches to extend the ability of Video on Demand systems to serve more users. In the proposed system users share with each other the media data obtained and the media server is no longer the only source to get data from, thereby, the load on the media server could be greatly alleviated and the overall system capacity increases and more users could be served. The P2P streaming system introduces efficient searching;data transfer dynamically monitoring and initial buffering to maintain a high quality of playback. Its provider selection policy helps to reduce the load of the underlying network by avoiding remote data transfer.
