EEL 6507 Queueing Theory and Data Communications

Fall 2003



Honor Code

All students admitted to the University of Florida have signed a statement of academic honesty committing themselves to be honest in all academic work and understanding that failure to comply with this committment will result in disciplinary action. This statement is a reminder to uphold your obligation as a student at the University of Flordia, and to be honest in all work submitted and exams taken in this class and all others. For more information, please see the academic honor code.

Course Objectives and Overview

EEL 6507 is graduate-level course on Queueing Theory and its application to Data Communication Systems. This course is intended to be a sequel to the course EEL 5718C on Computer Communications. While the latter course introduces the concepts of computer networks, concentrating on the lower 3 layers of the ISO OSI model and provides linkages with digital communication systems, EEL 6507 provides the tools for a detailed analytical treatment of the performance and design issues in computer networks. The material presented is designed to provide an understanding of the basic copcepts of queueing systems and covers the development of M/M/m/K, M/G/1, and other important queueing models. These results are then applied to networking protocols such as multiaccess and routing protocols as well as to congestion control.

A brief review of the material covered in EEL 5718C - Computer Communication is first given, highlighting important protocols and systems associated with the lower 3 layers of the ISO OSI Model. Particular emphasis will be given to The Datalink and ARQ protocols, Ethernet and TCP/IP

The general elements involved in queueing systems are next considered and the M/M/1 queueing model is developed and studied in detail. Little's Formula is then defined and proved as applicable to general queueing systems and the M/M/1 queueing results are extended to the case of M/M/m and M/M/{infinity}, and M/M/m/K. The case of general service time is next considered in the study of the M/G/1 queue and this study is extended to priority, reservation and polling systems. In considering Networks of Queues, the Kleinrock Independence Approximation, Burke's Time Reversibility Theorem and Jackson's Theorem are considered.

The queueing theory results are next applied to several important classes of data communication systems including Multiaccess Communications Systems, Routing and Congestion Control. The course concludes with a consideration of traffic modelling and the application of queueing theory to ATM networks.

Prerequisites

A basic course in computer networks is desirable, but his material will be reviewed at the beginning of the course. A sound grasp of elementary probability theory is also desirable.

Electronic copies of the course syllabus, notes and other course information will be accessible via the World Wide Web (WWW) at the following URL http://latchman.list.ufl.edu/ Course notes and problem solutions will be distributed in hardcopy format in class and posted electronically as indicated above.

Text

Additional Reading Material

The following additional reading material may be helpful.

Grading

Grades will be based on the following weights.

  • Midterm Test: 25%
  • Project: 20%
  • Final Exam: 35%
  • Assignments: 20%%

Final letter grades will be assigned at the end of the semester and will depend on absolute and relative student and class performance.

Participation

A formal assessment will ebe included in this class for active participation in class-time an online activities. This will foster and active learning mode as well as a fruitful and collaborative learning environment. Details of the types of participation expected will be provided in class.

Assignments

Homework and other assignments will be given periodically and will be due within the first 5 minutes of class on the designated due-date. FEEDS/NTU students will have a one (1) week extension on all assignment due dates. Use regular-size paper, staple the sheets together, fold and put your name and homework number at the top. Late homework will be accepted only in exceptional circumstances which need to be discussed with the Instructor for approval. Homework assignments will not be given over the phone. Graded homework will be returned in class and/or placed in the receptacle outside NEB 463.

Final Project

All students will be required to complete a final project as part of the requirements of this course. The project may take the form of a programming project, a simulation or other quantitative experimental study, or a critical review a relevant paper, or some combination of these. The project may be done individually or in teams of two or more students, provided that the work is compartmentalized to clearly identify the contribution of each participant. All projects must deal with some aspect of computer networks and queueing or other statistical methodshttp://aln.list.ufl.edu It is prefered that the student should select a project that is of interest to him/her and one that can be completed in a timely manner using readily available resources. In some cases, the resources of the Laboratory for Information Systems and Telecommunications (LIST) may be used, especially if the selected project is relevant to on-going LIST research. The project must be completed in the allotted time; incomplete grades will not be given just to allow extra time to work on the project. All projects must be approved by the instructor. Each student or team must submit a project proposal (no more than three pages) that outlines project objectives, research resources, work plan, and deliverables. Project proposals are due within the first three weeks of classes. divided. You are encouraged to discuss project ideas with the instructor and to submit your proposal as early as possible. If a student cannot find an appropriate topic, one will be assigned. Here are some types of projects which may be considered:

  • Programming project to develop demonstration of a protocol or service. Some students have developed GUI interfaces for SLIP/PPP connections using WINSOCK and Visual Basic.
  • Measurement and performance analysis of some real network. Unix and TCP/IP tools could be used to characterize traffic flowing in a certain LAN, or to compare various protocols. For example, a student could consider comparing SLIP/PPP with Ethernet and Kermit file transfers.
  • Critical review of a relevant paper highlighting advantages and disadvantages, strengths and weaknesses, and proposing alternative approaches.

      Project Reports

      Project reports should be presented in a professional manner. Students working in teams may submit multiple reports or a single report as agreed with the instructor on project approval. All reports must be typed and neatly formatted. A cover page that indicates project title, course, student name(s) and ID number(s) and date, must be included. Reports should be formatted according to the standard IEEE Journal format. A sample will be provided. Variations from this format must be approved by the Instructor. Neatness, spelling, grammar, writing style, presentation and clarity will be considered in grading. Any texts, papers, manuals, reports, or other sources must be acknowledged and referenced should be given in standard IEEE format. Neatly drawn figures and graphs should be used where appropriate. Target lengths for the project report is about 15-20 pages. Please do not copy material directly from reference sources. Give proper citations for all references and explictly identify the source of direct quotations.

      Students will also be required to give an in-class presenation of their projects.

      Exams

      The in-term exam and the final exam will be given in class and dates for these will be announced in class. The final exam will be comprehensive, but with emphasis on material covered since Test # 1. An announcement will be made to indicate whether the examinations will be closed-book, open-book or limited-notes.