2018 IEEE 26th International Conference on Network Protocols (ICNP)最新文献

Canon: Exploiting Channel Diversity for Reliable Parallel Decoding in Backscatter Communication 经典:在反向散射通信中利用信道分集实现可靠的并行解码

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-09-01 DOI: 10.1109/ICNP.2018.00051

Chengkun Jiang, Yuan He, Meng Jin, Xiaolong Zheng, Junchen Guo

{"title":"Canon: Exploiting Channel Diversity for Reliable Parallel Decoding in Backscatter Communication","authors":"Chengkun Jiang, Yuan He, Meng Jin, Xiaolong Zheng, Junchen Guo","doi":"10.1109/ICNP.2018.00051","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00051","url":null,"abstract":"Backscatter communication, due to its low energy consumption, attract a broad range of applications. The throughput of such low-power communication is however limited. Parallel backscatter is deemed as a promising technique for improving the overall throughput by enabling concurrent transmissions of the backscattering tags. The state-of-the-art approaches for parallel backscatter assume that all the states of the collided signals are distinguishable in the In-phase and Quadrature (IQ) signal plane. In this paper, we disclose the superclustering phenomenon that makes the assumption untenable and significantly degrades the overall performance. Moreover, we observe that the indistinguishable states at different channels are not the same due to the intrinsic channel diversity. Motivated by the observation, we propose Canon, an approach that exploits the channel diversity of the backscatter tags for reliable parallel decoding. In Canon, we address two critical challenges: (i) designing the Multi-Carrier Backscatter (MCB) module to extract the collided signals simultaneously from multiple channels, (ii) designing the Multi-Channel Cluster Union (MCCU) algorithm to distinguish each state of the collided signals. The experiments demonstrate that Canon can achieve over 10 times higher throughput than the state-of-the-art approaches.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116518473","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

Hardware-Accelerated Firewall for 5G Mobile Networks 5G移动网络硬件加速防火墙

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-09-01 DOI: 10.1109/ICNP.2018.00066

Ruben Ricart-Sanchez, P. Malagón, J. A. Calero, Qi Wang

引用次数: 18

Stabilizing Chaotic Behavior of RED RED混沌行为的稳定

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-09-01 DOI: 10.1109/ICNP.2018.00033

Guillem Duran, J. Cuadra, José María Amigó García, Angel Gimenez Pastor, O. Bonastre

引用次数: 5

Network Coding for Critical Infrastructure Networks 关键基础设施网络的网络编码

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-09-01 DOI: 10.1109/ICNP.2018.00061

Rakesh Kumar, Vignesh Babu, D. Nicol

引用次数: 6

Rate of Convergence of Increasing Path-Vector Routing Protocols 递增路径矢量路由协议的收敛速度

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-09-01 DOI: 10.1109/ICNP.2018.00049

M. Daggitt, T. Griffin

{"title":"Rate of Convergence of Increasing Path-Vector Routing Protocols","authors":"M. Daggitt, T. Griffin","doi":"10.1109/ICNP.2018.00049","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00049","url":null,"abstract":"A good measure of the rate of convergence of path-vector protocols is the number of synchronous iterations required for convergence in the worst case. From an algebraic perspective, the rate of convergence depends on the expressive power of the routing algebra associated with the protocol. For example in a network of n nodes, shortest-path protocols are guaranteed to converge in O(n) iterations. In contrast the algebra underlying the Border Gateway Protocol (BGP) is in some sense too expressive and the protocol is not guaranteed to converge. There is significant interest in finding well-behaved algebras that still have enough expressive power to satisfy network operators. Recent theoretical results have shown that by constraining routing algebras to those that are \"strictly increasing\" we can guarantee the convergence of path-vector protocols. Currently the best theoretical worst-case upper bound for the convergence of such algebras is O(n!) iterations. However in practice it is difficult to find examples that do not converge in n iterations. In this paper we close this gap. We first present a family of network configurations that converges in Θ(n^2) iterations, demonstrating that the worst case is Ω(n^2) iterations. We then prove that path-vector protocols with a strictly increasing algebra are guaranteed to converge in O(n^2) iterations. Together these results establish a tight Θ(n^2) bound. This is another piece of the puzzle in showing that \"strictly increasing\" is, at least on a technical level, a reasonable constraint for practical policy-rich protocols.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132871617","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

DARE: Dynamic Adaptive Mobile Augmented Reality with Edge Computing 动态自适应移动增强现实与边缘计算

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-09-01 DOI: 10.1109/ICNP.2018.00011

Qiang Liu, T. Han

{"title":"DARE: Dynamic Adaptive Mobile Augmented Reality with Edge Computing","authors":"Qiang Liu, T. Han","doi":"10.1109/ICNP.2018.00011","DOIUrl":"https://doi.org/10.1109/ICNP.2018.00011","url":null,"abstract":"Mobile augmented reality (MAR) is a killer application of mobile edge computing because of its high computation demand and stringent latency requirement. Since edge networks and computing resources are highly dynamic, handling such dynamics is essential for providing high-quality MAR services. In this paper, we design a new network protocol named DARE (dynamic adaptive AR over the edge) that enables mobile users to dynamically change their AR configurations according to wireless channel conditions and computation workloads in edge servers. The dynamic configuration adaptations reduce the service latency of MAR users and maximize the quality of augmentation (QoA) under varying network conditions and computation workloads. Considering the video frame size and computation model, i.e., object detection algorithms, as two key parameters in adapting the AR configuration, we develop analytical models to characterize the impact of these parameters on QoA and the service latency. Then, we design optimization mechanisms on both the edge server and AR devices to guide the AR configuration adaptation and server computation resource allocation. The performance of the DARE protocol is validated through a small-scale testbed implementation.","PeriodicalId":264202,"journal":{"name":"2018 IEEE 26th International Conference on Network Protocols (ICNP)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115344709","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}

引用次数: 67

Innovating at the Connected Industry: SDN and NFV Experiences and Lessons Learned 互联产业的创新:SDN和NFV的经验和教训

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-09-01 DOI: 10.1109/ICNP.2018.00035

David García, J. Astorga, E. Jacob

引用次数: 1

Switch ASIC Programmability in Hybrid Mode 混合模式下开关ASIC可编程性

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-09-01 DOI: 10.1109/ICNP.2018.00067

Y. Piasetzky, Matty Kadosh, Marian Pritsak, Omer Shabtai, Alan Lo, Guohan Lu

引用次数: 3

RPC: Joint Online Reducer Placement and Coflow Bandwidth Scheduling for Clusters RPC:集群的联合在线减速器放置和共流带宽调度

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-09-01 DOI: 10.1109/ICNP.2018.00028

Yangming Zhao, Chen Tian, Jingyuan Fan, Tong Guan, C. Qiao

引用次数: 8

ARP-P4: A Hybrid ARP-Path/P4Runtime Switch ARP-P4:一个混合的ARP-Path/P4Runtime开关

2018 IEEE 26th International Conference on Network Protocols (ICNP) Pub Date : 2018-09-01 DOI: 10.1109/ICNP.2018.00062

I. Martínez-Yelmo, J. Alvarez-Horcajo, Miguel Briso-Montiano, D. Lopez-Pajares, Elisa Rojas

引用次数: 5