this paper investigates using extensive simulations the effects of a number of important system parameters in a typical MANETs, including node speed, pause time, traffic load, and node density on the performance of pr...
详细信息
Wireless sensor networks are emerging as a popular research issue and tool for many applications. However, nodes in a sensor network are severely constrained by energy, storage capacity and computing power. In this pa...
详细信息
作者：
Barolli, ValbonaFukuda, Heihachiro
3-30-1 Wajiro-higashi Higashi-ku Fukuoka 811-0295 Japan
3-30-1 Wajiro-higashi Higashi-ku Fukuoka 811-0295 Japan
the main objective of this paper is to provide an evaluation method for both: the quality aspect of corporations (marketable quality) and the profitability. First, we define the corporation rate of operation and profi...
详细信息
Oracle 10g is a commercial infrastructure specifically designed for enterprise grid computing. On an Oracle Grid, we implement a ScanOnce algorithm to mine global association rules in support of the third generation o...
详细信息
ISBN:
(纸本)3540287000
Oracle 10g is a commercial infrastructure specifically designed for enterprise grid computing. On an Oracle Grid, we implement a ScanOnce algorithm to mine global association rules in support of the third generation of data mining systems on distributed and massive data. the ScanOnce algorithm does not need to ship all of local data to one site thereby not causing excessive network communication cost. the power of generating ad hoc queries in SQL ensures fast access to any desired counter.
this work deals with efficient barrier synchronization for wireless cluster computing where nodes communicate with each other wirelessly in one or multiple hops. Such a computing system is referred to as a wireless co...
详细信息
Given a network G = (V, E), edge weights w((.)), and a set of terminals S C V, the minimum-weight Steiner tree problem is to find a tree in G that spans S with minimum weight. Most provable heuristics treat the networ...
详细信息
ISBN:
(纸本)3540280618
Given a network G = (V, E), edge weights w((.)), and a set of terminals S C V, the minimum-weight Steiner tree problem is to find a tree in G that spans S with minimum weight. Most provable heuristics treat the network G is a metric;this assumption, in a distributed setting, cannot be easily achieved without a subtle overhead. We give a simple distributed algorithm based on a minimum spanning tree heuristic that returns a solution whose cost is within a factor of two of the optimal. the algorithm runs in time O(vertical bar V vertical bar log vertical bar V vertical bar) on a synchronous network. We also show that another heuristic based on iteratively finding shortest paths gives a theta(log vertical bar V vertical bar)-approximation using a novel charging scheme based on low-congestion routing on trees. Both algorithms work for unit-cost and general cost cases. the algorithms also have applications in finding multicast trees in wireless ad hoc networks.
In this paper, we consider the problem of modeling machine availability in enterprise-area and wide-area distributedcomputing settings. Using availability data gathered from three different environments, we detail th...
详细信息
ISBN:
(纸本)3540287000
In this paper, we consider the problem of modeling machine availability in enterprise-area and wide-area distributedcomputing settings. Using availability data gathered from three different environments, we detail the suitability of four potential statistical distributions for each data set: exponential, Pareto, Weibull, and hyperexponential. In each case, we use software we have developed to determine the necessary parameters automatically from each data collection. To gauge suitability, we present both graphical and statistical evaluations of the accuracy with each distribution fits each data set. For all three data sets, we find that a hyperexponential model fits slightly more accurately than a Weibull, but that both are substantially better choices than either an exponential or Pareto. these results indicate that either a hyperexponential or Weibull model effectively represents machine availability in enterprise and Internet computing environments.
Advances in computer networking and database technologies have enabled the collection and storage of vast quantities of data. Data mining can extract valuable knowledge from this data, and organizations have realized ...
详细信息
Advances in computer networking and database technologies have enabled the collection and storage of vast quantities of data. Data mining can extract valuable knowledge from this data, and organizations have realized that they can often obtain better results by pooling their data together. However, the collected data may contain sensitive or private information about the organizations or their customers, and privacy concerns are exacerbated if data is shared between multiple organizations. distributed data mining is concerned withthe computation of models from data that is distributed among multiple participants. Privacy-preserving distributed data mining seeks to allow for the cooperative computation of such models without the cooperating parties revealing any of their individual data items. Our paper makes two contributions in privacy-preserving data mining. First, we introduce the concept of arbitrarily partitioned data, which is a generalization of both horizontally and vertically partitioned data. Second, we provide an efficient privacy-preserving protocol for k-means clustering in the setting of arbitrarily partitioned data. Copyright 2005 ACM.
Advances in networking and microprocessor technology have enabled the development of a variety of small, low-cost, and resource-limited embedded systems. Such an embedded system is often diskless due to the weight, si...
详细信息
this paper examines the relationship among disaster tolerant systems, Information Technology (IT) application operation and availability, and the executive level management visibility necessary for system operational ...
详细信息
ISBN:
(纸本)9806560426
this paper examines the relationship among disaster tolerant systems, Information Technology (IT) application operation and availability, and the executive level management visibility necessary for system operational success. the current state of disaster tolerant application systems is explored including an investigation into the reliability and survivability requirements necessary to achieve disaster tolerant system operation through a simplified network architecture analysis. Specific focus is directed towards the risk of IT application downtime attributable to the increasing dependence placed on critical data-driven applications operating in distributed and unbounded networks. A method for disaster tolerance is proposed which mitigates unplanned downtime through a disciplined approach of computer and people based processes implementing specific documentation procedures. In addition, the importance of executive visibility into die system wide impact of downtime and the resultant effects on the total cost of ownership (TCO) of these critical systems is addressed.
暂无评论