2015 IEEE Symposium on Computers and Communication (ISCC)最新文献_第7页

Evaluating a cloud federation ecosystem to reduce carbon footprint by moving computational resources 评估云联盟生态系统，通过移动计算资源来减少碳足迹

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405500

Maurizio Giacobbe, A. Celesti, M. Fazio, M. Villari, A. Puliafito

引用次数: 8

QADC-MORE: A new QoS-aware dynamic credit MORE protocol for wireless mesh networks QADC-MORE:一种新的无线网状网络qos感知动态信用MORE协议

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405625

Mostafa Abdolahi, F. Eshghi, M. Kelarestaghi, M. Mohammadi

引用次数: 3

Contribution aware task allocation in sensor networks 传感器网络中贡献感知任务分配

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405572

Tingting Fu, Peng Liu

引用次数: 7

Selfish attacks in IEEE 802.11aa networks with intra-AC prioritization 具有ac内优先级的IEEE 802.11aa网络中的自私攻击

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405597

Lukasz Prasnal, S. Szott, M. Natkaniec

引用次数: 1

Towards a faster and accurate supertree inference 朝着更快更准确的超树推理

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405643

Diogo Telmo Neves, J. Sobral

{"title":"Towards a faster and accurate supertree inference","authors":"Diogo Telmo Neves, J. Sobral","doi":"10.1109/ISCC.2015.7405643","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405643","url":null,"abstract":"Phylogenetic inference is one of the most challenging and important problems in computational biology. However, computing evolutionary links on data sets containing only few thousands of taxa easily becomes a daunting task. Moreover, recent advances in next-generation sequencing technologies are turning this problem even much harder, either in terms of complexity or scale. Therefore, phylogenetic inference requires new algorithms and methods to handle the unprecedented growth of biological data. In this paper, we identify several types of parallelism that are available while refining a supertree. We also present four improvements that we made to SuperFine - a state-of-the-art supertree (meta)method -, which add support: i) to use FastTree as the inference tool; ii) to use a parallel version of FastTree, or RAxML, as the inference tool; iii) to exploit intra-polytomy parallelism within the so-called polytomy refinement phase; and iv) to exploit, at the same time, inter-polytomy and intra-polytomy parallelism within the polytomy refinement phase. Together, these improvements allow an efficient and transparent exploitation of hybrid-polytomy parallelism. Additionally, we pinpoint how future contributions should enhance the performance of such applications. Our studies show groundbreaking results in terms of the achieved speedups, specially when using biological data sets. Moreover, we show that the new parallel strategy - which exploits the hybrid-polytomy parallelism within the polytomy refinement phase - exhibits good scalability, even in the presence of asymmetric sets of tasks. Furthermore, the achieved results show that the radical improvement in performance does not impair tree accuracy, which is a key issue in phylogenetic inferences.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130044049","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}

引用次数: 3

Internet of Things: Security vulnerabilities and challenges 物联网：安全漏洞和挑战

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405513

Ioannis Andrea, C. Chrysostomou, G. Hadjichristofi

引用次数: 370

A lightweight, non-intrusive approach for orchestrating autonomously-managed network elements 用于编排自主管理的网络元素的轻量级、非侵入性方法

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405537

C. Liaskos

引用次数: 3

Performance of perceptual 1-bit compressed sensing for audio compression 音频压缩中感知1位压缩感知的性能

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405560

Hossam M. Kasem, M. Elsabrouty, O. Muta, H. Furukawa

{"title":"Performance of perceptual 1-bit compressed sensing for audio compression","authors":"Hossam M. Kasem, M. Elsabrouty, O. Muta, H. Furukawa","doi":"10.1109/ISCC.2015.7405560","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405560","url":null,"abstract":"The innovative concept of Compressed Sensing (CS) presents a breakthrough that enables the acquisition of sparse signals at much lower sampling rates compared to the conventional Nyquist rate. The scope of CS is not limited only to sparse signal but it is also applicable to compressible signals, such as multimedia signals including audio signals. Representing the random samples from CS process using finite-precision is a crucial problem in communication systems. In this paper, we focus on 1-bit quantized CS. We propose to take into account the perceptual CS model for audio compression, where the perceptual properties are taken into account. We propose two models, the first applies perceptual effect at the transmitter side. In the other model, a modified Binary Iterative Hard Thresholding (BIHT) is proposed to improve the performance of 1-bit compressed sensing by taking the perceptual properties of the received audio signal into account. The Mean Opinion Score (MOS) is used to compare the perceptual quality of the received signal for the proposed 1-bit perceptual CS algorithms. Simulation results show that a better performance is achieved using the proposed algorithms.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133243118","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}

引用次数: 3

OpenFlow and services in the cloud: Core network demonstrator OpenFlow和云中的服务:核心网演示

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405565

Goncalo Pardal, J. Soares, Rafael Gouveia, S. Sargento

{"title":"OpenFlow and services in the cloud: Core network demonstrator","authors":"Goncalo Pardal, J. Soares, Rafael Gouveia, S. Sargento","doi":"10.1109/ISCC.2015.7405565","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405565","url":null,"abstract":"Considering the growth of customers craving for complex services like IPTV, cloud storage, and online gaming, traditional networking is quickly becoming an obsolete technology. The new networking paradigm, Software Defined Networking (SDN), in combination with the recent communication protocol, OpenFlow, brings a new perspective to the operator and cloud provider's core networks by providing new autonomous tools. This paper proposes and evaluates a new SDN control mechanism that allows the definition of dedicated connectivity service within an operator network, making it possible to easily provide and support cloud services to the end user. It takes advantage of the combination of SDN and Cloud Computing, and further benefits the automation of both technologies, which empowers the operator to provide faster services to its users, such as virtual machine instantiation with automatic network creation. The evaluation of the proposed approach shows that the most time consuming phase is the installation of the OpenFlow rules in the network: in a network of 128 nodes, it takes around 250msec to both install and remove connections.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130535403","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}

引用次数: 0

Cracker: Crumbling large graphs into connected components 裂解:将大图形分解成相互连接的组件

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405576

Alessandro Lulli, L. Ricci, E. Carlini, Patrizio Dazzi, C. Lucchese

引用次数: 26