Spring 2008 ECEN4533 Data Communications
Instructor: Dr. George Scheets
E-Mail: george.scheets@okstate.edu
Contact Information:
    Monday - Friday: ES303, Stillwater Campus, Phone: (405)744-6553
Tentative Office Hours:
    Monday - Friday: 1330 - 1430
Grading: 540 560 points total.  2 quizzes (40 points), 2 exams (200 points), 1 comprehensive final exam (150 points),  2 projects (150 points), 1 homework problem (20 points).
    Late projects are accepted at a cost of 1 point per working day past the due date.
    Students missing an exam or the final without notifying the instructor in advance will receive a zero.
    At the instructor's option, make-up exams will be available for non-business related reasons, but will be harder. These make-ups will be given on the scheduled make-up time, which is Friday, May 2nd, at 1600 hours.
    No make-up quizzes will be given.
Grade Scale: 90/80/70 % = A/B/C etc. (initially). Final break points will be curved.
Cheating: Don't do it! Quizzes and exams should be your own work.  The projects should be your own or your team's work.  Expect to get an 'F' for the course if you are caught cheating on a quiz, exam, or project.
Required Text: Computer and Communication Networks, Nader Mir, Prentice Hall, 2007, ISBN 0-13-174799-1.
Recommended Text: High Performance TCP/IP Networking, Mahbub Hassan & Raj Jain, Pearson Prentice Hall, 2004, ISBN 0-13-064634-2.
Prerequisites: Previous course in probability and statistics.  Knowledge of spreadsheet use, programming tools such as MathCAD or MatLab, or a programming language such as C, is highly advised for the design problems.
Course Objectives: To give the student a solid background of design and performance issues associated with data networks. 
Web Assistance:
Week #15   .html     .ppt
Week #14   .html     .ppt
Week #13   .html     .ppt
Week #12   .html     .ppt
Packet Capture Homework (due 2 May 2008)
Homework Solutions Quiz #2 to Exam #2
Week #11   .html     .ppt
Design Project #2
Week #10   .html     .ppt
Wireshark
Week #9     .html     .ppt
Homework Solutions Exam #1 to Quiz #2
Week #8     .html     .ppt
Week #7     .html     .ppt
Week #6     .html     .ppt
Qfunction Tables (Excell Spreadsheet)
Week #5     .html     .ppt
Homework Solutions Quiz #1 to Exam #1
Week #4     .html     .ppt
audio:  4096q16000fs   4096q8000fs   4096q2000fs   4096q1000fs    256q16000fs   32q16000fs   4q16000fs
Week #3     .html     .ppt
Week #2     .html     .ppt
Design Project #1
Week #1     .html     .ppt
Scheets, G., Parperis, M., Singh, R. "Voice over the Internet: A Tutorial discussing Problems and Solutions associated with Alternative Transport"IEEE Communications Surveys, June 2004.    
Lubacz, J., "The IP Syndrome", IEEE Communications, February 2000.
www.techweb.com     wikipedia     (acronyms and tutorials)
Spring 2007 Home Page
Old Tests:
Exam #1  . 2005             . 2006             . 2007
Exam #2  . 2005             . 2006             . 2007   
Final        . 2005             . 2006             . 2007  
Quiz Solutions
:
Quiz #1   . 2005             . 2006             . 2007    
Quiz #2   . 2005             . 2006             . 2007 
OSU Campus Network circa 1993
Course Outline:
Channel Capacity (Hertz versus bits/second)
Multiplexing: FDM, TDM, StatMux, CDM
Switching: Circuit, Packet, Cell
OSI 7 Layer Model
Moving a File: Packetization & Encapsulation
Network Building Blocks: Hubs, Switches, Routers
Network Terminology: Core versus Access
Time to Move a File: Using Time-Distance Diagrams
Ethernet
    Packet Format
    CSMA/CD MAC
    Deployment: Shared to Switched Network
    Flavors
    Difference between MAC address & IP address
Leased Line Networks
Frame Relay
    Frame Format
    Oversubscription
    Addressing: Data Link Connection Identifiers
ATM
    Cell Format
    Classes of Service
    ATM Adaptation Layers 1 & 5
The Internet & the Internet Protocol
Performance Issues: TDM vs. StatMux & Infinite Buffers
Review of Probability & Statistics
    Important Theories & Axioms
    Important Probability Density Functions
    Mean & Variance
    Autocorrelation Function
Queuing Theory
    M/M/1 & M/D/1 Queues
    Inverse Multiplexing: M/M/N Queues
    Queues with Priorities
The Failure of Poisson Modeling
    Hurst Parameter & Self-Similarity
Carrying Capacity
    Circuit Switched TDM
    Packet Switdhed StatMux
    Cell Switched TDM/StatMux
End System Traffic Management
    Normalized Propagation Delay
    Stop & Wait
    Sliding Window
    Go Back N versus Selective Repeat
Transmission Control Protocol
    Background
    Flow Control: Slow Start & Linear Congestion Avoidance
    Retransmission Timers
    Transmitter Retransmission Policies
    Receiver Accept Policies
    Window Management
ATM Revisited
Real Time Traffic over StatMuxed networks
Internet Protocol
Traffic Policing
    Connection Admission Control
    Usage Parameter Control
    Leaky Bucket Algorithm: Frame Relay, ATM PCR & SCR
Internet QoS