https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Meo_et_al_2010aMeo et al 2010a - Revision history2026-04-21T18:26:53ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Meo_et_al_2010a&diff=210077&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 774269092 to Meo et al 2010a2021-02-08T09:26:04Z<p>Scipediacontent moved page <a href="/public/Draft_Content_774269092" class="mw-redirect" title="Draft Content 774269092">Draft Content 774269092</a> to <a href="/public/Meo_et_al_2010a" title="Meo et al 2010a">Meo et al 2010a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 09:26, 8 February 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Meo_et_al_2010a&diff=210076&oldid=prevScipediacontent: Created page with " == Abstract == The increasing success of P2P-TV applications, that may overwhelm the network with their large volume of traffic in the near future, calls for the need of new..."2021-02-08T09:26:00Z<p>Created page with " == Abstract == The increasing success of P2P-TV applications, that may overwhelm the network with their large volume of traffic in the near future, calls for the need of new..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
The increasing success of P2P-TV applications, that may overwhelm the network with their large volume of traffic in the near future, calls for the need of new traffic models that can effectively represent the traffic generated by these applications. In this paper, we study the traffic generated by PPLive and SopCast, that are among the most popular P2P-TV applications of today, and propose Hidden-Markov chains for modeling the traffic they generate. Our results show that the models are quite accurate and can be effectively used in many networking tasks such as network performance analysis, network planning and dimensioning, traffic engineering.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [http://dx.doi.org/10.1109/GLOCOM.2010.5683368 http://dx.doi.org/10.1109/GLOCOM.2010.5683368]<br />
<br />
* [http://xplorestaging.ieee.org/ielx5/5682081/5683069/05683368.pdf?arnumber=5683368 http://xplorestaging.ieee.org/ielx5/5682081/5683069/05683368.pdf?arnumber=5683368],<br />
: [http://dx.doi.org/10.1109/glocom.2010.5683368 http://dx.doi.org/10.1109/glocom.2010.5683368]<br />
<br />
* [https://dblp.uni-trier.de/db/conf/globecom/globecom2010.html#GarciaSM10 https://dblp.uni-trier.de/db/conf/globecom/globecom2010.html#GarciaSM10],<br />
: [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005683368 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005683368],<br />
: [https://iris.polito.it/handle/11583/2557573 https://iris.polito.it/handle/11583/2557573],<br />
: [http://porto.polito.it/2557573 http://porto.polito.it/2557573],<br />
: [https://academic.microsoft.com/#/detail/2092994810 https://academic.microsoft.com/#/detail/2092994810]</div>Scipediacontent