发布求助
文献互助 智能选刊 最新文献

2019 International Conference on Computing, Networking and Communications (ICNC)最新文献

筛选
英文 中文
Markov Chain Analysis for Compressed Sensing based Random Access in Cellular Systems 基于压缩感知的蜂窝系统随机接入马尔可夫链分析
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-18 DOI: 10.1109/ICCNC.2019.8685521
Sangjun Park, Seunghyung Lee, Wan Choi
{"title":"Markov Chain Analysis for Compressed Sensing based Random Access in Cellular Systems","authors":"Sangjun Park, Seunghyung Lee, Wan Choi","doi":"10.1109/ICCNC.2019.8685521","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685521","url":null,"abstract":"In large scale cellular systems, it is needed to simultaneously support a massive number of users with low latency. However, in conventional cellular systems, random access performance is severely degraded as the number of users increases due to frequent collisions. Recently, compressed sensing based random access is touted as a good solution to improve random access performance of cellular systems. To investigate latency performance of compressed based random access in cellular systems, we model the random access process by a Markov chain, and derive successful access probability of users and expected access latency based on steady state analysis.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125606367","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
Adaptive Resource Provisioning based on Application State 基于应用状态的自适应资源发放
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-18 DOI: 10.1109/ICCNC.2019.8685605
Constantine Ayimba, P. Casari, V. Mancuso
{"title":"Adaptive Resource Provisioning based on Application State","authors":"Constantine Ayimba, P. Casari, V. Mancuso","doi":"10.1109/ICCNC.2019.8685605","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685605","url":null,"abstract":"Infrastructure providers employing Virtual Network Functions (VNFs) in a cloud computing context need to find a balance between optimal resource utilization and adherence to agreed Service Level Agreements (SLAs). Tenants should be allocated as much computing, storage and network capacity as they need in order not to violate SLAs, but not more so that the infrastructure provider can accommodate more tenants to increase revenue. This paper presents an optimizer VNF that ensures that a given virtual machine (VM) is sufficiently utilized before directing traffic to another VM, and an orchestrator VNF that scales the number of VMs up or down as needed when workloads change, thereby limiting the number of active VMs to a minimum that can deliver the service. We setup a testbed to transcode and stream Video on Demand (VoD) as a service. We present experimental results which show that when the optimizer and orchestrator are used together they outperform static provisioning in terms of both resource utilization and service response times.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"243 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124242843","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}
引用次数: 2
A Comprehensive Study of Low Frequency and High Frequency Channel Correlation 低频与高频信道相关的综合研究
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-18 DOI: 10.1109/ICCNC.2019.8685565
Pablo Jiménez Mateo, Alejandro Blanco Pizarro, Norbert Ludant, M. M. Borelli, A. García-García, Adrian Loch, Zhenyu Shi, Yi Wang, J. Widmer
{"title":"A Comprehensive Study of Low Frequency and High Frequency Channel Correlation","authors":"Pablo Jiménez Mateo, Alejandro Blanco Pizarro, Norbert Ludant, M. M. Borelli, A. García-García, Adrian Loch, Zhenyu Shi, Yi Wang, J. Widmer","doi":"10.1109/ICCNC.2019.8685565","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685565","url":null,"abstract":"To meet the increasing throughput demand due to the proliferation of data-hungry services and applications, 5G technologies are adopting innovative solutions, such as using high frequency (HF) bands from 20 to 300GHz. While these bands provide more bandwidth and thus higher data rates, this comes at the price of higher propagation and penetration losses, making reliable communication more challenging in some scenarios. The characteristics of low frequency (LF) and HF bands are complementary, and multiband systems that combine the advantages of both types of bands are highly promising. In such a case, estimating the channel of one band given an prior channel measurement of the other band helps to reduce channel measurement overhead, provided the bands are correlated. In this work, we present a detailed study of the correlation between HF and LF bands. The existence of this correlation makes possible to reduce the overhead of expensive operations such as millimeter-wave beam steering to one third of its original time with an average loss rate SNR of less than 3dB.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125750159","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
A Graded Approach to Network Forensics with Privacy Concerns 网络取证与隐私问题的分级方法
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685654
William Brockelsby, R. Dutta
{"title":"A Graded Approach to Network Forensics with Privacy Concerns","authors":"William Brockelsby, R. Dutta","doi":"10.1109/ICCNC.2019.8685654","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685654","url":null,"abstract":"Anomaly detection in recent or historic traffic traces is a typical approach in applying network forensics to analyze previous security incidents in networks, as well as for real-time network monitoring for detecting intrusions or other security incidents without known signatures. However, even in the aftermath of a security incident, privacy expectations of legitimate users remain a primary concern. In this paper, we describe our findings regarding the preference of network administrators for releasing data. We then go on to describe a methodology that balances the motivations of preserving maximum privacy for legitimate users and obtaining maximum possible information regarding potentially anomalous behavior. Our methodology is based on a graded approach to progressing from highly anonymized data to further disclosure for targeted traffic streams. In particular, we show that it is possible to obtain significant progress from highly aggregated data that is typically considered essentially valueless for the purpose of anomaly detection. We present the result of these first steps as executed on a real enterprise network, showing how the graded approach can work in practice.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126926085","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}
引用次数: 7
An LSTM Enabled Dynamic Stackelberg Game Theoretic Method for Resource Allocation in the Cloud 基于LSTM的云资源分配动态Stackelberg博弈论方法
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685670
Yongxin Liu, L. Njilla, Jian Wang, Houbing Song
{"title":"An LSTM Enabled Dynamic Stackelberg Game Theoretic Method for Resource Allocation in the Cloud","authors":"Yongxin Liu, L. Njilla, Jian Wang, Houbing Song","doi":"10.1109/ICCNC.2019.8685670","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685670","url":null,"abstract":"Resource allocation is essential in cloud computing because it affects the performance, functionality, and development of cloud services. Resource allocation in the cloud based on economic and pricing approaches has the potential to increase the infrastructure suppliers’ revenue and improve the service providers’ efficiency and quality of services. However, in practice, information may be imperfect, and resulting resource allocation is not fair. Therefore, there is a need for a more appropriate model which could leverage imperfect information. In this paper, we propose an imperfect information based game theoretic method for resource allocation in the cloud. In this method, both an information control strategy and an LSTM model are used to predict the market status and to optimize bidding strategy for achieving maximal profits while maintaining fairness and profits for tenants with huge demands. The simulation results demonstrate the feasibility of the simulation framework as well as the effectiveness of the proposed method.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122736974","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}
引用次数: 7
Virtual Edge Computing Using Vehicular Micro Clouds 使用车载微云的虚拟边缘计算
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685481
F. Dressler, Gurjashan Singh Pannu, Florian Hagenauer, M. Gerla, Takamasa Higuchi, O. Altintas
{"title":"Virtual Edge Computing Using Vehicular Micro Clouds","authors":"F. Dressler, Gurjashan Singh Pannu, Florian Hagenauer, M. Gerla, Takamasa Higuchi, O. Altintas","doi":"10.1109/ICCNC.2019.8685481","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685481","url":null,"abstract":"We will discuss the challenges and opportunities of the connected cars vision in relation to the need for distributed data management solutions ranging from the vehicle to the mobile edge and to the data centers. As a novel concept, vehicular micro clouds have been proposed that bridge the gap between fully distributed vehicular networks based on short range vehicle to vehicle communication and cellular based infrastructure for centralized solutions. We will discuss the need for vehicular micro clouds, followed by the architecture, formation of micro clouds, and feasibility of micro clouds. Furthermore, we will cover aspects of efficient data upload and download between cars and a data center facilitated by our micro cloud concept.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122036427","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}
引用次数: 28
Video Streaming over the LWA Systems LWA系统上的视频流
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685626
Jounsup Park
{"title":"Video Streaming over the LWA Systems","authors":"Jounsup Park","doi":"10.1109/ICCNC.2019.8685626","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685626","url":null,"abstract":"In this paper, a quality-driven packet scheduling algorithm for DASH streaming is proposed for the LTE Wi-Fi Aggregation (LWA) systems. The playback buffer status on the receiver side and the network conditions for LTE and Wi-Fi are used to effectively control the video rate. To estimate the network conditions, the distributions of the packet inter-arrival times of both paths are used. The playback buffer is modeled to find the probability of the successful arrival of the assigned video packets before the playback buffer depletes. A convex optimization method is used to find the optimal packet distribution for the LTE and Wi-Fi. Simulation results based on NS-3 show that the proposed algorithm can stream the video with the best quality in terms of the utility while having less probability than other methods of re-buffering while the video is playing.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129707099","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
Age Minimization of Multiple Flows using Reinforcement Learning 使用强化学习的多流年龄最小化
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685524
Hasan Burhan Beytur, E. Uysal-Biyikoglu
{"title":"Age Minimization of Multiple Flows using Reinforcement Learning","authors":"Hasan Burhan Beytur, E. Uysal-Biyikoglu","doi":"10.1109/ICCNC.2019.8685524","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685524","url":null,"abstract":"Age of Information (AoI) is a recently proposed performance metric measuring the freshness of data at the receiving side of a flow. This metric is particularly suited to status-update type information flows, like those occurring in machine-type communication (MTC), remote monitoring and similar applications. In this paper, we consider the problem of AoI-optimal scheduling of multiple flows served by a single server. The performance of scheduling algorithms proposed in previous literature has been shown under limited assumptions, due to the analytical intractability of the problem. The goal of this paper is to apply reinforcement learning methods to achieve scheduling decisions that are resilient to network conditions and packet arrival processes. Specifically, Policy Gradients and Deep Q-Learning methods are employed. These can adapt to the network without a priori knowledge of its parameters. We study the resulting performance relative to a benchmark, the MAF algorithm, which is known to be optimal under certain conditions.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128376923","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}
引用次数: 28
Construction of Time-Space Radio Environment Database using HMM for Cooperative Sensing 基于HMM的协同感知时空无线电环境数据库构建
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685548
Yuya Aoki, T. Fujii
{"title":"Construction of Time-Space Radio Environment Database using HMM for Cooperative Sensing","authors":"Yuya Aoki, T. Fujii","doi":"10.1109/ICCNC.2019.8685548","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685548","url":null,"abstract":"In recent years, many researchers focus on a measurement-based radio environment database (RED) that utilizes the actual received signal power obtained by spectrum sensing as an enabler for an efficient frequency sharing. In this paper, in an environment where multiple transmitters are switched ON/OFF, each sensor is distributed in the environment by cooperative sensing and acquires time series data. Moreover, each sensor learns using the Hidden Markov Model (HMM) on the acquired time series data, thereby estimating the parameter of the receivable transmitter. After collecting estimation results by HMM in each sensor, we propose to use sensor selection for estimation of time parameters (channel occupancy rate, average ON/OFF interval) and multiple imputation for estimation of spatial parameters (pathloss exponent, transmit power). By the proposed method, it is possible to construct a highly accurate time–space RED. The simulation results confirm the effectiveness of the proposed method.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129458236","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
Minimum Latency Aggregation Scheduling in Internet of Things 物联网中的最小时延聚合调度
2019 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2019-02-01 DOI: 10.1109/ICCNC.2019.8685660
Min Kyung An, Hyuk Cho, Bing Zhou, Lei Chen
{"title":"Minimum Latency Aggregation Scheduling in Internet of Things","authors":"Min Kyung An, Hyuk Cho, Bing Zhou, Lei Chen","doi":"10.1109/ICCNC.2019.8685660","DOIUrl":"https://doi.org/10.1109/ICCNC.2019.8685660","url":null,"abstract":"The Minimum Latency Aggregation Scheduling (MLAS) problem in Wireless Sensor Networks (WSNs) targets to attain aggregation schedules that satisfy the two desirable properties: minimum latency and no collisions. Researchers adapt the conventional homogeneous and heterogeneous WSNs to address the MLAS problem in Internet of Things (IoTs) as WSN technology is an essential component of an IoT. However, usual WSNs assume devices to use one single protocol, while some IoTs require heterogeneous devices to use different protocols. Therefore, calling a WSN an IoT is a misnomer and accordingly existing approaches may not properly realize broader IoT environments. In this paper, we clarify the distinction between WSNs and IoTs in terms of types of devices and protocols. Then, we provide a constant-factor approximation algorithm that can fully address the MLAS problem in IoTs. To the best of our knowledge, it is the first constant factor algorithm that addresses the NP-hard problem.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123333017","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
首页 上一页 下一页 尾页
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学术官方微信