发布求助
文献互助 智能选刊 最新文献

2011 IEEE 10th International Symposium on Network Computing and Applications最新文献

筛选
英文 中文
On-line Detection of Encrypted Traffic Generated by Mesh-Based Peer-to-Peer Live Streaming Applications: The Case of GoalBit 基于网格的点对点直播应用生成的加密流量在线检测:以GoalBit为例
2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.38
André F. Esteves, Pedro R. M. Inácio, Manuela Pereira, M. Freire
{"title":"On-line Detection of Encrypted Traffic Generated by Mesh-Based Peer-to-Peer Live Streaming Applications: The Case of GoalBit","authors":"André F. Esteves, Pedro R. M. Inácio, Manuela Pereira, M. Freire","doi":"10.1109/NCA.2011.38","DOIUrl":"https://doi.org/10.1109/NCA.2011.38","url":null,"abstract":"The number and popularity of applications developed over the Peer-to-Peer (P2P) network paradigm has been growing over the last decade, some of which are dedicated to streaming multimedia content. To deceive traffic shaping mechanisms or improve the security of the communications, these applications generate encrypted traffic or resort to several obfuscation techniques, making it difficult to manage this kind of traffic at the network level. In this work, we propose a method that explores transmission vulnerabilities of the encrypted traffic allowing its detection. Hence, an experimental test bed was created to capture a diversity of traffic, which includes flows of a widely used P2P media streaming application called Goal Bit. The collected traces of traffic were then analysed, and a set of rules was created for the SNORT network intrusion detection system, which allows the successful detection of the encrypted traffic generated by Goal Bit. The accuracy of this system was then validated experimentally.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132256945","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
A Subset Coding Based k-Anonymization Technique to Trade-Off Location Privacy and Data Integrity in Participatory Sensing Systems 基于子集编码的k-匿名化技术在参与式传感系统中权衡位置隐私和数据完整性
2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.22
Manzur Murshed, Anindya Iqbal, Tishna Sabrina, Kh Mahmudul Alam
{"title":"A Subset Coding Based k-Anonymization Technique to Trade-Off Location Privacy and Data Integrity in Participatory Sensing Systems","authors":"Manzur Murshed, Anindya Iqbal, Tishna Sabrina, Kh Mahmudul Alam","doi":"10.1109/NCA.2011.22","DOIUrl":"https://doi.org/10.1109/NCA.2011.22","url":null,"abstract":"Success of participatory sensing system depends on the extent of voluntary participation by users. To increase participation, incentive such as rewards can be used only if reported data has associated user identification. This creates serious threat to participating users' location privacy. Existing techniques tried to solve it with spatial clocking, which suffers from inferior data integrity. In this paper, we present a subset coding based anonymization scheme that can safeguard users' location privacy with k-anonymity while preserving almost lossless data integrity at the destination server. Adversary threats to our scheme are comprehensively analyzed to develop robust strategies and analytical bounds on system parameters for location privacy risk mitigation. Applicability of the proposed scheme is established with extensive simulation results.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129744200","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}
引用次数: 18
Improving Adaptive Offloading Using Distributed Abstract Class Graphs in Mobile Environments 在移动环境中使用分布式抽象类图改进自适应卸载
2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.41
E. Abebe, C. Ryan
{"title":"Improving Adaptive Offloading Using Distributed Abstract Class Graphs in Mobile Environments","authors":"E. Abebe, C. Ryan","doi":"10.1109/NCA.2011.41","DOIUrl":"https://doi.org/10.1109/NCA.2011.41","url":null,"abstract":"Adaptive offloading dynamically distributes portions of a computationally heavy application to remote devices to achieve context specific optimisations. However, since existing state-of-the-art approaches incur significant overhead from storing, updating and partitioning application graphs this paper proposes a novel distributed approach to alleviate much of this overhead. Specifically, each device maintains a graph consisting only of components in its own memory space, while maintaining abstraction elements for components in remote devices. This approach removes the need to store and update complete application graphs on each device and reduces the cost of partitioning an application during adaptation. An evaluation involving computationally heavy open-source applications adapting in a heterogeneous collaboration showed that the new approach reduced graph update network cost by 100%, collaboration-wide memory cost by between 37% and 50%, battery usage by between 63% and 93%, and adaptation time by between 19% and 98%, while improving efficacy of adaptation by 12% and 34% for two of the considered applications.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130167593","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
Improving Web Cache Performance via Adaptive Content Fragmentation Design 通过自适应内容碎片设计改进Web缓存性能
2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.55
Carlos Guerrero, C. Juiz, R. Puigjaner
{"title":"Improving Web Cache Performance via Adaptive Content Fragmentation Design","authors":"Carlos Guerrero, C. Juiz, R. Puigjaner","doi":"10.1109/NCA.2011.55","DOIUrl":"https://doi.org/10.1109/NCA.2011.55","url":null,"abstract":"The performance of web caches, in Web Content Management Systems, can be improved by assembling only some of the content elements of a web page in the application server, and finishing the assembling process in the cache proxy. Due to this, the cache is able to manage parts of the web page instead of whole pages, which improves its performance. We propose an algorithm based on decision trees and obtained in a training process to create content fragmentation designs. Data mining is used in the training phase. Inputs of the classification algorithm must be monitored from the system producing small overheads. The paper contribution are the validation of: the use of classification system to self-adapt content fragmentation designs to improve the web performance, the parameters set to be used as inputs of the decision tree and finally, the suitability of using decision trees to represent and implement, in the classification system, the previous extracted knowledge. All these aspects are validated by experimental results extracted from a test-bed.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121387643","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
PAWDS: A Roadmap Profile-Driven Adaptive System for Alert Dissemination in VANETs PAWDS:一种路线图轮廓驱动的vanet警报传播自适应系统
2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.25
Manuel Fogué, Piedad Garrido, F. Martinez, Juan-Carlos Cano, C. Calafate, P. Manzoni
{"title":"PAWDS: A Roadmap Profile-Driven Adaptive System for Alert Dissemination in VANETs","authors":"Manuel Fogué, Piedad Garrido, F. Martinez, Juan-Carlos Cano, C. Calafate, P. Manzoni","doi":"10.1109/NCA.2011.25","DOIUrl":"https://doi.org/10.1109/NCA.2011.25","url":null,"abstract":"In traffic safety applications for Vehicular Ad hoc Networks (VANETs), warning messages have to be disseminated whenever a dangerous situation occurs to alert nearby vehicles. Using inefficient broadcast schemes may lead to ineffective dissemination of warning messages causing broadcast storm problems. In the past, several approaches have been proposed to reduce the so called broadcast storm in multi-hop wireless networks, but none of them is adapted to the features of the propagation scenario. In this paper, we present the Profile-driven Adaptive Warning Dissemination Scheme (PAWDS) to improve the warning message dissemination process. With respect to previous proposals, our PAWDS scheme uses an adaptive technique based on tuning the operation of the dissemination scheme according to the characteristics of the street area where the vehicles are moving. Our algorithm reported a noticeable improvement in the performance of alert dissemination processes in simulated scenarios based on real city maps.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129030837","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
A Resilient Architecture Oriented to P2P Computing 面向P2P计算的弹性体系结构
2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.13
D. C. Martínez, F. Giné, Francesc Solsona, J. L. Lérida
{"title":"A Resilient Architecture Oriented to P2P Computing","authors":"D. C. Martínez, F. Giné, Francesc Solsona, J. L. Lérida","doi":"10.1109/NCA.2011.13","DOIUrl":"https://doi.org/10.1109/NCA.2011.13","url":null,"abstract":"This paper proposes a distributed computing architecture using the P2P paradigm. Our proposal gathers the peers into markets according to their computational resources. Each market is arranged in an N-tree and the trees are linked by a Bruijn graph. The tree topology allows efficient searching of available resources in a specific market, while Bruijn provides good scalability as search complexity does not depend on the number of markets. A Hilbert function is used to arrange markets in one ordered and mono-dimensional space. This way, the proposed architecture exploits the Bruijn and N-tree topologies together with the Hilbert function in a completely distributed, scalable and fault tolerant way. Likewise, the paper describes the main operations involved in the peer management (insertion, maintenance and output of peers) and analyses its reliability. The main parameters associated with our proposal are discussed and tuned by means of simulation. A look-up query mechanism of multiple attributes for exact and approximate queries is also introduced over this architecture. The performance of our proposal was analyzed by means of simulation in relation to the widely used Chord overlay and the Baton algorithm.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130236273","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
Belisarius: BFT Storage with Confidentiality Belisarius: BFT保密性存储
2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.15
Ricardo Padilha, F. Pedone
{"title":"Belisarius: BFT Storage with Confidentiality","authors":"Ricardo Padilha, F. Pedone","doi":"10.1109/NCA.2011.15","DOIUrl":"https://doi.org/10.1109/NCA.2011.15","url":null,"abstract":"Traditional approaches to byzantine fault-tolerance have mostly avoided the problem of confidentiality. Current confidentiality-aware solutions rely on a heavy infrastructure investment or depend on complex key management schemes. The framework presented in this paper relies on a novel approach that combines byzantine fault-tolerance, secure storage and verifiable secret sharing to significantly reduce the additional infra-structure and complexity required by confidentiality protection. The proposed framework was compared to other solutions using a micro-benchmark, and an implementation of TPC-B and NFS.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121304198","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}
引用次数: 22
Application of a Self-Healing Video-Streaming Architecture to RTSP Servers 自修复视频流架构在RTSP服务器上的应用
2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.44
C. Cunha, L. Silva
{"title":"Application of a Self-Healing Video-Streaming Architecture to RTSP Servers","authors":"C. Cunha, L. Silva","doi":"10.1109/NCA.2011.44","DOIUrl":"https://doi.org/10.1109/NCA.2011.44","url":null,"abstract":"Streaming media is now one of the killer applications on the Internet. Availability in streaming services is a critical concern, as consumer expectations are drawn around decades of traditional TV experience. Server performance has particular importance in streaming, as its sensitiveness to delays makes it vulnerable to performance anomalies. Current work on server-level performance analysis fails to cope with performance failures not explained by the workload. We propose a self-healing architecture for streaming servers sustained by a biological metaphor of heart that explores proactive server recovery by anticipating performance failures through detection of arrhythmias (transmission delays of streaming content) and session probing. We evaluated the approach in RTSP streaming through experimental work in several resource exhaustion scenarios. Results have shown that our approach is able to predict and localize service failures several seconds before their occurrence for most failure scenarios.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125978109","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
Using Performance, Energy Consumption, and Resilience Experimental Measures to Evaluate Routing Protocols for Ad Hoc Networks 使用性能、能量消耗和弹性实验措施评估Ad Hoc网络的路由协议
2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.34
Jesus Friginal, D. Andrés, Juan-Carlos Ruiz-Garcia, P. Gil
{"title":"Using Performance, Energy Consumption, and Resilience Experimental Measures to Evaluate Routing Protocols for Ad Hoc Networks","authors":"Jesus Friginal, D. Andrés, Juan-Carlos Ruiz-Garcia, P. Gil","doi":"10.1109/NCA.2011.34","DOIUrl":"https://doi.org/10.1109/NCA.2011.34","url":null,"abstract":"Ad hoc networks are gaining momentum in contexts of use where the rapid deployment of dynamic networks is critical. It is well-known that these networks are threatened by a variety of accidental and malicious faults. Despite this fact, there exist few critical studies quantifying and analysing the impact of faults on networks' performance, resilience and energy consumption. This practical experience report studies the effect of eleven different types of perturbations (including malicious and accidental faults) on different versions of a well-known ad hoc routing protocol implementation, named olsrd. Experimentation also includes the assessment of the effectiveness of fault prevention (encryption) and detection (watchdog) mechanisms available for the considered protocols versions. During the analysis, emphasis is placed on the influence that context of use has on the interpretation of results. In that sense, reported experimentation is particularised to the domain of wireless mesh networks and mobile ad hoc networks.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127350217","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
A Framework for Transparent Active Replication in Remote Method Invocation 远程方法调用中透明活动复制的框架
2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.47
Diogo Reis, Hugo M. Miranda
{"title":"A Framework for Transparent Active Replication in Remote Method Invocation","authors":"Diogo Reis, Hugo M. Miranda","doi":"10.1109/NCA.2011.47","DOIUrl":"https://doi.org/10.1109/NCA.2011.47","url":null,"abstract":"The Java Remote Method Invocation (RMI) simplifies the development of distributed applications. However, the specification relies on the client/server communication paradigm, creating a single point of failure at the server side. To address this issue, some approaches extend RMI syntax and semantic to encompass fault tolerance. However, this solution is neither transparent for the application programmer nor for the client. This paper describes a middleware platform that enhances JRMI with strong replica consistency. The middleware is completely transparent for the client and does not require recoding on the server side.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132690920","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学术文献互助群
群 号：604180095
Book学术官方微信