Networking (SCN) extends Information-Centric Networking (ICN) from content to services, enabling clients to request services without having them coupled to specific servers. This brings new authentication challenges, since legacy authentication techniques do not apply. We propose and evaluate three generic SCN use cases and their corresponding authentication methods.
{"title":"Authentication and Trust in Service-Centric Networking","authors":"I. Aad, T. Braun, D. Mansour","doi":"10.1109/LCN.2016.93","DOIUrl":"https://doi.org/10.1109/LCN.2016.93","url":null,"abstract":"Networking (SCN) extends Information-Centric Networking (ICN) from content to services, enabling clients to request services without having them coupled to specific servers. This brings new authentication challenges, since legacy authentication techniques do not apply. We propose and evaluate three generic SCN use cases and their corresponding authentication methods.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"34 1","pages":"563-566"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79726603","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}
In this work, we propose an approach for optimizing Mobile Cloud Computing (MCC) resources allocation using stochastic networks optimization based on Lyapunov optimization. The approach targets reducing users' requests experienced delay while enhancing resource availability. We use Lyapunov drift plus penalty optimization to ensure design stability and to minimise the delay cost function. We perform extensive simulations under different charge conditions in order to prove the effectiveness of the approach in handling user requests with lower delays. Simulation results show that the approach enhances the experienced delay while ensuring a good utilization of resource pools.
{"title":"Resource Allocation for Delay Sensitive Applications in Mobile Cloud Computing","authors":"Omar Chakroun, S. Cherkaoui","doi":"10.1109/LCN.2016.105","DOIUrl":"https://doi.org/10.1109/LCN.2016.105","url":null,"abstract":"In this work, we propose an approach for optimizing Mobile Cloud Computing (MCC) resources allocation using stochastic networks optimization based on Lyapunov optimization. The approach targets reducing users' requests experienced delay while enhancing resource availability. We use Lyapunov drift plus penalty optimization to ensure design stability and to minimise the delay cost function. We perform extensive simulations under different charge conditions in order to prove the effectiveness of the approach in handling user requests with lower delays. Simulation results show that the approach enhances the experienced delay while ensuring a good utilization of resource pools.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"18 1","pages":"615-618"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84823938","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}
Multipath TCP (MPTCP) enables a single TCP connection to use multiple paths for data delivery. This is expected to increase the overall data transfer throughput by utilizing the multihoming capabilities of communicating nodes. This paper introduces an experimental study of MPTCP connections of multihomed wireless nodes. The nodes' transceivers use two wireless interfaces. One is connected to a WiFi network, whereas the other emulates a dedicated link (such as a 3G or 4G). The performance of MPTCP is investigated in a practical setting, where the WiFi network suffers from interference of other nearby WiFi networks. The effect of connection parameters (such as maximum segment size and receiver buffer size) is examined. For such multihomed connections, our findings demonstrate that the MPTCP coupled congestion control algorithm can transfer more traffic over the WiFi link than the dedicated link only if the WiFi channel rate far exceeds the dedicated link rate.
{"title":"Experimental Performance Study of Multipath TCP over Heterogeneous Wireless Networks","authors":"A. Abdrabou, M. Prakash","doi":"10.1109/LCN.2016.35","DOIUrl":"https://doi.org/10.1109/LCN.2016.35","url":null,"abstract":"Multipath TCP (MPTCP) enables a single TCP connection to use multiple paths for data delivery. This is expected to increase the overall data transfer throughput by utilizing the multihoming capabilities of communicating nodes. This paper introduces an experimental study of MPTCP connections of multihomed wireless nodes. The nodes' transceivers use two wireless interfaces. One is connected to a WiFi network, whereas the other emulates a dedicated link (such as a 3G or 4G). The performance of MPTCP is investigated in a practical setting, where the WiFi network suffers from interference of other nearby WiFi networks. The effect of connection parameters (such as maximum segment size and receiver buffer size) is examined. For such multihomed connections, our findings demonstrate that the MPTCP coupled congestion control algorithm can transfer more traffic over the WiFi link than the dedicated link only if the WiFi channel rate far exceeds the dedicated link rate.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"17 1","pages":"172-175"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91116476","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}
To address the challenge of unprecedented growth in mobile data traffic, ultra-dense network deployment is a cost efficient solution to offload the traffic over some small cells. The overlapped coverage areas of small cells create more than one candidate access points for one mobile station. Signal strength based user association in IEEE 802.11 results in a significantly unbalanced load distribution among access points. However, the bandwidth demand of each user actually differs vastly due to their different preferences on mobile applications. In this paper, we formulate a non-linear integer programming model for joint user association and user bandwidth demand guarantee problem. In this model, we try to maximize the system capacity and guarantee the effective bandwidth demand for each user by soft-association control. Finally, we evaluate the proposed algorithm performance for the edge users with dynamic and heterogeneous bandwidth demands. Simulation results show that the proposed soft-association control performs better than the distributed ones and improves the individual quality of user experience with a little price on system throughput.
{"title":"User Demand Aware Soft-Association Control in Ultra-Dense Small Cell Networks","authors":"Guolin Sun, Hangming Zhang, Guisong Liu","doi":"10.1109/LCN.2016.114","DOIUrl":"https://doi.org/10.1109/LCN.2016.114","url":null,"abstract":"To address the challenge of unprecedented growth in mobile data traffic, ultra-dense network deployment is a cost efficient solution to offload the traffic over some small cells. The overlapped coverage areas of small cells create more than one candidate access points for one mobile station. Signal strength based user association in IEEE 802.11 results in a significantly unbalanced load distribution among access points. However, the bandwidth demand of each user actually differs vastly due to their different preferences on mobile applications. In this paper, we formulate a non-linear integer programming model for joint user association and user bandwidth demand guarantee problem. In this model, we try to maximize the system capacity and guarantee the effective bandwidth demand for each user by soft-association control. Finally, we evaluate the proposed algorithm performance for the edge users with dynamic and heterogeneous bandwidth demands. Simulation results show that the proposed soft-association control performs better than the distributed ones and improves the individual quality of user experience with a little price on system throughput.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"18 1","pages":"651-654"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78453912","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}
Internet of Vehicles requires reliable Inter-Vehicular communications. Such a requirement is challenging since the wireless communication channel is very erroneous and lossy in city environments. A lot of solutions for connecting vehicles to the internet have been proposed. However, existing multi-hop gateway discovery solutions do not consider, a key issue, the unreliability of broadcast in city environments. In this paper, our objective is to find out the minimum communication hops, with very high reliability (e.g., 97%), to gateways. To accomplish this, we model the gateway placement problem (called GP) as a k-center optimization problem. We solve it in O(n^2*log(n)) time using a (2-1) dimension reduction technique. We make use of M-HRB to discover reliable multi-hop paths to gateways. Simulation results demonstrate that applying M-HRB with GP provides high packet reception rate and generates smaller end-to-end delay compared to existing solutions. Furthermore, our proposal makes efficient use of wireless channel bandwidth.
{"title":"Optimal Gateway Placement and Reliable Internet Access in Urban Vehicular Environments","authors":"Wiem Benrhaiem, A. Hafid, P. Sahu","doi":"10.1109/LCN.2016.116","DOIUrl":"https://doi.org/10.1109/LCN.2016.116","url":null,"abstract":"Internet of Vehicles requires reliable Inter-Vehicular communications. Such a requirement is challenging since the wireless communication channel is very erroneous and lossy in city environments. A lot of solutions for connecting vehicles to the internet have been proposed. However, existing multi-hop gateway discovery solutions do not consider, a key issue, the unreliability of broadcast in city environments. In this paper, our objective is to find out the minimum communication hops, with very high reliability (e.g., 97%), to gateways. To accomplish this, we model the gateway placement problem (called GP) as a k-center optimization problem. We solve it in O(n^2*log(n)) time using a (2-1) dimension reduction technique. We make use of M-HRB to discover reliable multi-hop paths to gateways. Simulation results demonstrate that applying M-HRB with GP provides high packet reception rate and generates smaller end-to-end delay compared to existing solutions. Furthermore, our proposal makes efficient use of wireless channel bandwidth.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"241 1","pages":"662-670"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74931717","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}
Meitian Huang, W. Liang, Zichuan Xu, M. Jia, Song Guo
Today's computer networks rely on a wide spectrum of specialized middleboxes to improve their security and performance. Traditional middleboxes that are implemented by dedicated hardware are expensive and hard to manage. A promising technique of consolidated middleboxes - implementing traditional middleboxes in Virtual Machines (VMs) - offers economical yet simplified management of middleboxes in Software-Defined Networks (SDNs). However there are still challenges to realizing user routing requests with network function enforcement (a sequence of middleboxes) while maximizing the network throughput, due to various resource constraints on SDNs, such as forwarding table capacity at each switch, bandwidth resource capacity at each link, and computing resource capacity at each server (Physical Machine). In this paper, we study the problem of maximizing the network throughput of an SDN by admitting as many user requests as possible, where each user request has both bandwidth and computing resource demands to implement its network functions (consolidated middleboxes). We first formulate the problem as a novel network throughput maximization problem. We then provide an Integer Linear Program (ILP) solution for it if the problem size is small, otherwise, we devise two heuristics that strive for the fine tradeoff between the accuracy of solutions and the running times of achieving the solutions. We finally evaluate the performance of the proposed algorithms by simulations, based on real and synthetic network topologies. Experimental results demonstrate that the proposed algorithms are very promising.
{"title":"Throughput Maximization in Software-Defined Networks with Consolidated Middleboxes","authors":"Meitian Huang, W. Liang, Zichuan Xu, M. Jia, Song Guo","doi":"10.1109/LCN.2016.58","DOIUrl":"https://doi.org/10.1109/LCN.2016.58","url":null,"abstract":"Today's computer networks rely on a wide spectrum of specialized middleboxes to improve their security and performance. Traditional middleboxes that are implemented by dedicated hardware are expensive and hard to manage. A promising technique of consolidated middleboxes - implementing traditional middleboxes in Virtual Machines (VMs) - offers economical yet simplified management of middleboxes in Software-Defined Networks (SDNs). However there are still challenges to realizing user routing requests with network function enforcement (a sequence of middleboxes) while maximizing the network throughput, due to various resource constraints on SDNs, such as forwarding table capacity at each switch, bandwidth resource capacity at each link, and computing resource capacity at each server (Physical Machine). In this paper, we study the problem of maximizing the network throughput of an SDN by admitting as many user requests as possible, where each user request has both bandwidth and computing resource demands to implement its network functions (consolidated middleboxes). We first formulate the problem as a novel network throughput maximization problem. We then provide an Integer Linear Program (ILP) solution for it if the problem size is small, otherwise, we devise two heuristics that strive for the fine tradeoff between the accuracy of solutions and the running times of achieving the solutions. We finally evaluate the performance of the proposed algorithms by simulations, based on real and synthetic network topologies. Experimental results demonstrate that the proposed algorithms are very promising.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"66 1","pages":"298-306"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72855787","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}
Industrial Control Systems (ICS) are a less obvious part of the Internet of Things with their own unique security challenges. We introduce the structure and components of typical ICS installations. We also provide an overview of a number of ICS security approaches. Contrasting these with a sampling of documented ICS security incidents highlights the relevance of this topic. Finally, this approach allows us to identify unsolved problems with respect to securing ICS.
{"title":"Key Factors in Industrial Control System Security","authors":"J. Chapman, Simon Ofner, Piotr Pauksztelo","doi":"10.1109/LCN.2016.90","DOIUrl":"https://doi.org/10.1109/LCN.2016.90","url":null,"abstract":"Industrial Control Systems (ICS) are a less obvious part of the Internet of Things with their own unique security challenges. We introduce the structure and components of typical ICS installations. We also provide an overview of a number of ICS security approaches. Contrasting these with a sampling of documented ICS security incidents highlights the relevance of this topic. Finally, this approach allows us to identify unsolved problems with respect to securing ICS.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"220 1","pages":"551-554"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85087872","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}
In capillary machine type communications, random multi-access lends itself as a natural choice at the link layer due to the largely intermittent, event-driven traffic involved. A major challenge to that end arises, however, from the anticipated large scale of the network. Considering a carrier sense multiple access based random access protocol where infrastructural support is available in the form of a coordinator node, this paper presents a framework to help sustain efficient protocol performance when faced with temporal variation in packet traffic. The coordinator dynamically determines a timely contention parameter by means of an online algorithm based on certain analytic characterizations of the protocol performance, and the end-nodes get opportunistically notified of it. Throughput, fairness and delay-variation performance produced by the proposed scheme turns out to be consistently close to an optimal protocol in identical settings, in contrast with that of the binary exponential backoff based solutions.
{"title":"On an Efficient Random Access Scheme for Capillary Machine Type Communication","authors":"K. Ashrafuzzaman, A. Fapojuwo","doi":"10.1109/LCN.2016.21","DOIUrl":"https://doi.org/10.1109/LCN.2016.21","url":null,"abstract":"In capillary machine type communications, random multi-access lends itself as a natural choice at the link layer due to the largely intermittent, event-driven traffic involved. A major challenge to that end arises, however, from the anticipated large scale of the network. Considering a carrier sense multiple access based random access protocol where infrastructural support is available in the form of a coordinator node, this paper presents a framework to help sustain efficient protocol performance when faced with temporal variation in packet traffic. The coordinator dynamically determines a timely contention parameter by means of an online algorithm based on certain analytic characterizations of the protocol performance, and the end-nodes get opportunistically notified of it. Throughput, fairness and delay-variation performance produced by the proposed scheme turns out to be consistently close to an optimal protocol in identical settings, in contrast with that of the binary exponential backoff based solutions.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"17 1","pages":"95-103"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81567897","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}
Monitoring air quality has become a major challenge of modern cities where the majority of population lives. In this paper, we focus on using wireless sensor networks for air pollution mapping. We tackle the optimization problem of sensor deployment and propose two placement models allowing to minimize the deployment cost and ensure an error-bounded air pollution mapping. Our models take into account the sensing drift of sensor nodes and the impact of weather conditions. Unlike most of existing deployment models, which assume that sensors have a given detection range, we base on interpolation methods to place sensors in such a way that pollution concentration is estimated with a bounded error at locations where no sensor is deployed. We evaluate our model on a dataset of the Lyon City and give insights on how to establish a good compromise between the deployment budget and the precision of air quality monitoring. We also compare our model to generic approaches and show that our formulation is at least 3 times better than random and uniform deployment.
{"title":"Error-Bounded Air Quality Mapping Using Wireless Sensor Networks","authors":"Ahmed Boubrima, Walid Bechkit, H. Rivano","doi":"10.1109/LCN.2016.66","DOIUrl":"https://doi.org/10.1109/LCN.2016.66","url":null,"abstract":"Monitoring air quality has become a major challenge of modern cities where the majority of population lives. In this paper, we focus on using wireless sensor networks for air pollution mapping. We tackle the optimization problem of sensor deployment and propose two placement models allowing to minimize the deployment cost and ensure an error-bounded air pollution mapping. Our models take into account the sensing drift of sensor nodes and the impact of weather conditions. Unlike most of existing deployment models, which assume that sensors have a given detection range, we base on interpolation methods to place sensors in such a way that pollution concentration is estimated with a bounded error at locations where no sensor is deployed. We evaluate our model on a dataset of the Lyon City and give insights on how to establish a good compromise between the deployment budget and the precision of air quality monitoring. We also compare our model to generic approaches and show that our formulation is at least 3 times better than random and uniform deployment.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"11 1","pages":"380-388"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82893775","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}
Today, third-party tracking services and passive traffic monitoring are extensively used to gather knowledge about users' internet activities and interests. Such tracking has significant privacy implications for the end users. This paper presents an overview of the third-party tracking usage. Using measurements, we highlight the current state of the third-party tracking landscape and differences observed across tracking service classes (e.g., advertising, analytics, and content), across domain categories (e.g., popular vs. less popular, and national vs. global domains), and with regards to the organizations that owns many of the tracker services, when using HTTP and HTTPS, respectively. Understanding these differences help answer questions related to the third-party services that track modern web users and their coverage of our browsing.
{"title":"Third-Party Tracking on the Web: A Swedish Perspective","authors":"Joel Purra, Niklas Carlsson","doi":"10.1109/LCN.2016.14","DOIUrl":"https://doi.org/10.1109/LCN.2016.14","url":null,"abstract":"Today, third-party tracking services and passive traffic monitoring are extensively used to gather knowledge about users' internet activities and interests. Such tracking has significant privacy implications for the end users. This paper presents an overview of the third-party tracking usage. Using measurements, we highlight the current state of the third-party tracking landscape and differences observed across tracking service classes (e.g., advertising, analytics, and content), across domain categories (e.g., popular vs. less popular, and national vs. global domains), and with regards to the organizations that owns many of the tracker services, when using HTTP and HTTPS, respectively. Understanding these differences help answer questions related to the third-party services that track modern web users and their coverage of our browsing.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"77 1","pages":"28-34"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89536801","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：