2021 IEEE Symposium on Computers and Communications (ISCC)最新文献

筛选
英文 中文
A Shared Memory Approach for Function Chaining in Serverless Platforms 无服务器平台中函数链的共享内存方法
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631385
Andrea Sabbioni, Lorenzo Rosa, Armir Bujari, L. Foschini, Antonio Corradi
{"title":"A Shared Memory Approach for Function Chaining in Serverless Platforms","authors":"Andrea Sabbioni, Lorenzo Rosa, Armir Bujari, L. Foschini, Antonio Corradi","doi":"10.1109/ISCC53001.2021.9631385","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631385","url":null,"abstract":"Serverless platforms are increasingly gaining importance in the cloud computing landscape due to their benefit of shortening the time to market of solutions and capability of automatic, fast, fine-grained scaling of resources. In this context, function chaining represents an appealing feature, allowing the composition of two or more functions to create a complex computation from simpler units while incentivizing modularity and reusability of functions. In this paper, we propose a portable and transparent, container-based serverless architecture that introduces an innovative infrastructural support, enabling an efficient composition of functions co-located on the same host. The proposal relies on a shared-memory approach and a message-oriented middleware serving as a communication medium among components. The experimental assessment shows the approach comes with the benefit of optimized resource usage and performance benefits measured in terms of request completion rate and a decrease in response latency.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130421927","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}
引用次数: 5
Intelligent Network Service Embedding using Genetic Algorithms 基于遗传算法的智能网络服务嵌入
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631456
Panteleimon Rodis, Panagiotis Papadimitriou
{"title":"Intelligent Network Service Embedding using Genetic Algorithms","authors":"Panteleimon Rodis, Panagiotis Papadimitriou","doi":"10.1109/ISCC53001.2021.9631456","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631456","url":null,"abstract":"Network Function Virtualization (NFV) opens us great opportunities for network processing with higher resource efficiency and flexibility. Nevertheless, intelligent orchestration mechanisms are required, such that NFV can exploit its potential and fill up to its promise. In this respect, we investigate the potential gains of embracing Artificial Intelligence (AI) for the virtual network function (VNF) placement problem. To this end, we design and evaluate a genetic algorithm, which seeks efficient embeddings with runtimes on par with heuristic methods. Our proposed embedding method exhibits innovations in terms of network representation and algorithm design, thereby, deviating from typical genetic algorithms. Compared to a heuristic, the proposed genetic algorithm yields higher request acceptance rates, stemming from more efficient resource utilization. We further study a range of factors and parameters that affect the efficiency of the genetic algorithm.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128819066","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}
引用次数: 6
A Cross-Layered Readahead Architecture for Multi-Tiered Storage Systems 面向多层存储系统的跨层预读结构
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631462
Hsung-Pin Chang, Wei-Ming Su, Da-Wei Chang
{"title":"A Cross-Layered Readahead Architecture for Multi-Tiered Storage Systems","authors":"Hsung-Pin Chang, Wei-Ming Su, Da-Wei Chang","doi":"10.1109/ISCC53001.2021.9631462","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631462","url":null,"abstract":"Recent researches have proposed multi-tiered storage systems that extend the storage hierarchy by using solid-state drives (SSDs) to cache data from the hard disk drives (HDDs). However, the current Linux readahead architecture fails to fully support the multi-tiered storage systems. To address this issue, we propose a new Linux readahead architecture. To make prefetching decisions, the framework analyzes not only the degree of data access sequentiality, but also the performance model of the destined storage device and the access regularities of the I/O workload on the corresponding storage device.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125601582","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
MobiWEB: Mobility-Aware Energy Balancing for P2P Wireless Power Transfer 基于移动感知的P2P无线电力传输能量平衡
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631530
Tamoghna Ojha, Theofanis P. Raptis, M. Conti, A. Passarella
{"title":"MobiWEB: Mobility-Aware Energy Balancing for P2P Wireless Power Transfer","authors":"Tamoghna Ojha, Theofanis P. Raptis, M. Conti, A. Passarella","doi":"10.1109/ISCC53001.2021.9631530","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631530","url":null,"abstract":"Peer-to-peer wireless power transfer (P2P-WPT) enables portable devices to mutually exchange energy. In opportunistic mobile networks, P2P-WPT can be uncertain due to the varying user inter-meeting duration. Existing P2P-WPT methods (unrealistically) assume the users to be exchanging energy at each opportunity, to be able to interact with all users, or the inter-node meeting duration to be unaffected by users' mobility. In this paper, in contrast to the state-of-the-art, not only we constitute more fine-grained, realistic assumptions for P2P-WPT, but also we design MobiWeb, a mobility-aware energy balancing method, which employs (for the first time) a predictor for estimating the mobility information of users. MobiWEB selects the different pairs of peers for energy exchange, such that the network energy distribution is balanced while minimizing the loss and energy difference between the peers. MobiWEB, when compared to the state-of-the-art, achieves different performance trade-offs between energy balance quality, convergence time, and energy-efficiency.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123363171","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
OverlapShard: Overlap-based Sharding Mechanism OverlapShard:基于重叠的分片机制
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631476
Yanan Liu, Huiping Sun, Xu Song, Zhong Chen
{"title":"OverlapShard: Overlap-based Sharding Mechanism","authors":"Yanan Liu, Huiping Sun, Xu Song, Zhong Chen","doi":"10.1109/ISCC53001.2021.9631476","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631476","url":null,"abstract":"The sharding-based protocols provide an effective solution on scaling decentralized blockchains. However, the performance of a sharding-based blockchain protocol can be greatly degraded by the existence of cross-shard transactions. This paper proposes an overlap-based sharding mechanism for sharding protocols, OverlapShard, to weaken the adverse impact of cross-shard transactions by mapping each node into multiple actual shards. The virtual shards composed of overlapping nodes can be used to process cross-shard transactions. The results of empirical analysis show that when a transaction contains 2 inputs and 2 outputs, the consensus overheads of OverlapShard account for 25% of that of the nonoverlapping mechanism, and OverlapShard's communication overheads are reduced by about 33.3 %. The evaluation results show that the average communication overhead of OverlapShard is reduced by 63.30%. And the average cross-shard transaction ratio of overlap-based sharding model with 3-layer virtual shard structure is 43.76% lower than that of the non-overlapping sharding model.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126253807","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
Multidimensional Design and Analysis of a Data Mart Related to Healthcare Treatments with Biologic Drugs 生物药物医疗保健治疗相关数据集市的多维设计与分析
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631489
Matilde Tanaglia, Valentina Ientile, L. L'Abbate, Carlo Combi, S. Scondotto, G. Trifirò
{"title":"Multidimensional Design and Analysis of a Data Mart Related to Healthcare Treatments with Biologic Drugs","authors":"Matilde Tanaglia, Valentina Ientile, L. L'Abbate, Carlo Combi, S. Scondotto, G. Trifirò","doi":"10.1109/ISCC53001.2021.9631489","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631489","url":null,"abstract":"Biologic drugs have revolutionized the treatments in many therapeutic areas and their pre and post-marketing evaluation is crucial for investigating their benefit-risk profile. The VALORE project is an AIFA (Italian Medicines Agency)-funded research project aiming at establishing a multi-regional network for the integrated analysis of healthcare and clinical data from different sources. Here we deal with the design and implementation of a data mart supporting the multidimensional data analysis. We also discuss the design of a portable architecture, making each regional center autonomous with respect to the required analysis. It is a first step in the direction of providing all the regional centers and AIFA with a common tool for the analysis and monitoring of marketed biologic drugs.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121325375","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
Join-Me: A Framework for integrating Service Providers and Mobile Network Operators 加入我:整合服务供应商和流动网络营办商的架构
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631393
Alexandre Martins G. De Deus, E. P. Julio, M. Moreno
{"title":"Join-Me: A Framework for integrating Service Providers and Mobile Network Operators","authors":"Alexandre Martins G. De Deus, E. P. Julio, M. Moreno","doi":"10.1109/ISCC53001.2021.9631393","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631393","url":null,"abstract":"With mobile networks becoming one of the main means of accessing the Internet, Service Providers (SPs) and Mobile Network Operators (MNOs) have been investing considerable effort on service delivery mechanisms to improve end users' Quality of Experience (QoE). However, despite some advances, a lack of integration between SPs and MNOs is noticeable, which otherwise would allow for on-demand use of core and edge resources resulting in greater impact on users' QoE. This work presents Join-Me, a framework that allows SPs to transfer service modules into MNOs' infrastructure. Join-Me provides MNOs with the needed components to autonomously manage SPs' service modules, protecting mobile users' privacy and dynamically allocating the appropriate resources. Besides a framework that can be adapted to MNOs' deployed technologies, Join-Me provides SPs with an API for parameterizing the resource options to be used by their modules. An interactive UHD telemedicine service is evaluated as a proof of concept.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126313794","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
UTANSA: Static Approach for Multi-Language Malicious Web Scripts Detection UTANSA:多语言恶意Web脚本检测的静态方法
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631400
Wei-qing Huang, Chenggang Jia, Min Yu, Gang Li, Chao Liu, Jianguo Jiang
{"title":"UTANSA: Static Approach for Multi-Language Malicious Web Scripts Detection","authors":"Wei-qing Huang, Chenggang Jia, Min Yu, Gang Li, Chao Liu, Jianguo Jiang","doi":"10.1109/ISCC53001.2021.9631400","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631400","url":null,"abstract":"In order to detect malicious web scripts automatically, many detection methods using static features and machine learning are proposed. However, the existing detection methods can only detect web scripts of specific programming languages. This paper proposes the unified text features and abstract syntax tree(AST) node sequence features algorithm(UTANSA) that exploits the text feature classification method and AST node classification method, together with the corresponding unified method to enhance the generalization ability of the model. Through the algorithm, two unified approaches are proposed based on text features and AST node features respectively, so that the detection model can detect multi-language web scripts. We choose scripts written in the JavaScript(JS) and PHP languages for experimentation to evaluate our approach. The results show that the detection model trained with the proposed method has a similar detection effect as trained with only JS samples or PHP samples.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114181095","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
ODM-RPL: Optimized Dual MOP RPL ODM-RPL:优化的双MOP RPL
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631422
Mohamed redha Bouakouk, A. Abdelli, L. Mokdad
{"title":"ODM-RPL: Optimized Dual MOP RPL","authors":"Mohamed redha Bouakouk, A. Abdelli, L. Mokdad","doi":"10.1109/ISCC53001.2021.9631422","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631422","url":null,"abstract":"Nowadays, small objects endowed with a communication device are collaborating to execute specific tasks. Due to their large number and limited capabilities, they are being supported by Low Power and Lossy Networks (LLNs). LLNs are often used in data collection oriented applications in which nodes collect data and forward it to a border router using the RPL protocol. RPL is a standard routing protocol which has been especially designed for LLNS. To introduce more interoperability and flexibility in RPL, DUAL-MOP RPL has been designed, thus enabling nodes having different Modes Of Operations (MOPs) to function in the same network. However, to solve the long source header problem, in DUAL-MOP RPL, a large number of source routing operations are being executed which conducts to a high processing load. To tackle this issue, we introduce in this paper an extension of DUAL-MOP RPL called ODM-RPL that proposes a trade-off between the source routing header length and the storing nodes' processing load by first optimizing the source routing header and introducing a concept of preferred source routing header maximum length. The simulations results show the effectiveness of our solution in terms of performances.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131565974","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
Big Data Pipelines on the Computing Continuum: Ecosystem and Use Cases Overview 计算连续体上的大数据管道:生态系统和用例概述
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631410
D. Roman, Nikolay Nikolov, A. Soylu, B. Elvesæter, Hui Song, R.-C. Prodan, Dragi Kimovski, Andrea Marrella, F. Leotta, M. Matskin, Giannis Ledakis, K. Theodosiou, Anthony Simonet-Boulogne, F. Perales, E. Kharlamov, Alexandre Ulisses, Arnor Solberg, Raffaele Ceccarelli
{"title":"Big Data Pipelines on the Computing Continuum: Ecosystem and Use Cases Overview","authors":"D. Roman, Nikolay Nikolov, A. Soylu, B. Elvesæter, Hui Song, R.-C. Prodan, Dragi Kimovski, Andrea Marrella, F. Leotta, M. Matskin, Giannis Ledakis, K. Theodosiou, Anthony Simonet-Boulogne, F. Perales, E. Kharlamov, Alexandre Ulisses, Arnor Solberg, Raffaele Ceccarelli","doi":"10.1109/ISCC53001.2021.9631410","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631410","url":null,"abstract":"Organisations possess and continuously generate huge amounts of static and stream data, especially with the proliferation of Internet of Things technologies. Collected but unused data, i.e., Dark Data, mean loss in value creation potential. In this respect, the concept of Computing Continuum extends the traditional more centralised Cloud Computing paradigm with Fog and Edge Computing in order to ensure low latency pre-processing and filtering close to the data sources. However, there are still major challenges to be addressed, in particular related to management of various phases of Big Data processing on the Computing Continuum. In this paper, we set forth an ecosystem for Big Data pipelines in the Computing Continuum and introduce five relevant real-life example use cases in the context of the proposed ecosystem.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"174 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114090590","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}
引用次数: 6
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信