Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the classical cyclic polling model with Poisson arrivals and with gated service at all queues, but where the local scheduling policies are not necessarily First-Come- First-Served (FCFS). More precisely,  study the waitingtime performance of polling models where the local service order is Last-Come-First-Served (LCFS), Random-Orderof- Service (ROS) or Processor Sharing (PS). Under heavytraffic conditions the waiting times turn out to converge to products of generalized trapezoidal distributions and a gamma distribution.
['Rene Bekker', 'Jl Jan-Pieter Dorsman', 'van der Rd Mei', 'Petra Vis', 'Emm Erik Winands']
I am writing a research paper on a idea Scheduling in polling systems in heavy traffic
[{"from": "human", "value": "I am writing a research paper on a idea Scheduling in polling systems in heavy traffic"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the classical cyclic polling model with Poisson arrivals and with gated service at all queues, but where the local scheduling policies are not necessarily First-Come- First-Served (FCFS). More precisely,  study the waitingtime performance of polling models where the local service order is Last-Come-First-Served (LCFS), Random-Orderof- Service (ROS) or Processor Sharing (PS). Under heavytraffic conditions the waiting times turn out to converge to products of generalized trapezoidal distributions and a gamma distribution."}]