R. Baldoni, Silvia Bonomi, Adriano Rippa, Leonardo Querzoni, S. Piergiovanni, A. Virgillito
{"title":"Evaluation of Unstructured Overlay Maintenance Protocols under Churn","authors":"R. Baldoni, Silvia Bonomi, Adriano Rippa, Leonardo Querzoni, S. Piergiovanni, A. Virgillito","doi":"10.1109/ICDCSW.2006.49","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.49","url":null,"abstract":"An overlay network is formed on top of - and generally independently from - the underlying physical computer network, by the peers (nodes) of a P2P system. The dynamics of peers is taken into account by devising appropriate overlay maintenance protocols that are able to join and leave peers from the overlay. Due to the need for scaling in the number of nodes, overlay maintenance protocols have been simulated only in environments showing a very restricted behavior with respect to the possible concurrent and interleaved execution of join/leave operations. In this paper we compare two overlay maintenance protocols well suited to unstructured P2P systems, namely SCAMP and Cyclon, in an event-based simulation setting including concurrent and interleaved join and leave operations as well as variable message transfer delay. This simulation setting allows to point out surprising results for both protocols. In particular, under a continuous and concurrent replacement of nodes, permanent partitioning of the overlay arises after a very small number of join/leave operations.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"72 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":"123113999","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}
S. Tano, Tatsuhiro Takayama, Mitsuru Iwata, T. Hashiyama
{"title":"Wearable Computer for Ubiquitous Informal Communication","authors":"S. Tano, Tatsuhiro Takayama, Mitsuru Iwata, T. Hashiyama","doi":"10.1109/ICDCSW.2006.114","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.114","url":null,"abstract":"The rapid progress of information technology has spurred development of various communication support systems. In particular, the importance of informal communication has lately drawn considerable attention because informal information can be intuitive, emotional, personal, honest, and subjective, traits that may be very difficult to get from formal media. We analyzed the features of informal communication and clarified the requirements of an informal communication support system. Next, we designed an informal communication support system whose basic architecture is a combination of a wearable computer, a see-through head mounted display, a bone conduction speaker, and a 3D-pen. The user can write graffiti such as a handwritten memo or make a voice memo and place it in a realworld context such as at a certain location (by GPS), environmental sound, the real object (by RFID) and so on. The informal information is thus shared with others on the peer-to-peer self-organized network. We demonstrated the prototype system and conducted a preliminary evaluation.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"155 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113993014","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 Robust and Energy Efficient Routing Scheme for Wireless Sensor Networks","authors":"Haiguang Wang, P. Kong, Winston K.G. Seah","doi":"10.1109/ICDCSW.2006.10","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.10","url":null,"abstract":"In a wireless sensor network, energy efficient transmissions are important because each node has a limited battery. On the other hand, the energy limitation should not compromise the robustness in end-to-end packet delivery. This paper proposes an energy efficient routing scheme that can ensure high robustness despite dynamic link quality. The key ideas are to form a routing tree with one degree of redundancy where each node maintains two parents, namely default and backup, toward the sink, and to dynamically switch between the default and backup links depending on the dynamic link quality. For energy efficiency, the default parents are selected based on the minimal expected transmission (METX) criterion while the backup parents are selected with a combination of METX and signal strength criteria. The switching mechanism is designed to be adaptive with inertia so that unnecessary changes in route can be avoided. The proposed routing scheme has been evaluated through NS-2 simulator. The results confirm that a 36% improvement in robustness can be achieved in a random topology without any significant degradation in energy efficiency.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"79 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":"131531994","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}
P. Pietzuch, J. Ledlie, M. Mitzenmacher, M. Seltzer
{"title":"Network-Aware Overlays with Network Coordinates","authors":"P. Pietzuch, J. Ledlie, M. Mitzenmacher, M. Seltzer","doi":"10.1109/ICDCSW.2006.76","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.76","url":null,"abstract":"Network coordinates, which embed network distance measurements in a coordinate system, were introduced as a method for determining the proximity of nodes for routing table updates in overlay networks. Their power has far broader reach: due to their low overhead and automatic adaptation to changes in the network, network coordinates provide a new paradigm for managing dynamic overlay networks. We compare network coordinates to other proposals for network-aware overlays and show how they permit the lucid expression of a range of distributed systems problems in well-understood geometric terms.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"17 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":"131594565","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":"Flow-based resource allocation in a multiple-access wireless market-setting using an auction","authors":"M. Roggendorf, F. Beltrán","doi":"10.1109/ICDCSW.2006.55","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.55","url":null,"abstract":"This paper presents a flow-based, auction-driven approach to resource allocation. This approach allows mobile stations to simultaneously negotiate for resources from competing providers. We use an auction at each provider to decide on the resource allocation, based on the offers made by agents representing mobile nodes. All agents in the system try to maximise their utility gained from the total allocation of resources. The focus of this paper is on the bidding strategy of a mobile station when faced with the opportunity to obtain network resources from multiple sources. We support the proposed bidding strategy by simulation experiments, which show that the resulting allocation is efficient under the limited scope of the simulation setup.We also show that multiple-access can increase the allocation efficiency compared to the situation in which agents have access to only one network.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"2188 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":"130107102","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":"Service Plans for Context- and QoS-aware Dynamic Middleware","authors":"Sten A. Lundesgaard, K. Lund, F. Eliassen","doi":"10.1109/ICDCSW.2006.97","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.97","url":null,"abstract":"State-of-the-art context- and QoS-aware dynamic middleware platforms use information about the environment, in order to evaluate alternative configurations of an application and select the one that best meets the user’s QoS requirements. The specification of the alternatives is prepared at designtime and associated with the software during deployment. From the information and requirements in the specification, the middleware can synthesis, filter, and compare the alternative application configurations. This paper presents a platform independent specification, referred to as service plan, which contains information elements for specifying configurations, dependencies on the environment, and QoS characteristics. The service plan is specified at a conceptual level to ensure that it can be implemented in a wide range of middleware platforms. The paper describes how the concept is used during deployment, instantiation, and reconfiguration. From the implementation and validation the expressiveness and usefulness of the service plan concept is assessed.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"90 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":"116084712","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":"AwareOffice: Integrating Modular Context-Aware Applications","authors":"T. Zimmer, M. Beigl","doi":"10.1109/ICDCSW.2006.25","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.25","url":null,"abstract":"Developing valuable context-aware applications is at the centre of research in Ubicomp. In this paper we want to describe our experience over the last years in designing and developing such applications and in integrating them to build homogeneous Ubicomp environments. We introduce the concept of modular integration of context-aware application by presenting the AwareOffice TecO’s test bed for all kinds of context-aware applications form the office domain. We will show how we can easily build new applications by simply exploiting the modularity of our system. Therefore we introduce some base applications of the AwareOffice in some detail and show how to build more complex applications by modularly integrating them.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"264 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120971672","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":"Preventing Spam in Publish/Subscribe","authors":"S. Tarkoma","doi":"10.1109/ICDCSW.2006.85","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.85","url":null,"abstract":"Publish/subscribe protocols are becoming popular on the Internet with the advent of RSS-feeds and Session Initiation Protocol (SIP) events. Since publish/subscribe is by nature many-to-many form of communication, it is vital to prevent spam and bogus messages. This problem has not yet been fully addressed. In this paper, we investigate the spam problem in distributed content-based publish/ subscribe overlay networks and outline several solutions inspired by current email spam prevention techniques. We analyze filter-based spam in distributed pub/sub systems and focus on the detection and mitigation of bogus publishers and brokers.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"41 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":"117068175","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":"Saving Energy and Reducing Latency in MANET File Access","authors":"G. Dodero, V. Gianuzzi","doi":"10.1109/ICDCSW.2006.94","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.94","url":null,"abstract":"The paper illustrates the design of MobEYE, a cooperative cache system for file transfer overMANETs. Its implementation is based on the sniffing facilities provided by the BSD Packet Filter, to process in-transit messages at the application level. MobEYE has been simulated, deriving support for the claim of saving energy and reducing latency; further possible optimizations, based on the use of promiscuous transmission mode, are discussed as well.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"32 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":"127804280","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":"Specification-Based Unit Testing of Publish/Subscribe Applications","authors":"Anton Michlmayr, P. Fenkam, S. Dustdar","doi":"10.1109/ICDCSW.2006.103","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.103","url":null,"abstract":"Testing remains the most applied verification method for software systems. Typically, the behavior of such systems is evaluated against their informal or formal specifications. In this paper, we consider an architecture-driven approach to software testing. We support the argument that, in many cases, the difficulties in testing can be alleviated by optimizing the test methodology to leverage the architecture of the application under test. To support this claim, we present a test framework for publish/subscribe applications. This paper evaluates our initial steps in this regard. We focus on the design of our framework, and illustrate how to accomplish unit testing of publish/subscribe applications against LTL specifications, considering a real-world application as example.","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":"132393304","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}