37th Annual IEEE Conference on Local Computer Networks最新文献

筛选
英文 中文
Strategies for automatic labelling of web traffic traces 网络流量轨迹自动标记策略
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423605
L. M. Torres, E. Magaña, M. Izal, D. Morató
{"title":"Strategies for automatic labelling of web traffic traces","authors":"L. M. Torres, E. Magaña, M. Izal, D. Morató","doi":"10.1109/LCN.2012.6423605","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423605","url":null,"abstract":"In the field of traffic classification, previous efforts have been centered on identifying applications (HTTP, SMTP, FTP, etc) rather than the actual services that they provide (email, file transfer, video streaming, etc.). Nowadays, however, a single application as HTTP can provide multiple services for the end-user. Some methods have been proposed to distinguish between these services but tuning and testing them remains a challenge as there is no easy way to obtain labelled HTTP traffic traces. In this paper we present a method to discover server IP addresses related to a specific website in a traffic trace. Our method uses NetFlow-type records which makes it scalable an impervious to encryption of packet payloads. By applying the method to a representative set of websites the resulting list of IP addresses can be used to label a sizeable number of connections in the trace.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"14 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":"129456142","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
A differential game theoretic model for real-time spectrum pricing in cognitive radio networks 认知无线电网络中实时频谱定价的微分博弈论模型
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423617
D. Hao, Atsushi Iwasaki, M. Yokoo
{"title":"A differential game theoretic model for real-time spectrum pricing in cognitive radio networks","authors":"D. Hao, Atsushi Iwasaki, M. Yokoo","doi":"10.1109/LCN.2012.6423617","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423617","url":null,"abstract":"In cognitive radio networks, one key feature of spectrum trading is its short term or, even, real time, since the spectrum availability, quality, and price keep changing over time. Therefore, a spectrum pricing policy should be dynamically optimal. In this work, we address the real-time optimal pricing problem for primary users. Based on differential game model, we analyze the optimal pricing strategy for QoS-aware dynamic networks in which the secondary users' number and primary users' QoS level keep changing over time. Nash equilibrium is derived and an optimal pricing and QoS setting policy is formulated. Since the Nash equilibrium of our differential game based model deals with optimal pricing in each time instance, the real-time optimal pricing characteristic can be realized.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"14 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":"130017649","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
Multi-resolution elliptic curve digital signature 多分辨率椭圆曲线数字签名
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423691
Panoat Chuchaisri, R. Newman
{"title":"Multi-resolution elliptic curve digital signature","authors":"Panoat Chuchaisri, R. Newman","doi":"10.1109/LCN.2012.6423691","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423691","url":null,"abstract":"Broadcast authentication mechanisms are essential to cyber-physical systems that communicate through wireless links such as wireless sensor networks (WSN) and body area network (BAN). Even though symmetric key-based authentication schemes are more prevalent among these systems, public key-based digital signature schemes have started to gain ground; notably, several research efforts have been focused on the Elliptic Curve Cryptosystem due to its low overheads. As a combination of sensing and computing platform, WSN must handle both time-sensitive as well as delay-tolerant but security-sensitive data. The cryptographic strength and verification delay of an elliptic curve digital signature are determined by the parameters of the curve's underlying finite held. The held's parameters and public key are usually generated and distributed before the WSN's deployment thus cannot be changed easily. This situation creates a need for a multi-resolution digital signature scheme that provides the signer a choice to trade off a signature's strength for faster verification time and less power consumption. In this paper, we present a digital signature scheme called Multi-Resolution Elliptic Curve Signature (MRECS) that allows the signer the ability to create signatures of different strengths from the same public key set. Compared to an implementation using a set of different keys, MRECS requires less storage overhead and has longer key lifetime at the cost of slightly higher but acceptable communication overhead. MRECS yields up to 33% computational overhead reduction compared to that of the full-size signature while maintaining a full elliptic curve strength regardless of a signature strength.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"70 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":"125912491","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
Intrusion detection in computer networks using Optimum-Path Forest clustering 基于最优路径森林聚类的计算机网络入侵检测
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423588
K. Costa, C. R. Pereira, R. Nakamura, J. Papa
{"title":"Intrusion detection in computer networks using Optimum-Path Forest clustering","authors":"K. Costa, C. R. Pereira, R. Nakamura, J. Papa","doi":"10.1109/LCN.2012.6423588","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423588","url":null,"abstract":"Nowadays, organizations face the problem of keeping their information protected, available and trustworthy. In this context, machine learning techniques have also been extensively applied to this task. Since manual labeling is very expensive, several works attempt to handle intrusion detection with traditional clustering algorithms. In this paper, we introduce a new pattern recognition technique called Optimum-Path Forest (OPF) clustering to this task. Experiments on three public datasets have showed that OPF classifier may be a suitable tool to detect intrusions on computer networks, since it outperformed some state-of-the-art unsupervised techniques.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"21 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":"128169439","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
Detecting covert communication on Android 检测Android上的秘密通信
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423634
Michael Hansen, Raquel L. Hill, Seth Wimberly
{"title":"Detecting covert communication on Android","authors":"Michael Hansen, Raquel L. Hill, Seth Wimberly","doi":"10.1109/LCN.2012.6423634","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423634","url":null,"abstract":"Using covert channels, malicious applications on Android-based smartphones are able to subvert the permission system and share data in a potentially untraceable manner. These channels are easy to exploit today, and have enough bandwidth to transmit sensitive information in real-time between collaborating applications. In this paper, we define and implement an application layer covert communications detector that does not require special permission from the user. We quantify the effect our detector has on channel capacities for malicious applications that wish to remain stealthy. Lastly, we evaluate the robustness of the volume and vibration channels on the Android emulator, HTC G1, and Motorola Droid, as well as characterize the effects of background noise on data loss and transfer rates.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"140 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":"127275082","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}
引用次数: 13
DELTA: Delta encoding for less traffic for apps DELTA: DELTA编码,减少应用程序的流量
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423611
Nikolai Samteladze, Ken Christensen
{"title":"DELTA: Delta encoding for less traffic for apps","authors":"Nikolai Samteladze, Ken Christensen","doi":"10.1109/LCN.2012.6423611","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423611","url":null,"abstract":"The number of applications (or apps) in the Android Market exceeded 450,000 in 2012 with more than 11 billion total downloads. The necessity to fix bugs and add new features leads to frequent app updates. For each update, a full new version of the app is downloaded to the user's smart phone; this generates significant traffic in the network. We propose to use delta encoding algorithms and to download only the difference between two versions of an app. We implement delta encoding for Android using the bsdiff and bspatch tools and evaluate its performance. We show that app update traffic can be reduced by about 50%, this can lead to significant cost and energy savings.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"1 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":"130330086","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}
引用次数: 33
On bandwidth reservation for optimal resource utilization in high-performance networks 基于带宽预留的高性能网络资源优化利用研究
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423592
Poonam Dharam, C. Wu, Mengxia Zhu
{"title":"On bandwidth reservation for optimal resource utilization in high-performance networks","authors":"Poonam Dharam, C. Wu, Mengxia Zhu","doi":"10.1109/LCN.2012.6423592","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423592","url":null,"abstract":"Many high-performance networks support both advance and immediate bandwidth reservations, the former reserving bandwidth ahead of time in a future time slot to provide guaranteed bandwidth, while the latter allocating bandwidth upon availability in the next immediate time slot. As a result, an ongoing data transfer task based on an immediate reservation may be preempted by the activation of an advance reservation due to the lack of bandwidth. We propose a bandwidth reservation solution to optimize network resource utilization by exploring the interactions between advance and immediate reservations. This solution integrates two major interrelated components: (i) We design a scheduling algorithm based on rigorous statistical analysis of reservation dynamics to route incoming advance reservations with minimal impact on immediate reservations. (ii) We design a preemption scheme to minimize the actual number of immediate reservations that must be preempted at runtime due to insufficient bandwidth. The performance superiority of the proposed bandwidth reservation solution is illustrated by extensive simulations in comparison with existing methods.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"49 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131829534","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
Distributed Decode and Forward Beamforming 分布式解码和前向波束形成
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423658
Chris Walsh, Douglas Hakkarinen, T. Camp
{"title":"Distributed Decode and Forward Beamforming","authors":"Chris Walsh, Douglas Hakkarinen, T. Camp","doi":"10.1109/LCN.2012.6423658","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423658","url":null,"abstract":"Distributed transmit beamforming is a wireless communication technique in which multiple independent antennas transmit a common message while controlling their transmitted carrier phases to constructively interfere the message at a destination. Depending on the transmission goals and choice of network parameters, certain noteworthy benefits arise from beamforming. These benefits may include improved received signal to noise ratios, increased transmission ranges, power consumption reductions, or physical layer security against eavesdropping. We present a distributed cross-layer cooperative beamforming protocol implemented into the IEEE 802.11 wireless communication stack: Distributed Decode and Forward Beamforming. In this paper we conduct a brief literature review of current beamforming research, and present a detailed discussion on the mathematical foundation of the single- and multi-destination decode and forward beamforming technique. We then describe our distributed multi-destination decode and forward beamforming protocol, and present results from our in-depth evaluation of our protocol in a realistic simulation environment. In our evaluation, we investigate five aspects of our distributed beamforming protocol: beamforming event frequency, queue length, latency, participation level, and throughput.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"29 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":"133151649","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
How's My Network? Predicting performance from within a Web browser sandbox 我的社交网络怎么样?从Web浏览器沙盒内预测性能
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423670
M. Kaplan, Mihajlo Zeljkovic, M. Claypool, C. Wills
{"title":"How's My Network? Predicting performance from within a Web browser sandbox","authors":"M. Kaplan, Mihajlo Zeljkovic, M. Claypool, C. Wills","doi":"10.1109/LCN.2012.6423670","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423670","url":null,"abstract":"Measuring Internet performance for home users can provide useful information for improving networks. Unfortunately, Internet measurements typically require users to install special software, a major impediment to use. To overcome this impediment, we designed and implemented several scripting techniques to predict Internet performance from within the tightly constrained sandbox environment of a Web browser. Our techniques are integrated into a Web site project called “How's My Network” that provides predictions for common Internet activities, with this paper concentrating on the performance of online news, social networks, and online shopping. The contributions of this work include the design, implementation and evaluation of new approaches for predicting Web browser performance.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"116 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":"115646745","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
TDMA for wireless passive backscatter networks: An information theoretic approach 无线无源反向散射网络的TDMA:一种信息论方法
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423624
Aditya V. Padaki, M. Zawodniok
{"title":"TDMA for wireless passive backscatter networks: An information theoretic approach","authors":"Aditya V. Padaki, M. Zawodniok","doi":"10.1109/LCN.2012.6423624","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423624","url":null,"abstract":"The passive backscatter technology is increasingly employed in wireless sensor network (WSN) applications. In contrast to existing technologies it offers several advantages including a battery-less operation, extremely small-form factor, and low costs. Our previous works demonstrated that theoretically such backscatter-based network outperforms existing solutions. In contrast, this paper presents a new time division multiple access (TDMA) based approach that considers a practical realization of the multi-hop framework. The capacity limits for the proposed scheme are evaluated for two frameworks - (a) single hop with direct backscatter signal and (b) a multi-hop transmission. An analytical comparison shows that the multi-hop transmission improves the per-node capacity over the single-hop scenario. Numerical simulations verify the theoretical conclusions.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"267 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":"124343889","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
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学术官方微信