2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)最新文献

筛选
英文 中文
Defeating the insider threat via autonomic network capabilities 通过自主网络能力击败内部威胁
Faisal M. Sibai, D. Menascé
{"title":"Defeating the insider threat via autonomic network capabilities","authors":"Faisal M. Sibai, D. Menascé","doi":"10.1109/COMSNETS.2011.5716431","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716431","url":null,"abstract":"There has been a constant growing security concern on insider attacks on network accessible computer systems. Users with power credentials can do almost anything they want with the systems they own with very little control or oversight. Most breaches occurring nowadays by power users are considered legitimate access and not necessarily intrusions. Developing a solution for such a problem is challenging because power users need flexible requirements to administer or maintain their systems. The increased usage of virtual environments, virtual systems, teleworking, and remote usage has made network access the preferred method for system administration. This paper presents (1) the Autonomic Violation Prevention System (AVPS), a framework that provides a solution to this problem and meet the above mentioned challenges, and (2) a proof-of-concept prototype that embeds self-protection capabilities into traditional Network Intrusion Prevention Systems (NIPS). AVPS focuses on self-protection against security policy violations instead of malware, vulnerability, or exploit intrusions. AVPS heavily enforces separation of duties, promotes scalability, ease of use and manageability. The proof-of-concept prototype uses Snort in-line NIPS with our own customizations.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125543328","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}
引用次数: 20
Hulu in the neighborhood 附近的Hulu
Dongsu Han, D. Andersen, M. Kaminsky, K. Papagiannaki, S. Seshan
{"title":"Hulu in the neighborhood","authors":"Dongsu Han, D. Andersen, M. Kaminsky, K. Papagiannaki, S. Seshan","doi":"10.1109/COMSNETS.2011.5716501","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716501","url":null,"abstract":"Internet Service Providers (ISPs) are in a constant race to meet the bandwidth demands of their subscribers. Access link upgrades, however, are expensive and take years to deploy. Many ISPs are looking for alternative solutions to reduce the need for continuous and expensive infrastructure expansion. This paper shows that there are many forms of local connectivity and storage in residential environments, and that these resources can be used to relieve the access network load. Making effective use of this local connectivity, however, introduces several challenges that require careful application and protocol design.We present a new system for a neighborhood-assisted video-on-demand service that reduces access link traffic by carefully placing VoD data across the neighborhood. We demonstrate that this approach can reduce the access network traffic that ISPs must provision for by up to 45% while still providing high-quality service.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128730051","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
Augmenting topic models with user relations in context based communication services 在基于上下文的通信服务中增强带有用户关系的主题模型
V. T. Babu, K. Dhara, V. Krishnaswamy
{"title":"Augmenting topic models with user relations in context based communication services","authors":"V. T. Babu, K. Dhara, V. Krishnaswamy","doi":"10.1109/COMSNETS.2011.5716478","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716478","url":null,"abstract":"Context-based communication services analyze user data and offer new and novel services that enhance end user unified communication experience. These services rely on data analysis and machine learning techniques to predict user behavior. In this paper we look at topic modeling as an unsupervised learning tool to categorize user communication data for retrieval. However, modeling topics based on user communication data, such as emails, meetings, invites, etc, poses several interesting challenges. One challenge is that user communication, even for a single topic, varies with the current context of the participating users. Other challenges include low lexical content and high contextual data in communication corpus. Hence, relying primarily on lexical analysis could result in inferior topic models. In this paper, we look at this problem of modeling topics for documents based on user communication. First, we use Latent Dirichlet Allocation (LDA) for extracting topics. LDA models documents as a mixture of latent topics where each topic consists of a probabilistic distribution over words. Then we use a technique that overlays a user-relational model over the lexical topic model generated by LDA. In this paper, we present our work and discuss our results.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129925177","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
Loss behavior analysis and its application in design of link quality metrics 损耗行为分析及其在链路质量指标设计中的应用
Kameswari Chebrolu, Advait Mishra
{"title":"Loss behavior analysis and its application in design of link quality metrics","authors":"Kameswari Chebrolu, Advait Mishra","doi":"10.1109/COMSNETS.2011.5716415","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716415","url":null,"abstract":"Wireless losses play a significant role in determining the performance of many higher-layer protocols. Various measurement studies have presented results that explore the many facets of link behaviour. However, the results have often been contradictory. In the first half of the paper, we delve into understanding the underlying causes of losses and resolve two contradictions that appear in literature. One of the key insight we gain from this study is how packet loss manifests as a function of the packet count over which the averaging is done. This observation has wide applicability in many research domains that routinely employ loss rate measurements to dictate protocol behavior. To illustrate this point, we focus on a specific research domain: link quality metrics as employed in routing protocols. In the second half of the paper, we show that the popular link quality metric ETX [1] and variants thereof employ incorrect averaging which results in unstable and degraded performance. We modify the averaging mechanism based on our insight and term this modified version SLIQ. SLIQ stands for stability based link quality metric. The modification is simple yet subtle, and the performance improvement it provides is substantial. We carry out our evaluation of these metrics using realistic traces obtained from a wireless 802.11a testbed. We consider the impact the modified link metric has at both the routing layer and the application layer by defining appropriate performance metrics. When compared with ETX and another previously proposed metric ROMA [2], SLIQ provides stable and persistent routes (cuts the number of route flaps by a factor of 6) and can support twice as many high quality voice calls as ETX.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126407480","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 local and global effects of traffic shaping in the internet 互联网流量形成的本地和全球影响
M. Marcon, Marcel Dischinger, K. Gummadi, Amin Vahdat
{"title":"The local and global effects of traffic shaping in the internet","authors":"M. Marcon, Marcel Dischinger, K. Gummadi, Amin Vahdat","doi":"10.1109/COMSNETS.2011.5716420","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716420","url":null,"abstract":"The Internet is witnessing explosive growth in traffic, in large part due to bulk transfers. Delivering such traffic is expensive for ISPs because they pay other ISPs based on peak utilization. To limit costs, many ISPs are deploying ad-hoc traffic shaping policies that specifically target bulk flows. However, there is relatively little understanding today about the effectiveness of different shaping policies at reducing peak loads and what impact these policies have on the performance of bulk transfers. In this paper, we compare several traffic shaping policies with respect to (1) the achieved reduction in peak network traffic and (2) the resulting performance loss for bulk transfers. We identified a practical policy that achieves peak traffic reductions of up to 50% with only limited performance loss for bulk transfers. However, we found that the same policy leads to large performance losses for bulk transfers when deployed by multiple ISPs along a networking path. Our analysis revealed that this is caused by certain TCP characteristics and differences in local peak utilization times.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"293 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132720729","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}
引用次数: 52
Vis-à-Vis: Privacy-preserving online social networking via Virtual Individual Servers Vis-à-Vis:通过虚拟个人服务器保护在线社交网络的隐私
Amre Shakimov, Harold Lim, R. Cáceres, Landon P. Cox, Kevin A. Li, Dongtao Liu, A. Varshavsky
{"title":"Vis-à-Vis: Privacy-preserving online social networking via Virtual Individual Servers","authors":"Amre Shakimov, Harold Lim, R. Cáceres, Landon P. Cox, Kevin A. Li, Dongtao Liu, A. Varshavsky","doi":"10.1109/COMSNETS.2011.5716497","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716497","url":null,"abstract":"Online social networks (OSNs) are immensely popular, but their centralized control of user data raises important privacy concerns. This paper presents Vis-à-Vis, a decentralized framework for OSNs based on the privacy-preserving notion of a Virtual Individual Server (VIS). A VIS is a personal virtual machine running in a paid compute utility. In Vis-à-Vis, a person stores her data on her own VIS, which arbitrates access to that data by others. VISs self-organize into overlay networks corresponding to social groups. This paper focuses on preserving the privacy of location information. Vis-à-Vis uses distributed location trees to provide efficient and scalable operations for sharing location information within social groups. We have evaluated our Vis-à-Vis prototype using hundreds of virtual machines running in the Amazon EC2 compute utility. Our results demonstrate that Vis-à-Vis represents an attractive complement to today's centralized OSNs.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131899216","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}
引用次数: 140
Distributed fault tolerance for WSNs with routing tree overlays 具有路由树覆盖的wsn的分布式容错
Shanti Chilukuri, A. Sahoo
{"title":"Distributed fault tolerance for WSNs with routing tree overlays","authors":"Shanti Chilukuri, A. Sahoo","doi":"10.1109/COMSNETS.2011.5716433","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716433","url":null,"abstract":"WSNs are inherently power constrained and are often deployed in harsh environments. As such, node death is a possibility that must be considered while designing protocols for such networks. Rerouting of data is generally necessary so that data from the descendant nodes of the dead node can reach the sink. Since slot allocation in TDMA MAC protocols is generally done based on the routing tree, all the nodes must switch to the new routing tree to avoid collisions. This necessitates disseminating the fault information to all the nodes reliably. We propose a flooding algorithm for disseminating fault info to the network reliably even in a lossy channel. Simulation results show that the proposed flooding scheme consumes lesser energy and converges faster than a simple flooding scheme.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115940302","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
Research and application of One-class small hypersphere support vector machine for network anomaly detection 一类小超球支持向量机在网络异常检测中的研究与应用
Santosh Kumar, Sukumar Nandi, S. Biswas
{"title":"Research and application of One-class small hypersphere support vector machine for network anomaly detection","authors":"Santosh Kumar, Sukumar Nandi, S. Biswas","doi":"10.1109/COMSNETS.2011.5716425","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716425","url":null,"abstract":"In recent years, machine learning technology often used as a recognition method of anomaly in anomaly detection. In this paper we have proposed a One-class small hypersphere support vector machine classifier (OCSHSVM) algorithm, which builds a learning classifier model via both normal and abnormal network traffic. This combination of normal and abnormal traffic for training model gives the better performance and generalization for proposed classifier Experimental results show that high detection rates and low false positive rates are achieves by our proposed approach. We have demonstrate proposed algorithm by using of KDD [1] and NSL-KDD [2] dataset.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122108597","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
Scalability of a distributed virtual environment based on a structured peer-to-peer architecture 基于结构化点对点架构的分布式虚拟环境的可伸缩性
Jiehua Chen, S. Grottke, Jan Sablatnig, R. Seiler, A. Wolisz
{"title":"Scalability of a distributed virtual environment based on a structured peer-to-peer architecture","authors":"Jiehua Chen, S. Grottke, Jan Sablatnig, R. Seiler, A. Wolisz","doi":"10.1109/COMSNETS.2011.5716424","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716424","url":null,"abstract":"We investigate the scalability of distributed virtual environments (DVEs) based on a structured peer-to-peer (P2P) overlay. We focus on network load and message routing latency. To this end, we study a prototypical DVE consisting of a simple game scenario and a P2P architecture based on Pastry and Scribe as proposed by Knutsson et al. [1]. Both our theoretical analysis and simulation results show that under constant population density, the network load is constant except for the overhead messages incurred by the overlay protocol. The overall network load per host as well as the message routing latency grows logarithmically with the number of hosts; this is in partial contradiction to Knutsson et al.'s results. We propose a resolution to this contradiction.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129816377","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
HySecNJoining: A hybrid secure node joining algorithm for wireless sensor network HySecNJoining:一种用于无线传感器网络的混合安全节点加入算法
H. Kalita, A. Kar
{"title":"HySecNJoining: A hybrid secure node joining algorithm for wireless sensor network","authors":"H. Kalita, A. Kar","doi":"10.1109/COMSNETS.2011.5716524","DOIUrl":"https://doi.org/10.1109/COMSNETS.2011.5716524","url":null,"abstract":"A wireless sensor network consists of several sensor nodes strewn over a large geographic area and base station. Depending upon the routing model used data collected by the sensor node are routed through several hops of the network to the base station. Before a new node becomes operational the base station verifies its authenticity for security reasons. We call this phase as secure joining of a node. The process of secure joining can be as simple as allowing a new node to join by simply verifying its MAC-ID in plain text. However, this simple secure joining is prone to many attacks and therefore, not acceptable to many organizations requiring high grade of security. On the other hand stringent process of secure joining such as multi-level verification of authentication credentials in a secure channel comes with a cost in terms of energy consumption. In this paper we propose a stringent secure joining method which uses the concept of certificate less PKI and symmetric key and goes through multi-level authentication for prevention of flooding attack.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128970627","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
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学术官方微信