26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)最新文献

{"title":"An OptimizedWorkload for Failure Data Analysis of Mobile P2P over Bluetooth Ad-Hoc Networks","authors":"G. Carrozza, M. Cinque, F. Cornevilli, S. Russo","doi":"10.1109/ICDCSW.2006.18","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.18","url":null,"abstract":"Mobile Peer-to-Peer (P2P) is a base paradigm for many new killer applications for mobile ad-hoc networks and the Mobile Internet. Currently, it is not well understood whether this paradigm is able to meet business and consumer dependability expectations. Dependability assessment of P2P applications can be achieved by field failure data analysis. The collection of failure data from wireless ad-hoc networks is a challenging task due to the intermittent usage and the mobility of users that do not allow to measure time-based dependability parameters. For this reason, we propose to deploy automated workloads on the actual peer nodes which have to operate continuously. Specifically, this paper formalizes the problem and presents the design of a workload for mobile P2P that aims to orchestrate the peers uniformly, letting the failure occurrence be independent of the network load. Simulation results and experimentation over an actual Bluetooth network demonstrate that the proposed workload meets the defined requirements.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"55 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":"117028078","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":"The Bootstrapping Service","authors":"Márk Jelasity, A. Montresor, Özalp Babaoglu","doi":"10.1109/ICDCSW.2006.105","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.105","url":null,"abstract":"We outline a lightweight architecture to support novel application scenarios for P2P systems. These scenarios include merging and splitting of large networks, or multiplexing relatively short-lived applications over a pool of shared resources. In such scenarios, the architecture needs to be quickly and efficiently (re)generated frequently, often from scratch. We propose the bootstrapping service abstraction as a solution to this problem. We present an instance of the service that can jumpstart any prefix-table based routing substrate quickly, cheaply and reliably from scratch. We experimentally analyze the proposed bootstrapping service, demonstrating its scalability and robustness.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"31 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":"117253058","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":"A Practical Method to Form Energy Efficient Connected -Coverage in Wireless Sensor Networks","authors":"Zhen Jiang, Robert Kline, Jie Wu, Fei Dai","doi":"10.1109/ICDCSW.2006.8","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.8","url":null,"abstract":"In the wireless sensor networks, an important issue of area coverage is to know how many sensor nodes are needed in a deployment under a certain kind of distribution. In that way, the nodes can be dense enough to form a complete and connected cover of interest area. Another issue that needs to be addressed is the \"redundancy of connectivity\" caused by the use of the well known sufficient condition that \"the communication range is at least twice the sensing range\". In this paper, we show our result in solving these problems, a practical method to form a connected -coverage with a connected dominating set (CDS). By introducing a measure of node density called the biggest vacant square territory (BVST), we prove that the point coverage offered by a CDS implies area coverage of the area of interest. The 1-point-coverage of a CDS with a reduced R and a certain number of deploying sensors guarantees -area-coverage, or simply -coverage. Such assurance is verified via a simulation study on the CDS in [7] under random node distribution.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"21 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":"125692542","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":"An Application of Question Answering System for Collaborative Learning","authors":"Chun-Chia Wang, J. C. Hung, Che-Yu Yang, T. Shih","doi":"10.1109/ICDCSW.2006.15","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.15","url":null,"abstract":"With the rapid development of E-learning, collaborative learning is an important kind of group learning mode. It emphasizes the communication and information sharing among group members. Current collaborative learning systems haven’t reached a high interaction degree between the students and the instructor to gain knowledge. In order to solve this problem, this paper introduces a semantic-based automated question answering (Q&A) system like a virtual teacher to respond to student questions online. Through the proposed mechanism, the Q&A knowledge base will be enriched in the future process of Q&A. Furthermore, not only the students can get answers to their questions, but also the instructors could know what problems students encountered in learning. This would be a great help for both the instructor and the students in collaborative learning environment. Keywords: automated question answering system, natural language processing, collaborative learning, distance learning.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"18 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":"128167721","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":"Thracker - Using Capacitive Sensing for Gesture Recognition","authors":"Raphael Wimmer, Paul Holleis, M. Kranz, A. Schmidt","doi":"10.1109/ICDCSW.2006.109","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.109","url":null,"abstract":"In this paper we present Thracker - a low-cost and robust hardware to track hand gestures in front of a screen or small-scale active spaces like public displays or posters. Thracker uses capacitive sensing for tracking user input. Thracker allows for entire new interaction modes like picking and dropping an object on the screen with the hand. We present a fully working prototype and a short user study to confirm our findings.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"5 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":"121121298","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":"Multi-radio channel allocation in competitive wireless networks","authors":"M. Félegyházi, Mario Cagalj, J. Hubaux","doi":"10.1109/ICDCSW.2006.75","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.75","url":null,"abstract":"Channel allocation has been extensively studied in the framework of cellular networks, but the emergence of new system concepts, such as cognitive radio systems, bring this topic into the focus of research again. In this paper, we provide a formal analysis of the selfish multi-radio channel allocation problem using game theory. We conclude that in spite of the non-cooperative behavior of such devices, their channel allocation results in a Pareto- and system-optimal solution. Furthermore, we present a simple algorithm to achieve this efficient channel allocation. To the best of our knowledge, our paper is the first contribution to this important topic.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"15 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":"129669538","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":"Replacing Failed Sensor Nodes by Mobile Robots","authors":"Yongguo Mei, C. Xian, Saumitra M. Das, Y. C. Hu, Yung-Hsiang Lu","doi":"10.1109/ICDCSW.2006.90","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.90","url":null,"abstract":"Sensor replacement is important for sensor networks to provide continuous sensing services. Existing approaches relocate redundant nodes to fill the holes created by failed sensors and require all or most sensor nodes to have mobility. However, mobility equipment is expensive while technology trends are scaling sensors to be smaller and cheaper. In this paper, we propose to use a small number of mobile robots to replace failed sensors in a large-scale static sensor network. We study algorithms for detecting and reporting sensor failures and coordinating the movement of robots that minimize the motion energy of mobile robots and the messaging overhead incurred to the sensor network. A manager receives failure reports and determines which robot to handle a failure. We study three algorithms: a centralized manager algorithm, a fixed distributed manager algorithm, and a dynamic distributed manager algorithm. Our simulations show that: (a) The centralized and the dynamic distributed algorithms have lower motion overhead than the fixed distributed algorithm. (b) The centralized algorithm is less scalable than the two distributed manager algorithms. (c) The two distributed algorithms have higher messaging cost than the centralized algorithm. Hence, the optimal choice of the coordination algorithm depends on the specific scenarios and objectives being optimized.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"38 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":"132854852","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":"Throughput Performance of Java Messaging Services Using WebsphereMQ","authors":"R. Henjes, M. Menth, C. Zepfel","doi":"10.1109/ICDCSW.2006.110","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.110","url":null,"abstract":"The Java messaging service (JMS) is a middlewareoriented messaging technology working according to the publish/ subscribe principle. If subscribers install filter rules on the JMS server, JMS can be used as a message routing platform, but it is not clear whether its message throughput is sufficiently high to support large-scale systems. In this paper we investigate the capacity of the Websphere Message Queue JMS server. In contrast to other studies, we focus on the message throughput in the presence of filters and show that filtering reduces the performance significantly. We also present a model that describes the service time for a single message depending on the number of installed filters and validate it by measurements. This model helps to calculate the system throughput for specific application scenarios.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"30 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":"134314108","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":"Trustworthiness of Peers Based on Access Control in Peer-to-Peer Overlay Networks","authors":"Kenichi Watanabe, Y. Nakajima, Naohiro Hayashibara, T. Enokido, M. Takizawa, S. Deen","doi":"10.1109/ICDCSW.2006.112","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.112","url":null,"abstract":"Service supported by an object in a peer-to-peer (P2P) overlay network is modeled to be a set of methods and quality of service (QoS). In addition to discovering a peer holding a target object, it is critical to discuss what peer is allowed to manipulate the target object in what method. In this paper, we take an acquaintance approach to finding and manipulating objects in P2P overlay networks. An acquaintance peer of a peer is a peer whose service the peer knows and with which the peer can directly communicate In this paper, we discuss ways to obtain results satisfying an access request by the cooperation of acquaintances. Acquaintance peers of a peer p may hold different information on target peers since it takes time to propagate change information of the target peers, and peers may be faulty. Here, it is critical to discuss how much a peer can trust each acquaintance. First, we define how much a requesting peer is satisfied for each access request issued to an acquaintance. Then, we define the trustworthiness of an acquaintance based on the satisfiability.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"47 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":"132396503","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":"Thou Shalt Not Trust non-Trustworthy Systems","authors":"P. Veríssimo","doi":"10.1109/ICDCSW.2006.108","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.108","url":null,"abstract":"Computer systems and ICT at large (information and communication technologies) are on the verge of a strange era: on the one hand, everyday we require more from applications as seen by users (response, determinism, robustness, security); on the other hand, improvements in infrastructure technology peer with asymmetry and instability (access networks, mobility, de-regulation, and so forth). This evolution of distributed computing and applications has put new challenges on models, architectures and systems. In essence, we should look for paradigms that help us reconcile uncertainty with predictability. Grand challenges require drastic changes, and they are happening: in the hybrid, dynamic and decentralised way we start looking at system design, once quite homogeneous, static, centralised, and in the cross-fertilising way we now look at previously disjoint scientific fields. Two issues are central to modern design of dependable and secure dynamic distributed systems: the confluence between classical dependability and security, met essentially but not only by the concept of common ’accidental fault and malicious intrusion tolerance’. and the necessary but often forgotten link between trust (dependence or belief on some system’s properties) and trustworthiness (the merit of that system to be trusted, the degree to which it meets those properties, or its dependability). The uncertainty described above, together with the vast amount of exposure to wrong-doing endured by current systems, forms an explosive combination. In order to handle it and obtain assurance on the correct operation of systems, all efforts are not too much. The tolerance perspective on security, currently termed intrusion tolerance, shed new light on a road darkened by the growing difficulty of preventing every intrusion on large and complex and uncertain installations. The combination of fault and intrusion tolerance closes the final gap, by allowing the design of systems that become simultaneously secure and dependable through the same class of mechanisms. This is not enough though, we need system design principles that ensure a global and accurate view of the relation between trust and trustworthiness. This goes well beyond technological factors: if an ICT-based society will not be able to provide trustable services, services that are trusted because justifiably they rely on trustworthy components and infrastructure, then, such services, which will nevertheless be deployed due to market pressure: will be perceived with suspicion by users; will be managed by a restricted group of \"experts\", increasing info-exclusion; may very well be mismanaged, yielding cyber-crime, e-frauds, cyber terrorism and sabotage.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"34 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":"130118444","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}