Netw. Protoc. Algorithms最新文献_第10页

Dynamic VoIP codec selection on smartphones 智能手机上的动态VoIP编解码器选择

Netw. Protoc. Algorithms Pub Date : 2014-06-30 DOI: 10.5296/npa.v6i2.5370

A. Estepa, R. Estepa, J. Vozmediano, Pablo Carrillo

引用次数: 15

Adaptive Streaming: A subjective catalog to assess the performance of objective QoE metrics 自适应流:评估客观QoE指标性能的主观目录

Netw. Protoc. Algorithms Pub Date : 2014-06-30 DOI: 10.5296/npa.v6i2.5461

Alberto Álvarez, Laura Pozueco, Sergio Cabrero Barros, X. G. Pañeda, Roberto García, David Melendi, Gabriel Díaz

{"title":"Adaptive Streaming: A subjective catalog to assess the performance of objective QoE metrics","authors":"Alberto Álvarez, Laura Pozueco, Sergio Cabrero Barros, X. G. Pañeda, Roberto García, David Melendi, Gabriel Díaz","doi":"10.5296/npa.v6i2.5461","DOIUrl":"https://doi.org/10.5296/npa.v6i2.5461","url":null,"abstract":"Scalable streaming has emerged as a feasible solution to resolve users' heterogeneity problems. SVC is the technology that has served as the definitive impulse for the growth of streaming adaptive systems. Systems seek to improve layer switching efficiency from the network point of view but, with increasing importance, without jeopardizing user perceived video quality, i.e., QoE. We have performed extensive subjective experiments to corroborate the preference towards adaptive systems when compared to traditional non-adaptive systems. The resulting subjective scores are correlated with most relevant Full Reference (FR) objective metrics. We obtain an exponential relationship between human decisions and the same decisions expressed as a difference of objective metrics. A strong correlation with subjective scores validates objective metrics to be used as aid in the adaptive decision taking algorithms to improve overall systems performance. Results show that, among the evaluated objective metrics, PSNR is the metric that provide worse results in terms of reproducing the human decisions.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133708961","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}

引用次数: 11

Evaluation of a Query-Obfuscation Mechanism for the Privacy Protection of User Profiles 用户配置文件隐私保护的查询混淆机制评估

Netw. Protoc. Algorithms Pub Date : 2014-06-30 DOI: 10.5296/npa.v6i2.5395

José Estrada-Jiménez, A. Rodríguez, Javier Parra-Arnau, J. Forné

{"title":"Evaluation of a Query-Obfuscation Mechanism for the Privacy Protection of User Profiles","authors":"José Estrada-Jiménez, A. Rodríguez, Javier Parra-Arnau, J. Forné","doi":"10.5296/npa.v6i2.5395","DOIUrl":"https://doi.org/10.5296/npa.v6i2.5395","url":null,"abstract":"Traces related to our identity are left every day while we browse the Internet. Being the user’s information a very valued asset for most of the companies, user activities on Internet are permanently monitored, and the information obtained from this process is used by big advertising companies. Accurate user profiles are built based on web searches, tags, tweets and even clicks issued by users. Collecting and processing this huge amount of personal data represents a serious risk for the user’s privacy but most of people are not aware of such risk. We describe in this paper a way to measure the effectiveness of a query obfuscation method. Since privacy level of user profiles is only estimated theoretically in some previous work, we firstly create a privacy risk measuring tool in a Firefox add-on which we named PrivMeter. Besides warning the user about his privacy levels, this tool is especially useful to evaluate the obfuscation mechanism offered by another very well-known add-on called TrackMeNot. We find that, for identification attacks, TrackMeNot importantly improved the user’s privacy. However, against more sophisticated attacks, such as classification attacks, the obfuscation mechanism was not successful enough.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120938213","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}

引用次数: 1

Smart Grid ICT Research Lines out of the European Project INTEGRIS 智能电网ICT研究线来自欧洲项目INTEGRIS

Netw. Protoc. Algorithms Pub Date : 2014-06-30 DOI: 10.5296/npa.v6i2.5439

J. Selga, G. Corral, A. Zaballos, R. Pozuelo

{"title":"Smart Grid ICT Research Lines out of the European Project INTEGRIS","authors":"J. Selga, G. Corral, A. Zaballos, R. Pozuelo","doi":"10.5296/npa.v6i2.5439","DOIUrl":"https://doi.org/10.5296/npa.v6i2.5439","url":null,"abstract":"The Smart Grid is at the same time a part of the Internet of Things and an example of a cyber-physical system where the physical power grid is surrounded by many intelligent and communication devices that allow for an enhanced management of the power network itself. The Smart Grid may bring great performance benefits to the society in terms of enabling the massive introduction of renewable energy sources in the power grid, the reduction of carbon emissions and improved sustainability among others. However, it may also bring big computer networking challenges to achieve the needed high reliability and low latency and even risks in terms of cybersecurity since it opens the power system to at least the same threats faced by the Internet. In fact, it is reasonable to think that the vulnerabilities will be still larger, considering the novel, heterogeneous and distributed nature of the Smart Grid. Furthermore, cybersecurity in Smart Grids is essential for the survival and feasibility of this electricity concept, thus making the risks still more relevant. Such ICT systems and computer networks supporting the Smart Grid concept need to be very efficient and to comply with very stringent requirements, at least for some of the services to be provided. They also need to efficiently integrate and manage in a single network a vast array of technologies among which diverse link layer technologies, meshed and non-meshed Ethernet networks, different cybersecurity protocols, networking at different layers, cognitive systems and storage and replication of data. The objective is to provide a system capable of providing adequate service to the wide array of applications foreseen for the Smart Grid but the complexity of the problem is really impressive and it is not possible to focus all of its aspects in a single paper or even project. The present paper presents these requirements, the solutions and results developed and tested in the FP7 European Project INTEGRIS as well as the future challenges and research lines identified as a result of the project and some prospective solutions.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"469 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123268165","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}

引用次数: 10

REST service testing based on inferred XML schemas 基于推断的XML模式的REST服务测试

Netw. Protoc. Algorithms Pub Date : 2014-06-30 DOI: 10.5296/npa.v6i2.5360

Álvaro Navas, P. Capelastegui, Francisco Huertas, Pablo Alonso-Rodriguez, Juan C. Dueñas

引用次数: 2

An eVoting System Based on Ring Signatures 基于环签名的投票系统

Netw. Protoc. Algorithms Pub Date : 2014-06-30 DOI: 10.5296/npa.v6i2.5390

J. Tornos, J. L. Salazar, J. Piles, J. Saldaña, Luis Casadesus, José Ruíz, J. Fernández-Navajas

引用次数: 8

Protection of data in unsecured public cloud environment with open, vulnerable networks using threshold-based secret sharing 使用基于阈值的秘密共享，在开放、易受攻击的网络中保护不安全的公共云环境中的数据

Netw. Protoc. Algorithms Pub Date : 2014-04-30 DOI: 10.5296/npa.v6i1.4862

R. Dutta, B. Annappa

引用次数: 11

Scriptable Sensor Network Applications for Rapid Development of Internet of Things 面向物联网快速发展的可编程传感器网络应用

Netw. Protoc. Algorithms Pub Date : 2014-04-30 DOI: 10.5296/npa.v6i1.4763

Sanat Sarangi, Subrat Kar

引用次数: 3

Spectrum Occupancy Information in Support of Adaptive Spectrum Sensing for Cognitive Radio 支持认知无线电自适应频谱感知的频谱占用信息

Netw. Protoc. Algorithms Pub Date : 2014-04-30 DOI: 10.5296/npa.v6i1.4863

K. Patil, Snehal Barge, K. Skouby, R. Prasad

引用次数: 4

A Degree-first Greedy Search Algorithm for the Evaluation of Structural Controllability of Real World Directed Complex Networks 真实世界有向复杂网络结构可控性评价的一种度优先贪婪搜索算法

Netw. Protoc. Algorithms Pub Date : 2014-04-30 DOI: 10.5296/npa.v6i1.4756

D. Das, Ayan Chatterjee, Nabamita Pal, A. Mukherjee, M. K. Naskar

{"title":"A Degree-first Greedy Search Algorithm for the Evaluation of Structural Controllability of Real World Directed Complex Networks","authors":"D. Das, Ayan Chatterjee, Nabamita Pal, A. Mukherjee, M. K. Naskar","doi":"10.5296/npa.v6i1.4756","DOIUrl":"https://doi.org/10.5296/npa.v6i1.4756","url":null,"abstract":"Ubiquitous data flow through a directed complex network requires the complete structural controllability of the network. For evaluating the structural controllability of any network, determination of maximum matching in the network is a cardinal task and has always been a problem of immense concern. Its solution is mandatory in structural control theory for controlling real world complex networks. The existing classical approach through the Hopcroft-Karp algorithm and other proposed algorithms require the determination of the bipartite equivalent graph (i.e., network), which belongs to the NP-complete class of problems. In this article, we propose a degree-first greedy search algorithm to determine maximum matching in unipartite graphs without determining its bipartite equivalent. Thus this classical problem of the NP-Complete class can be solved using the heuristic, with reduced complexity. This algorithm can be efficiently used to find maximum matching in most of the real world complex networks that follow Erdős-Renyi model. Simulation results obtained using our heuristic reveal that dense and homogenous networks can be controlled with fewer controller nodes popularly termed as driver nodes, compared to the sparse inhomogeneous networks.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130255421","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}

引用次数: 4