2016 IEEE 24th International Conference on Network Protocols (ICNP)最新文献_第4页

SDIG: Toward Software-Defined IPsec Gateway SDIG:向软件定义IPsec网关

2016 IEEE 24th International Conference on Network Protocols (ICNP) Pub Date : 2016-11-01 DOI: 10.1109/ICNP.2016.7785316

Wei Li, Fengxu Lin, Guanchao Sun

{"title":"SDIG: Toward Software-Defined IPsec Gateway","authors":"Wei Li, Fengxu Lin, Guanchao Sun","doi":"10.1109/ICNP.2016.7785316","DOIUrl":"https://doi.org/10.1109/ICNP.2016.7785316","url":null,"abstract":"The current IPsec gateway integrates many functions of IPsec operation, tunnel management and forwarding decision, which makes the IPsec gateway complicated in maintenance and deployment. The problem of maintaining such devices prevents IPsec VPN from applying widely. The emergence of SDN provides an innovative way to decouple the control plane and data plane. In this paper, a Software-Defined IPsec Gateway (SDIG) is proposed to achieve net2net IPsec VPN. Different from the traditional IPsec gateway, the SDIG device serves as a data plane equipment that just concentrates on exchanging IKE packets and encrypting/decrypting IP packets. A global view of SDIG devices can be constructed in the SDN controller by collecting the status of all devices. Therefore the controller can manage and configure SDIG devices centrally, and simplify deployment complexity. Outbound IP packets for the SDIG device can be viewed as a trigger to control the establishment of IPsec tunnels. The SDIG device and the controller exchange information through a customized southbound protocol. The prototype system of SDIG is implemented, and the preliminary experimental results show that the method is feasible and effective.","PeriodicalId":115376,"journal":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131685083","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}

引用次数: 11

Enabling router-assisted congestion control on the Internet 在Internet上启用路由器辅助拥塞控制

2016 IEEE 24th International Conference on Network Protocols (ICNP) Pub Date : 2016-11-01 DOI: 10.1109/ICNP.2016.7784442

Marcel Flores, A. Wenzel, A. Kuzmanovic

