2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops)最新文献

Optimizing Broadcasting Scheme for VANETs Using Genetic Algorithm 利用遗传算法优化VANETs广播方案

2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.051

Muhammad Jafer, M. Khan, S. Rehman, T. Zia

引用次数: 10

An Enhancement of Multipath TCP Performance in Lossy Wireless Networks 有损无线网络中多路径TCP性能的增强

2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.046

K. Nguyen, G. Villardi, M. G. Kibria, K. Ishizu, F. Kojima, H. Shinbo

{"title":"An Enhancement of Multipath TCP Performance in Lossy Wireless Networks","authors":"K. Nguyen, G. Villardi, M. G. Kibria, K. Ishizu, F. Kojima, H. Shinbo","doi":"10.1109/LCN.2016.046","DOIUrl":"https://doi.org/10.1109/LCN.2016.046","url":null,"abstract":"Multipath TCP (MPTCP) is an evolvable technology for bandwidth aggregation on a mobile device. MPTCP naturally and concurrently exploits wireless links via different interfaces (i.e., Wi-Fi and cellular) for data transferring. Theoretically, the MPTCP's aggregated throughput is better or at least equals to the TCP throughput over a link. However, our investigation of MPTCP performance in a lossy wireless environment shows that the theoretical statement does not always hold. Specifically, the aggregation benefit of MPTCP (i.e., in a comparison to TCP) becomes negative when the loss over a link surpasses specific levels. In this paper, we focus on finding the negative region of MPTCP's aggregation benefit by experimental study. Additionally, we propose a loss-aware disabling mechanism to bypass the negativity. The mechanism temporarily switches a wireless link to a backup mode when an observed loss value reaches a threshold. We integrate the mechanism with a state-of-the-art MPTCP implementation and compare the two MPTCPs in various lossy conditions. The evaluation results confirm the effectiveness of the newly proposed mechanism in terms of enhancing goodput and saving resources.","PeriodicalId":192030,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops)","volume":"5 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":"126450336","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}

引用次数: 8

Modeling and Analysis of Virtualized Multi-Service Cloud Data Centers with Automatic Server Consolidation and Prescribed Service Level Agreements 具有自动服务器整合和规定服务水平协议的虚拟化多服务云数据中心建模与分析

2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.023

M. Mashaly, P. Kühn

{"title":"Modeling and Analysis of Virtualized Multi-Service Cloud Data Centers with Automatic Server Consolidation and Prescribed Service Level Agreements","authors":"M. Mashaly, P. Kühn","doi":"10.1109/LCN.2016.023","DOIUrl":"https://doi.org/10.1109/LCN.2016.023","url":null,"abstract":"Cloud Data Centers (CDC) are developing rapidly and will have a major impact on IT infrastructures in the future for reasons of their low ramp-up costs and service delivery/support capabilities for the users. In this paper CDCs with multi-service application classes are considered which are operated under an automatic server consolidation based on parallel hysteresis methods for server activations/deactivations which have been reported on our previous work. Each class is subjected to an individual SLA, e.g., for the average service delay for non-real-time services or for delay percentiles for services with strict response time constraints, and probabilities for service rejection (loss) or migration. The CDC is modeled by a multi-class server cluster (SC) system, each of them represented by a multi-server queuing system which is controlled by a Finite State machine (FSM) for each class of cloud services. The SC systems are analyzed exactly under Markovian assumptions to receive averages and percentiles of response times and probabilities of loss or migration. The method is novel as it minimizes the energy consumption for servers by an automatic server consolidation strategy while guaranteeing the negotiated SLAs. The method is based on a worst case boundary consideration for the delays of arriving service requests and can be useful to understand the parametric influences and to assess the energy saving gains for multi-tier CDCs.","PeriodicalId":192030,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops)","volume":"60 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":"115620762","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}

引用次数: 8

Sensitivity-Based Anonymization of Big Data 基于敏感性的大数据匿名化

2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.029

Mohammed Al-Zobbi, S. Shahrestani, Chun Ruan

