2018 IEEE Symposium on Computers and Communications (ISCC)最新文献_第5页

Energy-efficient Offloading Policy for Resource Allocation in Distributed Mobile Edge Computing 分布式移动边缘计算中资源分配的节能卸载策略

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538612

Changdong Wang, Chongwu Dong, Jinghui Qin, Xiaoxing Yang, Wushao Wen

{"title":"Energy-efficient Offloading Policy for Resource Allocation in Distributed Mobile Edge Computing","authors":"Changdong Wang, Chongwu Dong, Jinghui Qin, Xiaoxing Yang, Wushao Wen","doi":"10.1109/ISCC.2018.8538612","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538612","url":null,"abstract":"Mobile edge computing (MEC) is a promising paradigm to integrate computing and communication resources in mobile networks. MEC can improve mobile service quality and enhance Quality of Experience (QoE) by offloading computation tasks to MEC servers. However, a MEC server only can provide limited computational resources for users. In this paper, we consider a mobile edge computing system that provides three offloading policies that are: (i) executing tasks in local device, (ii) offloading tasks to servers in a local region, (iii)offloading tasks to servers in a nearby region. In the policy (iii), mobile user equipment can utilize computational resources of MEC servers in nearby regions to solve the problem of insufficient computational resources in local region servers. We formulate the computation offloading problem as a potential game and propose a Distributed Offloading strategy based on Jacobi algorithm (DOJ) for solving the computation offloading problem in a short period. The simulation results show that our proposed algorithm can reduce overall system costs and guarantee the QoE of users.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123739525","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}

引用次数: 15

Ballistic Skip Graph: A Skip Graph-Style Constant-Degree Structured Overlay 弹道跳跃图:一种跳跃图风格的等度结构叠加

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538706

Yusuke Aoki, M. Ohnishi, Kazuyuki Shudo

引用次数: 2

Optimal Uplink Channel Estimation Algorithm for OFDM Based MmWave Massive MIMO Systems 基于OFDM的毫米波大规模MIMO系统的最优上行信道估计算法

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538581

Moufida Hajjaj, A. Mejri, R. Bouallègue, S. Hasnaoui

引用次数: 2

Multi-User Preemptive Scheduling For Critical Low Latency Communications in 5G Networks 5G关键低时延通信的多用户抢占调度

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538471

Ali A. Esswie, K. Pedersen

{"title":"Multi-User Preemptive Scheduling For Critical Low Latency Communications in 5G Networks","authors":"Ali A. Esswie, K. Pedersen","doi":"10.1109/ISCC.2018.8538471","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538471","url":null,"abstract":"5G new radio is envisioned to support three major service classes: enhanced mobile broadband (eMBB), ultra-reliable low-latency communications (URLLC), and massive machine type communications. Emerging URLLC services require up to one millisecond of communication latency with 99.999% success probability. Though, there is a fundamental trade-off between system spectral efficiency (SE) and achievable latency. This calls for novel scheduling protocols which cross-optimize system performance on user-centric; instead of network-centric basis. In this paper, we develop a joint multi-user preemptive scheduling strategy to simultaneously cross-optimize system SE and URLLC latency. At each scheduling opportunity, available URLLC traffic is always given higher priority. When sporadic URLLC traffic appears during a transmission time interval (TTI), proposed scheduler seeks for fitting the URLLC-eMBB traffic in a multi-user transmission. If the available spatial degrees of freedom are limited within a TTI, the URLLC traffic instantly overwrites part of the ongoing eMBB transmissions to satisfy the URLLC latency requirements, at the expense of minimal eMBB throughput loss. Extensive dynamic system level simulations show that proposed scheduler provides significant performance gain in terms of eMBB SE and URLLC latency.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"176 19","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120885385","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}

引用次数: 34

Improving Feature Point Detection in High Dynamic Range Images 改进高动态范围图像的特征点检测

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538716

W. Melo, Jusley Arley Oliveira de Tavares, Daniel Oliveira Dantas, Beatriz Trinchão Andrade

{"title":"Improving Feature Point Detection in High Dynamic Range Images","authors":"W. Melo, Jusley Arley Oliveira de Tavares, Daniel Oliveira Dantas, Beatriz Trinchão Andrade","doi":"10.1109/ISCC.2018.8538716","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538716","url":null,"abstract":"Feature Point (FP) detection is a fundamental step in computer vision tasks. Although FP detectors are mostly designed to support Low Dynamic Range (LDR) images as input, interest in High Dynamic Range (HDR) images has increased recently due to their higher precision to register overexposed and underexposed areas in an image. As the detection of FPs is strongly dependent on the illumination of the scene, HDR images have the potential to be more robust than LDR images during FP detection. Known FP detectors, however, do not use the full potential of HDR images. In addition, few works have evaluated the performance of HDR images in this context. In this paper, we propose a modification of FP detectors aiming to improve FP detection on HDR images. To this end, we design a local mask based on the Coefficient of Variation (CV) of sets of pixels, creating thus a new step in FP detection. We compare our approach with popular FP detection methods using a standard evaluation metric, Repeatability Rate (RR) of FPs, and also Uniformity as a proposed new criterion. A dataset of images from scenes affected by camera transformations and substantial illumination changes was used as input. Experimental results show that our proposed algorithms give better Uniformity and RR in most HDR images from the dataset when compared to standard FP detectors. Moreover, they indicate that HDR images present a great potential to be explored in applications that rely on FP detection.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123865860","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

Game Theoretic Modeling of Interaction Problems in Datacenter Network Environments 数据中心网络环境中交互问题的博弈论建模

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538591

Jun Gong, J. Liao, Zilu Kang

引用次数: 0

BGCC: a Bloom Filter-based Grouped-Chunk Caching Approach for Information-Centric Networking BGCC:一种基于Bloom过滤器的信息中心网络分组块缓存方法

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538357

Jiang Zhi, Jun Yu Li, Haibo Wu

引用次数: 0

MOMMA: A Flexible Architecture Based on Fog Computing for Mobility Management MOMMA:一种基于雾计算的机动管理灵活架构

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538737

E. P. Valentini, D. Lieira, L. H. Nakamura, L. Villas, R. Meneguette

引用次数: 0

Unfolding the Mutual Relation Between Timeliness and Scalability in Cloud Monitoring 揭示云监控中实时性与可扩展性的相互关系

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538570

Guilherme da Cunha Rodrigues, R. Calheiros, G. Santos, Vinicius Tavares Guimaraes, L. Granville, L. Tarouco, R. Buyya

{"title":"Unfolding the Mutual Relation Between Timeliness and Scalability in Cloud Monitoring","authors":"Guilherme da Cunha Rodrigues, R. Calheiros, G. Santos, Vinicius Tavares Guimaraes, L. Granville, L. Tarouco, R. Buyya","doi":"10.1109/ISCC.2018.8538570","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538570","url":null,"abstract":"Cloud computing is a suitable solution for professionals, companies, and institutions that need to have access to computational resources on demand. Clouds rely on proper management to provide such computational resources with adequate quality of service, which is established by Service Level Agreements (SLAs), to customers. In this context, cloud monitoring is a critical function to achieve such proper management. Cloud monitoring systems have to accomplish requirements to perform its functions properly, and currently, there are plenty of requirements which includes: timeliness, adaptability, comprehensiveness, and scalability. However, such requirements usually have mutual influence, which is positive or negative, among themselves, and it has prevented the development of complete cloud monitoring solutions. This paper presents a mathematical model to predict the mutual influence between timeliness and scalability, which is a step forward in cloud monitoring because it paves the way for the development of complete monitoring solutions. It complements our previous work that identified the monitoring parameters (e.g., frequency sampling, amount of monitoring data) that influence timeliness and scalability. Evaluations present the effectiveness of the mathematical model based on a comparison of the results provided by the mathematical model and the results obtained via simulation.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134314622","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

Slicing of Network Resources in Future Internet Service Providers Based on Daytime 基于白天的未来互联网服务提供商网络资源切片

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538725

R. Gomes, Arthur Urbano, Francisco R. P. da Ponte, L. Bittencourt, E. Madeira

引用次数: 3