Quality of Service Provisioning in Wireless and High-Speed Networks

The goal in the second part of the thesis is the alleviation of a potential processing bottleneck encountered in packet scheduling in high-speed wireline networks. The scheduler should be designed to provide minimum-bandwidth and delay guarantees, and fair sharing of excess bandwidth. In the state-of-the-art schedulers, based on the weighted fair queuing (WFQ) paradigm, packets are assigned (transmission sequence) tags based on the bandwidth shares of the connections. In order to relieve the processing burden due to tag computation and sorting, variants of weighted round robin (WRR) scheduling paradigm are proposed in this thesis. Contrary to conventional thinking, it is shown that, for networks with fixed packet lengths, such WRR schemes can guarantee the same desirable properties as different WFQ schemes.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Electrical Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Chaskar, Hemant Madhusudan

Contributors dc:contributor

• Upamanyu Madhow

• Engineering, Electronics and Electrical

Language dc:language

eng

Identifier

(MiAaPQ)AAI9952986

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/81303