Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Packet networks need to maintain the state in the form of forwarding tables at each switch. The cost of this state increases as networks support ever more sophisticated per-flow routing, traffic engineering, and service chaining. Per-flow or per-path state at the switches can be eliminated by encoding each packet’s desired path in its header. A key component of such a method is an efficient encoding of paths through the network.  introduce a mathematical formulation of this optimal path-encoding problem.  prove that the problem is APX-hard, by showing that approximating it to within a factor less than    $8/7$    is NP-hard. Thus, at best,  can hope for a constant-factor approximation algorithm.  then present such an algorithm, approximating the optimal path-encoding problem to within a factor 2. Finally,  provide the empirical results illustrating the effectiveness of the proposed algorithm.
['Adiseshu Hari', 'Urs Niesen', 'Gordon T. Wilfong']
I am writing a research paper on a idea On the Problem of Optimal Path Encoding for Software-Defined Networks
[{"from": "human", "value": "I am writing a research paper on a idea On the Problem of Optimal Path Encoding for Software-Defined Networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Packet networks need to maintain the state in the form of forwarding tables at each switch. The cost of this state increases as networks support ever more sophisticated per-flow routing, traffic engineering, and service chaining. Per-flow or per-path state at the switches can be eliminated by encoding each packet\u2019s desired path in its header. A key component of such a method is an efficient encoding of paths through the network.  introduce a mathematical formulation of this optimal path-encoding problem.  prove that the problem is APX-hard, by showing that approximating it to within a factor less than    $8/7$    is NP-hard. Thus, at best,  can hope for a constant-factor approximation algorithm.  then present such an algorithm, approximating the optimal path-encoding problem to within a factor 2. Finally,  provide the empirical results illustrating the effectiveness of the proposed algorithm."}]