Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Virtual network embedding has been intensively studied for a decade. The time complexity of most conventional methods has been reduced to the cube of the number of links. Since customers are likely to request a dense virtual network that connects every node pair directly (|E| = O(|V|2)) based on a traffic matrix, the time complexity is actually O(|E|3 = |V|6). If  re allod to reduce this dense network into a sparse one before embedding, the time complexity could be decreased to O(|V|3); the time gap can be a million times for |V| = 100. The network reduction, hover, combines several virtual links into a broader link, which makes the embedding cost (solution quality) much worse.  analytically and empirically investigates the trade-off beten the embedding time and cost for the virtual network reduction.  define two simple reduction algorithms and analyze them with several interesting theorems. The analysis indicates that the embedding cost increases only linearly with exponential decay of embedding time. Thorough numerical evaluation justifies the desirability of the trade-off.
['Toru Mano', 'Takeru Inoue', 'Kimihiro Mizutani', 'Osamu Akashi']
I am writing a research paper on a idea Reducing dense virtual networks for fast embedding
[{"from": "human", "value": "I am writing a research paper on a idea Reducing dense virtual networks for fast embedding"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Virtual network embedding has been intensively studied for a decade. The time complexity of most conventional methods has been reduced to the cube of the number of links. Since customers are likely to request a dense virtual network that connects every node pair directly (|E| = O(|V|2)) based on a traffic matrix, the time complexity is actually O(|E|3 = |V|6). If  re allod to reduce this dense network into a sparse one before embedding, the time complexity could be decreased to O(|V|3); the time gap can be a million times for |V| = 100. The network reduction, hover, combines several virtual links into a broader link, which makes the embedding cost (solution quality) much worse.  analytically and empirically investigates the trade-off beten the embedding time and cost for the virtual network reduction.  define two simple reduction algorithms and analyze them with several interesting theorems. The analysis indicates that the embedding cost increases only linearly with exponential decay of embedding time. Thorough numerical evaluation justifies the desirability of the trade-off."}]