PhD Thesis Proposal Defence "Design and Analysis of Scheduling and Queue Management Schemes for High Performance Switches and Routers" Mr. Zhen Zhou Abstract: The growth of today's Internet has been constrained substantially by the performance of the interconnecting router and switches. High performance routers and switches rely heavily on the scheduling and queuing technologies in order to provide quality services to today's Internet users. In this proposal, we design and analyze fast and efficient scheduling algorithms and fair queuing management schemes for routers and switches. We commence by proving the theoretical limitations on the queuing lengths in the framework of on-line switching scheduling with virtual output queuing. Those bounds determine the size of the memory that must be allocated to switch ports in order to avoid packet loss. We then focus on designing the scheduling algorithms for optical switches. The optical switch scheduling problem is modelled as batch scheduling, and its on-line competitiveness is examined. Three algorithms are proposed for optical switches with analysis and simulations. Internet research stresses more and more on the quality of service provided to the network end users rather than engineering realization of the service implementation. Following this trend, we formulate router resource allocation schemes and compare their corresponding fairness. "Network ants" are the splitting flows that network end users create in order to obtain additional bandwidth allocation. We show by example and simulation that network ants can lead to unfair bandwidth resource allocation; thus requiring a queue management scheme that will maintain the fairness among the flows by mitigating these effects. Date: Friday, 10 November 2006 Time: 10:00a.m.-12:00noon Venue: Room 3501 lifts 25-26 Committee Members: Dr. Mordecai Golin (Supervisor) Dr. Qian Zhang (Chairperson) Dr. Brahim Bensaou Dr. Danny Tsang (ECE) **** ALL are Welcome ****