Create your own awesome maps

Even on the go

with our free apps for iPhone, iPad and Android

Get Started

Already have an account?
Log In

48750 Network Management and Planning by Mind Map: 48750 Network Management
and Planning
0.0 stars - reviews range from 0 to 5

48750 Network Management and Planning

Part 1: Teletraffic Engineering

Session 1 - Traffic and its sources

What gives rise to traffic Types of traffic Modelling traffic Poisson traffic CBR traffic Counting traffic

Session 2 - Queues and Markov Modeling

Queues Demand for and Supply of services (Let’s do some Maths) System Capacity Markov Modeling

Session 3 - Circuit switching - Preassigned resources

Revise basics of telephone traffic Apply this to a Lost-Call system Develop the equations for a Lost-Call telephone queue Develop the equations for Grade of Service

Session 4 - Circuit switching - Preassigned resources

Grade of Service How traffic is distributed Calls in the System Special cases

Session 5 - Packet switching - On demand assigned resources

Introduction Single Server Queue Queue Parameters Summary of terms used to describe queues Basic Queuing Relationships

Session 6 - Packet switching - On demand assigned resources

From single server to multi-server The basics - queue parameters Basic Queuing relationships Multi Server relationships Networks of queues Aggregating networks paths and elements

Emulation Lab 1

Creation of an emulation of a small telephone exchange

Use Matlab or Simulink

Done as a Lab Group. Reported as a Lab Group

Part 2: Software Defined Networks

Session 7 - History and evolution of SDN

Session 8 - Control Plane

Session 9 - Data Plane

Session 10 - OpenFlow

Emulation Lab 2

Use of Mininet to emulate an OpenFlow Network

Done as a Lab Group. Reported as a Lab Group

Part 3: Network Optimization

Session 11 - The basics

Optimum Solutions Linear Programming Dynamic Programming Case Studies

Session 12 - Optimization Examples

The terminal assignment problem The concentrator location problem Distributed network topology Shortest path routing

Optimization Lab 3

Create an optimization of a cross connect setup using the Population Based Incremental Learning algorithm

Use Matlab or Simulink

Done as a Lab Group. Reported as a Lab Group