2014 IEEE 22nd International Conference on Network Protocols最新文献_第7页

A Study on a Routing-Based Mobility Management Architecture for IoT Devices 基于路由的物联网设备移动性管理体系结构研究

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.78

M. Ishino, Y. Koizumi, T. Hasegawa

引用次数: 14

Towards Resource-Efficient Application-Controlled Software Defined Networks 面向资源高效应用控制的软件定义网络

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.73

Jeremias Blendin, D. Hausheer

{"title":"Towards Resource-Efficient Application-Controlled Software Defined Networks","authors":"Jeremias Blendin, D. Hausheer","doi":"10.1109/ICNP.2014.73","DOIUrl":"https://doi.org/10.1109/ICNP.2014.73","url":null,"abstract":"Network management systems (NMS) need to support a wide range of application requirements while ensuring an efficient use of networking resources. Application control of Software Defined Networking (SDN) promises to drastically reduce OPEX and increase flexibility of NMS by automatically translating application requirements into network policies and subsequently into network behavior. The current research in this area focuses mainly on top-down approaches aiming at expressiveness, generality, and control plane resource efficiency. However, the expressive power and flexibility of Open Flow, a widely used SDN implementation, comes at the cost of high complexity when high-level policies are automatically translated into Open Flow rules, which can lead to an inefficient use of data plane resources. To counter this problem, this paper proposes a bottom-up approach to application-controlled SDN which aims to leverage scenario- and application-specific information for optimization. Thereby, the proposed approach is able to satisfy diverse application requirements and use the available data plane resources more efficiently than comparable approaches.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115614856","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

Cost-Minimizing Mobile Access Point Deployment in Workflow-Based Mobile Sensor Networks 基于工作流的移动传感器网络中的成本最小化移动接入点部署

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.29

Haiming Jin, He Huang, Lu Su, K. Nahrstedt

{"title":"Cost-Minimizing Mobile Access Point Deployment in Workflow-Based Mobile Sensor Networks","authors":"Haiming Jin, He Huang, Lu Su, K. Nahrstedt","doi":"10.1109/ICNP.2014.29","DOIUrl":"https://doi.org/10.1109/ICNP.2014.29","url":null,"abstract":"In mission-based mobile environments such as airplane maintenance, workflow-based mobile sensor networks emerge, where mobile users (MUs) with sensing devices visit sequences of mission-driven locations defined by workflows, and demand the gathering of sensory data within mission durations. To satisfy this demand in a cost-efficient manner, mobile access point (AP) deployment needs to be part of the overall solution. Therefore, we study the mobile AP deployment in workflow-based mobile sensor networks. We categorize MUs' workflows according to a priori knowledge of MUs' staying durations at mission locations into complete and incomplete information workflows. In both categories, we formulate the cost-minimizing mobile AP deployment problem into multiple (mixed) integer optimization problems, satisfying MUs' QoS constraints. We prove that the formulated optimization problems are NP-hard and design approximation algorithms with guaranteed approximation ratios. We demonstrate using simulations that the AP deployment cost calculated using our algorithms is 50-60% less than the stationary baseline approach and fairly close to the optimal AP deployment cost. In addition, the run times of our approximation algorithms are only 10-25% of those of the branch-and-bound algorithm used to derive the optimal AP deployment cost.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130538745","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

Domain Science Applications on GENI: Presentation and Demo 领域科学在GENI上的应用:介绍与演示

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.86

P. Ruth, A. Mandal

引用次数: 1

Designing a GENI Experimenter Tool to Support the Choice Net Internet Architecture 设计一个支持Choice Net Internet架构的GENI实验工具

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.88

D. Brown, Onur Ascigil, Hussamuddin Nasir, Charles Carpenter, J. Griffioen, K. Calvert

{"title":"Designing a GENI Experimenter Tool to Support the Choice Net Internet Architecture","authors":"D. Brown, Onur Ascigil, Hussamuddin Nasir, Charles Carpenter, J. Griffioen, K. Calvert","doi":"10.1109/ICNP.2014.88","DOIUrl":"https://doi.org/10.1109/ICNP.2014.88","url":null,"abstract":"Test beds such as GENI provide an ideal environment for experimenting with future internet architectures such as Choice Net. Unlike the narrow waist of the current Internet (IP), Choice Net encourages alternatives and competition at the network layer via an economic plane that allows users to choose and purchase precisely the services they need. In this paper we describe our experiences implementing the Choice Net architecture on GENI. Some features of GENI, such as the ability to program the network layer, to leverage existing protocols and software, to run real applications generating realistic traffic, and the ability to perform long-running experiments made GENI an ideal platform for Choice Net experimentation. However, we found that GENI currently lacks the tools needed to make it easy to use these features. To address this issue, we designed and implemented a GENI Experimenter Tool specifically designed and tailored to perform tasks commonly needed by experimenters such as dynamically configuring nodes, loading and compiling node-specific code, executing Click modules, running commands on sets of nodes, accessing the local file system on nodes, and dynamically logging into nodes.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115051959","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}

引用次数: 2

Experiments on Networking of Hadoop Hadoop的网络化实验

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.87

A. Navaz, Gandhimathi Velusamy, D. Gurkan

引用次数: 3

Can Bandwidth Estimation Tackle Noise at Ultra-high Speeds? 带宽估计能在超高速下解决噪声问题吗?

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.31

Qianwen Yin, J. Kaur, F. D. Smith

引用次数: 9

The Shape and Size of Threats: Defining a Networked System's Attack Surface 威胁的形状和大小:定义网络系统的攻击面

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.101

E. Osterweil, D. McPherson, Lixia Zhang

引用次数: 11

On Exploiting Dynamic Execution Patterns for Workload Offloading in Mobile Cloud Applications 利用动态执行模式实现移动云应用的工作负载卸载

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.22

Wei Gao, Yong Li, Haoyang Lu, Ting Wang, Cong Liu

{"title":"On Exploiting Dynamic Execution Patterns for Workload Offloading in Mobile Cloud Applications","authors":"Wei Gao, Yong Li, Haoyang Lu, Ting Wang, Cong Liu","doi":"10.1109/ICNP.2014.22","DOIUrl":"https://doi.org/10.1109/ICNP.2014.22","url":null,"abstract":"Mobile Cloud Computing (MCC) bridges the gap between limited capabilities of mobile devices and the increasing users' demand of mobile multimedia applications, by offloading the computational workloads from local devices to the remote cloud. Current MCC research focuses on making offloading decisions over different methods of a MCC application, but may inappropriately increase the energy consumption if having transmitted a large amount of program states over expensive wireless channels. Limited research has been done on avoiding such energy waste by exploiting the dynamic patterns of applications' run-time execution for workload offloading. In this paper, we adaptively offload the local computational workload with respect to the run-time application dynamics. Our basic idea is to formulate the dynamic executions of user applications using a semi-Markov model, and to further make offloading decisions based on probabilistic estimations of the offloading operation's energy saving. Such estimation is motivated by experimental investigations over practical smart phone applications, and then builds on analytical modeling of methods' execution times and offloading expenses. Systematic evaluations show that our scheme significantly improves the efficiency of workload offloading compared to existing schemes over various smart phone applications.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116708187","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}

引用次数: 32

Every Packet Counts: Fine-Grained Delay and Loss Measurement with Reordering 每个包计数:细粒度延迟和损失测量与重新排序

2014 IEEE 22nd International Conference on Network Protocols Pub Date : 2014-10-21 DOI: 10.1109/ICNP.2014.30

Jiliang Wang, Shuo Lian, Wei Dong, Yunhao Liu, Xiangyang Li

{"title":"Every Packet Counts: Fine-Grained Delay and Loss Measurement with Reordering","authors":"Jiliang Wang, Shuo Lian, Wei Dong, Yunhao Liu, Xiangyang Li","doi":"10.1109/ICNP.2014.30","DOIUrl":"https://doi.org/10.1109/ICNP.2014.30","url":null,"abstract":"Delay is an important metric to understand and improve system performance. While existing approaches focus on aggregate delay statistics in pre-programmed granularity, providing only statistical results such as averages and deviations, those approaches fail to provide fine-grained delay measurement at a flexible level and thus may miss important delay characteristics. For example, delay anomalies, which are critical system performance indicators, may not be captured by existing coarse grained approaches. In this work, we propose a fine-grained delay measurement approach based on a new measurement structure design called order preserving aggregator (OPA). OPA can efficiently encode the ordering and loss information by exploiting inherent data characteristics. Based on OPA, we propose a two layer design to convey both ordering and time stamp information, and then derive per-packet delay/loss measurement with a small overhead. We evaluate our approach both analytically and experimentally with widely used real-world data sets. The results show that our approach can achieve accurate per-packet delay measurement with an average of per-packet relative error at 2%, and an average of aggregated relative error at 10-5, while introducing less than 4 × 10-4 additional overhead.","PeriodicalId":437864,"journal":{"name":"2014 IEEE 22nd International Conference on Network Protocols","volume":"24 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123431998","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