{"title":"Enabling router-assisted congestion control on the Internet","authors":"Marcel Flores, A. Wenzel, A. Kuzmanovic","doi":"10.1109/ICNP.2016.7784442","DOIUrl":"https://doi.org/10.1109/ICNP.2016.7784442","url":null,"abstract":"Enabling communication between routers and endpoints has long been sought after as an approach to congestion control in the Internet. However, the narrow-waist of TCP/IP has complicated the deployment of such communication. In this paper, we present Kick-Ass1, a congestion control mechanism that enables explicit rate congestion control protocols to be deployed within the TCP/IP stack. The key idea is to utilize packet lengths as a vehicle to communicate fine-grained explicit rate and other information from routers to endpoints and vice versa. Given that our approach (i) requires no explicit coordination among Kick-Ass routers, (ii) no explicit coordination among Kick-Ass routers and endpoints, and (iii) is effective on paths that include legacy routers, it provides a practical road towards a faster Internet, today. Using large-scale simulations, testbed experiments, and wide-area Internet evaluations, we demonstrate that (i) a basic explicit-rate protocol using the Kick-Ass mechanism improves flow completion times by up to an order of magnitude and outperforms endpoint-based approaches, including CUBIC and PCC. (ii) Kick-Ass is incrementally deployable on the Internet. (iii) Deploying Kick-Ass at end-hosts and edge routers can enable the above performance benefits, without waiting for universal adoption. (iv) Our packet-fragmentation mechanism is well behaved on the Internet.","PeriodicalId":115376,"journal":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129494970","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

Cache contention aware Virtual Machine placement and migration in cloud datacenters 云数据中心中缓存争用感知的虚拟机放置和迁移

2016 IEEE 24th International Conference on Network Protocols (ICNP) Pub Date : 2016-11-01 DOI: 10.1109/ICNP.2016.7784447

Liuhua Chen, Haiying Shen, Stephen Platt

{"title":"Cache contention aware Virtual Machine placement and migration in cloud datacenters","authors":"Liuhua Chen, Haiying Shen, Stephen Platt","doi":"10.1109/ICNP.2016.7784447","DOIUrl":"https://doi.org/10.1109/ICNP.2016.7784447","url":null,"abstract":"In cloud datacenters, multiple Virtual Machines (VMs) are co-located in a Physical Machine (PM) to serve different applications. Prior VM consolidation methods for cloud datacenters schedule VMs mainly based on resource (CPU and memory) constraints in PMs but neglect serious shared Last Level cache contention between VMs. This may cause severe VM performance degradation due to cache thrashing and starvation for VMs. Current cache contention aware VM consolidation strategies either estimate cache contention by coarse VM classification for each individual VM without considering co-location and (or) require the aid of hardware to monitor the online miss rate of each VM. Therefore, these strategies are insufficiently accurate and (or) difficult to adopt for VM consolidation in clouds. In this paper, we formalize the problem of cache contention aware VM placement and migration in cloud datacenters using integer linear programming. We then propose a cache contention aware VM placement and migration algorithm (CacheVM). It estimates the total cache contention degree of co-locating a given VM with a group of VMs in a PM based on the cache stack distance profiles of the VMs. Then, it places the VM to the PM with the minimum cache contention degree and chooses the VM from a PM that generates the maximum cache contention degree to migrate out. We implemented CacheVM and its comparison methods on a supercomputing cluster. Trace-driven simulation and real-testbed experiments show that CacheVM outperforms other methods in terms of the number of cache misses, execution time and throughput.","PeriodicalId":115376,"journal":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133098855","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}

引用次数: 21

Topological ordering based iterative TCAM rule compression using bi-partite graphs 基于拓扑排序的双部图迭代TCAM规则压缩

2016 IEEE 24th International Conference on Network Protocols (ICNP) Pub Date : 2016-11-01 DOI: 10.1109/ICNP.2016.7784471

Rui Li, Wenjie Li, Bruhadeshwar Bezawada, Zheng Qin

引用次数: 0

Fast shortest-path queries on large-scale graphs 大规模图上的快速最短路径查询

2016 IEEE 24th International Conference on Network Protocols (ICNP) Pub Date : 2016-11-01 DOI: 10.1109/ICNP.2016.7784419

Qiongwen Xu, Xu Zhang, Jin Zhao, Xin Wang, T. Wolf

{"title":"Fast shortest-path queries on large-scale graphs","authors":"Qiongwen Xu, Xu Zhang, Jin Zhao, Xin Wang, T. Wolf","doi":"10.1109/ICNP.2016.7784419","DOIUrl":"https://doi.org/10.1109/ICNP.2016.7784419","url":null,"abstract":"Shortest-path queries on weighted graphs are an essential operation in computer networks. The performance of such algorithms has become a critical challenge in emerging software-defined networks (SDN), since SDN controllers need to perform a shortest-path query for every flow. Unlike classic solutions (e.g., Dijkstra's algorithm), high-performance shortest-path query algorithms include two stages: preprocessing and query answering. Despite the improved query answering time, existing two-stage algorithms are still extremely time-consuming in preprocessing large-scale graphs. In this paper, we propose an efficient shortest-path query algorithm, called BBQ, which reduces the running time of both stages via tree decomposition. BBQ constructs a distance oracle in a bottom-top-bottom manner, which significantly reduces preprocessing time over existing algorithms. In addition, BBQ can answer batch queries in bulk by traversing the decomposed tree instead of executing separate queries. Our experimental results show that BBQ outperforms state-of-the-art approaches by orders of magnitude for the running time of the preprocessing stage. Meanwhile, BBQ also offers remarkable acceleration for answering batches of queries. As a result, SDN controllers that use BBQ can sustain 1.1-27.9 times higher connection request rates.","PeriodicalId":115376,"journal":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127657189","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

How sustainable is social based mobile crowdsensing? An experimental study 基于社交的移动众筹的可持续性如何?实验研究

2016 IEEE 24th International Conference on Network Protocols (ICNP) Pub Date : 2016-11-01 DOI: 10.1109/ICNP.2016.7785318

Carlos Bermejo, Dimitris Chatzopoulos, P. Hui

引用次数: 4

Estimating the rumor source with anti-rumor in social networks 用反谣言估计社交网络中的谣言来源

2016 IEEE 24th International Conference on Network Protocols (ICNP) Pub Date : 2016-11-01 DOI: 10.1109/ICNP.2016.7785329

Jaeyoung Choi, Sang-chul Moon, Jinwoo Shin, Yung Yi

{"title":"Estimating the rumor source with anti-rumor in social networks","authors":"Jaeyoung Choi, Sang-chul Moon, Jinwoo Shin, Yung Yi","doi":"10.1109/ICNP.2016.7785329","DOIUrl":"https://doi.org/10.1109/ICNP.2016.7785329","url":null,"abstract":"Recently, the problem of detecting the rumor source in a social network has been much studied, where it has been shown that the detection probability cannot be beyond 31% even for regular trees. In this paper, we study the impact of an anti-rumor on the rumor source detection. We first show a negative result: the anti-rumor's diffusion does not increase the detection probability under Maximum-Likelihood-Estimator (MLE) when the number of infected nodes are sufficiently large by passive diffusion that the anti-rumor starts to be spread by a special node, called the protector, after is reached by the rumor. We next consider the case when the distance between the rumor source and the protector follows a certain type of distribution, but its parameter is hidden. Then, we propose the following learning algorithm: a) learn the distance distribution parameters under MLE, and b) detect the rumor source under Maximum-A-Posterior-Estimator (MAPE) based on the learnt parameters. We provide an analytic characterization of the rumor source detection probability for regular trees under the proposed algorithm, where MAPE outperforms MLE by up to 50% for 3-regular trees and by up to 63% when the degree of the regular tree becomes large. We demonstrate our theoretical findings through numerical results, and further present the simulation results for general topologies (e.g., Facebook and US power grid networks) even without knowledge of the distance distribution, showing that under a simple protector placement algorithm, MAPE produces the detection probability much larger than that by MLE.","PeriodicalId":115376,"journal":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","volume":"117 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132483639","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

A communication model for stateless networked tags 无状态网络标签的通信模型

2016 IEEE 24th International Conference on Network Protocols (ICNP) Pub Date : 2016-11-01 DOI: 10.1109/ICNP.2016.7784457

Jia Liu, Youlin Zhang, Min Chen, Shigang Chen, Lijun Chen

{"title":"A communication model for stateless networked tags","authors":"Jia Liu, Youlin Zhang, Min Chen, Shigang Chen, Lijun Chen","doi":"10.1109/ICNP.2016.7784457","DOIUrl":"https://doi.org/10.1109/ICNP.2016.7784457","url":null,"abstract":"Traditional radio frequency identification (RFID) technologies allow tags to communicate with a reader but not among themselves. By enabling peer-to-peer communications among nearby tags, the emerging networked tags make a fundamental enhancement to today's RFID systems. This new capability supports a series of system-level functions in previously infeasible scenarios where the readers cannot cover all tags due to cost or physical limitations. This paper makes the first attempt to design a new communication model that is specifically tailored to efficient implementation of system-level functions in networked tag systems. Instead of exploiting complex mechanisms for collision detection and resolution, we propose a collision-resistent communication model (CCM) that embraces the collision in tag communications and utilizes it to merge the data from different sources in a benign way. Two fundamental applications: RFID estimation and missing-tag detection, are presented to illustrate how CCM assists efficient system-level operations in networked tag systems. Simulation results show that system-level applications through CCM outperform those through ID collection.","PeriodicalId":115376,"journal":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115310901","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

Distributed privacy-protecting DTN routing: Concealing the information indispensable in routing 分布式保护隐私的DTN路由:隐藏路由中不可缺少的信息

2016 IEEE 24th International Conference on Network Protocols (ICNP) Pub Date : 2016-11-01 DOI: 10.1109/ICNP.2016.7784461

Kang-Peng Chen, Haiying Shen

引用次数: 2

Redactor: Reconcile network control with declarative control programs In SDN 编辑器:在SDN中调和网络控制与声明性控制程序

2016 IEEE 24th International Conference on Network Protocols (ICNP) Pub Date : 2016-11-01 DOI: 10.1109/ICNP.2016.7784433

Wen Wang, Wenbo He, Jinshu Su

{"title":"Redactor: Reconcile network control with declarative control programs In SDN","authors":"Wen Wang, Wenbo He, Jinshu Su","doi":"10.1109/ICNP.2016.7784433","DOIUrl":"https://doi.org/10.1109/ICNP.2016.7784433","url":null,"abstract":"With SDN control programs from multi-domains configuring the network, it is inevitable that control programs make conflicting control decisions, which probably lead to misconfiguration or performance degradation. Existing control coordination approaches either compose control programs to derive consistent solutions jointly or examine the generated rules of each control program to ensure they are consistent. However, the former is usually of great complexity and hard to be conducted automatically, and the latter probably results in suboptimal solutions due to the independent execution of control programs. Moreover, these approaches all fail to consider the control utility of control programs. In this paper, we propose Redactor to optimize the consistency and utility of network control in an automatic and dynamic manner. To make network control consistent, we implement SDN control programs with declarative language Prolog, and compose control programs automatically to execute together to make consistent decisions. When conflicts occur, we use a heuristic approach to compromise a subset of control programs to maximize the control utility. We compare Redactor with the static priority mechanism and Athens [1], and the results show that Redactor always satisfies more control objectives to achieve better control consistency and utility.","PeriodicalId":115376,"journal":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128991190","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}

引用次数: 8