000199459 001__ 199459
000199459 005__ 20190316235922.0
000199459 0247_ $$2doi$$a10.1016/j.jnca.2010.06.015
000199459 037__ $$aARTICLE
000199459 245__ $$aAn ant-based rate allocation algorithm for media streaming in peer to peer networks: extension to multiple sessions and dynamic networks
000199459 269__ $$a2011
000199459 260__ $$c2011
000199459 336__ $$aJournal Articles
000199459 520__ $$aIn this paper, we introduce a novel algorithm for rate allocation in media stream- ing P2P networks where multimedia contents are distributed among network members and streamed toward any requesting peer. The proposed algorithm is based on ant-colony optimization. It is capable of handling network dynamism, which is an inherent property of unstructured P2P networks. Another advantage of our algorithm is its ability to get over uncertainties in network state information, particularly the rate of supplying peers that could happen due to lack of accurate measurements. In addition, the suggested method does not rely on any information about the topology of the network. We have investigated both single and multiple streaming sessions scenarios in which more than one peer is receiving media streams from media providers. We show that the suggested algorithm will reach the maximum achievable rate of the network quite fast. A key feature of the proposed algorithm is its low pass filter property, which makes it discriminate between transient and permanent network changes. If the changes are transient, the algorithm easily and rapidly compensates the temporary losses. In cases where the network changes last longer, the algorithm overcomes losses by employing other nodes that have the media stream available. The rate of adaptation is adjustable and must be carefully determined according to network conditions. Moreover, adaption rate is not constant and varies during the streaming session. This results in uninterrupted services for current users in cases where multiple sessions are present in the network. Finally, since we have assumed that fountain codes are used to encode media streams in the P2P networks, the suggested algorithm does not require the user to receive different parts of the streams according to a predefined order and from a specific list of media suppliers. It suffices that the user gets as many stream chunks as necessary, regardless of their order or the fact that not all the media suppliers have all the parts available. In other words, using fountain codes enables us to overcome a big difficulty of P2P media streaming and that is to receive different parts of media streams according to a specific order.
000199459 6531_ $$aAnt colony optimization
000199459 6531_ $$aMultimedia streaming
000199459 6531_ $$aPeer to peer media streaming
000199459 6531_ $$aP2P networks
000199459 6531_ $$aRate allocation
000199459 700__ $$aGoudarzi, Hadi
000199459 700__ $$0243425$$g190838$$aSalavati, Amir Hesam
000199459 700__ $$aPakravan, Mohammad Reza
000199459 773__ $$j34$$tElsevier Journal of Networks and Computer Applications$$k1$$q327-340
000199459 8564_ $$uhttps://infoscience.epfl.ch/record/199459/files/JNCA2011.pdf$$zPostprint$$s6682616$$yPostprint
000199459 909C0 $$xU10423$$0252435$$pISC
000199459 909CO $$qGLOBAL_SET$$particle$$ooai:infoscience.tind.io:199459
000199459 917Z8 $$x190838
000199459 917Z8 $$x148230
000199459 937__ $$aEPFL-ARTICLE-199459
000199459 973__ $$rREVIEWED$$sPUBLISHED$$aOTHER
000199459 980__ $$aARTICLE