2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)最新文献_第7页

Explicit topology management for continental-scale airborne networks 大陆尺度机载网络的显式拓扑管理

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116355

Ben Newton, Jay Aikat, K. Jeffay

{"title":"Explicit topology management for continental-scale airborne networks","authors":"Ben Newton, Jay Aikat, K. Jeffay","doi":"10.1109/INFCOMW.2017.8116355","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116355","url":null,"abstract":"Large-scale high-capacity communication networks among airborne platforms are quickly becoming a reality. Today, both Google and Facebook are seeking to form networks between high flying balloons and drones in an effort to provide Internet connections from the upper atmosphere to users on the ground. These airborne networks, that will likely use directional communication links between nodes to achieve high rates over long distances, present new networking challenges. One such challenge is the fact that the topology of these networks must be explicitly and constantly managed, ensuring that each directional data link is always pointed at and connected with the appropriate neighbor to yield an acceptable global topology. In this work we present several topology generation algorithms that can be used by a topology management framework to manage the topology of a continental-scale airborne network in a distributed manner. We give a detailed analysis of the strengths and weaknesses of these algorithms, based on their performance on numerous sets of nodes of various densities. We then simulate the topology management and routing with a geographic routing protocol in a network made up of hundreds of commercial aircraft in the continental United States, utilizing actual aircraft position data.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"487 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116323478","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

An LTE-based optimal resource allocation scheme for delay-sensitive M2M deployments coexistent with H2H users 针对时延敏感型M2M部署和H2H用户共存的一种基于lte的资源优化分配方案

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116366

Mohammed Y. Abdelsadek, Y. Gadallah, M. Ahmed

{"title":"An LTE-based optimal resource allocation scheme for delay-sensitive M2M deployments coexistent with H2H users","authors":"Mohammed Y. Abdelsadek, Y. Gadallah, M. Ahmed","doi":"10.1109/INFCOMW.2017.8116366","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116366","url":null,"abstract":"Machine-to-Machine (M2M) communication is considered one of the essential elements of the Internet of Things (IoT) for enabling objects to communicate over potentially large distances. It is predicted to be the dominant source of traffic in 5G networks. To enable M2M communications on LTE networks, which is considered the main cellular access technology for M2M communications, several issues need to be addressed while managing radio resources. One of the major issues is the scheduling of delay-sensitive M2M applications which require strict delay constraints in the existence of traffic types of other needs such as Human-to-Human (H2H) traffic. In this paper, we propose an optimal resource allocation scheme for delay-sensitive M2M applications that considers their delay requirements with statistical guarantees while not impacting the Quality of Service (QoS) of H2H traffic. We formulate the optimization problem and propose solution techniques that do not require high computational complexity. We also analytically derive the performance metrics of the proposed algorithm and validate them using simulations. The results show that the proposed algorithm exhibits better performance in comparison with other scheduling algorithms from past studies.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115368054","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}

引用次数: 14

A framework for flexible interdomain routing in transit ISPs 一种灵活的跨域路由框架

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116450

Trung Truong, I. Welch, Bryan K. F. Ng

引用次数: 1

Demo abstract: An intent solver for enabling intent-based SDN 演示摘要:实现基于意图的SDN的意图求解器

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116514

Haodi Zhang, Yu Wang, X. Qi, Weiping Xu, Tao Peng, Shucheng Liu

{"title":"Demo abstract: An intent solver for enabling intent-based SDN","authors":"Haodi Zhang, Yu Wang, X. Qi, Weiping Xu, Tao Peng, Shucheng Liu","doi":"10.1109/INFCOMW.2017.8116514","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116514","url":null,"abstract":"In recent years, software-defined networking (SDN) has been adopted in practice, such as the fast-growing market of software-defined wide area networks (SD-WAN). Intent, an emerging concept for SDN, aims to provide a simple interface for operators to manage the network. Under the framework of intent, an application submits a request by specifying the objective only, and the SDN controller decides how to reconfigure the network by considering the objectives of multiple intents with potential conflicts. For instance, in SD-WAN, when multiple applications or flows are competing for limited MPLS resource, we need to decide how and when to redirect some of them to Internet broadband connections. To this end, an intent solver is needed to analyze the received intents, making optimized solutions to operate the network. In this demo, we present the prototype of an intent solver focusing on intents related to flow routing. The demo takes intents both from applications for establishing/adjusting connections and from the network operator for load balancing, and generates optimized routing/rerouting solutions in real time.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125242097","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

Coordination mechanisms for floating content in realistic vehicular scenario 现实车辆场景中浮动内容的协调机制

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116443

Gaetano Manzo, R. Soua, Antonio Di Maio, T. Engel, M. Palattella, G. Rizzo

{"title":"Coordination mechanisms for floating content in realistic vehicular scenario","authors":"Gaetano Manzo, R. Soua, Antonio Di Maio, T. Engel, M. Palattella, G. Rizzo","doi":"10.1109/INFCOMW.2017.8116443","DOIUrl":"https://doi.org/10.1109/INFCOMW.2017.8116443","url":null,"abstract":"The increasing interest in vehicular communications draws attention to scalability and network congestion problems and therefore on techniques to offload the traffic, typically carried through the infrastructure, to the Vehicle-to-vehicle (V2V) network. Floating content (FC) represents a promising paradigm to share ephemeral content without direct support from infrastructure. It is based on constraining geographically within the Anchor Zone (AZ) the opportunistic replication of a given content among vehicles, in a way that strikes a balance between minimization of resource usage and content availability. Existing works on FC performance modeling are based on standard, homogeneous synthetic mobility models, and it is hence unclear how they actually fit in realistic mobility scenarios. Moreover, the approaches to FC dimensioning they propose assume users have full knowledge of Spatio-temporal mobility patterns, which is hard to achieve in practice. Finally, despite FC is an infrastructure-less communication paradigm, some form of infrastructure support could be available in the vast majority of those application scenarios for which it has been proposed. In this paper, we perform a first attempt at tackling these issues. We focus on how to dimension an Anchor Zone in a realistic vehicular scenario. We propose the first set of simple dimensioning strategies, based on the estimation of some key mobility parameters and of FC performance. We assess such strategies on measurement-based vehicular traces, providing a first indication of their relative performance, and of the feasibility of FC in practical scenarios.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"2 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123448112","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}

引用次数: 9

Poster abstract: SDN-based handover management in enterprise networked femtocells with X2-forwarding scheme 海报摘要:基于sdn的x2转发方案的企业网络基站切换管理

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116541

Tewelde Degefa Assefa, Rashedul Hoque, E. Tragos, X. Dimitropoulos

引用次数: 1

Heterogeneous wireless sensor networks using CoAP and SMS to predict natural disasters 基于CoAP和SMS的异构无线传感器网络预测自然灾害

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116348

Raihan ul Islam, Karl Andersson, Mohammad Shahadat Hossain

引用次数: 11

Virtual resource allocation for information-centric heterogeneous networks with mobile edge computing 基于移动边缘计算的信息中心异构网络虚拟资源分配

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116382

Yuchen Zhou, F. Yu, Jian Chen, Yonghong Kuo

引用次数: 5

Redundancy elimination might be overrated: A quantitative study on wireless traffic 冗余消除可能被高估:无线通信的定量研究

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116471

Xueheng Hu, A. Striegel

引用次数: 3

Ranking most informative apps for effective identification of legitimate smartphone owners 排名最具信息量的应用程序，有效识别合法的智能手机用户

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2017-05-01 DOI: 10.1109/INFCOMW.2017.8116477

Abdulaziz Alzubaidi, Swarup Roy, J. Kalita

引用次数: 3