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

DEME: Decouple packet marking from enqueuing for multiple services in data center networks DEME:将数据包标记从数据中心网络中多个服务的排队中分离出来

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

Chengxi Gao, V. Lee

{"title":"DEME: Decouple packet marking from enqueuing for multiple services in data center networks","authors":"Chengxi Gao, V. Lee","doi":"10.1109/ICNP.2016.7784465","DOIUrl":"https://doi.org/10.1109/ICNP.2016.7784465","url":null,"abstract":"Most of current Data Center Network (DCN) protocols leverage Explicit Congestion Notification (ECN) for congestion control. However, the majority of them assume single-queue scenario in each switch port, making their performance inferior in multiple-queue scenario. MQECN [1] solves this problem by periodically measuring the round time of queue scheduling, calculating a threshold for individual queue based on its weight and the measured round time, and adopting standard ECN in each queue. However, MQECN incurs non-negligible overhead for frequent round time measurement, and inaccurate round time measurement is unavoidable. To this end, we propose DEME, a light-weight DCN scheme for multiple-queue scenario with no need for round time measurement or per queue threshold setting. The core idea of DEME is to decouple packet marking from enqueuing, which means, when a packet is enqueued and the total queue length exceeds the standard threshold, instead of marking this newly arrived packet, we mark the head packet of the queue whose length exceeds its fair share the most. Experiments show that our light-weight DEME has similar performance with MQECN in terms of average Flow Completion Time and guarantees the fairness.","PeriodicalId":115376,"journal":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","volume":"30 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":"114474128","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}

引用次数: 4

Name-based geographical routing/forwarding support for location-based IoT services 基于名称的地理路由/转发支持基于位置的物联网服务

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

Kai Ryu, Y. Koizumi, T. Hasegawa

引用次数: 12

OpenFunction: An extensible data plane abstraction protocol for platform-independent software-defined middleboxes OpenFunction:用于独立于平台的软件定义中间件的可扩展数据平面抽象协议

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

Chen Tian, A. Liu, Ali Munir, Jie Yang

引用次数: 9

Reconciling task assignment and scheduling in mobile edge clouds 在移动边缘云中协调任务分配和调度

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

L. Wang, Lei Jiao, D. Kliazovich, P. Bouvry

{"title":"Reconciling task assignment and scheduling in mobile edge clouds","authors":"L. Wang, Lei Jiao, D. Kliazovich, P. Bouvry","doi":"10.1109/ICNP.2016.7785317","DOIUrl":"https://doi.org/10.1109/ICNP.2016.7785317","url":null,"abstract":"The prosperous growth of the Internet-of-Things industry attracts numerous interests in employing edge clouds (a.k.a. cloudlets) to enhance the performance of mobile services and applications. Most existing research has been focused on offloading computational tasks from mobile devices to a single cloudlet or a central location, yet overlooked the issue of jointly coordinating the offloaded tasks in a system of multiple cloudlets. In this paper, we fill this gap by investigating the assignment and the scheduling of mobile computational tasks over multiple cloudlets, while optimizing the overall cost efficiency by leveraging the heterogeneity of cloudlets. We model both data transfer and computation in terms of monetary and time costs, with task deadlines guaranteed. We formulate the problem as a mixed integer program and prove its NP-hardness. By introducing admission control for the cloudlet provider to shape the system workload, we transform our problem into maximizing the task admission rate over the two coupled phases: data transfer and computation. We propose an efficient two-phase scheduling algorithm, and demonstrate that, compared with the conventional approach of always selecting the closest cloudlet, our approach achieves significantly higher admission rate with up to 20% reduction in the average cost of all offloaded tasks.","PeriodicalId":115376,"journal":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","volume":"12 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":"126695835","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}

引用次数: 47

Limitations of IEC62351-3's public key management IEC62351-3公钥管理的局限性

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

James G. Wright, S. Wolthusen

引用次数: 4

Piggyback game: Efficient event stream dissemination in Online Social Network systems 在线社交网络系统中有效的事件流传播

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

Fan Zhang, Hanhua Chen, Hai Jin

