2016 IEEE 41st Conference on Local Computer Networks (LCN)最新文献_第5页

Confidentiality and Authenticity for Distributed Version Control Systems - A Mercurial Extension 分布式版本控制系统的机密性和真实性-一个Mercurial扩展

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

Michael Lass, Dominik Leibenger, Christoph Sorge

引用次数: 3

Carving Software-Defined Networks for Scientific Applications with SpateN 用SpateN雕刻科学应用的软件定义网络

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

Celio Trois, L. C. E. Bona, Marcos Didonet Del Fabro, M. Martinello

引用次数: 2

Probr - A Generic and Passive WiFi Tracking System Probr -一种通用的无源WiFi跟踪系统

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

Joel Scheuner, Genc Mazlami, Dominik Schöni, Sebastian Stephan, A. D. Carli, T. Bocek, B. Stiller

引用次数: 17

Improved Energy-Aware Routing Algorithm in Software-Defined Networks 软件定义网络中改进的能量感知路由算法

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

Adriana Fernández-Fernández, C. Cervelló-Pastor, Leonardo Ochoa-Aday

引用次数: 13

Man-In-the-Middle Anycast (MIMA): CDN User-Server Assignment Becomes Flexible 中间人任意播(MIMA): CDN用户服务器分配变得灵活

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

Jeffrey Lai, Q. Fu

{"title":"Man-In-the-Middle Anycast (MIMA): CDN User-Server Assignment Becomes Flexible","authors":"Jeffrey Lai, Q. Fu","doi":"10.1109/LCN.2016.74","DOIUrl":"https://doi.org/10.1109/LCN.2016.74","url":null,"abstract":"Within Content Delivery Networks (CDNs), users are typically geographically load-balanced across multiple servers in order to provide better performance and locality - users are assigned to the content servers close to them. One approach to user-server assignment is the use of IP anycast, where all the content servers use the same IP address. A user request is then routed to the server closest to the user, determined by the routing protocols such as BGP. However, there are problems associated with this anycast-based approach. IP anycast is generally incapable of updating or redirecting users to a different (better) server without breaking already established TCP sessions. Moreover, the CDN operators do not have much control on where to redirect the users - it is completely controlled by Internet routing. In this paper we present our Man-In-the-Middle Anycast (MIMA) architecture, a novel anycast-based design that leverages Network Functions Virtualization (NFV) and Software Defined Networking (SDN) techniques to enable flexible and efficient user-server assignment. We demonstrate that the MIMA architecture is capable of performing flexible user-server assignment and offloading during times of high demand, such as flash crowd events that are becoming more common in a media-focused Internet. These capabilities offered by MIMA provide CDN operators a higher degree of flexibility in network management and content provisioning by enabling flexible user-server assignment.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"2 1","pages":"451-459"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87944563","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

The Early Bird Gets the Botnet: A Markov Chain Based Early Warning System for Botnet Attacks 早起的鸟儿得到僵尸网络:基于马尔可夫链的僵尸网络攻击预警系统

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

Zainab Abaid, D. Sarkar, M. Kâafar, Sanjay Jha

引用次数: 18

Toward Coexistence of Different Congestion Control Mechanisms 不同拥塞控制机制的共存研究

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

Mario Hock, R. Bless, M. Zitterbart

引用次数: 7

BAH: A Bitmap Index Compression Algorithm for Fast Data Retrieval BAH:一种快速数据检索的位图索引压缩算法

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

Chenxing Li, Zhen Chen, Wenxun Zheng, Yinjun Wu, Junwei Cao

{"title":"BAH: A Bitmap Index Compression Algorithm for Fast Data Retrieval","authors":"Chenxing Li, Zhen Chen, Wenxun Zheng, Yinjun Wu, Junwei Cao","doi":"10.1109/LCN.2016.120","DOIUrl":"https://doi.org/10.1109/LCN.2016.120","url":null,"abstract":"Efficient retrieval of traffic archival data is a must-have technique to detect network attacks, such as APT(advanced persistent threat) attack. In order to take insight from Internet traffic, the bitmap index is increasingly used for efficiently querying over large datasets. However, a raw bitmap index leads to high space consumption and overhead on loading indexes. Various bitmap index compression algorithms are proposed to save storage while improving query efficiency. This paper proposes a new bitmap index compression algorithm called BAH (Byte Aligned Hybrid compression coding). An acceleration algorithm using SIMD is designed to increase the efficiency of AND operation over multiple compressed bitmaps. In all, BAH has a better compression ratio and faster intersection querying speed compared with several previous works such as WAH, PLWAH, COMPAX, Roaring etc. The theoretical analysis shows that the space required by BAH is no larger than 1.6 times the information entropy of the bitmap with density larger than 0.2%. In the experiments, BAH saves about 65% space and 60% space compared with WAH on two datasets. The experiments also demonstrate the query efficiency of BAH with the application in Internet Traffic and Web pages.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"40 1","pages":"697-705"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78582556","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

Maximum Likelihood Topology Maps for Wireless Sensor Networks Using an Automated Robot 基于自动化机器人的无线传感器网络最大似然拓扑图

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

Ashanie Gunathillake, A. Savkin, A. Jayasumana

{"title":"Maximum Likelihood Topology Maps for Wireless Sensor Networks Using an Automated Robot","authors":"Ashanie Gunathillake, A. Savkin, A. Jayasumana","doi":"10.1109/LCN.2016.62","DOIUrl":"https://doi.org/10.1109/LCN.2016.62","url":null,"abstract":"Topology maps represent the layout arrangement of nodes while maintaining the connectivity. As it is extracted using connectivity information only, it does not accurately represent the physical layout such as physical voids, shape, and relative distances among physical positions of sensor nodes. A novel concept Maximum Likelihood-Topology Maps for Wireless Sensor Networks is presented. As it is based on a packet reception probability function, which is sensitive to the distance, it represents the physical layout more accurately. In this paper, we use a binary matrix recorded by a mobile robot representing the reception of packets from sensor nodes by the mobile robot at different locations along the robots trajectory. Maximum likelihood topology coordinates are then extracted from the binary matrix by using a packet receiving probability function. Also, the robot trajectory is automated to avoid the obstacles and cover the entire network within least possible amount of time. The result shows that our algorithm generates topology maps for various network shapes under different environmental conditions accurately, and that it outperforms the existing algorithms by representing the physical layout of the network more accurately.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"11 1","pages":"339-347"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88637826","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}

引用次数: 10

Latency and Lifetime-Aware Clustering and Routing in Wireless Sensor Networks 无线传感器网络中的时延和寿命感知聚类和路由

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

Chuanyao Nie, Hui Wu, Wenguang Zheng

引用次数: 9