CMPE 548 Fall 20051 CMPE 548 Class Policies Dogu Arifler.

Slides:



Advertisements
Similar presentations
Why choose AP Statistics? My college major requires the course. I like lab classes where I can see the concepts. I like homework that is challenging.
Advertisements

CSE 531: Performance Analysis of Systems Lecture 1: Intro and Logistics Anshul Gandhi 1307, CS building
ECE 355 Introduction to Computer Networks and Data Communications
CS 581: Introduction to the Theory of Computation Lecture 1 James Hook Portland State University
1 SWE Software Testing and Quality Assurance Fall Semester (081) King Fahd University of Petroleum & Minerals Information & Computer.
ISM 206 Optimization Theory and Applications Fall 2005 Lecture 1: Introduction.
CS/CMPE 535 – Machine Learning Outline. CS Machine Learning (Wi ) - Asim LUMS2 Description A course on the fundamentals of machine.
CS 331 / CMPE 334 – Intro to AI CS 531 / CMPE AI Course Outline.
1 CS 425 / CS 625 Software Engineering Fall 2007 Course Syllabus August 27, 2007.
Course Introduction ENTC 210: Circuit Analysis I Rohit Singhal Lecturer Texas A&M University.
MATH 330: Ordinary Differential Equations Fall 2014.
Course Introduction Computer Science Department CS141:Computer Programming 1 Fall 2014 Dr. Hamid Al-Hamadi.
PROBABILITY AND STATISTICS FOR ENGINEERS Session 1 Dr Abdelaziz Berrado MTH3301 —Fall 09.
Winter 2008Logistics1 Advanced Computer Networks Prof. Venus W. Samawi Welcome to Time: 2pm –5pm Tuesday Winter credits.
1 SWE Introduction to Software Engineering Fall Semester (081) King Fahd University of Petroleum & Minerals Information & Computer Science.
COP4020/CGS5426 Programming languages Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: T, H 10:00am – 11:30am Class website:
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
Fall 2013 Course Syllabus Instructor: Sergiu Dascalu Department of Computer Science and Engineering August 27,
Performance Evaluation of Computer Systems and Networks By Behzad Akbari Tarbiat Modares University Spring 2012 In the Name of the Most High.
© 2004 Goodrich, Tamassia CS2210 Data Structures and Algorithms Lecture 1: Course Overview Instructor: Olga Veksler.
CSCI 347 – Data Mining Lecture 01 – Course Overview.
CS 453 Introduction to Data and computer communications Syllabus Vinod Kulathumani West Virginia University.
MAT 331 Mathematical solving problem with computers.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
Instructor: Spyros Reveliotis homepage: IE6650: Probabilistic Models Fall 2007.
Lecture 1 Page 1 CS 111 Summer 2015 Introduction CS 111 Operating System Principles.
Syllabus and Class Policies MATH 130: Summer 2014.
Course name : computer essentials. Instructor: Basma Alabdullatif Office: computer department instructors office, 1st floor Office hours: Saturday (11:00-01:00)
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
MAT 3724 Applied Analysis Fall 2012
Fall 2004FSU CIS 5930 Internet Protocols1 Welcome to CIS 5930 Internet Protocols Time: 5:15PM-6:30PM, TTh Location: Love 301 Fall 2004, 3 credits.
Computer Science 102 Data Structures and Algorithms CSCI-UA.0102 Fall 2012 Lecture 1: administrative details Professor: Evan Korth New York University.
Course Information Sarah Diesburg Operating Systems COP 4610.
CS 5291 Stochastic Processes for Networking Instructor: Shun-Ren Yang Office: EECS Office Hour: Tuesday morning 10:00-12:00.
Lecture 1 Page 1 CS 111 Summer 2013 Introduction CS 111 Operating System Principles Peter Reiher.
CS-2851 Dr. Mark L. Hornick 1 CS-2852 Data Structures Dr. Mark L. Hornick Office: L341 Phone: web: people.msoe.edu/hornick/
MAT 3730 Complex Variables Spring 2012
Introduction to ECE 2401 Data Structure Fall 2005 Chapter 0 Chen, Chang-Sheng
Course Information Andy Wang CIS 5930 Computer Systems Performance Analysis.
Computer Science, FSU1 CNT5505 DATA/COMUTER COMMUNICATIONS FALL 2008 Time: 3:35AM-4:50AM, MW Location: Love 103 Fall 2008, 3 credits.
Florida State UniversityCOP5570 – Advanced Unix Programming COP 5570 Advanced Unix Programming Instructor: Xin Yuan.
COP4610/CGS5765 Operating Systems Syllabus. Instructor Xin Yuan Office: 168 LOV Office hours: W M F 9:10am – 10:00am, or by appointments.
1 CDA 4527 Computer Communication Networking (not “analysis”) Prof. Cliff Zou School of Electrical Engineering and Computer Science University of Central.
C Programming Lecture 1 : Introduction Bong-Soo Sohn Associate Professor School of Computer Science and Engineering Chung-Ang University.
Computer Science, FSU1 CNT5505 DATA/COMUTER COMMUNICATIONS Fall 2010.
CS151 Introduction to Digital Design Noura Alhakbani Prince Sultan University, College for Women.
Welcome to Numerical Analysis Math 448/548 Cpt S 430/530 Fall 2016 Instructor: John Miller, West 134E Class web page can be found.
Data Structures and Algorithms in Java AlaaEddin 2012.
COP4020 INTRODUCTION FALL COURSE DESCRIPTION Programming Languages introduces the fundamentals of the design and implementation of programming languages.
Performance Evaluation When: Wed. 1:20am~4:20pm Where: Room 107 Instructor: 周承復 –Office hours: by appointment – –
Computer Networks CNT5106C
1 Welcome to COE 431: Computer Networks Instructor: Wissam F. Fawaz Office 103, Bassil Bldg. Required.
1 CS 425 / 625 Software Engineering Fall 2003 Course Syllabus August 25, 2003.
PHR 211: BIOSTATISTICS Dr. M Zulfiquer Hossain (ZQH) Associate Professor Department of Pharmacy Room UB31108
Copyright January, Prof. Basuony El-Garhy Geotechnical Engineering and Foundations Civil Engineering Department Faculty of Engineering What is CE.
Syllabus and Class Policies MATH 130: Summer 2016.
Computer Network Fundamentals CNT4007C
Andy Wang Object Oriented Programming in C++ COP 3330
Networking CS 3470, Section 1 Sarah Diesburg
Computer Networks CNT5106C
CNT 4704 Computer Communication Networking (not “analysis”)
CS5040: Data Structures and Algorithms
ECE 6610: Wireless Networks
CSC 111 Course orientation
Computer Science 102 Data Structures CSCI-UA
CS 201 – Data Structures and Discrete Mathematics I
Course Overview - Database Systems
Welcome to CS 1340! Computing for scientists.
Andy Wang Object Oriented Programming in C++ COP 3330
CIS5930: Advanced Topics in Parallel and Distributed Systems
Presentation transcript:

CMPE 548 Fall CMPE 548 Class Policies Dogu Arifler

CMPE 548 Fall 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

CMPE 548 Fall Policies Office hours (Tue & Wed 8:30-10:30 AM) –Please come only during office hours. If you cannot, send an 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)

CMPE 548 Fall 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

CMPE 548 Fall 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!

CMPE 548 Fall 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)

CMPE 548 Fall 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.

CMPE 548 Fall 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)