The Experts below are selected from a list of 273 Experts worldwide ranked by ideXlab platform
John Kubiatowicz - One of the best experts on this subject based on the ideXlab platform.
-
tapestry a resilient global scale overlay for service deployment
IEEE Journal on Selected Areas in Communications, 2004Co-Authors: Ben Y Zhao, Anthony D Joseph, Ling Huang, Jeremy Stribling, Sean Rhea, John KubiatowiczAbstract:We present Tapestry, a peer-to-peer overlay Routing Infrastructure offering efficient, scalable, location-independent Routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic decentralized object location and Routing applications programming interface using a self-repairing, soft-state-based Routing layer. The paper presents the Tapestry architecture, algorithms, and implementation. It explores the behavior of a Tapestry deployment on PlanetLab, a global testbed of approximately 100 machines. Experimental results show that Tapestry exhibits stable behavior and performance as an overlay, despite the instability of the underlying network layers. Several widely distributed applications have been implemented on Tapestry, illustrating its utility as a deployment Infrastructure.
-
Distributed object location in a dynamic network
Theory of Computing Systems, 2004Co-Authors: Kirsten Hildrum, Satish Rao, John Kubiatowicz, B. Y. ZhaoAbstract:Modern networking applications replicate data and services widely, leading to a need for location-independent Routing--the ability to route queries to objects using names independent of the objects' physical locations. Two important properties of such a Routing Infrastructure are Routing locality and rapid adaptation to arriving and departing nodes. We show how these two properties can be efficiently achieved for certain network topologies. To do this, we present a new distributed algorithm that can solve the nearest-neighbor problem for these networks. We describe our solution in the context of Tapestry, an overlay network Infrastructure that employs techniques proposed by Plaxton et al. 24.
-
tapestry an Infrastructure for fault tolerant wide area location and
2001Co-Authors: Ben Y Zhao, John Kubiatowicz, Anthony D JosephAbstract:In today''s chaotic network, data and services are mobile and replicated widely for availability, durability, and locality. Components within this Infrastructure interact in rich and complex ways, greatly stressing traditional approaches to name service and Routing. This paper explores an alternative to traditional approaches called Tapestry. Tapestry is an overlay location and Routing Infrastructure that provides location-independent Routing of messages directly to the closest copy of an object or service using only point-to-point links and without centralized resources. The Routing and directory information within this Infrastructure is purely soft state and easily repaired. Tapestry is self-administering, fault-tolerant, and resilient under load. This paper presents the architecture and algorithms of Tapestry and explores their advantages through a number of experiments.
-
Tapestry : An Infrastructure for Fault-tolerant Wide-area Location and Routing
Science, 2001Co-Authors: Ben Yanbin Zhao, John Kubiatowicz, Anthony D JosephAbstract:In todays chaotic network, data and services are mobile and replicated widely for availability, durability, and locality. Components within this Infrastructure interact in rich and complex ways, greatly stressing traditional approaches to name service and Routing. This paper explores an alternative to traditional approaches called Tapestry. Tapestry is an overlay location and Routing Infrastructure that provides location-independent Routing of messages directly to the closest copy of an object or service using only point-to-point links and without centralized resources. The Routing and directory information within this Infrastructure is purely soft state and easily repaired. Tapestry is self-administering, faulttolerant, and resilient under load. This paper presents the architecture and algorithms of Tapestry and explores their advantages through a number of experiments. 1
Anthony D Joseph - One of the best experts on this subject based on the ideXlab platform.
-
tapestry a resilient global scale overlay for service deployment
IEEE Journal on Selected Areas in Communications, 2004Co-Authors: Ben Y Zhao, Anthony D Joseph, Ling Huang, Jeremy Stribling, Sean Rhea, John KubiatowiczAbstract:We present Tapestry, a peer-to-peer overlay Routing Infrastructure offering efficient, scalable, location-independent Routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic decentralized object location and Routing applications programming interface using a self-repairing, soft-state-based Routing layer. The paper presents the Tapestry architecture, algorithms, and implementation. It explores the behavior of a Tapestry deployment on PlanetLab, a global testbed of approximately 100 machines. Experimental results show that Tapestry exhibits stable behavior and performance as an overlay, despite the instability of the underlying network layers. Several widely distributed applications have been implemented on Tapestry, illustrating its utility as a deployment Infrastructure.
-
tapestry an Infrastructure for fault tolerant wide area location and
2001Co-Authors: Ben Y Zhao, John Kubiatowicz, Anthony D JosephAbstract:In today''s chaotic network, data and services are mobile and replicated widely for availability, durability, and locality. Components within this Infrastructure interact in rich and complex ways, greatly stressing traditional approaches to name service and Routing. This paper explores an alternative to traditional approaches called Tapestry. Tapestry is an overlay location and Routing Infrastructure that provides location-independent Routing of messages directly to the closest copy of an object or service using only point-to-point links and without centralized resources. The Routing and directory information within this Infrastructure is purely soft state and easily repaired. Tapestry is self-administering, fault-tolerant, and resilient under load. This paper presents the architecture and algorithms of Tapestry and explores their advantages through a number of experiments.
-
Tapestry : An Infrastructure for Fault-tolerant Wide-area Location and Routing
Science, 2001Co-Authors: Ben Yanbin Zhao, John Kubiatowicz, Anthony D JosephAbstract:In todays chaotic network, data and services are mobile and replicated widely for availability, durability, and locality. Components within this Infrastructure interact in rich and complex ways, greatly stressing traditional approaches to name service and Routing. This paper explores an alternative to traditional approaches called Tapestry. Tapestry is an overlay location and Routing Infrastructure that provides location-independent Routing of messages directly to the closest copy of an object or service using only point-to-point links and without centralized resources. The Routing and directory information within this Infrastructure is purely soft state and easily repaired. Tapestry is self-administering, faulttolerant, and resilient under load. This paper presents the architecture and algorithms of Tapestry and explores their advantages through a number of experiments. 1
Ben Y Zhao - One of the best experts on this subject based on the ideXlab platform.
-
tapestry a resilient global scale overlay for service deployment
IEEE Journal on Selected Areas in Communications, 2004Co-Authors: Ben Y Zhao, Anthony D Joseph, Ling Huang, Jeremy Stribling, Sean Rhea, John KubiatowiczAbstract:We present Tapestry, a peer-to-peer overlay Routing Infrastructure offering efficient, scalable, location-independent Routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic decentralized object location and Routing applications programming interface using a self-repairing, soft-state-based Routing layer. The paper presents the Tapestry architecture, algorithms, and implementation. It explores the behavior of a Tapestry deployment on PlanetLab, a global testbed of approximately 100 machines. Experimental results show that Tapestry exhibits stable behavior and performance as an overlay, despite the instability of the underlying network layers. Several widely distributed applications have been implemented on Tapestry, illustrating its utility as a deployment Infrastructure.
-
tapestry an Infrastructure for fault tolerant wide area location and
2001Co-Authors: Ben Y Zhao, John Kubiatowicz, Anthony D JosephAbstract:In today''s chaotic network, data and services are mobile and replicated widely for availability, durability, and locality. Components within this Infrastructure interact in rich and complex ways, greatly stressing traditional approaches to name service and Routing. This paper explores an alternative to traditional approaches called Tapestry. Tapestry is an overlay location and Routing Infrastructure that provides location-independent Routing of messages directly to the closest copy of an object or service using only point-to-point links and without centralized resources. The Routing and directory information within this Infrastructure is purely soft state and easily repaired. Tapestry is self-administering, fault-tolerant, and resilient under load. This paper presents the architecture and algorithms of Tapestry and explores their advantages through a number of experiments.
John A. Stankovic - One of the best experts on this subject based on the ideXlab platform.
-
Efficiency centric communication model for wireless sensor networks
Proceedings - IEEE INFOCOM, 2006Co-Authors: Qing Cao, Tarek F. Abdelzaher, John A. Stankovic, Tian He, Lei Fang, Sang SonAbstract:Recent studies on radio reality provided strong evidence that radio links between low-power sensor devices are extremely unreliable. In this paper, we study how to improve energy efficiency for reliable communication using such unreliable links. We identify an optimal bound on energy efficiency for reliable communication, and propose a new communication model in the link layer that asymptotically approaches this bound. This new model indicates a better path metric compared to previous path metrics, and we validate this by establishing a Routing Infrastructure based on this metric, which indeed achieves a higher energy efficiency compared to other state-of-the-art approaches. We present results from a systematic analysis, simulations and prototype experiments based on the MicaZ platform. The results give us fundamental insights on communication efficiency over unreliable links.
-
an entity maintenance and connection service for sensor networks
International Conference on Mobile Systems Applications and Services, 2003Co-Authors: Brian M Blum, Prashant Nagaraddi, Anthony D Wood, Tarek Abdelzaher, Sang H Son, John A. StankovicAbstract:In this paper, we present a middleware architecture for coordination services in sensor networks that facilitates interaction between groups of sensors which monitor different environmental events. It sits on top of the native Routing Infrastructure and exports the abstraction of mobile communication endpoints maintained at the locations of such events. A single logical destination is created and maintained for every environmental event of interest. Such destinations are uniquely labeled and can be used for communication by application-level algorithms for coordination and sensory data management between the different event locales. For example, they may facilitate coordination, in a distributed intrusion scenario, among nodes in the vicinity of the intruders.We evaluate our middleware architecture using GloMoSim, a wireless network simulator. Our results illustrate the success of our architecture in maintaining event-related communication endpoints. We provide an analysis of how architectural and network dependent parameters affect our performance. Additionally we provide a proof of concept implementation on a real sensor network testbed (Berkeley's MICA Motes).
Christian S Jensen - One of the best experts on this subject based on the ideXlab platform.
-
learning to route with sparse trajectory sets
International Conference on Data Engineering, 2018Co-Authors: Bin Yang, Jilin Hu, Christian S JensenAbstract:Motivated by the increasing availability of vehicle trajectory data, we propose learn-to-route, a comprehensive trajectory-based Routing solution. Specifically, we first construct a graph-like structure from trajectories as the Routing Infrastructure. Second, we enable trajectory-based Routing given an arbitrary (source, destination) pair. In the first step, given a road network and a collection of trajectories, we propose a trajectory-based clustering method that identifies regions in a road network. If a pair of regions are connected by trajectories, we maintain the paths used by these trajectories and learn a Routing preference for travel between the regions. As trajectories are skewed and sparse, %and although the introduction of regions serves to consolidate the sparse data, many region pairs are not connected by trajectories. We thus transfer Routing preferences from region pairs with sufficient trajectories to such region pairs and then use the transferred preferences to identify paths between the regions. In the second step, we exploit the above graph-like structure to achieve a comprehensive trajectory-based Routing solution. Empirical studies with two substantial trajectory data sets offer insight into the proposed solution, indicating that it is practical. A comparison with a leading Routing service offers evidence that the paper's proposal is able to enhance Routing quality.
