Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In computer networks, message routing is often accomplished by network nodes using local information. The unavailability of global information intuitively makes hard routing problems virtually impossible.  formalizes this intuition by examining a hard (NP-complete) routing problem, the problem of multi-destination routing. It is shown that with only limited information it is  impossible  to optimize network utilization for the multi-destination routing problem. Moreover, it is impossible to even approximate optimality to within a specified tolerance. Several versions of this result are proved; the versions differ in terms of the amount of information available at a node, and the extent to which the problem cannot be approximated.
['Jeffrey M. Jaffe']
I am writing a research paper on a idea Distributed multi-destination routing: The constraints of local information
[{"from": "human", "value": "I am writing a research paper on a idea Distributed multi-destination routing: The constraints of local information"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In computer networks, message routing is often accomplished by network nodes using local information. The unavailability of global information intuitively makes hard routing problems virtually impossible.  formalizes this intuition by examining a hard (NP-complete) routing problem, the problem of multi-destination routing. It is shown that with only limited information it is  impossible  to optimize network utilization for the multi-destination routing problem. Moreover, it is impossible to even approximate optimality to within a specified tolerance. Several versions of this result are proved; the versions differ in terms of the amount of information available at a node, and the extent to which the problem cannot be approximated."}]