Results 1 -
7 of
7
Survey of Research towards Robust Peer-to-Peer Networks: Search Methods
- COMPUTER NETWORKS
, 2004
"... ..."
(Show Context)
Routing as a Service
, 2004
"... Many recent proposals have argued for giving end-hosts control over routing in the network to satisfy the growing demands of applications. However, these proposals either run at an overlay level independent of one another, or else lack support for end-hosts to discover the desired routes. In this pa ..."
Abstract
-
Cited by 44 (6 self)
- Add to MetaCart
(Show Context)
Many recent proposals have argued for giving end-hosts control over routing in the network to satisfy the growing demands of applications. However, these proposals either run at an overlay level independent of one another, or else lack support for end-hosts to discover the desired routes. In this paper, we propose a network architecture that addresses these limitations. At the basis of our solution lies the idea that specialized route computation should be provided as a service and not embedded in the infrastructure. This design allows the routing functionality to evolve without changing the infrastructure. Our architecture consists of three entities: (a) a forwarding infrastructure that enables end-hosts to setup routes, (b) Routing Service (ROSE) providers that compute routes (conforming to application requirements) based on network information that the infrastructure provides, and (c) end-hosts that setup the routes, obtained by querying ROSE, in the infrastructure. We address the issues of trust, scalability of the ROSE architecture, and deployability. We demonstrate the feasibility of our solution by conducting experiments on a prototype deployed on PlanetLab. To illustrate the benefits of our architecture we evaluate two applications: metric-sensitive multicast, and resilient routing.
Querying at Internet Scale
- In: SIGMOD ’04: Proceedings of the 2004 ACM SIGMOD international conference on Management of data
, 2004
"... We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Internet. PIER utilizes a Distributed Hash Table (DHT) as its communication substrate in order to achieve scalability, reliability, decentralized control, and load balancing. PIER enhance ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Internet. PIER utilizes a Distributed Hash Table (DHT) as its communication substrate in order to achieve scalability, reliability, decentralized control, and load balancing. PIER enhances DHTs with declarative and algebraic query interfaces, and underneath those interfaces implements multihop, in-network versions of joins, aggregation, recursion, and query/result dissemination. PIER is currently being used for diverse applications, including network monitoring, keyword-based filesharing search, and network topology mapping. We will demonstrate PIER's functionality by showing system monitoring queries running on PlanetLab, a testbed of over 300 machines distributed across the globe.
unknown title
"... Interoperation between Information Spaces on the Web In my thesis I will address the problem of interoperation between information spaces on the web. We explain how this problem is different to traditional database integration scenarios. In particular, we focus on one issue of the information integr ..."
Abstract
- Add to MetaCart
(Show Context)
Interoperation between Information Spaces on the Web In my thesis I will address the problem of interoperation between information spaces on the web. We explain how this problem is different to traditional database integration scenarios. In particular, we focus on one issue of the information integration problem peculiar to the web environment, namely linking information across sources. We use RDF as the underlying data model and representation format, and define a query and rule language where queries can span multiple sources. We show how this language can be used to relate information among sources. 1.
Survey of Research towards Robust Peer-to-Peer Networks: Search Methods Status of This Memo
"... ..."
(Show Context)
Querying and Routing in Next-Generation Networks
"... I propose the use of recursive queries [24] as an interface for querying distributed network graph structures. Recursive queries allow a query result to be defined in terms of itself. This is particularly useful for querying network graphs that exhibit recursive structures. To query these distribute ..."
Abstract
- Add to MetaCart
I propose the use of recursive queries [24] as an interface for querying distributed network graph structures. Recursive queries allow a query result to be defined in terms of itself. This is particularly useful for querying network graphs that exhibit recursive structures. To query these distributed graphs over the Internet, I propose using distributed query processing techniques to process recursive queries. I further demonstrate the relationship between in-network execution of recursive queries and traditional routing protocols. Based on this relationship, I propose investigating the use of recursive queries for end-hosts to customize routing protocols. I plan to implement my proposals in the context of the PIER [9] system, and study different techniques to achieve good performance in the system.
Querying at Internet Scale
"... We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Inter-net. PIER utilizes a Distributed Hash Table (DHT) as its communication substrate in order to achieve scalability, re-liability, decentralized control, and load balancing. PIER enhan ..."
Abstract
- Add to MetaCart
(Show Context)
We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Inter-net. PIER utilizes a Distributed Hash Table (DHT) as its communication substrate in order to achieve scalability, re-liability, decentralized control, and load balancing. PIER enhances DHTs with declarative and algebraic query inter-faces, and underneath those interfaces implements multi-hop, in-network versions of joins, aggregation, recursion, and query/result dissemination. PIER is currently being used for diverse applications, including network monitoring, keyword-based ¯lesharing search, and network topology map-ping. We will demonstrate PIER's functionality by showing system monitoring queries running on PlanetLab, a testbed of over 300 machines distributed across the globe. 1.
