Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  propose a trade-off beten hard and soft real-time guarantees to maintain an acceptable QoS guarantee in overload condition and maximize efficiently the utilization of network resources. The key of our solution is that many real-time applications are loss-tolerant, but the loss profile must be ll defined since successive packet losses are not suitable.  use the concept of (m,k)-firm timing constraints to define a novel guaranteed loss-tolerant QoS. Therefore,  extend the basic WFQ algorithm to take into account the firm timing constraints to provide lor delay guarantees without violating bandwidth fairness or misusing network resources. The proposal is called (m,k)-WFQ. Using network calculus formalism, analytic study gives the deterministic delay bound provided by the (m,k)-WFQ algorithm for upper bounded arrival curve traffic. Theoretical results and simulations show a noticeable improvement on delay guarantee made by (m,k)-WFQ compared to standard WFQ algorithm without much degrading bandwidth fairness.
['Anis Koubaa', 'Ye-Qiong Song']
I am writing a research paper on a idea Loss-tolerant QoS using firm constraints in guaranteed rate networks
[{"from": "human", "value": "I am writing a research paper on a idea Loss-tolerant QoS using firm constraints in guaranteed rate networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  propose a trade-off beten hard and soft real-time guarantees to maintain an acceptable QoS guarantee in overload condition and maximize efficiently the utilization of network resources. The key of our solution is that many real-time applications are loss-tolerant, but the loss profile must be ll defined since successive packet losses are not suitable.  use the concept of (m,k)-firm timing constraints to define a novel guaranteed loss-tolerant QoS. Therefore,  extend the basic WFQ algorithm to take into account the firm timing constraints to provide lor delay guarantees without violating bandwidth fairness or misusing network resources. The proposal is called (m,k)-WFQ. Using network calculus formalism, analytic study gives the deterministic delay bound provided by the (m,k)-WFQ algorithm for upper bounded arrival curve traffic. Theoretical results and simulations show a noticeable improvement on delay guarantee made by (m,k)-WFQ compared to standard WFQ algorithm without much degrading bandwidth fairness."}]