{"title":"Piggyback game: Efficient event stream dissemination in Online Social Network systems","authors":"Fan Zhang, Hanhua Chen, Hai Jin","doi":"10.1109/ICNP.2016.7784417","DOIUrl":"https://doi.org/10.1109/ICNP.2016.7784417","url":null,"abstract":"Event stream dissemination dominates the workloads in large-scale Online Social Network (OSN) systems. Based on the de facto per-user view data storage, event stream dissemination raises a large amount of inter-server traffics due to the complex interconnection among OSN users. The state-of-the-art schemes mainly explore the structure features of social graphs to reduce the inter-server messages for event stream dissemination. Different sub-graph structures are exploited for achieving the approximated optimal assignment. However, such schemes incur high costs of computation or communication. In this work, we follow a different design philosophy by using a game theoretic approach, which decomposes the high complex graph computation problem into individuals' rational strategy selection of each node. Specifically, we propose a novel social piggyback game to achieve a more efficient solution. We mathematically prove the existing of the Nash Equilibrium of the social piggyback game. Moreover, we propose an efficient best response dynamic algorithm to achieve the Nash Equilibrium, which quickly converges in a small number of iterations for large-scale OSNs. We further show that the communication cost of this design achieves a 1.5-approximation of the theoretical social optimal. We conduct comprehensive experiments to evaluate the performance of this design using large-scale real-world traces from popular OSN systems. Results show that the social piggyback game achieves a significant 302× improvement in system efficiency compared to existing schemes.","PeriodicalId":115376,"journal":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","volume":"93 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":"124537447","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

A template approach to group key establishment in dynamic ad-hoc groups 在动态自组织中建立组密钥的模板方法

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

Bruhadeshwar Bezawada, Xiaojiang Liang, A. Liu, Rui Li

{"title":"A template approach to group key establishment in dynamic ad-hoc groups","authors":"Bruhadeshwar Bezawada, Xiaojiang Liang, A. Liu, Rui Li","doi":"10.1109/ICNP.2016.7784470","DOIUrl":"https://doi.org/10.1109/ICNP.2016.7784470","url":null,"abstract":"Fast growing communication networks like wireless ad-hoc networks and Internet-of-things (IoT) put forth new challenges in secure communication like eavesdropping and tampering attacks. For such networks, we consider the following important problem: How to establish a shared secret group key among the nodes of a dynamically formed ad-hoc group? There are two major challenges: (a) The nodes are constrained and cannot support expensive public-key operations, especially for large groups and (b) the neighborhood of an ad-hoc node is not determined a-priori and therefore, the node needs to be able to establish a group key with any dynamic sub-set of the nodes. In this work, we describe a novel template based approach to group key establishment wherein our template is a logical shared secret distribution hierarchy built on the ad-hoc nodes prior to deployment. Our template approach ensures that any given ad-hoc node shares a distinct set of secrets with any dynamic group of nodes, regardless of the physical neighborhood, after deployment. We illustrate our approach using two instantiations of symmetric secret distribution protocols namely: sub-set and dual one-way hash chain distributions.","PeriodicalId":115376,"journal":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","volume":"07 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":"127213726","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

Smoggy-Link: Fingerprinting interference for predictable wireless concurrency 烟雾链接:指纹识别干扰可预测的无线并发

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

Meng Jin, Yuan He, Xiaolong Zheng, Dingyi Fang, Dan Xu, Tianzhang Xing, Xiaojiang Chen

{"title":"Smoggy-Link: Fingerprinting interference for predictable wireless concurrency","authors":"Meng Jin, Yuan He, Xiaolong Zheng, Dingyi Fang, Dan Xu, Tianzhang Xing, Xiaojiang Chen","doi":"10.1109/ICNP.2016.7784420","DOIUrl":"https://doi.org/10.1109/ICNP.2016.7784420","url":null,"abstract":"Operating in unlicensed ISM bands, ZigBee devices often yield poor throughput and packet reception ratio due to the interference from ever increasing wireless devices in 2.4 GHz band. Although there have been many efforts made for interference avoidance, they come at the cost of miscellaneous overhead, which oppositely hurts channel utilization. Our empirical results show that, a specific interference is likely to have different influence on different outbound links of a ZigBee sender, which indicates the chance of concurrent transmissions. Based on this insight, we propose Smoggy-Link, a practical protocol to exploit the potential concurrency for adaptive ZigBee transmissions under harsh interference. Smoggy-Link maintains an accurate link model to describe and trace the relationship between interference and link quality of the sender's outbound links. With such a link model, Smoggy-Link can obtain fine-grained spatiotemporal link information through a low-cost interference identification method. The link information is further utilized for adaptive link selection and intelligent transmission schedule. We implement and evaluate a prototype of our approach with TinyOS and TelosB motes. The evaluation results show that Smoggy-Link has consistent improvements in both throughput and packet reception ratio under interference from various interferer.","PeriodicalId":115376,"journal":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","volume":"125 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":"127408540","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

An efficient framework for data-plane verification with geometric windowing queries 基于几何窗口查询的数据平面验证的有效框架

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

Takeru Inoue, Richard Chen, Toru Mano, Kimihiro Mizutani, Hisashi Nagata, Osamu Akashi

{"title":"An efficient framework for data-plane verification with geometric windowing queries","authors":"Takeru Inoue, Richard Chen, Toru Mano, Kimihiro Mizutani, Hisashi Nagata, Osamu Akashi","doi":"10.1109/ICNP.2016.7784412","DOIUrl":"https://doi.org/10.1109/ICNP.2016.7784412","url":null,"abstract":"Modern networks have complex configurations to provide advanced functions, but the complexity also makes them error-prone. Network verification is attracting attention as a key technology to detect inconsistencies between a configuration and a policy before deployment. Existing verifiers, however, either generally verify various properties over the policy at the cost of efficiency, or efficiently perform configuration analysis without paying much attention to the policy. This paper presents a novel framework of data-plane verification, which flexibly checks the inconsistency with great efficiency. For the purpose of generality, our framework formalizes a verification process with three abstract steps: each step is related to 1) packet behaviors defined by a configuration, 2) operator intentions described in a policy, and 3) the inspection of their relation. These steps work efficiently with each other on the simple quotient set of packet headers. This paper also reveals how the second step can be regarded as the windowing query problem in computational geometry. Two novel windowing algorithms are proposed with solid theoretical analyses. Experiments on real network datasets show that our framework with the windowing algorithms is surprisingly fast even when verifying the policy compliance; e.g., in a medium-scale network with thousands of switches, our framework reduces the verification time of all-pairs reachability from ten hours to ten minutes.","PeriodicalId":115376,"journal":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","volume":"65 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":"123403225","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}

引用次数: 4

Towards rapid and cost-effective prototyping of IoT platforms 面向物联网平台的快速和经济高效的原型设计

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

Gaoyang Guan, Wei Dong, Yi Gao, Jiajun Bu

引用次数: 6