{"title":"Sensitivity-Based Anonymization of Big Data","authors":"Mohammed Al-Zobbi, S. Shahrestani, Chun Ruan","doi":"10.1109/LCN.2016.029","DOIUrl":"https://doi.org/10.1109/LCN.2016.029","url":null,"abstract":"Data Analytics is widely used as a means of extracting useful information from available data. It is only natural that it is increasingly adapted for processing big data. The rapidly growing demand for big data analytics has several undesirable side-effects. Perhaps, the most significant of those relates to increased risks for data disclosure and privacy violations. Data anonymization can provide promising solutions for minimizing such risks. In this paper, we discuss some of the specific requirements of the anonymization process when dealing with big data. We show that in general, information loss is the result of avoidable generalization of similar or equivalent data. Using these analyses, we propose a novel framework for data anonymization, which expands the k-anonymity properties and concepts and takes the data class values and the sensitivity of data into account. As such, the proposed process can utilize a bottom-up approach, in contrast to most other anonymization methods. The top-down approaches usually generalize all records, the equivalent and the non-equivalent ones. Ours is more methodical, as it avoids the generalization of the equivalent records. With the inclusion of sensitivity levels, we demonstrate that our framework can reduce the iteration steps and the time required to finalize the anonymization, and therefore enhance the overall efficiency of the process.","PeriodicalId":192030,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops)","volume":"69 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":"124399232","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

Joint Rate and Queue Based Routing for Vehicular Ad-Hoc Networks 基于联合速率和队列的车辆自组织网络路由

2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.043

S. Rehman, M. A. Khan, T. Zia, Albert Y. Zomaya

{"title":"Joint Rate and Queue Based Routing for Vehicular Ad-Hoc Networks","authors":"S. Rehman, M. A. Khan, T. Zia, Albert Y. Zomaya","doi":"10.1109/LCN.2016.043","DOIUrl":"https://doi.org/10.1109/LCN.2016.043","url":null,"abstract":"In recent years, Vehicular Ad-hoc Networks (VANETs) have become important and critical part of the Intelligent Transport System (ITS). VANETs have brought the potential of new services and various applications for emergency, comfort and commercial use. However, designing a practical VANET architecture is still hindered with lot of challenges. One such challenge is to route the data packets from source to destination vehicle as per application specific need without sacrificing the Quality of Service (QoS) requirements. In order to design a practical system that meets the requirements of new applications for VANETs, we propose a new cross-layer approach for efficient and reliable routing. Our proposed model considers the wireless transmission parameters from Physical (PHY) layer as well as the system buffer capacities from the Medium Access Control (MAC) layer to make informed and accurate routing decisions at the network layer. This model can be used to cater for specific application requirements in VANET by applying varying routing decisions depending on node specific attributes such as commodity data, queue backlog and rate allocation. The model exemplifies a multi-hop backpressure architecture in VANET where each vehicle is trying to select the next-hop vehicle on the basis of buffer size (queue backlogs), the data to be send (commodity) as well as the channel rate allocated. The key objective here is the optimal selection of next hop vehicle for information dissemination by integrating these metrics. We classify this as a rational Constraint Driven Problem (CDP) and we explore an optimal solution to this problem. Using a systematic mathematical model formulation and extensive simulations, we present the performance analysis of our exemplary model by deriving values of relevant key performance indicators applicable in such an environment.","PeriodicalId":192030,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops)","volume":"48 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":"123623468","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

The Swarm as a Service: Virtualization of Motion The Swarm as a Service:运动虚拟化

2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.038

Daniel Graff, R. Karnapke

引用次数: 1

Simulation Framework for a Security Protocol for Wireless Body Sensor Networks 无线身体传感器网络安全协议的仿真框架

2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.055

H. A. Hamadi, A. Gawanmeh, M. Al-Qutayri

引用次数: 1

An Efficient VNE Algorithm via Preferentially Mapping Important Nodes 基于优先映射重要节点的高效VNE算法

2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.026

Yanyu Li, Yunchun Li, Min Shu, Jiqiang Tang, Yigang Peng

引用次数: 4

Decentralized Time-Based Target Searching Algorithm Using Sensor Network Topology Maps 基于传感器网络拓扑图的分散时间目标搜索算法

2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.044

Ashanie Gunathillake, A. Savkin, A. Jayasumana

引用次数: 3

Nested Rollout Policy Adaptation for Optimizing Vehicle Selection in Complex VRPs 复杂vrp车辆选择优化的嵌套推出策略自适应

2016 IEEE 41st Conference on Local Computer Networks Workshops (LCN Workshops) Pub Date : 2016-11-01 DOI: 10.1109/LCN.2016.050

Ashraf Abdo, S. Edelkamp, M. Lawo

引用次数: 10