Management by network search

Uddin, Misbah; Stadler, Rolf; Clemm, Alexander

doi:10.1109/noms.2012.6211893

Cited by 10 publications

(7 citation statements)

References 30 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two examples of IR models that are relevant to this paper are the vector space model and the extended boolean retrieval model [3]. A brief discussion of IR concepts with respect to network search can be found in [1].…”

Section: Related Workmentioning

confidence: 99%

“…Term matching is performed against attributes associated with graph nodes [15], [16]. Figure 1 shows an architecture for a network search system, which we introduced in [1]. Its key element is the search plane, which conceptualizes the network search functionality.…”

Section: Related Workmentioning

confidence: 99%

“…Network search is a paradigm that stresses an information-centric view of network management [1], [2]. Its main elements are real-time access to operational and configuration data, a weakly structured data model, and a scalable search function that executes inside the managed system.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Scalable matching and ranking for network search

Uddin

Stadler

Clemm

2013

Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013)

View full text Add to dashboard Cite

Abstract-Network search makes operational data available in real-time to management applications. In contrast to traditional monitoring, neither the data location nor the data format needs to be known to the invoking process, which simplifies application development, but requires an efficient search plane inside the managed system. The search plane is realized as a network of search nodes that process search queries in a distributed fashion. This paper introduces matching and ranking for network search queries. We are proposing a semantic for matching and ranking, which is configurable to support different types of management applications-from exact matching for database-style queries to loose, approximate matching, which is appropriate for exploratory purposes. We describe an echo protocol for efficient distributed query processing that supports matching and ranking. Further, we present the design of a search node, which maintains a real-time database of operational information and allows for parallel processing of search queries. A prototype implementation on a cloud testbed shows that the network search system, on a 9-node cluster with 24 core servers, executes 200 global search queries/sec with the 75th percetile latency below 100 milliseconds and with a CPU utilization below 5%. The performance measurements, together with our design, suggest that a system of 100,000 servers processing the same load would exhibit the same overhead per server and a query latency of below 1 sec.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Scalable matching and ranking for network search

Uddin

Stadler

Clemm

2013

Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013)

View full text Add to dashboard Cite

show abstract

“…1. An architecture for a graph search system [15] Our design includes a simple information model that is based on property graphs [10] to represent operational and configuration data. Further, it includes a search query language that is based on keyword search and extended with boolean, projection and aggregation operators.…”

Section: Introductionmentioning

confidence: 99%

“…It allows to search for and search in large graph objects that represents important operational and configuration information in networked systems. Figure 1 shows the architecture for a graph search system that we developed for in-network processing of management information and applied to network search [15]. Its key element is the search plane, which conceptualizes the graph search functionality.…”

Section: Introductionmentioning

confidence: 99%

Graph search for cloud network management

Uddin

Stadler

Miyazawa

et al. 2014

2014 IEEE Network Operations and Management Symposium (NOMS)

View full text Add to dashboard Cite

Abstract-A large part of operational and configuration information in networks and clouds has graph structure, e.g., virtual network topologies, IP flows, communication links of distributed cloud applications. The final objective of this work is to develop a scalable management system that allows realtime management applications, such as network analytics and anomaly detection applications, to search for graph-structured operational information. The paper contains a step towards this objective. The key challenge is to devise an efficient and scalable search process on data that is volatile and distributed across the network infrastructure. Approaches that are currently pursued for distributed graph databases are not applicable in this context. This paper presents design options and possible solutions for engineering a scalable graph search system that supports management applications. It includes a simple information model based on property graphs and a search query language based on keyword search. The architecture of the system centers around a distributed search plane that performs query processing using a network of search nodes. Finally, the paper outlines the design of a search node, which contains a local database that maintains graph partitions.

show abstract

A bottom‐up design for spatial search in large networks and clouds

2018

View full text Add to dashboard Cite

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 that 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 to efficiently encode locations. We present a generic search protocol that 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 up to 100 000 nodes. In most experiments, the overhead incurred by our protocol lies well below 30% of a hypothetical optimal protocol. In addition, the protocol provides high accuracy under significant churn. Int J Network Mgmt. 2018;28:e2041. wileyonlinelibrary.com/journal/nemConsider a networking scenario where locations for routers, servers, and virtual machines are produced by a network coordinate system, such as Vivaldi. 4 In this case, the Euclidean distance between locations refers to the round-trip-time between the network entities at those locations. Spatial queries include finding a server that is closest to a client application or finding a server with a similar distance to a given set of clients. Second, consider a networking environment where locations refer to geographic coordinates and distances refer to geographical distances. A spatial query for this case is finding backup servers outside a given area to improve availability in case of failures. Third, consider an Internet of Things (IoT) scenario with garbage containers at different geographical locations. A spatial query is finding full containers within a certain distance from a given place, for example, to facilitate garbage collection. Fourth, consider an information and communication technology infrastructure, whereby locations are IP addresses mapped onto R 4 (in case of IPv4). A spatial query in this case is finding physical or virtual machines in a given address range for the purpose of security management. Lastly, consider the case where a router searches for the closest gateway in the context of performance-based routing in order to optimize service levels.We illustrate the use of the Euclidean spatial model with two spatial queries. We assume a search space O of objects, whereby each object o ∈ O has a locat...

show abstract

Management by network search

Cited by 10 publications

References 30 publications

Scalable matching and ranking for network search

Scalable matching and ranking for network search

Graph search for cloud network management

A bottom‐up design for spatial search in large networks and clouds

Contact Info

Product

Resources

About