Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In the online packet buffering problem (also known as the unighted FIFO variant of buffer management),  focus on a single network packet switching device with several input ports and one output port. This device forwards unit-size, unit-value packets from input ports to the output port. Buffers attached to input ports may accumulate incoming packets for later transmission; if they cannot accommodate all incoming packets, the excess is lost. A packet buffering algorithm has to choose from which buffers to transmit packets in order to minimize the number of lost packets and thus maximize the throughput.    present a tight lor bound of e/(e − 1) a 1.582 on the competitive ratio of the throughput maximization, which holds even for randomized algorithms. This improves the previously best known lor bound of 1.4659 and matches the performance of the algorithm Random Schedule. Our result contradicts the claimed performance of the Random Permutation algorithm;  point out a flaw in its original analysis.
['Marcin Bienkowski']
I am writing a research paper on a idea An optimal lower bound for buffer management in multi-queue switches
[{"from": "human", "value": "I am writing a research paper on a idea An optimal lower bound for buffer management in multi-queue switches"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In the online packet buffering problem (also known as the unighted FIFO variant of buffer management),  focus on a single network packet switching device with several input ports and one output port. This device forwards unit-size, unit-value packets from input ports to the output port. Buffers attached to input ports may accumulate incoming packets for later transmission; if they cannot accommodate all incoming packets, the excess is lost. A packet buffering algorithm has to choose from which buffers to transmit packets in order to minimize the number of lost packets and thus maximize the throughput.    present a tight lor bound of e/(e \u2212 1) a 1.582 on the competitive ratio of the throughput maximization, which holds even for randomized algorithms. This improves the previously best known lor bound of 1.4659 and matches the performance of the algorithm Random Schedule. Our result contradicts the claimed performance of the Random Permutation algorithm;  point out a flaw in its original analysis."}]