2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)最新文献_第6页

Automated offloading of android applications for computation/energy optimizations 自动卸载用于计算/能量优化的android应用程序

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116525

Alessandro Zanni, Se-young Yu, Stefano Secci, R. Langar, P. Bellavista, D. Macedo

引用次数: 8

Distributed mobile devices caching over edge computing wireless networks 在边缘计算无线网络上的分布式移动设备缓存

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116364

Xi Zhang, Qixuan Zhu

{"title":"Distributed mobile devices caching over edge computing wireless networks","authors":"Xi Zhang, Qixuan Zhu","doi":"10.1109/INFCOMW.2017.8116364","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116364","url":null,"abstract":"In edge computing wireless networks, popular data contents can be stored in mobile devices to provide the local data resources services, so that a mobile user can obtain these data contents directly from its nearby mobile devices instead of the remote service provider. Even though each mobile device's caching memory can be limited, caching in mobile devices offers the great potential of caching capability because of the massive mobile devices. In this paper, we focus on a single cellular network where mobile users' requested data contents are cached in nearby peer mobile devices and are served by device-to-device (D2D) communications. We propose the caching in mobile devices schemes through deriving the minimum distance between two actively offloaded mobile user receivers to optimize the D2D throughput while guaranteeing the D2D channel quality. We also quantify the improvements of this offloading supported cellular network in terms of (1) the upper and lower bound of offloading probability, (2) average throughput of offloaded traffic, (3) average content downloading delay, and (4) variance of total number of potential D2D links, which result in more superior network performances than pure cellular networks. Finally, we evaluate and validate the network improvements using our proposed mobile devices caching framework through numerical analyses.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127814945","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}

引用次数: 18

Demo abstract an ultrasonic intra body area network for ehealth applications 摘要演示了一种用于电子健康应用的超声体内网络

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116521

L. Galluccio, Sebastiano Milardo, E. Sciacca

引用次数: 2

Computation offloading considering fronthaul and backhaul in small-cell networks integrated with MEC 集成MEC的小蜂窝网络中考虑前传和回程的计算卸载

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116362

Heli Zhang, Jun Guo, Lichao Yang, Xi Li, Hong Ji

{"title":"Computation offloading considering fronthaul and backhaul in small-cell networks integrated with MEC","authors":"Heli Zhang, Jun Guo, Lichao Yang, Xi Li, Hong Ji","doi":"10.1109/INFCOMW.2017.8116362","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116362","url":null,"abstract":"Mobile edge computing (MEC) provides a promising way to bring enhanced computing capabilities in proximity to user equipments (UEs). Various previous works have been done and they usually focus on how to segment the computation intensive task and how to offload the task to edge of the network with plenty of computation capacity. However, few of them consider integrating MEC with small cell networks (SCNs) which is regarded as the key technology in future 5G networks. In this paper, we study the computation offloading scheme in a multiuser and multi-SC scenario with MEC. We firstly formulate an energy efficient computation offloading problem, which aims to optimize the offloading energy for the tasks while constraining the latency lower than a threshold. In view of the characteristics of SCNs, the fronthaul and backhual links are also taken into account when calculating the task energy and latency. Secondly, we apply artificial fish swarm algorithm (AFSA) to solve the proposed problem in a high efficiency. To guarantee the global optimization, strong robustness and fast convergence of AFSA, fish swarm's three important behaviors such as prey behavior, swarm behavior and following behavior are utilized in our algorithm design. Finally, the simulation has been done and show the superiority of our scheme.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130352145","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}

引用次数: 53

Multiple graph abstractions for parallel routing over virtual topologies 虚拟拓扑上并行路由的多图抽象

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116496

Ahmet Soran, M. Yuksel, M. H. Gunes

引用次数: 2

Fine-grained ultrasound range finding for mobile devices: Sensing way beyond the 24 kHz limit of built-in microphones 用于移动设备的细粒度超声测距:感应方式超过内置麦克风的24 kHz限制

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116486

Yuchi Chen, Wei Gong, Jiangchuan Liu, Yong Cui

{"title":"Fine-grained ultrasound range finding for mobile devices: Sensing way beyond the 24 kHz limit of built-in microphones","authors":"Yuchi Chen, Wei Gong, Jiangchuan Liu, Yong Cui","doi":"10.1109/INFCOMW.2017.8116486","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116486","url":null,"abstract":"Range finding is a core service in many applications for smart homes and cities. Recently studies have been exploring ultrasound-based range finding with commercial-off-the-shelf (COTS) mobile devices. Yet their accuracy is largely bounded by the limited sample rate (typically up to 48 kHz; i.e. only sensitive to sound below 24 kHz) of their built-in microphones and chips. In this paper, we introduce a novel coprime-sampling-based method that can enable current COTS mobile devices to achieve accurate range finding by sensing very-high-frequency (> 24 kHz) ultrasound. We show that, through smart algorithm design, the hardware limit will not be a barrier for COTS devices to derive such useful information as phase shift and power spectral density (PSD) from very-high-frequency ultrasound signals. We discuss how our method can achieve fine-grained range finding, as well as improve other applications such as motion tracking and data transport. Through evaluations of our prototype on the latest Android tablet model, we show that with an ultrasound signal at 42 kHz, our method can achieve fine-grained range finding with a median error of 1.2 mm and a median accuracy of 97.3%.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130729075","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

How flexible is dynamic SDN control plane? 动态SDN控制平面有多灵活?

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116460

Mu He, A. Basta, Andreas Blenk, W. Kellerer

{"title":"How flexible is dynamic SDN control plane?","authors":"Mu He, A. Basta, Andreas Blenk, W. Kellerer","doi":"10.1109/INFCOMW.2017.8116460","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116460","url":null,"abstract":"In Software Defined Networking (SDN), for performance reasons the control plane consists of multiple SDN controllers that provide a logically centralized network control. To react to traffic changes, the control plane may adapt to improve the performance of the whole network. This adaptation includes the migration of controllers, i.e. the change of their placement, as well as the change of switch to controller assignments. We call such adaptive network control a dynamic SDN control plane. Whereas most state of the art focuses on an optimal placement of controllers considering static traffic demands, we draw the attention to the need for a dynamic control plane and the performance of the adaption process itself. The involved controller migration and switch re-assignments significantly affect the control plane performance. Moreover, in this work we evaluate the flexibility of a dynamic SDN control plane with respect to the number of controllers. In particular, we refer to a flexibility metric that takes the time into account that is needed for successful migrations to handle traffic changes. Our evaluations are based on detailed models of controller placement and migration time. The results confirm that the migration time is a critical parameter and reveal that in case only a short migration time is allowed, the number of controllers does not bring more flexibility. For relaxed migration times, a larger number of controllers leads to more flexibility as expected. The results also show that a dynamic adaptation to traffic changes, can provide an improvement of up to 60% over a non-dynamic SDN control plane.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"305 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128445800","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}

引用次数: 16

Bridging the digital divide between research and home networks 弥合研究和家庭网络之间的数字鸿沟

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116417

Caleb Smith-Salzberg, Fraida Fund, S. Panwar

引用次数: 1

Virtualized control plane placement problem: Provisioning the control paths and architectures 虚拟化控制平面布局问题:发放控制路径和架构

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116461

I. Vaishnavi, Wint Yi Poe

{"title":"Virtualized control plane placement problem: Provisioning the control paths and architectures","authors":"I. Vaishnavi, Wint Yi Poe","doi":"10.1109/INFCOMW.2017.8116461","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116461","url":null,"abstract":"A fundamental problem to be resolved to achieve carrier grade functioning of an SDN network is the controller placement problem. The problem has been traditionally limited to optimally assigning switches to static physical controllers and placing those controllers over a network topology. However, virtualized controllers in place of physical ones could largely increase the dynamism in network control. In such a scenario, provisioning the requirements of the controllers themselves as virtual entities is also important. The virtual controllers may be inter-connected to each other via virtual controller-controller links and require additional virtualized support functions such as databases, to form a complete distributed virtual control plane. In this paper, we refer to the virtual control plane as the virtual control graph. This virtual control graph needs to be provisioned in addition to the traditional assignment of switches to controllers. Furthermore, all previous work assumes the control link between the switches and the controllers that control them can be created irrespective of the location of those controllers. This is untrue in a virtualized environment where the virtual control graph would connect to as well as control the very network they are provisioned on, using in band control channels. This switch to controller path must explicitly be provisioned in band and controller placement mechanisms must take into account the requirements of such provisioning algorithm as well. This paper proposes an extensible ILP model which addresses these two problems to enable the provisioning of virtual control graphs while also addressing the traditional requirements of controller placement. We then validate the proposed model with extensive simulations. The evaluation results show that this model can help address our considerations and can be applied to real world virtual controller graph placement scenarios.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127822977","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

Scalable path provision in software defined networks 软件定义网络中可扩展的路径配置

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116412

Long Luo, Hong-Fang Yu, Shouxi Luo

{"title":"Scalable path provision in software defined networks","authors":"Long Luo, Hong-Fang Yu, Shouxi Luo","doi":"10.1109/INFCOMW.2017.8116412","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116412","url":null,"abstract":"The OpenFlow-based SDN is widely studied to better network performance through providing flexible routing paths. However, being designed to configure path hop-by-hop, it faces the scalability issue — both the flow table overhead and path setup delay are unacceptable for large-scale networks. In this paper, we propose PACO, a framework based on Source Routing (SR) to address that problem through quickly pushing path information into packet header at network edges. The straightforward implementation of SR is inefficient as it would incur heavy header overhead (e.g., Sourcey); other approaches would sacrifice path flexibility for efficiency (e.g., DEFO). To leverage SR efficiently while maintaining path flexibility, PACO preloads a small group of pathlets in network and uses them to concatenate each desired path. Efficient algorithms are proposed to preprogram suitable pathlets and encode on-demand paths with minimum header overhead. Our extensive simulations confirm the scalability of PACO as it saves the flow table overhead up to 94% compared with OpenFlow-SDN solutions, and show that PACO outperforms the state-of-art SR-SDN solution by supporting more than 40% paths with negligible header overhead.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129290429","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