Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Communication networks are typically large, dynamic and extremely complicated. To deploy, maintain, and trouble-shoot such networks, it is essential to understand how network elements---such as servers, switches, virtual machines, and virtual network functions---are connected to one another, and be able to discover communication paths beten them. It is also essential to understand how connections change over time, and be able to pose  time-travel queries  to retrieve information about past network states. This problem is becoming more acute with the advent of software defined networks, where network functions are virtualized and managed in a cloud infrastructure.    represent a communication network inventory as a graph where the nodes are network entities and edges represent relationships beten them, e.g. hosted-on, communicates-with, etc. Querying such a graph, e.g. for troubleshooting, using existing graph query languages is too cumbersome for network analysts. Thus, in this paper  present Nepal---a network path query language, which is designed to effectively retrieve desired paths from a network graph. The main novelty of Nepal is to consider paths as first-class citizens of the language, which achieves closure under composition while maintaining simplicity.  demonstrate the capabilities of Nepal by examples and discuss query evaluation.  illustrate how path queries can simplify the extraction of information from a dynamic inventory of a multi-layer network and can be used for troubleshooting.
['Theodore Johnson', 'Yaron Kanza', 'Laks V. S. Lakshmanan', 'Vladislav Shkapenyuk']
I am writing a research paper on a idea Nepal: a path query language for communication networks
[{"from": "human", "value": "I am writing a research paper on a idea Nepal: a path query language for communication networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Communication networks are typically large, dynamic and extremely complicated. To deploy, maintain, and trouble-shoot such networks, it is essential to understand how network elements---such as servers, switches, virtual machines, and virtual network functions---are connected to one another, and be able to discover communication paths beten them. It is also essential to understand how connections change over time, and be able to pose  time-travel queries  to retrieve information about past network states. This problem is becoming more acute with the advent of software defined networks, where network functions are virtualized and managed in a cloud infrastructure.    represent a communication network inventory as a graph where the nodes are network entities and edges represent relationships beten them, e.g. hosted-on, communicates-with, etc. Querying such a graph, e.g. for troubleshooting, using existing graph query languages is too cumbersome for network analysts. Thus, in this paper  present Nepal---a network path query language, which is designed to effectively retrieve desired paths from a network graph. The main novelty of Nepal is to consider paths as first-class citizens of the language, which achieves closure under composition while maintaining simplicity.  demonstrate the capabilities of Nepal by examples and discuss query evaluation.  illustrate how path queries can simplify the extraction of information from a dynamic inventory of a multi-layer network and can be used for troubleshooting."}]