{"title":"Fuzzy Trust for Peer-to-Peer Systems","authors":"N. Griffiths, K. Chao, M. Younas","doi":"10.1109/ICDCSW.2006.57","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.57","url":null,"abstract":"Peer-to-peer (P2P) systems are based upon the cooperative interactions of member peers. Typically, peers are both autonomous and self-interested, meaning that there is no hierarchy of control or power, and that individuals seek to maximise their own goal achievement, rather than acting in a benevolent or socially-oriented manner. Consequently, interaction outcomes are uncertain, since peers can break their commitments or provide sub-standard contributions or services. Thus, when a peer cooperates it is entering into an uncertain interaction, that has an associated risk of failure or reduced performance. For peers to be effective they need some mechanism for managing this risk of failure. In this paper we show how peers can use trust to manage this risk. Our model of trust uses fuzzy logic to allow peers to represent and reason with uncertain and imprecise information regarding others’ trustworthiness.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"46 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134442236","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}
{"title":"Performance Evaluation of the . Accrual Failure Detector","authors":"Naohiro Hayashibara, M. Takizawa","doi":"10.1109/ICDCSW.2006.83","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.83","url":null,"abstract":"In this paper, we explain an implementation of an accrual failure detector, that we call the . failure detector. The particularity of the . failure detector is that it dynamically adjusts to current network conditions the scale on which the suspicion level is expressed. We have done the experiment in a LAN in a whole day and evaluated the behavior of our . failure detector. Then we discuss on the parameters of the failure detector based on our experimental result.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122000594","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}
{"title":"Contory: A Smart Phone Middleware Supporting Multiple Context Provisioning Strategies","authors":"Oriana Riva, C. D. Flora","doi":"10.1109/ICDCSW.2006.33","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.33","url":null,"abstract":"This paper presents Contory, a middleware specifically deployed to support provisioning of context information on mobile devices such as smart phones. Contory integrates multiple strategies for context provisioning, namely internal sensors-based, external infrastructure-based, and distributed provisioning in ad hoc networks. Applications can query Contory about context items of different types, using a declarative query language which features on-demand, periodic, and event-based context queries. Contory allows applications to utilize different provisioning mechanisms depending on resource availability and presence of external infrastructures. This paper illustrates our approach along with its design and implementation on smart phones.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"19 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123509221","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}
{"title":"Implementation and Performance Study of a New NAT/Firewall Signaling Protocol","authors":"Niklas Steinleitner, Henning Peters, Xiaoming Fu","doi":"10.1109/ICDCSW.2006.63","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.63","url":null,"abstract":"The NAT/Firewall NSIS Signaling Layer Protocol (NAT/Firewall NSLP) is a path-coupled signaling protocol for explicit Network Address Translator and firewall configuration within an extensible IP signaling framework currently being developed by the IETF Next Steps in Signaling (NSIS) working group. This new protocol allows end hosts to signal along a path to configure NATs and firewalls according to the data flow needs. In this paper we present a first open source implementation and performance evaluation of NAT/Firewall NSLP. The performance study shows that our implementation scales well and is able to support firewall signaling for up to tens of thousands of flows in parallel even in a low-end PC testbed environment. The overall performance bottleneck is found to lie in the utilized firewall implementation, not depending on the NAT/Firewall NSLP implementation.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127463657","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}
{"title":"Automatic Web Service Composition Using ConGolog","authors":"Minh Phan, F. Hattori","doi":"10.1109/ICDCSW.2006.24","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.24","url":null,"abstract":"Semantic Web Service, nowadays, is emerging as a solution for interoperating distributed applications on the WWW. Web service composition is the task of combining existing web services to yield a new service in order to achieve a desired goal. In this paper, we propose a formal approach to translate OWL-S web service descriptions into primitive and complex actions of ConGolog, a high level logic programming language with sensing actions for web service composition. In addition, in order to support information gathering with search in an open world initial database, we propose an extended version of the middle-ground ConGolog interpreter which relies on a theorem-prover with prime implicates.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129454578","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}
{"title":"Finding Optimal Join Tree forMulti-Join Stream Queries in a Production System","authors":"Joseph S. Gomes, Hyeong-Ah Choi","doi":"10.1109/ICDCSW.2006.53","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.53","url":null,"abstract":"Data Stream Management Systems (DSMS) handle a particular type of database applications that involve multiple continuous data streams with inputs arriving at highly variable and unpredictable rates. Since data rate fluctuates over time in this type of applications the appropriate join tree is crucial for maintaining high system throughput. We consider the problem of finding optimal join tree for performing count based sliding window multi-joins over continuous streams. We use a unit-time based cost model to evaluate the expected performance for a given join tree. We materialize all intermediate results assuming there is enough main memory to store all partial results and window buffers. We give a polynomial time algorithm that finds the optimal join tree under our cost model for a given noncommuting (single permutation) order of streams. This algorithm can be used in conjunction with any linear order producing heuristic to give the optimal tree for that order. Our algorithm is implemented in the Jess rule engine and an extensive experimental evaluation is provided.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126409413","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}
{"title":"Dimension-Based Subscription Pruning for Publish/Subscribe Systems","authors":"S. Bittner, A. Hinze","doi":"10.1109/ICDCSW.2006.42","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.42","url":null,"abstract":"Subscription pruning has been proven as valuable routing optimization for Boolean subscriptions in publish/ subscribe systems. It aims at optimizing subscriptions independently of each other and is thus applicable for all kinds of subscriptions regardless of their individual and collective structures. The original subscription pruning approach tries to optimize the event routing process based on the expected increase in network load. However, a closer look at pruning-based routing reveals its further applicability to optimizations in respect to other dimensions. In this paper, we introduce and investigate subscription pruning based on three dimensions of optimization: network load, memory usage, and system throughput. We present the algorithms to perform prunings based on these dimensions and discuss the results of a series of practical experiments. Our analysis reveals the advantages and disadvantages of the different dimensions of optimization and allows conclusions about the suitability of dimension-based pruning for different application requirements.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128922983","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}
L. Souza, A. Ripoll, Xiaoyuan Yang, P. Hernández, F. Cores
{"title":"Designing a Video-on-Demand System for a Brazilian High Speed Network","authors":"L. Souza, A. Ripoll, Xiaoyuan Yang, P. Hernández, F. Cores","doi":"10.1109/ICDCSW.2006.40","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.40","url":null,"abstract":"Despite the availability of video-on-demand (VoD) services in a number of cities around the world, the large-scale deployment of VoD services has not been widely explored due to economic constraints. The high complexity founded in these systems makes the design process very difficult. This study presents a VoD system design for a highspeed metropolitan network, based on ATM technology, located in Brazil. To accomplish this goal, we have utilized our own simulation-based tool for VoD design called VODSim. This tool allows VoD research on any VoD platform, simulating the complete flow path followed by requests from clients to servers passing through the network infrastructure, allowing the configuration and tuning of multiple system parameters. Using VODSim, we analyse possible VoD architectures for the proposal environment (i.e. Centralized-server, Independent-servers, One-level-proxies and Distributedservers), studying key-parameters that have influence in system design. Experimental results show that Distributed-server architecture is the one that adjusts better to the analyzed infrastructure, improving streaming capacity by 16%, 25% and 28% more than One-level-proxies, Centralized and Independent-servers respectively. Taking in account future growth in VoD system, the Distributed-server even provides an unlimited scalability through new local network incorporation and using P2P techniques.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124417449","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}
{"title":"Energy Efficient Fractional Coverage Schemes for Low Cost Wireless Sensor Networks","authors":"Mao Ye, E. Chan, Guihai Chen, Jie Wu","doi":"10.1109/ICDCSW.2006.44","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.44","url":null,"abstract":"An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. Depending on different types of applications, the network lifetime may be much more critical than covering the entire monitored area at every data reporting round. This paper presents a competition based distributed scheme called FCS to address the fractional coverage problem in wireless sensor networks with tiny, lowcost sensors. Through localized, energy-aware competition, the proposed scheme achieves the desired fractional coverage with a minimum number of active sensors. By taking account of both residual battery energy and recent reporting latency, an enhanced version of FCS which uses a novel competition metric to constrain the maximum reporting latency throughout the network is also proposed. These two schemes also contain the desirable property that it can be extended easily to handle the more general k-coverage problem.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"315 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124472584","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}
{"title":"Preservation of Correctness During System Reconfiguration in Data Distribution Service for Real-Time Systems (DDS)","authors":"B. Zieba, M. V. Sinderen","doi":"10.1109/ICDCSW.2006.84","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.84","url":null,"abstract":"This paper addresses dynamic reconfiguration of distributed systems that use a publish/subscribe (pub/sub) middleware. The objective of dynamic reconfiguration is to evolve incrementally from one system configuration to another at run-time in order to e.g., ensure the reliability of the system. The correctness notion of a distributed system is introduced that assures that the system parts that interact with entities under reconfiguration do not fail because of reconfiguration. We analyse the OMG specification of pub/sub systems - DDS (Data Distribution Service for Real-Time Systems) with respect to its support for the correctness preservation during reconfiguration. We notice that the DDS specification defines such an architecture and behaviour of the pub/sub system that automatically preserves correctness. This differentiates the DDS from other middleware technologies that require that the correctness preservation is guaranteed on application level or by reconfiguration manager/controller. We give several examples of automatic correctness preservation supported by the DDS.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123003150","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}