Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performance of distributed applications.  introduce a framework for solving online problems that aim to minimize the congestion (i.e. the maximum load of a network link) in general topology networks.  apply this framework to the problem of online routing of virtual circuits and to a dynamic data management problem. For both scenarios  achieve a competitive ratio of O(log/sup 3/ n) with respect to the congestion of the network links. Our online algorithm for the routing problem has the remarkable property that it is oblivious, i.e., the path chosen for a virtual circuit is independent of the current network load. Oblivious routing strategies can easily be implemented in distributed environments and have therefore been intensively studied for certain network topologies as e.g. meshes, tori and hypercubic networks. This is the first oblivious path selection algorithm that achieves a polylogarithmic competitive ratio in general networks.
['Harald Räcke']
I am writing a research paper on a idea Minimizing congestion in general networks
[{"from": "human", "value": "I am writing a research paper on a idea Minimizing congestion in general networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performance of distributed applications.  introduce a framework for solving online problems that aim to minimize the congestion (i.e. the maximum load of a network link) in general topology networks.  apply this framework to the problem of online routing of virtual circuits and to a dynamic data management problem. For both scenarios  achieve a competitive ratio of O(log/sup 3/ n) with respect to the congestion of the network links. Our online algorithm for the routing problem has the remarkable property that it is oblivious, i.e., the path chosen for a virtual circuit is independent of the current network load. Oblivious routing strategies can easily be implemented in distributed environments and have therefore been intensively studied for certain network topologies as e.g. meshes, tori and hypercubic networks. This is the first oblivious path selection algorithm that achieves a polylogarithmic competitive ratio in general networks."}]