2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)最新文献

筛选
英文 中文
On-Demand Routing for Chaining Multiple Functions in ICN-Based In-Network Processing 基于icn的网内处理中多功能链接的按需路由
2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2018-06-01 DOI: 10.1109/LANMAN.2018.8475111
Yusaku Hayamizu, Akira Nagata, M. Yamamoto
{"title":"On-Demand Routing for Chaining Multiple Functions in ICN-Based In-Network Processing","authors":"Yusaku Hayamizu, Akira Nagata, M. Yamamoto","doi":"10.1109/LANMAN.2018.8475111","DOIUrl":"https://doi.org/10.1109/LANMAN.2018.8475111","url":null,"abstract":"ICN (Information-Centric Networking) originally innovated for efficient content distribution, is now discussed to be applied to edge computing in IoT (Internet of Things) environment. In this paper, we focus on more flexible network processing environment, in-network processing, which is realized with ICN architecture. In our assumed environment, multiple functions are executed on different routers widely distributed in a whole network and the end-to-end optimal route for any data processing should be selected to satisfy various IoT applications’ requirement. Our proposal, an on-demand routing method efficiently chains data and multiple functions compared to an existing proactive routing method. Also, our method reactively caches routing information in the network and realize scalable routing for ICN-based in-network processing.","PeriodicalId":103856,"journal":{"name":"2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132623341","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
Reunifying Families after a Disaster via Serverless Computing and Raspberry Pis 通过无服务器计算和树莓派让灾难后的家庭团聚
2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2018-06-01 DOI: 10.1109/LANMAN.2018.8475098
J. Franz, Tanmayi Nagasuri, Andrew Wartman, Agnese V. Ventrella, Flavio Esposito
{"title":"Reunifying Families after a Disaster via Serverless Computing and Raspberry Pis","authors":"J. Franz, Tanmayi Nagasuri, Andrew Wartman, Agnese V. Ventrella, Flavio Esposito","doi":"10.1109/LANMAN.2018.8475098","DOIUrl":"https://doi.org/10.1109/LANMAN.2018.8475098","url":null,"abstract":"Children constitute a vulnerable population and special considerations are necessary in order to provide proper care for them during disasters. After disasters such as Hurricane Katrina, the rapid identification and protection of separated children and their reunification with legal guardians is necessary to minimize secondary injuries (i:e, physical and sexual abuse, neglect and abduction). At Camp Gruber, an Oklahoma shelter for Louisianan's displaced by Hurricane Katrina, of the 254 children at the camp, 36 ((i.e, 14.2%) were separated from their legal guardians. It took 6 months to reunify the last children; 70% of the children were with their legal guardian after 2 weeks. Imagine not knowing for 2 weeks (or 6 months) if your children are dead or alive. To exacerbate these natural challenges, during a disaster Internet connectivity is scarse or unreliable.","PeriodicalId":103856,"journal":{"name":"2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133582786","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}
引用次数: 15
A Prototype of In-Band Full-Duplex Free-Space Optical Transceiver 带内全双工自由空间光收发器原型
2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2018-06-01 DOI: 10.1109/LANMAN.2018.8475107
A. F. M. S. Haq, M. Khan, M. Yuksel
{"title":"A Prototype of In-Band Full-Duplex Free-Space Optical Transceiver","authors":"A. F. M. S. Haq, M. Khan, M. Yuksel","doi":"10.1109/LANMAN.2018.8475107","DOIUrl":"https://doi.org/10.1109/LANMAN.2018.8475107","url":null,"abstract":"Free-Space-Optical (FSO) communication has become an attractive option over Radio Frequency (RF) communication due to having broader bandwidth, unlicensed band, higher spatial reuse, and enhanced security. In-band full-duplex FSO (IBFD-FSO) transceivers ensure, in some cases enhance, these features enabling future vision of smart communication and Internet-of-Things (IoT) applications. Even though IBFDFSO transceivers can double the network capacity theoretically, overall performance and capacity is limited by interference and optical feedback. In this paper, we present a proof-ofconcept prototype of IBFD-FSO transceiver by implementing isolation technique to reduce optical feedback. We demonstrate the effectiveness of the isolation technique and performance through test-bed experiments using off-the-shelf components.","PeriodicalId":103856,"journal":{"name":"2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114422334","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
Saving Relay Time in a Heterogeneous Wireless Sensor Network 在异构无线传感器网络中节省中继时间
2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2018-06-01 DOI: 10.1109/LANMAN.2018.8475114
M. Saber, Mahmuda Naznin
{"title":"Saving Relay Time in a Heterogeneous Wireless Sensor Network","authors":"M. Saber, Mahmuda Naznin","doi":"10.1109/LANMAN.2018.8475114","DOIUrl":"https://doi.org/10.1109/LANMAN.2018.8475114","url":null,"abstract":"In a Wireless Sensor Network (WSN), it is common to use high end nodes known as relay nodes with more battery power and communication range for forwarding data to the base station. To assist sensor nodes if the relay nodes are added, communication becomes better because relay nodes are used to bridge the communication or routing. However, this is also important to keep the minimum number of relay nodes working to save the network cost. Most of the existing research focuses on placing the relay nodes in wireless sensor networks. It may happen that the different relay nodes forward data of the different sensor nodes on the basis of the availability. When data is not forwarded, relay nodes may be in sleep condition. In this paper, we provide a load balancing strategy to find the minimum number of relay nodes to be working with the goal of having longer network lifetime. We validate our claim by providing simulation results and we find it is possible to save a significant part of duty cycle using our model.","PeriodicalId":103856,"journal":{"name":"2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129141321","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
Orchestration and Monitoring in Fog Computing for Personal Edge Cloud Service Support 个人边缘云服务支持中的雾计算编排和监控
2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2018-06-01 DOI: 10.1109/LANMAN.2018.8475113
Florian Wamser, C. Lombardo, Constantinos Vassilakis, Lam Dinh-Xuan, P. Lago, R. Bruschi, P. Tran-Gia
{"title":"Orchestration and Monitoring in Fog Computing for Personal Edge Cloud Service Support","authors":"Florian Wamser, C. Lombardo, Constantinos Vassilakis, Lam Dinh-Xuan, P. Lago, R. Bruschi, P. Tran-Gia","doi":"10.1109/LANMAN.2018.8475113","DOIUrl":"https://doi.org/10.1109/LANMAN.2018.8475113","url":null,"abstract":"To effectively support new cloud services and smart device accessibility, current Internet design must move away from its typical TCP/IP-based architecture and evolve towards new paradigms characterized by high degrees of freedom. In particular, Network Functions Virtualization and Software-Defined Networking have proven to be appropriate approaches to introducing edge-programmability. In this article we give an overview over the fog computing-architecture approach INPUT (In-Network Programmability for the next generation of Personal CloUd Service SupporT) with its implementation OpenVolcano, which uses the above approaches to promote future personal Internet cloud services at the network edge. Specifically, it enables computing and storage capabilities for edge network devices, provides a simple, private, programmable SDN-based Ethernet domain for end users and edge cloud services, IaaS and PaaS support with tight delay and performance constraints through templates. The focus of this work is on multi-service orchestration and monitoring, which is an essential core of any edge computing architecture.","PeriodicalId":103856,"journal":{"name":"2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115243815","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
Robustness of IoT Application Protocols to Network Impairments 物联网应用协议对网络损伤的鲁棒性
2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2018-06-01 DOI: 10.1109/LANMAN.2018.8475048
Elizabeth Liri, P. Singh, Abdulrahman Bin Rabiah, K. Kar, K. Makhijani, K. Ramakrishnan
{"title":"Robustness of IoT Application Protocols to Network Impairments","authors":"Elizabeth Liri, P. Singh, Abdulrahman Bin Rabiah, K. Kar, K. Makhijani, K. Ramakrishnan","doi":"10.1109/LANMAN.2018.8475048","DOIUrl":"https://doi.org/10.1109/LANMAN.2018.8475048","url":null,"abstract":"Constrained Application Protocol (CoAP) and Message Queue Telemetry Transport (MQTT) are two IoT application layer protocols that are seeing increased attention and industry deployment. CoAP uses a request-response model and runs over UDP, while MQTT follows a publish-subscribe model running over TCP. For more constrained IoT devices, MQTTSensor Networks (MQTT-SN) provides a UDP-based transport between the sensor and an MQTT-SN gateway, while using TCP between that gateway and the MQTT broker. Quick UDP Internet Connections (QUIC) is a new protocol and although not originally designed for IoT devices, some design features such as reduced connection establishment time may be useful in an IoT environment. Each of these protocols seeks optimizations in features and implementation complexity based on application domains rather than having the full flexibility and adaptability of traditional transport protocols such as TCP. We investigate and analyze four protocols, namely, CoAP, MQTT, MQTT-SN and QUIC, to understand the overhead of obtaining data from an IoT device at a sink to potentially disseminate this data downstream. These constrained IoT devices often operate under challenging, varying network conditions, and it is important to understand the limitations of the protocols in such conditions. Thus, we evaluate the performance of these protocols under varying loss, delay and disruption conditions to identify the most effective environment for their operation and understand the limitations of their dynamic range. Results show that with non-confirmable CoAP a more adaptive wait timer is required; and a more streamlined QUIC protocol may be a potential alternative IoT protocol.","PeriodicalId":103856,"journal":{"name":"2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129789412","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
Predictive Edge Computing With Hard Deadlines 具有硬截止日期的预测边缘计算
2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2018-05-31 DOI: 10.1109/LANMAN.2018.8475056
Yuxuan Xing, H. Seferoglu
{"title":"Predictive Edge Computing With Hard Deadlines","authors":"Yuxuan Xing, H. Seferoglu","doi":"10.1109/LANMAN.2018.8475056","DOIUrl":"https://doi.org/10.1109/LANMAN.2018.8475056","url":null,"abstract":"Edge computing is a promising approach for localized data processing for many edge applications and systems including Internet of Things (IoT), where computationally intensive tasks in IoT devices could be divided into sub-tasks and offloaded to other IoT devices, mobile devices, and/or servers at the edge. However, existing solutions on edge computing do not address the full range of challenges, specifically heterogeneity; edge devices are highly heterogeneous and dynamic in nature. In this paper, we develop a predictive edge computing framework with hard deadlines. Our algorithm; PrComp (i) predicts the uncertain dynamics of resources of devices at the edge including energy, computing power, and mobility, and (ii) makes sub-task offloading decisions by taking into account the predicted available resources, as well as the hard deadline constraints of tasks. We evaluate Prcomp on a testbed consisting of real Android-based smartphones, and show that it significantly improves energy consumption of edge devices and task completion delay as compared to baselines.","PeriodicalId":103856,"journal":{"name":"2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130014993","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
Application Component Placement in NFV-based Hybrid Cloud/Fog Systems 基于nfv的混合云/雾系统中的应用组件放置
2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2018-05-25 DOI: 10.1109/LANMAN.2018.8475055
Carla Mouradian, Somayeh Kianpisheh, R. Glitho
{"title":"Application Component Placement in NFV-based Hybrid Cloud/Fog Systems","authors":"Carla Mouradian, Somayeh Kianpisheh, R. Glitho","doi":"10.1109/LANMAN.2018.8475055","DOIUrl":"https://doi.org/10.1109/LANMAN.2018.8475055","url":null,"abstract":"Applications are sets of interacting components that can be executed in sequence, in parallel, or by using more complex constructs such as selections and loops. They can, therefore, be modeled as structured graphs with sub-structures consisting of these constructs. Fog computing can reduce the latency induced by distant clouds by enabling the deployment of some components at the edge of the network (i.e., closer to end-devices) while keeping others in the cloud. Network Functions Virtualization (NFV) decouples software from hardware and enables an agile deployment of network services and applications as Virtual Network Functions (VNFs). In NFV settings, efficient placement algorithms are required to map the structured graphs representing the VNF Forwarding Graphs (VNF-FGs) onto the infrastructure of the hybrid cloud/fog system. Only deterministic graphs with sequence and parallel sub-structures have been considered thus to date. However, several real-life applications do require non-deterministic graphs with sub-structures as selections and loops. This paper focuses on application component placement in NFV-based hybrid cloud/fog systems, with the assumption that the graph representing the application is non-deterministic. The objective is to minimize an aggregated weighted function of makespan and cost. The problem is modeled as an Integer Linear Programming (ILP) and evaluated over small-scale scenarios using the CPLEX optimization tool.","PeriodicalId":103856,"journal":{"name":"2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132444805","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}
引用次数: 19
Online VNF Placement and Chaining for Value-added Services in Content Delivery Networks 内容交付网络中增值业务的在线VNF放置和链接
2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2018-05-24 DOI: 10.1109/LANMAN.2018.8475103
N. T. Jahromi, Somayeh Kianpisheh, R. Glitho
{"title":"Online VNF Placement and Chaining for Value-added Services in Content Delivery Networks","authors":"N. T. Jahromi, Somayeh Kianpisheh, R. Glitho","doi":"10.1109/LANMAN.2018.8475103","DOIUrl":"https://doi.org/10.1109/LANMAN.2018.8475103","url":null,"abstract":"Value-added Services (VASs) (e.g. dynamic site acceleration, media management) play a critical role in Content Delivery Networks (CDNs). Network Functions Virtualization (NFV) enables the agile provisioning of VASs. In NFV settings, VASs are provisioned as ordered sets of Virtual Network Functions (VNFs), forming VNF-Forwarding Graphs (VNF-FG) which are deployed in the CDN infrastructure. The CDN VAS VNF-FGs have a specific characteristic: they have one end-point (corresponding to the content server) that is unknown, prior to their placement. The proposals for CDN VAS VNF-FG placement, so far, have only considered offline placement, where the VNF-FGs are placed before end-user traffic steers into the network. However, in concrete cases, a change in service usage patterns might occur, a situation that could require a VNF-FG placement in an online manner. This paper tackles the problem of online VNF-FG placement for VASs in CDNs, taking into account the eventual reuses and migrations of already-deployed VNFs. A cost model is considered, including multiple costs; i.e. new VNF instantiations, migration, hosting and routing costs. The objective is to optimally place the VNF-FGs such that total reconfiguration costs are minimized while QoS is satisfied. An Integer Linear Programming (ILP) formulation is provided and evaluated in a small-scale scenario.","PeriodicalId":103856,"journal":{"name":"2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115017395","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
Piece of CAKE: A Comprehensive Queue Management Solution for Home Gateways 一块蛋糕:一个全面的队列管理解决方案的家庭网关
2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2018-04-20 DOI: 10.1109/LANMAN.2018.8475045
Toke Høiland-Jørgensen, Dave Täht, Jonathan Morton
{"title":"Piece of CAKE: A Comprehensive Queue Management Solution for Home Gateways","authors":"Toke Høiland-Jørgensen, Dave Täht, Jonathan Morton","doi":"10.1109/LANMAN.2018.8475045","DOIUrl":"https://doi.org/10.1109/LANMAN.2018.8475045","url":null,"abstract":"The last several years has seen a renewed interest in smart queue management to curb excessive network queueing delay, as people have realised the prevalence of bufferbloat in real networks. However, for an effective deployment at today's last mile connections, an improved queueing algorithm is not enough in itself, as often the bottleneck queue is situated in legacy systems that cannot be upgraded. In addition, features such as per-user fairness and the ability to de-prioritise background traffic are often desirable in a home gateway.In this paper we present Common Applications Kept Enhanced (CAKE), a comprehensive network queue management system designed specifically for home Internet gateways. CAKE packs several compelling features into an integrated solution, thus easing deployment. These features include: bandwidth shaping with overhead compensation for various link layers; reasonable DiffServ handling; improved flow hashing with both per-flow and per-host queueing fairness; and filtering of TCP ACKs. Our evaluation shows that these features offer compelling advantages, and that CAKE has the potential to significantly improve performance of last-mile internet connections.","PeriodicalId":103856,"journal":{"name":"2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124934918","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}
引用次数: 25
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信