P2Psystemsarecategorizedintotree-basedandmesh-basedsystemsaccordingtotheirtopologies.Mesh-basedsystemsareconsideredmoresuitableforlarge-scaleInternetapplications,butrequireoptimizationonlatencyissue.Thispaperproposesacontentsubscribingmechanism(CSM)toeliminateunnecessarytimedelaysduringdatarelaying.Anodecansendcontentdatatoitsneighborsassoonasitreceivesthedatasegment.Noadditionaltimeistakenduringtheinteractivestagespriortodatasegmenttransmissionofstreamingcontent.CSMconsistsofthreesteps.First,everynoderecordsitshistoricalsegmentslatency,andadoptsgammadistribution,whichpossessespowerfulexpressionability,toexpresslatencystatistics.Second,anodepredictssubscribingsuccessratioofeveryneighborbycomparingthegammadistributionparametersofthenodeanditsneighborsbeforeselectinganeighbornodetosubscribeadatasegment.Theabovestepswouldnotincreaselatencyastheyareexecutedbeforethedatasegmentsarereadyattheneighbornodes.Finally,thenode,whichwassubscribedto,sendsthesubscribeddatasegmenttothesubscriberimmediatelywhenithasthedatasegment.ExperimentsshowthatCSMsignificantlyreducesthecontentdatatransmissionlatency.
