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.展开更多
The growing P2P streaming traffic brings a variety of problems and challenges to ISP networks and service providers.A P2P streaming traffic classification method based on sampling technology is presented in this paper...The growing P2P streaming traffic brings a variety of problems and challenges to ISP networks and service providers.A P2P streaming traffic classification method based on sampling technology is presented in this paper.By analyzing traffic statistical features and network behavior of P2P streaming,a group of flow characteristics were found,which can make P2P streaming more recognizable among other applications.Attributes from Netflow and those proposed by us are compared in terms of classification accuracy,and so are the results of different sampling rates.It is proved that the unified classification model with the proposed attributes can identify P2P streaming quickly and efficiently in the online system.Even with 1:50 sampling rate,the recognition accuracy can be higher than 94%.Moreover,we have evaluated the CPU resources,storage capacity and time consumption before and after the sampling,it is shown that the classification model after the sampling can significantly reduce the resource requirements with the same recognition accuracy.展开更多
P2P systems are categorized into tree-based and mesh-based systems according to their topologies. Mesh-based systems are considered more suitable for large-scale lnternet applications, but require optimization on late...P2P systems are categorized into tree-based and mesh-based systems according to their topologies. Mesh-based systems are considered more suitable for large-scale lnternet applications, but require optimization on latency issue. This paper proposes a content subscribing mechanism （CSM） to eliminate unnecessary time delays during data relaying. A node can send content data to its neighbors as soon as it receives the data segment. No additional time is taken during the interactive stages prior to data segment transmission of streaming content. CSM consists of three steps. First, every node records its historical segments latency, and adopts gamma distribution, which possesses powerful expression ability, to express latency statistics. Second, a node predicts subscribing success ratio of every neighbor by comparing the gamma distribution parameters of the node and its neighbors before selecting a neighbor node to subscribe a data segment. The above steps would not increase latency as they are executed before the data segments are ready at the neighbor nodes. Finally, the node, which was subscribed to, sends the subscribed data segment to the subscriber immediately when it has the data segment. Experiments show that CSM significantly reduces the content data transmission latency.展开更多
P2P streaming application must realize network address translation （NAT） traversal. To handle low success ratio of the existing NAT traversal algorithm, UPnP-STUN （UPUN） and port-mapping sample estimation （PMSE）...P2P streaming application must realize network address translation （NAT） traversal. To handle low success ratio of the existing NAT traversal algorithm, UPnP-STUN （UPUN） and port-mapping sample estimation （PMSE） algorithm are recommended in this paper. UPUN is the combination of UPnP and STUN, and PMSE utilizes port mapping samples added by symmetric NAT for different sessions to estimate regularity of port mapping of symmetric NAT, which takes advantage of the Bernoulli law of large numbers. Besides, for the situation that both peers are behind NAT, and to handle heavy relay server load when many inner peers want to communicate with each other, a peer auxiliary-relay （PAR） algorithm is presented. PAR lets outer peers with sufficient bandwidth act as relay servers to alleviate pressure of real server, which could avoid NAT traversal failure caused by single point failure of relay server. Finally, experiments show that the proposed algorithms could improve the success ratio significantly for NAT traversal in P2P streaming application as well as improve P2P streaming application applicability.展开更多
基金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.
基金supported by State Key Program of National Natural Science Foundation of China under Grant No.61072061111 Project of China under Grant No.B08004the Fundamental Research Funds for the Central Universities under Grant No.2009RC0122
文摘The growing P2P streaming traffic brings a variety of problems and challenges to ISP networks and service providers.A P2P streaming traffic classification method based on sampling technology is presented in this paper.By analyzing traffic statistical features and network behavior of P2P streaming,a group of flow characteristics were found,which can make P2P streaming more recognizable among other applications.Attributes from Netflow and those proposed by us are compared in terms of classification accuracy,and so are the results of different sampling rates.It is proved that the unified classification model with the proposed attributes can identify P2P streaming quickly and efficiently in the online system.Even with 1:50 sampling rate,the recognition accuracy can be higher than 94%.Moreover,we have evaluated the CPU resources,storage capacity and time consumption before and after the sampling,it is shown that the classification model after the sampling can significantly reduce the resource requirements with the same recognition accuracy.
基金the National Natural Science Foundation of China (Nos. 60533090 and 60525108)the National Basic research Program (973) of China (No. 2002CB312101)+2 种基金the China-US Million Book Digital Library Project (www.cadal.zju.edu.cn)the Science and Technology Project of Zhejiang Province (Nos. 2005C13032 and 2005C11001-05)the Research Project of Education Department of Zhejiang Province (No. 20061352), China
文摘P2P systems are categorized into tree-based and mesh-based systems according to their topologies. Mesh-based systems are considered more suitable for large-scale lnternet applications, but require optimization on latency issue. This paper proposes a content subscribing mechanism （CSM） to eliminate unnecessary time delays during data relaying. A node can send content data to its neighbors as soon as it receives the data segment. No additional time is taken during the interactive stages prior to data segment transmission of streaming content. CSM consists of three steps. First, every node records its historical segments latency, and adopts gamma distribution, which possesses powerful expression ability, to express latency statistics. Second, a node predicts subscribing success ratio of every neighbor by comparing the gamma distribution parameters of the node and its neighbors before selecting a neighbor node to subscribe a data segment. The above steps would not increase latency as they are executed before the data segments are ready at the neighbor nodes. Finally, the node, which was subscribed to, sends the subscribed data segment to the subscriber immediately when it has the data segment. Experiments show that CSM significantly reduces the content data transmission latency.
基金Supported by the Nat/onal Science and Technology Support Projects of China（No. 2008BAH28B04） and the National Natural Science Foundation of China _（No..60903218F0208） andthe National High Technology Research and Development Programme of China （No. 2008AA01A317）
文摘P2P streaming application must realize network address translation （NAT） traversal. To handle low success ratio of the existing NAT traversal algorithm, UPnP-STUN （UPUN） and port-mapping sample estimation （PMSE） algorithm are recommended in this paper. UPUN is the combination of UPnP and STUN, and PMSE utilizes port mapping samples added by symmetric NAT for different sessions to estimate regularity of port mapping of symmetric NAT, which takes advantage of the Bernoulli law of large numbers. Besides, for the situation that both peers are behind NAT, and to handle heavy relay server load when many inner peers want to communicate with each other, a peer auxiliary-relay （PAR） algorithm is presented. PAR lets outer peers with sufficient bandwidth act as relay servers to alleviate pressure of real server, which could avoid NAT traversal failure caused by single point failure of relay server. Finally, experiments show that the proposed algorithms could improve the success ratio significantly for NAT traversal in P2P streaming application as well as improve P2P streaming application applicability.
