37th Annual IEEE Conference on Local Computer Networks最新文献_第8页

3DSVAT: A 3D Stereoscopic Vulnerability Assessment Tool for network security 3DSVAT:面向网络安全的三维立体漏洞评估工具

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423586

Troy Nunnally, A. Uluagac, J. Copeland, R. Beyah

{"title":"3DSVAT: A 3D Stereoscopic Vulnerability Assessment Tool for network security","authors":"Troy Nunnally, A. Uluagac, J. Copeland, R. Beyah","doi":"10.1109/LCN.2012.6423586","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423586","url":null,"abstract":"As the volume of network data continues to increase and networks become more complex, the ability to accurately manage and analyze data quickly becomes a difficult problem. Many network management tools already use two-dimensional (2D) and three-dimensional (3D) visualization techniques to help support decision-making and reasoning of network anomalies and activity. However, a poor user interface combined with the massive amount of data could obfuscate important network details. As a result, administrators may fail to detect and identify malicious network behavior in a timely manner. 3D visualizations address this challenge by introducing monocular and binocular visual cues to portray depth and to increase the perceived viewing area. In this work, we explore these cues for 3D network security applications, with a particular emphasis on binocular disparity or stereoscopic 3D. Currently, no network security tool takes advantage of the enhanced depth perception provided by stereoscopic 3D technologies for vulnerability assessment. Compared to traditional 3D systems, stereoscopic 3D helps improve the perception of depth, which can, in turn reduce the number of errors and increase response times of network administrators. Thus, we introduce a stereoscopic 3D visual Framework for Rendering Enhanced 3D Stereoscopic Visualizations for Network Security (FRE3DS). Our novel framework uses state-of-the art 3D graphics rendering to assist in 3D visualizations for network security applications. Moreover, utilizing our framework, we propose a new 3D Stereoscopic Vulnerability Assessment Tool (3DSVAT). We illustrate the use of 3DSVAT to assist in rapid detection and correlation of attack vulnerabilities in a subset of a modified local area network data set using the enhanced perception of depth in a stereoscopic 3D environment.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122240192","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}

引用次数: 7

Rapid and generalized identification of packetized voice traffic flows 分组话音流量的快速和广义识别

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423690

P. Branch, J. But

引用次数: 15

Resiliency taxonomy of routing protocols in Wireless Sensor Networks 无线传感器网络中路由协议的弹性分类

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423640

Ochirkhand Erdene-Ochir, M. Minier, F. Valois, A. Kountouris

引用次数: 3

HOPSCOTCH: An adaptive and distributed channel hopping technique for interference avoidance in Wireless Sensor Networks HOPSCOTCH:一种用于无线传感器网络中避免干扰的自适应分布式信道跳变技术

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423685

Dingwen Yuan, Michael Riecker, M. Hollick

引用次数: 3

Agnostic broadcast rendezvous for cognitive radio networks using channel hopping 使用信道跳频的认知无线网络的不可知广播会合

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423686

Raphael M. Guedes, Marcel William Rocha da Silva, P. S. Coutinho, J. Rezende

{"title":"Agnostic broadcast rendezvous for cognitive radio networks using channel hopping","authors":"Raphael M. Guedes, Marcel William Rocha da Silva, P. S. Coutinho, J. Rezende","doi":"10.1109/LCN.2012.6423686","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423686","url":null,"abstract":"Cognitive radios (CRs) are a promising solution for the spectrum scarcity problem. These radios access the spectrum in an opportunistic manner in order to take advantage of frequency bands, i.e. channels, left unused by primary users while not interfering with them. This opportunistic access model requires CRs to switch among channels searching for new opportunities and making contact with their neighbors to exchange the information needed for spectrum management. This search process, known as rendezvous (RV), is termed blind RV when it does not use a common control channel (CCC) or a centralized solution. Several algorithms have been proposed to deal with the blind RV problem. However, most of them do not deal with broadcast transmissions, that is, when a CR wants to exchange information with all its neighboring nodes. This paper proposes a broadcast mechanism that operates on top of different one-to-one RV algorithms but being agnostic to the one in use, i.e., any such mechanism can be combined with it. Simulation results show that the proposed mechanism achieves a favorable performance while inheriting the good properties of the underlying one-to-one RV algorithm.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121850941","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

Dynamic file bundling for large-scale content distribution 用于大规模内容分发的动态文件捆绑

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/lcn.2012.6423681

Song Zhang, Niklas Carlsson, D. Eager, Zongpeng Li, A. Mahanti

{"title":"Dynamic file bundling for large-scale content distribution","authors":"Song Zhang, Niklas Carlsson, D. Eager, Zongpeng Li, A. Mahanti","doi":"10.1109/lcn.2012.6423681","DOIUrl":"https://doi.org/10.1109/lcn.2012.6423681","url":null,"abstract":"One highly-scalable approach to content delivery is to harness the upload bandwidth of the clients. Peer-assisted content delivery systems have been shown to effectively offload the servers of popular files, as the request rates of popular content enable the formation of self-sustaining torrents, where the entire content of the file is available among the peers themselves. However, for less popular files, these systems are less helpful in offloading servers. With a long tail of mildly popular content, with a high aggregate demand, a large fraction of the file requests must still be handled by servers. In this paper, we present the design, implementation, and evaluation of a dynamic file bundling system, where peers are requested to download content which they may not otherwise download in order to “inflate” the popularity of less popular files. Our system introduces the idea of a super bundle, which consists of a large catalogue of files. From this catalogue, smaller bundles, consisting of a small set of files, can dynamically be assigned to individual users. The system can dynamically adjust the number of downloaders of each file and thus enables the popularity inflation to be optimized according to current file popularities and the desired tradeoff between download times and server resource usage. The system is evaluated on PlanetLab.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117068422","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

On using game theory to balance energy consumption in heterogeneous wireless sensor networks 基于博弈论的异构无线传感器网络能耗平衡研究

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423676

Xiaohui Lin, Hui Wang

引用次数: 11

Protecting IEEE 802.11s wireless mesh networks against insider attacks 保护IEEE 802.11s无线网状网络免受内部攻击

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423614

A. Reinhardt, Daniel Seither, André König, R. Steinmetz, M. Hollick

{"title":"Protecting IEEE 802.11s wireless mesh networks against insider attacks","authors":"A. Reinhardt, Daniel Seither, André König, R. Steinmetz, M. Hollick","doi":"10.1109/LCN.2012.6423614","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423614","url":null,"abstract":"IEEE 802.11s is an emerging standard for wireless mesh networks. Networks based on IEEE 802.11s directly benefit from existing security mechanisms in IEEE 802.11. This limits the attack surface of IEEE 802.11s significantly for adversaries that cannot authenticate with the network. Mesh networks are, however, often conceived for community network scenarios, which are inherently more open than managed infrastructure networks. This openness entails an increased risk of insider attacks, i.e., attacks by compromised stations that can authenticate with the network. Currently, IEEE 802.11s is lacking adequate protection against such insider attacks. In this paper, we hence derive an attack model for insider attacks and present two insider attack strategies to which IEEE 802.11s networks are prone, namely impairing the network performance and preventing communication between a pair of nodes. We design countermeasures that allow to defend the wireless network against both types of attacks. Our implementations only incur marginal computational and memory overheads, while the network security is measurably strengthened.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133641058","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

A cross layer approach to the novel distributed scheduling protocol and event-triggered controller design for Cyber Physical Systems 网络物理系统分布式调度协议与事件触发控制器设计的跨层方法

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423616

Hao Xu, S. Jagannathan

{"title":"A cross layer approach to the novel distributed scheduling protocol and event-triggered controller design for Cyber Physical Systems","authors":"Hao Xu, S. Jagannathan","doi":"10.1109/LCN.2012.6423616","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423616","url":null,"abstract":"In Cyber Physical Systems (CPS), multiple real-time dynamic systems are connected to their corresponding controllers through a shared communication network in contrast with a dedicated line. For such CPS, the existing scheduling schemes for instance Centralized or Distributed Scheduling schemes are unsuitable since the behavior of real-time dynamic systems is ignored during the network protocol design. Therefore, in this paper, a novel distributed scheduling protocol design via cross-layer approach is proposed to optimize the performance of CPS by maximizing the utility function which is generated by using the information collected from both the application and network layers. Subsequently, a novel adaptive model based optimal event-triggered control scheme is derived for each real-time dynamic system with unknown system dynamics in the application layer. Compared with traditional scheduling algorithms, the proposed distributed scheduling scheme via cross-layer approach can not only allocates the network resources efficiently but also improves the performance of the overall real-time dynamic system.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134026827","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

Efficient construction of directed Redundant Steiner trees 有向冗余Steiner树的高效构造

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423587

Y. Bejerano, S. Jana, P. Koppol

{"title":"Efficient construction of directed Redundant Steiner trees","authors":"Y. Bejerano, S. Jana, P. Koppol","doi":"10.1109/LCN.2012.6423587","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423587","url":null,"abstract":"Multicast is getting increasingly popular to support critical business services such as IPTV, video conferencing and content distribution. To meet the stringent availability requirements, a highly fault resilient multicast infrastructure is critically important. Redundant Steiner trees (RST) are one mechanism for realizing such infrastructure. RSTs are a pair of Steiner trees that ensure that for any single link or node failure in the network, every destination node of a multicast connection is reachable from the source on at least one of these two trees. In this paper, we consider the problem of constructing optimal RSTs in a directed graph, which is NP-complete. In light of this, we propose a simple and efficient scheme to construct near-optimal RSTs. The scheme ensures an approximation ratio of 2k for general directed graphs, where k denotes the number of destination nodes. We compare the performance of our scheme with an linear program (LP) formulation of the problem that provides a lower bound on the optimal solution. Our simulations illustrate that our scheme constructs near optimal RSTs independent of the number of destination nodes and significantly outperforms other approaches proposed in prior literature.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129220003","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}

引用次数: 7