During recent years, the success of live swarm-based P2P streaming system has been witnessed. Nevertheless, how to design an effective mechanism for mitigating video quality degradation in a lossy network environment is still not thoroughly resolved yet. Unlike conventional client-server paradigm, there is data availability problem in swarm-based P2P streaming system. If we directly conduct the importance-first scheduling strategy in swarm-based P2P streaming system, the serious content bottleneck for low priority chunks occurs, particularly when the population size is large. In this work, we propose a dynamic strategy-switching approach that combines the advantages of random scheduling and importance first scheduling to deal with the problem. Simulation results indicate that our approach not only provides better scheduling efficiency, but also is scalable even if population size is large.
{"title":"Striking the balance between content diversity and content importance in swarm-based P2P streaming","authors":"Chun-Yuan Chang, Cheng-Fu Chou, Ming-Hung Chen","doi":"10.1109/HPCC.2011.93","DOIUrl":"https://doi.org/10.1109/HPCC.2011.93","url":null,"abstract":"During recent years, the success of live swarm-based P2P streaming system has been witnessed. Nevertheless, how to design an effective mechanism for mitigating video quality degradation in a lossy network environment is still not thoroughly resolved yet. Unlike conventional client-server paradigm, there is data availability problem in swarm-based P2P streaming system. If we directly conduct the importance-first scheduling strategy in swarm-based P2P streaming system, the serious content bottleneck for low priority chunks occurs, particularly when the population size is large. In this work, we propose a dynamic strategy-switching approach that combines the advantages of random scheduling and importance first scheduling to deal with the problem. Simulation results indicate that our approach not only provides better scheduling efficiency, but also is scalable even if population size is large.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128393005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-07-01DOI: 10.1109/ICNP.2011.6089064
Andrea G. Ribeiro, Rute C. Sofia, A. Zúquete
Wireless networks growing popularity coupled with a wide availability of wireless-enabled personal devices is today the basis for user-centric Internet architectures to evolve. Central to this new paradigm of user-centricity is the fact that today the Internet end-user exhibits a highly nomadic behavior, where most of the portable devices are carried by humans. The thesis proposed relates to the recent trend of social mobility modeling as a way to improve mobile network operation. The work is focused on the analysis of social mobility models and how to propose new models having in mind an overall network optimization due to the possibility to predict adequately node movement on mobile networks.
{"title":"Improving mobile networks based on social mobility modeling","authors":"Andrea G. Ribeiro, Rute C. Sofia, A. Zúquete","doi":"10.1109/ICNP.2011.6089064","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089064","url":null,"abstract":"Wireless networks growing popularity coupled with a wide availability of wireless-enabled personal devices is today the basis for user-centric Internet architectures to evolve. Central to this new paradigm of user-centricity is the fact that today the Internet end-user exhibits a highly nomadic behavior, where most of the portable devices are carried by humans. The thesis proposed relates to the recent trend of social mobility modeling as a way to improve mobile network operation. The work is focused on the analysis of social mobility models and how to propose new models having in mind an overall network optimization due to the possibility to predict adequately node movement on mobile networks.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122611480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-03-29DOI: 10.1109/ICNP.2011.6089048
C. Castelluccia, Emiliano De Cristofaro, Aurélien Francillon, M. Kâafar
The increasing amount of personal and sensitive information disseminated over the Internet prompts commen-surately growing privacy concerns. Digital data often lingers indefinitely and users lose its control. This motivates the desire to restrict content availability to an expiration time set by the data owner. This paper presents and formalizes the notion of Ephemeral Publishing (EphPub), to prevent the access to expired content. We propose an efficient and robust protocol that builds on the Domain Name System (DNS) and its caching mechanism. With EphPub, sensitive content is published encrypted and the key material is distributed, in a steganographic manner, to randomly selected and independent resolvers. The availability of content is then limited by the evanescence of DNS cache entries. The EphPub protocol is transparent to existing applications, and does not rely on trusted hardware, centralized servers, or user proactive actions. We analyze its robustness and show that it incurs a negligible overhead on the DNS infrastructure. We also perform a large-scale study of the caching behavior of 900K open DNS resolvers. Finally, we propose Firefox and Thunderbird extensions that provide ephemeral publishing capabilities, as well as a command-line tool to create ephemeral files.
{"title":"EphPub: Toward robust Ephemeral Publishing","authors":"C. Castelluccia, Emiliano De Cristofaro, Aurélien Francillon, M. Kâafar","doi":"10.1109/ICNP.2011.6089048","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089048","url":null,"abstract":"The increasing amount of personal and sensitive information disseminated over the Internet prompts commen-surately growing privacy concerns. Digital data often lingers indefinitely and users lose its control. This motivates the desire to restrict content availability to an expiration time set by the data owner. This paper presents and formalizes the notion of Ephemeral Publishing (EphPub), to prevent the access to expired content. We propose an efficient and robust protocol that builds on the Domain Name System (DNS) and its caching mechanism. With EphPub, sensitive content is published encrypted and the key material is distributed, in a steganographic manner, to randomly selected and independent resolvers. The availability of content is then limited by the evanescence of DNS cache entries. The EphPub protocol is transparent to existing applications, and does not rely on trusted hardware, centralized servers, or user proactive actions. We analyze its robustness and show that it incurs a negligible overhead on the DNS infrastructure. We also perform a large-scale study of the caching behavior of 900K open DNS resolvers. Finally, we propose Firefox and Thunderbird extensions that provide ephemeral publishing capabilities, as well as a command-line tool to create ephemeral files.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122637626","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：