Scheduling Non-Uniform Traffic in a Packet Switching System
Weller, Timothy Neil
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/72026
Description
Title
Scheduling Non-Uniform Traffic in a Packet Switching System
Author(s)
Weller, Timothy Neil
Issue Date
1993
Doctoral Committee Chair(s)
Hajek, Bruce
Department of Study
Electrical Engineering
Discipline
Electrical Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Computer Science
Abstract
Flexible non-uniform traffic models are important for the analysis of integrated data networks carrying diverse classes of data. In this thesis, a new model of non-uniform traffic is introduced for a single-hop packet switching system. This traffic model allows arbitrary traffic streams subject only to a constraint on the number of data packets which can arrive at any individual source in the system or for any individual destination in the system over time periods of specified length. The maximum number of packets allowed and the length of time over which the maximum is enforced are parameters of the model. A system model is used which is general enough for broad application, from packet switches to passive optical star WDMA networks.
Transmission algorithms are introduced for use with such non-uniform traffic if the propagation delay is zero or small and if the propagation delay is large relative to the packet length. The algorithms presented for small propagation delay are based on collision-free scheduling of packets using graph matching algorithms since the global state of the system is known to all stations at any time. The algorithms introduced for large propagation delay are based primarily on sending transmission schedules to the receivers immediately before transmitting each data packet multiple times so that the receiver can maximize the number of packets it captures. Large propagation delay is an important consideration since it is increasingly a factor in networks as data packet lengths decrease and network speeds increase--for example, in high-speed networks based on the Asynchronous Transfer Mode standard.
Another contribution of the thesis is a comparison under uniform random traffic of several transmission algorithms--including two which are original in this thesis--on a common simulation platform over a broad range of propagation delay, number of stations, traffic arrival rate, and buffer size. The remainder of the thesis discusses transmission algorithm performance over a range of these parameters when the system model is modified to accommodate features of existing and anticipated communication systems. Considered in this analysis are propagation delay, data channel capacity, control channel capacity, source queue access, and switching times.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
