2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing最新文献_第2页

R4: Towards a holistic framework for designing and developing Social Web Applications R4:面向设计和开发社交Web应用程序的整体框架

2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2009-12-28 DOI: 10.4108/ICST.COLLABORATECOM2009.8288

S. P. Choe, Junehwa Song

引用次数: 2

DDT: A distributed data structure for the support of P2P range query 滴滴涕:用于支持P2P范围查询的分布式数据结构

2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2009-12-28 DOI: 10.4108/ICST.COLLABORATECOM2009.8356

D. Carfí, M. Coppola, D. Laforenza, L. Ricci

{"title":"DDT: A distributed data structure for the support of P2P range query","authors":"D. Carfí, M. Coppola, D. Laforenza, L. Ricci","doi":"10.4108/ICST.COLLABORATECOM2009.8356","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8356","url":null,"abstract":"This paper defines and evaluates a hierarchical distributed data structure, distributed digest trie, supporting range queries in P2P systems. Providing efficient support for these queries is currently a challenging research issue in the P2P field, as classical approaches based on distributed hash tables (DHT) are often not suitable for this kind of queries, due to the loss of locality introduced by the hashing function. Distributed digest trie exploits the DHT only to define a uniform assignment of logical identifiers to peers while each key is managed by the peer publishing it. Each peer is paired with the leaf of the trie corresponding to its logical identifier. An internal node of the trie stores a digest summarizing the keys published by the peers paired with the leaves of the tree rooted at that node. A proper mapping function is defined to map the internal nodes of the trie to the peers. The digests stored at the internal nodes are exploited to guide the search process for the resolution of the range query. Different aggregation techniques are proposed. A set of experimental results compare these techniques, evaluate the cost of dynamic updates of the data structure and the network traffic generated by the method.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116324689","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

SemSLATES: Improving enterprise 2.0 information systems using semantic Web technologies SemSLATES:使用语义Web技术改进企业2.0信息系统

2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2009-12-28 DOI: 10.4108/ICST.COLLABORATECOM2009.8369

Alexandre Passant, Philippe Laublet, J. Breslin, S. Decker

引用次数: 19

CASTLE: A social framework for collaborative anti-phishing databases CASTLE:协作反网络钓鱼数据库的社会框架

2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2009-12-28 DOI: 10.4108/ICST.COLLABORATECOM2009.8310

Arash Nourian, Sameer Ishtiaq, Muthucumaru Maheswaran

引用次数: 23

Square region-based coverage and connectivity probability model in wireless sensor networks 基于方形区域的无线传感器网络覆盖与连通性概率模型

2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2009-12-28 DOI: 10.4108/ICST.COLLABORATECOM2009.8335

X. Xing, Guojun Wang, Jie Wu, Jie Li

{"title":"Square region-based coverage and connectivity probability model in wireless sensor networks","authors":"X. Xing, Guojun Wang, Jie Wu, Jie Li","doi":"10.4108/ICST.COLLABORATECOM2009.8335","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8335","url":null,"abstract":"Sensing coverage and network connectivity are two fundamental issues in wireless sensor networks (WSNs). Due to resource constraints of sensor nodes, it may not be possible, or necessary, to provide full coverage and/or connectivity in WSNs. Under a certain coverage and connectivity requirement, the node deployment strategy becomes a challenging issue in randomly deployed networks. In this paper, we propose a square region-based coverage and connectivity probability model (SCCP), which reflects the relations among the coverage and connectivity rates, the number of sensor nodes, the sensing and communication ranges of sensor nodes, and the network size. This model can calculate the number of sensor nodes that need to be deployed for maintaining a certain coverage and/or connectivity rate. The simulation results have shown that the error-rate of node deployment is less than 5%, which is defined as the absolute difference between the number of sensor nodes obtained from the theoretical analysis and the number obtained from the simulation, divided by the number of sensor nodes obtained from the theoretical analysis. The proposed model is very useful in estimating the monitoring coverage and connectivity capacity when sensor nodes are distributed randomly and uniformly.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130584889","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}

引用次数: 29

A decentralized mechanism for application level monitoring of distributed systems 用于分布式系统的应用程序级监控的分散机制

2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2009-12-28 DOI: 10.4108/ICST.COLLABORATECOM2009.8336

C. Serban, Wenxuan Zhang, N. Minsky

引用次数: 6

A collaborative k-anonymity approach for location privacy in location-based services 基于位置的服务中位置隐私的协同k-匿名方法

2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2009-12-28 DOI: 10.4108/ICST.COLLABORATECOM2009.8374

Hassan Takabi, J. Joshi, H. Karimi

{"title":"A collaborative k-anonymity approach for location privacy in location-based services","authors":"Hassan Takabi, J. Joshi, H. Karimi","doi":"10.4108/ICST.COLLABORATECOM2009.8374","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8374","url":null,"abstract":"Considering the growth of wireless communication and mobile positioning technologies, location-based services (LBSs) have been generating increasing research interest in recent years. One of the critical issues for the deployment of LBS applications is how to reconcile their quality of service with privacy concerns. Location privacy based on k-anonymity is a very common way to hide the real locations of the users from the LBS provider. Several k-anonymity approaches have been proposed in the literature, each with some drawbacks. They need either a trusted third party or the users (or providers) to trust each other in collaborative approaches. In this paper, we propose a collaborative approach that provides k-anonymity in a distributed manner and does not require a trusted third party nor the users (or providers) to trust each other. Furthermore, our approach integrates well with the existing communication infrastructure. A user's location is known to only his/her location provider (e.g., cell phone operator). By using cryptographic schemes, user with the help of location providers determines whether the k-anonymity property is satisfied in a query area or not. We start with a simple scenario where user and location providers are honest-but-curious and then we progressively extend our protocol to deal with scenarios where entities may collude with each other. Moreover, we analyze possible threats and discuss how our proposed approach defends against such threats.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129254446","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

In-depth analysis of IPv6 security posture 深入分析IPv6安全态势

2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2009-12-28 DOI: 10.4108/ICST.COLLABORATECOM2009.8393

Abdur Rahim Choudhary

引用次数: 44

Collaborative filtering via epidemic aggregation in distributed virtual environments 分布式虚拟环境中基于疫情聚合的协同过滤

2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2009-12-28 DOI: 10.4108/ICST.COLLABORATECOM2009.8278

Patrick Gratz, J. Botev

{"title":"Collaborative filtering via epidemic aggregation in distributed virtual environments","authors":"Patrick Gratz, J. Botev","doi":"10.4108/ICST.COLLABORATECOM2009.8278","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8278","url":null,"abstract":"The ever-increasing amount of available information in today's digital society necessitates inline techniques for determining the most relevant content. Collaborative filtering (CF) systems have proven to be an adequate means for reducing informational overload and generating useful recommendations. Current systems are predominantly built on centralized or, more recently, structured Peer-to-Peer (P2P) approaches. However, in order to apply collaborative filtering to large-scale distributed virtual environments (DVEs) in unstructured networks with substatially higher user numbers, different approaches are necessary. Within this paper we present a collaborative filtering algorithm for DVEs utilizing epidemic data aggregation based exclusively on local information. Designed to be extremely scalable, it creates recommendations in a transparent way by distributing an accumulated view of favorite ratings to interacting users. The algorithm is intended for deployment in the HyperVerse - a self-organizing middleware service for large-scale DVEs - for generating and managing rating predictions of object favorites. Evaluation results show that, in terms of quality, locally aggregated predictions converge well on those obtained from an idealized global view.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126613008","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

Integrating P2PSIP into collaborative P2P applications: A case study with the P2P videoconferencing system BRAVIS 将P2PSIP集成到协作P2P应用程序中:P2P视频会议系统BRAVIS的案例研究

2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2009-12-28 DOI: 10.4108/ICST.COLLABORATECOM2009.8350

R. Klauck, M. Kirsche

引用次数: 4