The Experts below are selected from a list of 218148 Experts worldwide ranked by ideXlab platform
Andrea W Richa - One of the best experts on this subject based on the ideXlab platform.
-
accessing nearby copies of replicated objects in a Distributed Environment
Theory of Computing Systems \ Mathematical Systems Theory, 1999Co-Authors: C G Plaxton, Rajmohan Rajaraman, Andrea W RichaAbstract:Consider a set of shared objects in a Distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as efficient utilization of network resources, it is desirable that each access request be satisfied by a copy ``close'' to the requesting node. Unfortunately, it is not clear how to achieve this goal efficiently in a dynamic, Distributed Environment in which large numbers of objects are continuously being created, replicated, and destroyed. In this paper we design a simple randomized algorithm for accessing shared objects that tends to satisfy each access request with a nearby copy. The algorithm is based on a novel mechanism to maintain and distribute information about object locations, and requires only a small amount of additional memory at each node. We analyze our access scheme for a class of cost functions that captures the hierarchical nature of wide-area networks. We show that under the particular cost model considered (i) the expected cost of an individual access is asymptotically optimal, and (ii) if objects are sufficiently large, the memory used for objects dominates the additional memory used by our algorithm with high probability. We also address dynamic changes in both the network and the set of object copies.
-
accessing nearby copies of replicated objects in a Distributed Environment
ACM Symposium on Parallel Algorithms and Architectures, 1997Co-Authors: Greg C Plaxton, Rajmohan Rajaraman, Andrea W RichaAbstract:Consider a set of shared objects in a Distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as efficient utilization of network resources, it is desirable that each access request be satisfied by a copy "close" to the requesting node. Unfortunately, it is not clear how to efficiently achieve this goal in a dynamic, Distributed Environment in which large numbers of objects are continuously being created, replicated, and destroyed. In this paper, we design a simple randomized algorithm for accessing shared objects that tends to satisfy each access request with a nearby copy. The algorithm is based on a novel mechanism to maintain and distribute information about object locations, and requires only a small amount of additional memory at each node. We analyze our access scheme for a class of cost functions that captures the hierarchical nature of wide-area networks. We show that under the particular cost model considered: (i) the expected cost of an individual access is asymptotically optimal, and (ii) if objects are sufficiently large, the memory used for objects dominates the additional memory used by our algorithm with high probability. We also address dynamic changes in both the network as well as the set of object copies.
Greg C Plaxton - One of the best experts on this subject based on the ideXlab platform.
-
accessing nearby copies of replicated objects in a Distributed Environment
ACM Symposium on Parallel Algorithms and Architectures, 1997Co-Authors: Greg C Plaxton, Rajmohan Rajaraman, Andrea W RichaAbstract:Consider a set of shared objects in a Distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as efficient utilization of network resources, it is desirable that each access request be satisfied by a copy "close" to the requesting node. Unfortunately, it is not clear how to efficiently achieve this goal in a dynamic, Distributed Environment in which large numbers of objects are continuously being created, replicated, and destroyed. In this paper, we design a simple randomized algorithm for accessing shared objects that tends to satisfy each access request with a nearby copy. The algorithm is based on a novel mechanism to maintain and distribute information about object locations, and requires only a small amount of additional memory at each node. We analyze our access scheme for a class of cost functions that captures the hierarchical nature of wide-area networks. We show that under the particular cost model considered: (i) the expected cost of an individual access is asymptotically optimal, and (ii) if objects are sufficiently large, the memory used for objects dominates the additional memory used by our algorithm with high probability. We also address dynamic changes in both the network as well as the set of object copies.
Rajmohan Rajaraman - One of the best experts on this subject based on the ideXlab platform.
-
accessing nearby copies of replicated objects in a Distributed Environment
Theory of Computing Systems \ Mathematical Systems Theory, 1999Co-Authors: C G Plaxton, Rajmohan Rajaraman, Andrea W RichaAbstract:Consider a set of shared objects in a Distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as efficient utilization of network resources, it is desirable that each access request be satisfied by a copy ``close'' to the requesting node. Unfortunately, it is not clear how to achieve this goal efficiently in a dynamic, Distributed Environment in which large numbers of objects are continuously being created, replicated, and destroyed. In this paper we design a simple randomized algorithm for accessing shared objects that tends to satisfy each access request with a nearby copy. The algorithm is based on a novel mechanism to maintain and distribute information about object locations, and requires only a small amount of additional memory at each node. We analyze our access scheme for a class of cost functions that captures the hierarchical nature of wide-area networks. We show that under the particular cost model considered (i) the expected cost of an individual access is asymptotically optimal, and (ii) if objects are sufficiently large, the memory used for objects dominates the additional memory used by our algorithm with high probability. We also address dynamic changes in both the network and the set of object copies.
-
accessing nearby copies of replicated objects in a Distributed Environment
ACM Symposium on Parallel Algorithms and Architectures, 1997Co-Authors: Greg C Plaxton, Rajmohan Rajaraman, Andrea W RichaAbstract:Consider a set of shared objects in a Distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as efficient utilization of network resources, it is desirable that each access request be satisfied by a copy "close" to the requesting node. Unfortunately, it is not clear how to efficiently achieve this goal in a dynamic, Distributed Environment in which large numbers of objects are continuously being created, replicated, and destroyed. In this paper, we design a simple randomized algorithm for accessing shared objects that tends to satisfy each access request with a nearby copy. The algorithm is based on a novel mechanism to maintain and distribute information about object locations, and requires only a small amount of additional memory at each node. We analyze our access scheme for a class of cost functions that captures the hierarchical nature of wide-area networks. We show that under the particular cost model considered: (i) the expected cost of an individual access is asymptotically optimal, and (ii) if objects are sufficiently large, the memory used for objects dominates the additional memory used by our algorithm with high probability. We also address dynamic changes in both the network as well as the set of object copies.
S Velmurugan - One of the best experts on this subject based on the ideXlab platform.
-
an enhanced privacy preserving techniques for asynchronous streaming data mining in Distributed Environment
Social Science Research Network, 2020Co-Authors: S VelmuruganAbstract:This research deals with the study and analysis of privacy preserving techniques in collaborative data mining in order to improve the efficiency and effectiveness of asynchronous streaming data mining in Distributed Environment. Data mining is a process which uses different data analysis tools that discover patterns and relationships in data that can be used to make predictions. Security and Privacy protection has been a public policy firm for decades. However, rapid technological changes, the fast growing of the internet source and electronic digital source, and the development of more sophisticated methods of collecting, analyzing, and using personal data have made privacy a major public and government issues. The field of data mining is yield significance recognition to the availability of large amounts of data, easily collected and stored via computer systems.
Arif Ghafoor - One of the best experts on this subject based on the ideXlab platform.
-
a model for secure multimedia document database system in a Distributed Environment
IEEE Transactions on Multimedia, 2002Co-Authors: James Joshi, H Fahmi, Basit Shafiq, Arif GhafoorAbstract:The Internet provides a universal platform for large-scale distribution of information and supports inter-organizational services, system integration, and collaboration. Use of multimedia documents for dissemination and sharing of massive amounts of information is becoming a common practice for Internet-based applications and enterprises. With the rapid proliferation of multimedia data management technologies over the Internet, there is growing concern about security and privacy of information. Composing multimedia documents in a Distributed heterogeneous Environment involves integrating media objects from multiple security domains that may employ different access control policies for media objects. In this paper, we present a security model for Distributed document management system that allows creation, storage, indexing, and presentation of secure multimedia documents. The model is based on a time augmented Petri-net and provides a flexible, multilevel access control mechanism that allows clearance-based access to different levels of information in a document. In addition, the model provides detailed multimedia synchronization requirements including deterministic and non-deterministic temporal relations and incomplete timing information among media objects.
