Abstract Views :172 |
PDF Views:3
Authors
Affiliations
1 Computer Science and Engineering Department, St. Joseph’s College of Engineering, Chennai, Tamilnadu, IN
2 Electrical Engineering Department, Government College of Engineering, Salem, Tamilnadu, IN
Source
Networking and Communication Engineering, Vol 4, No 3 (2012), Pagination: 102-109
Abstract
Spectral resources are to be divided among the users in order to maximize total user utility. A new scheme for packet transmission in various traffic patterns has been developed by introducing a bandwidth based Round Robin scheduler. Our scheduling algorithm has the abilities of reducing frame lengths and rounds. There is no packet drop in our implementation. User favors application service with a higher percentage of bandwidth in order to provide QoS. Our scheduling has reduced the inter transmission time of packets from the same stream. We define a stream to be the traffic that comes from a particular source destinated to the output router. The starvation of lower priority class data has been avoided. It reduces burst generation at the output port from the same traffic stream. The streams fairness has been ensured. The performance of this scheduler has been shown by comparing with Output Controlled Round Robin algorithm in terms of transmission rate, jitter, bandwidth, scheduling and latency.
Keywords
Bandwidth based Round Robin, Guaranteed Service, Maxmin Fair Scheduling, Robust Opportunistic Scheduling.
