A. Riabov, Zhen Liu, J. Wolf, Philip S. Yu, Li Zhang
{"title":"New algorithms for content-based publication-subscription systems","authors":"A. Riabov, Zhen Liu, J. Wolf, Philip S. Yu, Li Zhang","doi":"10.1109/ICDCS.2003.1203519","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203519","url":null,"abstract":"This paper introduces new algorithms specifically designed for content-based publication-subscription systems. These algorithms can be used to determine multicast groups with as much commonality as possible, based on the totality of subscribers' interests. The algorithms are based oil concepts borrowed from the literature on spatial databases and clustering. These algorithms perform well in the context of highly heterogeneous subscriptions, and they also scale well. Based on concepts borrowed from the spatial database literature, we develop an algorithm to match publications to subscribers in real-time. We also investigate the benefits of dynamically determining whether to unicast, multicast or broadcast information about the events over the network to the matched subscribers. We call this the distribution method problem. Some of these same concepts can be applied to match publications to subscribers in real-time, and also to determine dynamically whether to unicast, multicast or broadcast information about the events over the network to the matched subscribers. We demonstrate the quality of our algorithms via a number of realistic simulation experiments.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114757819","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 hash history approach for reconciling mutual inconsistency","authors":"B. Kang, R. Wilensky, J. Kubiatowicz","doi":"10.1109/ICDCS.2003.1203518","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203518","url":null,"abstract":"We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of the number of active nodes but dependent on the rate and number of modifications. We present the basic hash history scheme and discuss mechanisms for trimming the history over time. We simulate the efficacy of hash histories on several large CVS traces. Our results highlight a useful property of the hash history: the ability to recognize when two different non-commutative operations produce the same output, thereby reducing false conflicts and increasing the rate of convergence. We call these events coincidental equalities and demonstrate that their recognition can greatly reduce the time to global convergence.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129028408","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 integrated approach to modeling and analysis of embedded real-time systems based on Timed Petri Nets","authors":"Z. Gu, K. Shin","doi":"10.1109/ICDCS.2003.1203484","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203484","url":null,"abstract":"In computer-based control systems, embedded software is taking over what mechanical and dedicated electronic systems used to do, that is, to engage and control the physical world, interacting directly with sensors and actuators. Therefore, software running on a digital processor is tightly-coupled with its surrounding physical environment. We propose an integrated approach based on Timed Petri-Nets for modeling and analysis of embedded real-time systems where real-time scheduling behavior of the controller software is explicitly represented at the model-level, together with the physical environment that it interacts with. This enables the designer to have an integrated view of the entire system while analyzing the system and making design decisions. We also describe a syntax-directed, automated translation procedure from Timed Petri-Nets to Timed Automata, thus enabling the use of model checkers such as UPPAAL for analysis purposes. We consider the railroad crossing problem as an application example, and evaluate alternatives for controller implementation on either single-processor or distributed multi-processor platforms based on the integrated approach.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129762354","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 case for grid computing on virtual machines","authors":"R. Figueiredo, P. Dinda, J. Fortes","doi":"10.1109/ICDCS.2003.1203506","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203506","url":null,"abstract":"We advocate a novel approach to grid computing that is based on a combination of \"classic\" operating system level virtual machines (VMs) and middleware mechanisms to manage VMs in a distributed environment. The abstraction is that of dynamically instantiated and mobile VMs that are a combination of traditional OS processes (the VM monitors) and files (the VM state). We give qualitative arguments that justify our approach in terms of security, isolation, customization, legacy support and resource control, and we show quantitative results that demonstrate the feasibility of our approach front a performance perspective. Finally, we describe the middleware challenges implied by the approach and an architecture for grid computing using virtual machines.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125846587","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 real-time scheduling in IEEE 802.11 wireless LANs","authors":"L. Y. Zhang, Y. Ge, J. Hou","doi":"10.1109/ICDCS.2003.1203517","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203517","url":null,"abstract":"Energy constraint has become an important factor in the design of MAC protocols. This paper addresses the issue of providing deterministic timing guarantees in the wireless LAN while minimizing energy consumption of the wireless nodes. We present a centralized energy efficient algorithm, Scheduled Contention Free Burst (S-CFB), which is built upon the recently proposed Hybrid Coordination Function (HCF) in the IEEE 802.11 standard. Two mechanisms are proposed: 1) bundling message transmissions into multiple contention free bursts in order to reduce control overhead; 2) allowing wireless nodes to sleep by avoiding preemption whenever possible. Our performance stud), shows that SCFB meets the timing requirement for real-time messages, allows wireless nodes to switch to idle state for a longer period of time, and reduces the number of control frames required to maintain contention free transmission.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114322777","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":"Effective delay control for high rate heterogeneous real-time flows","authors":"W. Jia, Hanxing Wang, Maoning Tang, Wei Zhao","doi":"10.1109/ICDCS.2003.1203486","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203486","url":null,"abstract":"This paper presents a new method to control the delay performance for high rate heterogeneous real-time traffic flows based on a novel traffic control algorithm which is a generalization of traditional (/spl sigma/, /spl rho/) regulator. Our new control algorithm operates like the traditional regulator under the normal loading situation, but provides more regulation for the high rate (heavy load condition) of the traffic. For a set of heterogenous real-time traffic flows R we can show that D/sub r/(R) /spl les/ D(R) where D/sub r/(R) and D(R) are the worst-case delay bounds with our new control algorithm and that with (/spl sigma/, /spl rho/) regulator respectively. More specifically, we develop a set of formula that can be used to set the parameters in our new traffic controller so that the worst case delay bound is minimized by streaming the traffic flow. We can prove that there exists a minimum (average) input rate p* such that D/sub r/(R) = D(R) for /spl rho/ /spl les/ /spl rho/* and D/sub r/(R) < D(R) for /spl rho/ > /spl rho/*. Using the extended regulator can effectively control the delay when the average heterogeneous traffic rate is high. The issues are particularly useful for Integrated Services where a flow may over claim its share of resource and for Differentiated Services where a class of traffic flows may possess very high rates.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114270642","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 context-aware data management system for ubiquitous computing applications","authors":"Christopher K. Hess, R. Campbell","doi":"10.1109/ICDCS.2003.1203478","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203478","url":null,"abstract":"One of the factors that differentiates ubiquitous computing from traditional distributed computing is context. Context, such as time, location, and situation, allows a system to adapt to the current surroundings in order to facilitate the use of the computational environment. In this paper, we present a file system for ubiquitous computing applications that is context-aware. Context is used to support the types of applications and devices that are found in ubiquitous computing spaces. Novel features of the system include how the view of data adapts to the activity being currently performed and how user data is imported into the local environment. Our system is evaluated as part of a ubiquitous computing infrastructure deployed in a seminar room to investigate issues of performance, scalability, and usability.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116225419","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":"Scalable distributed concurrency services for hierarchical locking","authors":"N. Desai, F. Mueller","doi":"10.1109/ICDCS.2003.1203504","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203504","url":null,"abstract":"Middleware components are becoming increasingly important as applications share computational resources in distributed environments. One of the main challenges in such environments is to achieve scalability of concurrency control. Existing concurrency protocols lack scalability. Scalability enables resource sharing and computing with distributed objects in systems with a large number of nodes. We have designed and implemented a novel, scalable and filly decentralized middleware concurrency control protocol. Our experiments on a Linux cluster indicate that an average number of three messages is required per lock request on a system with as many as 120, which is a logarithmic asymptote. At the same time, the response time for the requests scales linearly with the increase in concurrency level. A comparison to another scalable concurrency protocol shows that our protocol results in significantly superior asymptotic savings in message overhead and response time for large number of nodes. While our approach follows the specification of general CORBA concurrency services for large-scale data and object repositories, the principles are applicable to any distributed concurrency services and transaction models. The results of this work impact scalability for distributed computing facilities ranging from embedded computing with distributed objects over peer-to-peer computing environments to arbitrating accesses in very large database environments.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125431733","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":"On energy efficiency and network connectivity of mobile ad hoc networks","authors":"Wing Ho A. Yuen, C. Sung","doi":"10.1109/ICDCS.2003.1203450","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203450","url":null,"abstract":"In mobile ad hoc networks, it is often more important to optimize for energy efficiency than throughput. In this paper we investigate the effect of transmit range on energy efficiency of packet transmissions. We determine a common range for all nodes such that the average energy expenditure per received packet is minimized. In the first part of this paper, we consider stationary networks. We show that energy efficiency depends on various system parameters that includes path loss exponent of the channel, energy dissipation model and network offered load. In particular, when the path loss exponent is large, energy efficiency decreases when the transmit range increases. Hence, the network should be operated at the critical range that just maintains network connectivity. However, when the path loss exponent is small, operating at the critical range yields inferior throughput and energy efficiency. Our results show that energy efficiency is intimately connected to network connectivity. Three network connectivity regimes are identified as the transmit range of all nodes increases. In the second part, we examine the effect of node mobility on energy efficiency. We show that at normal offered load, an optimal transmit range exists such that energy efficiency is maximized The optimal range turns out to be insensitive to node mobility, and is much larger than the critical range. We show that the energy expenditure can be reduced by 15% to 73% in different mobility scenarios, if the network is operated at the optimal range.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125989267","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 guarantees for cluster-based internet services","authors":"Chang Li, Gang Peng, Kartik Gopalan, T. Chiueh","doi":"10.1109/ICDCS.2003.1203487","DOIUrl":"https://doi.org/10.1109/ICDCS.2003.1203487","url":null,"abstract":"As web-based transactions become an essential element of everyday corporate and commerce activities, it becomes increasingly important that the performance of web-based services be predictable and guaranteed even in the presence of wildly fluctuating input loads. In this paper, we propose a general implementation framework to provide quality of service (QoS) guarantee for cluster-based Internet services, such as E-commerce or directory service. We describe the design, implementation, and evaluation of a web request distribution system called Gage, which can provide every subscriber with distinct guarantee on the number of generic web requests that are serviced per second regardless of the total input loads at run time. Gage is one of the first systems that can support QoS guarantee involving multiple system resources, i.e., CPU, disk, and network. The frontend request distribution server of Gage distributes incoming requests among a cluster of back-end web server nodes so as to maintain per-subscriber QoS guarantee and load balance among the back-end servers. Each back-end web server node includes a Gage module, which performs distributed TCP splicing and detailed resource usage accounting. Performance evaluation of the fully operational Gage prototype demonstrates that the proposed architecture can indeed provide the guaranteed request throughput for different classes of web accesses, even in the presence of excessive input loads. The additional performance overhead associated with QoS support in Gage is merely 3.06%.","PeriodicalId":280657,"journal":{"name":"23rd International Conference on Distributed Computing Systems, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131272371","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}