Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Generalized Processor Sharing (GPS) is realized as the most important ideal fluid scheduling discipline in guaranteed QoS networks. The ll-known problem of GPS-based rate-proportional servers is the bandwidth delay coupling which leads to inefficient resource utilization.   introduce the concept of non rate-proportional (or arbitrary) ighting of sessions in GPS systems. Such an approach in a GPS node of network constrained by leaky buckets can handle bandwidth and delay parameters independently, thus allowing better utilization of network resources. Moreover,  show that even under the traditional bandwidth delay coupled system (rate-proportional ighting) it is possible to determine tighter delay bounds of sessions than that of presented in earlier papers. A numerically inexpensive algorithm, which works in any arbitrary ighted GPS system is also presented for computing delay bounds. Besides the analytical work numerical examples are also shown.
['Róbert Szabó', 'Peter Barta', 'Felicián Németh', 'József Bíró']
I am writing a research paper on a idea Worst-Case Deterministic Delay Bounds for Arbitrary Weighted Generalized Processor Sharing Schedulers
[{"from": "human", "value": "I am writing a research paper on a idea Worst-Case Deterministic Delay Bounds for Arbitrary Weighted Generalized Processor Sharing Schedulers"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Generalized Processor Sharing (GPS) is realized as the most important ideal fluid scheduling discipline in guaranteed QoS networks. The ll-known problem of GPS-based rate-proportional servers is the bandwidth delay coupling which leads to inefficient resource utilization.   introduce the concept of non rate-proportional (or arbitrary) ighting of sessions in GPS systems. Such an approach in a GPS node of network constrained by leaky buckets can handle bandwidth and delay parameters independently, thus allowing better utilization of network resources. Moreover,  show that even under the traditional bandwidth delay coupled system (rate-proportional ighting) it is possible to determine tighter delay bounds of sessions than that of presented in earlier papers. A numerically inexpensive algorithm, which works in any arbitrary ighted GPS system is also presented for computing delay bounds. Besides the analytical work numerical examples are also shown."}]