Abstarct: The problem of traffic scheduling and scheduling algorithms for servicing data networks have long been investigated from different aspects of quality of service parameters. Nowadays our smartphones have different servers such as WiFi, 3G, 4G, etc. and the number of these servers is growing over time. For each server we may have some preferences. If smartphones use several servers at the same time, it can increase throughput and connectivity for applications like video stream or VOIP, and it can also reduce delay in the network. This means our mobile devices need to schedule packets in keeping with our preferences while making use of all the capacity available. Traditional fair queuing algorithms couldn’t use an application preferences for some servers over others. In this thesis, with vertifying DRR, RR, SPN and FCFS as multiserver and identifying proposed algorithm baxsed on DRR algorithm, average delay and waiting time parameters are obtained, And by using poison distribution as input and leaky bucket as input controller, show that our proposed algorithm has better implementation than other 4 algorithms in quality of service parameters.