- First homework (Basic ILP models for network design) --
2
exercises Additional
Models (due by Wednesday, Apr. 6th)
- Second homework (Advance ILP models, heuristics, AMPL)
-- 3
exercises AMPL
notes&Example (due by Friday, Apr.15th)
- Third homework (Simulation) -- 4exercises (due
by Monday, May 2nd)
- Fourth homework (Queueing
theory) -- 5exercises (Queueing theory and Traffic Analysis due by Monday 9th,
TCFA due by May18th)

- List of projects: TBA
- Students are expected to provide: i)
a 15-min presentation on May 25th (ppt), ii) a
short written report (below 10 pages), iii) the code (if any) that has
been developed.

6:10
pm to 9:00 pm, Monday, 111 Wellman

6:10 pm to 7:40 pm, Wednesday, 111 Wellman

- 1st part (ILP design)
- Introduction and
Motivations (pdf) -- 1
slide per page
- Networking Modeling and
Optimization (pdf) -- 1
slide per page
- Additional reading -- Relevant
papers
- 2nd part (Simulation)
- Introduction to
Simulation -- 1
slide per page
- Description of
simulator structure & simulator code link
to zip
- 3rd part (Analysis)
- Queueing Theory -- 1
slide per page
- Analysis of offered,
carried and lost traffic in circuit switched systems1
slide per page
- Capacity and Flow
Assignment 1
slide per page

Office: 2245 Kemper Hall

Office Hours: 4:00 pm to 6:00 pm on Thursday;

Also by appointment -- e-mail: *massimo.tornatore**
AT gmail dot com*

*Leonard Kleinrock*, **Queueing****
Systems (Vol 1: Theory, Vol. 2: Computer
Applications)**, Edited by: Wiley, 1976

*Vasseur**, Pickavet,
Demesteer,,* **Network recovery**, Edited by:
Morgan Kaufmann, 2004

*Pioro**, Medhi*,
**Routing, Flow, and Capacity Design in Communication and Computer Networks,
**Edited by: Morgan Kaufmann, 2004

*Medhi**, Ramaswamy*,
**Network routing**, Edited by: Morgan Kaufmann, 2007

To be defined

ECS 252 or equivalent

Preferably: basics of operation research and queueing theory

1)
Approx. 3 Homework Assignments (1/3)

2) Project (1/3) (*May 25th*)

3) Final Exam (1/3) (*May 18th*)

Various important topics in communication networks planning and design are studied in the areas of network modeling, analysis and optimization methodologies.

**Introduction**. Telecom network overview and trend evolution, business models, traffic engineering vs network engineering vs network design, the telecom network hierarchy (core vs. metro vs. access network), overview of technologies and protocols.**[1hr]****Network design methodologies**. Network design based on mathematical modelling: flow formulation, route formulation. Modelling of network protection: dedicated protection, shared protection. Network design by heuristic approaches: greedy, local search.**[8hrs]****Simulation of a telecom network.**Definition of simulation, discrete event stochastic simulation, generation of pseudo-random numbers, analysis and validation of the results.**[4.5hrs]****Analysis of circuit-switched networks**. Queueing theory primer. Traffic modeling: definition and properties. Source model: single and multiple source. Analysis of multiple-server system with assumption LCC, LCH, LCR. Evaluation of congestion and statistics of carried/lost traffic. Dimensioning of overflow trunk: Wilkinson, Fredericks and Lindberger approaches.**[9hrs]****Capacity and Traffic Flow Assignment Problems in Communication Networks**. Delay analysis, the capacity assignment problem, the traffic flow assignment problem, the capacity and flow assignment problem.**[4.5hrs]****Presentations from students. [3hrs]****Final Exam.[3hrs]**

Back to: **M. Tornatore's Homepage**

This page is located at: http://networks.cs.ucdavis.edu/~tornatore/Tornatore_files/ECS289i/289i-sq16.html

Please report questions, comments, errors, or problems to:

Massimo Tornatore (*mtornatore**
AT ucdavis dot edu*)

*Last updated: March 28, 2016*