8
CMPE 548 Fall 2005 1 CMPE 548 Class Policies Dogu Arifler

CMPE 548 Fall 20051 CMPE 548 Class Policies Dogu Arifler

Embed Size (px)

Citation preview

Page 1: CMPE 548 Fall 20051 CMPE 548 Class Policies Dogu Arifler

CMPE 548 Fall 2005 1

CMPE 548Class Policies

Dogu Arifler

Page 2: CMPE 548 Fall 20051 CMPE 548 Class Policies Dogu Arifler

CMPE 548 Fall 2005 2

Course description

• Analysis of computer communication networks– We will cover other types of networks as well: Telephone

network, wireless networks, etc.

• Mathematical models and methods– TDM/FDM, statistical multiplexing, interconnected nodes, quality

of service (delay, loss, etc.): Markov chains, queues, stochastic networks, network calculus

– Routing and congestion control, utility functions, fairness: Tools from optimization theory and operations research

• Absolute prerequisite– Strong background in probability theory

Page 3: CMPE 548 Fall 20051 CMPE 548 Class Policies Dogu Arifler

CMPE 548 Fall 2005 3

Policies

• Office hours (Tue & Wed 8:30-10:30 AM)– Please come only during office hours. If you cannot, send an

email and make an appointment

• Late comers– Be considerate to others!

• Grading– Midterm 40%, Final 40%, Project 20%– I generally use curves; i.e. no absolute scale for A, B, Cs.

• One comprehensive make-up– Only given if you provide a valid excuse in writing within 3

working days following the missed exam (University By-Law)

Page 4: CMPE 548 Fall 20051 CMPE 548 Class Policies Dogu Arifler

CMPE 548 Fall 2005 4

Academic dishonesty

• Any conduct that attempts to gain unfair academic advantage is considered academic dishonesty. Copying homework, cheating during exams, substituting for another person are some examples of academic dishonesty. Cases of academic dishonesty will not be tolerated and will be punished according to EMU’s disciplinary policies

This is a very serious issue

Page 5: CMPE 548 Fall 20051 CMPE 548 Class Policies Dogu Arifler

CMPE 548 Fall 2005 5

What to expect?

• This course is not about networking software, technologies, protocols, acronyms, etc.

• We will have an intensive treatment of stochastic processes– I will not cover probability theory. However, important concepts

will be reviewed briefly when necessary – Knowledge of matrix operations, methods to solve simultaneous

equations, differential equations are assumed

• Expect hard exams– This does not imply you cannot make an “A” in this class!

Page 6: CMPE 548 Fall 20051 CMPE 548 Class Policies Dogu Arifler

CMPE 548 Fall 2005 6

Some principles to keep in mind

• The Gordian Knot– Alexander, The Great untying the knot

• Occam’s Razor– One should make no more assumptions than needed. The

simplest explanation is usually the best!– Not everyone agrees!

• Agent Mulder in the X Files: “Occam's Principle of Limited Imagination”?

– However, I think: Simplicity is the ultimate sophistication. (Leonardo da Vinci)

Page 7: CMPE 548 Fall 20051 CMPE 548 Class Policies Dogu Arifler

CMPE 548 Fall 2005 7

Why analysis?

• Need techniques for evaluation of computer systems and communication networks– During design and implementation– After design/implementation for upgrading systems– For answering what-if questions

• Some key performance metrics (quality of service metrics)– Mean delay, mean throughput, utilization– Packet loss probability, call rejection probability– Distribution of delay– Etc.

Page 8: CMPE 548 Fall 20051 CMPE 548 Class Policies Dogu Arifler

CMPE 548 Fall 2005 8

Analysis Techniques

• Measurement– If the system exists, change it (if possible) and analyze the

effects (experimental)

• Simulation– Write a program to emulate the system (CMPE 576)

• Operational analysis– Analyze based on directly measured quantities and the relations

between them (CMPE 474)

• Mathematical models– Stochastic models and queueing theory (CMPE 548, CMPE 547)