{"version":"1.0","provider_name":"IMDEA Networks","provider_url":"https:\/\/networks.imdea.org\/es","author_name":"in_admin","author_url":"https:\/\/networks.imdea.org\/es\/author\/in_admin\/","title":"Who are good parents? - IMDEA Networks","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"5r6RtED7MO\"><a href=\"https:\/\/networks.imdea.org\/es\/actualidad\/agenda-de-eventos\/who-are-good-parents\/\">Who are good parents?<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/networks.imdea.org\/es\/actualidad\/agenda-de-eventos\/who-are-good-parents\/embed\/#?secret=5r6RtED7MO\" width=\"600\" height=\"338\" title=\"\u00abWho are good parents?\u00bb \u2014 IMDEA Networks\" data-secret=\"5r6RtED7MO\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" class=\"wp-embedded-content\"><\/iframe><script type=\"text\/javascript\">\n\/* <![CDATA[ *\/\n\/*! This file is auto-generated *\/\n!function(d,l){\"use strict\";l.querySelector&&d.addEventListener&&\"undefined\"!=typeof URL&&(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&&!\/[^a-zA-Z0-9]\/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret=\"'+t.secret+'\"]'),o=l.querySelectorAll('blockquote[data-secret=\"'+t.secret+'\"]'),c=new RegExp(\"^https?:$\",\"i\"),i=0;i<o.length;i++)o[i].style.display=\"none\";for(i=0;i<a.length;i++)s=a[i],e.source===s.contentWindow&&(s.removeAttribute(\"style\"),\"height\"===t.message?(1e3<(r=parseInt(t.value,10))?r=1e3:~~r<200&&(r=200),s.height=r):\"link\"===t.message&&(r=new URL(s.getAttribute(\"src\")),n=new URL(t.value),c.test(n.protocol))&&n.host===r.host&&l.activeElement===s&&(d.top.location.href=t.value))}},d.addEventListener(\"message\",d.wp.receiveEmbedMessage,!1),l.addEventListener(\"DOMContentLoaded\",function(){for(var e,t,s=l.querySelectorAll(\"iframe.wp-embedded-content\"),r=0;r<s.length;r++)(t=(e=s[r]).getAttribute(\"data-secret\"))||(t=Math.random().toString(36).substring(2,12),e.src+=\"#?secret=\"+t,e.setAttribute(\"data-secret\",t)),e.contentWindow.postMessage({message:\"ready\",secret:t},\"*\")},!1)))}(window,document);\n\/\/# sourceURL=https:\/\/networks.imdea.org\/wp-includes\/js\/wp-embed.min.js\n\/* ]]> *\/\n<\/script>\n","thumbnail_url":"https:\/\/networks.imdea.org\/wp-content\/uploads\/2020\/01\/1568_01_jaime20garcia20reinoso.png","thumbnail_width":250,"thumbnail_height":180,"description":"Nowadays it is possible to watch some TV channels in the Internet using P2P mechanisms. There are basically two ways to construct a P2P network to transmit streaming video: mesh-based and tree-based (there is also a mix of both called hybrid-based). No matter how we construct the overlay, a fundamental problem is: what is the best peer to connect with, in order to obtain the best performance? This question is even more important in the tree-based P2P networks where there is just one connection between a &quot;parent&quot; peer and each one of its children, so, the leaving of a parent forces all its children to reconnect to other parents. Our goal in this study is to minimize the number of orphan peers per minute, i.e. select a parent who minimizes the probability of leaving before a given peer. In order to do that, it is necessary to have other results like the distribution of the channel holding time per peer, the future lifetime of a peer given its elapsed time in a given channel and other stuff that will be described during the presentation."}