Xiaoyan Hu, Shaoqi Zheng, Lixia Zhao, Guang Cheng, J. Gong
{"title":"Exploration and Exploitation of Off-path Cached Content in Network Coding Enabled Named Data Networking","authors":"Xiaoyan Hu, Shaoqi Zheng, Lixia Zhao, Guang Cheng, J. Gong","doi":"10.1109/ICNP.2019.8888053","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888053","url":null,"abstract":"Named Data Networking (NDN) intrinsically supports in-network caching and multipath forwarding. The two salient features offer the potential to simultaneously transmit content segments that comprise the requested content from original content publishers and in-network caches. However, due to the complexity of maintaining the reachability information of off-path cached content at the fine-grained packet level of granularity, the multipath forwarding and off-path cached copies are significantly underutilized in NDN so far. Network coding enabled NDN, referred to as NC-NDN, was proposed to effectively utilize multiple on-path routes to transmit content, but off-path cached copies are still unexploited. This work enhances NC-NDN with an On-demand Off-path Cache Exploration based Multipath Forwarding strategy, dubbed as O2CEMF, to take full advantage of the multipath forwarding to efficiently utilize off-path cached content. In O2CEMF, each network node reactively explores the reachability information of nearby off-path cached content when consumers begin to request a generation of content, and maintains the reachability at the coarse-grained generation level of granularity instead. Then the consumers simultaneously retrieve content from the original content publisher(s) and the explored capable off-path caches. Our experimental studies validate that this strategy improves the content delivery performance efficiently as compared to that in the present NC-NDN.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114504447","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}
Hyunjoong Lee, Jung-Jun Kim, Changhee Joo, S. Bahk
{"title":"BeaconRider: Opportunistic Sharing of Beacon Air-Time in Densely Deployed WLANs","authors":"Hyunjoong Lee, Jung-Jun Kim, Changhee Joo, S. Bahk","doi":"10.1109/ICNP.2019.8888044","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888044","url":null,"abstract":"The explosion of mobile traffic volume has led to dense deployment of IEEE 802.11 WLANs. As a consequence, periodic beacon transmissions can overwhelm the air-time, leading to significant air-time depletion for data transmissions. In this work, we develop an opportunistic air-time sharing scheme, named BeaconRider, that facilitates simultaneous data and beacon transmissions aimed at improving spectrum efficiency in dense network environments. The proposed method works for downlink communication and allows access points (APs) to coordinate with each other in a distributed manner to exploit opportunities provided by the capture effect. Our protocol is backward compatible with legacy 802.11 APs. Through experiments with a prototype implementation using off-the-shelf IEEE 802.11n dongles as well as extensive ns-3 simulation, we show that the proposed method achieves substantial performance gains that increase with the number of APs.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114966155","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}
Y. Teranishi, Takashi Kimata, Hiroaki Yamanaka, Eiji Kawai, H. Harai
{"title":"Demo Abstract: LASK: A Distributed Service Discovery Platform on Edge Computing Environments","authors":"Y. Teranishi, Takashi Kimata, Hiroaki Yamanaka, Eiji Kawai, H. Harai","doi":"10.1109/ICNP.2019.8888124","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888124","url":null,"abstract":"We present the LASK protocol and its platform implementation that supports distributed k-Nearest Service Discovery. LASK achieves scalable and locality-aware name-based service discovery and routing for the target nodes avoiding redundant lookup message exchanges across the edge networks.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122085682","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}
{"title":"LoRaBee: Cross-Technology Communication from LoRa to ZigBee via Payload Encoding","authors":"Junyang Shi, Di Mu, M. Sha","doi":"10.1109/ICNP.2019.8888145","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888145","url":null,"abstract":"Low-power wireless mesh networks (LPWMNs) have been widely used in wireless monitoring and control applications. Although LPWMNs work satisfactorily most of the time thanks to decades of research, they are often complex, inelastic to change, and difficult to manage once the networks are deployed. Moreover, the deliveries of control commands, especially those carrying urgent information such as emergency alarms, suffer long delay, since the messages must go through the hop-by-hop transport. Recent studies show that adding low-power wide-area network (LPWAN) radios such as LoRa onto the LPWMN devices (e.g., ZigBee) effectively overcomes the limitation. However, users have shown a marked reluctance to embrace the new heterogeneous communication approach because of the cost of hardware modification. In this paper, we introduce LoRaBee, a novel LoRa to ZigBee cross-technology communication (CTC) approach, which leverages the energy emission in the Sub-1 GHz bands as the carrier to deliver information. Although LoRa and ZigBee adopt distinct modulation techniques, LoRaBee sends information from LoRa to ZigBee by putting specific bytes in the payload of legitimate LoRa packets. The bytes are selected such that the corresponding LoRa chirps can be recognized by the ZigBee devices through sampling the received signal strength (RSS). Experimental results show that our LoRaBee provides reliable CTC communication from LoRa to ZigBee with the throughput of up to 281.61bps in the Sub-1 GHz bands.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124412637","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}
{"title":"Poster Abstract: Physical-layer Cross-Technology Communication with Narrow-Band Decoding","authors":"Lingang Li, Yongrui Chen, Zhijun Li","doi":"10.1109/ICNP.2019.8888132","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888132","url":null,"abstract":"Recent advances on physical-layer Cross-Technology Communication (PHY-CTC) achieve high throughput direct communication across different wireless technologies, by emulating the standard waveform of the receiver. However, this signal emulation method faces the challenges of inherent unreliability due to the imperfect emulation. Therefore, it’s not suitable to achieve PHY-CTC from WiFi to BLE, since a BLE receiver can not tolerate any bit error in preamble checking when receiving a BLE frame. We present NBee, the first WiFi to BLE physical-level CTC. The key insight lies in Narrow-Band Decoding, i.e., 22MHz bandwidth WiFi (802.11b) signal can be correctly decoded at the BLE RF front-end with only 1MHz bandwidth, if the WiFi payload bits are selected by a specific pattern. More specifically, NBee leverages the unique signatures in the WiFi signal distorted by 1MHz Low Pass Filter (LPF) at BLE to extract information. Evaluation results on commodity BLE chips show NBee can achieve 1Mbps CTC with 95% packet reception rate (PRR), 3400x faster than the state-of-art CTC from WiFi to BLE.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125703024","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}
Sepehr Taeb, Nashid Shahriar, S. R. Chowdhury, M. Tornatore, R. Boutaba, J. Mitra, Mahdi Hemmati
{"title":"Virtual Network Embedding with Path-based Latency Guarantees in Elastic Optical Networks","authors":"Sepehr Taeb, Nashid Shahriar, S. R. Chowdhury, M. Tornatore, R. Boutaba, J. Mitra, Mahdi Hemmati","doi":"10.1109/ICNP.2019.8888056","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888056","url":null,"abstract":"Elastic Optical Network (EON) virtualization has recently emerged as an enabling technology for 5G network slicing. A fundamental problem in EON slicing (known as Virtual Network Embedding (VNE)) is how to efficiently map a virtual network (VN) on a substrate EON characterized by elastic transponders and flexible grid. Since a number of 5G services will have strict latency requirements, the VNE problem in EONs must be solved while guaranteeing latency targets. In existing literature, latency has always been modeled as a constraint applied on the virtual links of the VN. In contrast, we argue in favor of an alternate modeling that constrains the latency of virtual paths. Constraining latency over virtual paths (vs. over virtual links) poses additional modeling and algorithmic challenges to the VNE problem, but allows us to capture end-to-end service requirements. In this paper, we first model latency in an EON by identifying the different factors that contribute to it. We formulate the VNE problem with latency guarantees as an Integer Linear Program (ILP) and propose a heuristic solution that can scale to large problem instances. We evaluated our proposed solutions using real network topologies and realistic transmission configurations under different scenarios and observed that, for a given VN request, latency constraints can be guaranteed by accepting a modest increase in network resource utilization. Latency constraints instead showed a higher impact on VN blocking ratio in dynamic scenarios.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129134085","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}
{"title":"Demo: Measuring Distance Traveled by an Object using WiFi-CSI and IMU Fusion","authors":"Raghav H. Venkatnarayan, Muhammad Shahzad","doi":"10.1109/ICNP.2019.8888086","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888086","url":null,"abstract":"Accurately measuring the distance traveled by an object or odometry, in indoor environments is important in many applications such as video-game controller tracking or robot route guidance. While the distance traveled by an object can be simply measured using an accelerometer, it is wellknown that distances measured with accelerometers suffer from large drift errors. In this paper, we demonstrate WIO, a WiFiassisted Inertial Odometry technique that uses WiFi signals as an auxiliary source of information to correct such drift errors. The key intuition behind WIO is that, among multiple paths of a transmitted WiFi signal that arrive at a moving object equipped with a WiFi receiver, WIO can isolate the path that is most parallel to the object’s direction of motion and use the change in the length of that path as an estimate of the traversed distance. WIO then fuses this distance estimate with the distance measured from an accelerometer on-board the object to correct drift errors. We implement WIO using commodity devices, and evaluate it on a robot car. Our results demonstrate an average error of just 4.37% in estimating the distance traversed by the car.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130200466","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}
{"title":"Towards Service Discovery and Invocation in Data-Centric Edge Networks","authors":"Spyridon Mastorakis, Abderrahmen Mtibaa","doi":"10.1109/ICNP.2019.8888081","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888081","url":null,"abstract":"The efforts exploring Named Data Networking (NDN) have mainly focused on addressing the lack of scalable data distribution by today’s Internet. In this paper, we argue that NDN offers a richer environment for edge computing applications. We consider a scenario, where applications need to discover the services running in the edge network. We demonstrate the design and implementation of a distributed service discovery mechanism over NDN through an example use-case of a mobile application for vision impairment patient. The paper discusses three main edge computing challenges, namely service discovery, service invocation, and user mobility management, to highlight NDN’s architectural advantages for edge computing systems. Experimental results show that our framework design can effectively utilize the available resources at the network edge, being able to satisfy 95-98% of mobile users’ service requests.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126659235","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}
{"title":"On Verification of Remote Computing on Potentially Untrusted Nodes","authors":"H. Masuda, Kentaro Kita, Y. Koizumi, T. Hasegawa","doi":"10.1109/ICNP.2019.8888063","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888063","url":null,"abstract":"Verifying remote computing environments, such as computing nodes in fog and edge computing, has gained considerable attention. This poster extends an existing remote attestation method so that it can verify that obtained results are generated by trusted computing nodes as well as remote computing nodes are trusted.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121204012","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}
{"title":"Re-designing Compact-structure based Forwarding for Programmable Networks","authors":"Shouqian Shi, Chen Qian, Minmei Wang","doi":"10.1109/ICNP.2019.8888050","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888050","url":null,"abstract":"Forwarding packets based on networking names is essential for network protocols on different layers, where the ‘names’ could be addresses, packet/flow IDs, and content IDs. For long there have been efforts using dynamic and compact data structures for fast and memory-efficient forwarding. In this work, we identify that the recently developed programmable network paradigm has the potential to further reduce the time/memory complexity of forwarding structures by separating the data plane and control plane. This work presents the new designs of network forwarding structures under the programmable network paradigm, applying three typical dynamic and compact data structures: Bloom filters, Cuckoo hashing, and Othello hashing. We conduct careful analyses and experiments in real networks of these forwarding methods for multiple performance metrics, including lookup throughput, memory footprint, construction time, dynamic updates, and lookup errors. The results give rich insights on designing forwarding algorithms with dynamic and compact data structures. In particular, the new designs based on Cuckoo hashing and Othello hashing show significant advantages over the extensively studied Bloom filter based methods, in all situations discussed in this paper.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"463 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122495528","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}