Change search
ReferencesLink to record
Permanent link

Direct link
A Bottom-Up Design for Spatial Search in Large Networks and Clouds
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Networks.
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Networks.
Cisco Systems, Inc..
2016 (English)Report (Other academic)
Abstract [en]

Information in networked systems often has spatial semantics: routers, sensors, or virtual machines have coordinates in a geographical or virtual space, for instance. In this paper, we propose a design for a spatial search system that processes queries against spatial information which is maintained in local databases inside a large networked system. In contrast to previous works in spatial databases and peer-to-peer designs, our design is bottom-up, which makes query routing network-aware and thus efficient, and which facilitates system bootstrapping and adaptation. Key to our design is a protocol that creates and maintains a distributed index of object locations based on information from local databases and the underlying network topology. The index builds upon minimum bounding rectangles (MBRs) to efficiently encode locations. We present a generic search protocol which is based on an echo protocol and uses the index to prune the search space and perform query routing. The response times of search queries increase with the diameter of the network, which is asymptotically optimal. We study the performance of the protocol through simulation in static and dynamic network environments, for different network topologies, and for network sizes upto 100'000 nodes. In all experiments, the overhead incurred by our protocol lies within thirty percent of a hypothetical optimal protocol. In addition, the protocol provides high accuracy under significant churn.

Place, publisher, year, edition, pages
2016.
Keyword [en]
network search, spatial search, spatial index, distributed query processing, bottom-up design
National Category
Communication Systems Telecommunications
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-181037OAI: oai:DiVA.org:kth-181037DiVA: diva2:897985
Note

NQC 20160228

Available from: 2016-01-27 Created: 2016-01-27 Last updated: 2016-04-11Bibliographically approved
In thesis
1. A Bottom-Up Approach to Real-Time Search in Large Networks and Clouds
Open this publication in new window or tab >>A Bottom-Up Approach to Real-Time Search in Large Networks and Clouds
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Networked systems, such as telecom networks and cloud infrastructures, generate and hold vast amounts of conguration and operational data. The goal of this work is to make all this data available through a real-time search process named network search , which will enable new real-time management solutions. The thesis contains several contributions towards engineering a network search system. Key elements of our design are a weakly structured information model that includes spatial properties, a query language that supports location- and schema-oblivious search queries, a peer-to-peer architecture, a set of echo protocols for scalable query processing, and an indexing protocol for ecient routing for spatial queries. The data against which network search is performed is maintained in local real-time databases close to the data sources. The design follows a bottom-up approach in the sense that the topology for query routing is constructed from the underlying network topology. We have built a prototype of the system on a cloud testbed and developed applications that use network search functionality. Testbed measurements suggest that it is feasible to engineer a network search system that processes queries at low latency and low overhead and that can scale to 100'000 nodes. Simulation results for spatial queries show that query processing achieves response times and incurs overhead close to an optimal protocol, and that query result remains accurate under signicant churn.

Place, publisher, year, edition, pages
Stockholm: Kungliga Tekniska högskolan, 2016. 122 p.
Series
TRITA-EE, ISSN 1653-5146 ; 2016:012
National Category
Communication Systems Telecommunications
Research subject
Electrical Engineering
Identifiers
urn:nbn:se:kth:diva-184236 (URN)978-91-7595-858-3 (ISBN)
Public defence
2016-05-03, F3, Lindstedtsvägen 26, våningsplan 2, Sing-Sing, KTH Campus, Stockholm, 09:30 (English)
Opponent
Supervisors
Note

QC 20160411

Available from: 2016-04-11 Created: 2016-03-31 Last updated: 2016-04-11Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Uddin, MisbahStadler, Rolf
By organisation
ACCESS Linnaeus CentreCommunication Networks
Communication SystemsTelecommunications

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 44 hits
ReferencesLink to record
Permanent link

Direct link