Network Capacity Planning IACT 418 IACT 918 Corporate Network Planning.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Capacity Planning IACT 918 July 2004 Gene Awyzio SITACS University of Wollongong.
Data and Computer Communications
BY PAYEL BANDYOPADYAY WHAT AM I GOING TO DEAL ABOUT? WHAT IS AN AD-HOC NETWORK? That doesn't depend on any infrastructure (eg. Access points, routers)
What is a network? A network consists of two or more computers that are linked in order to share resources (such as printers and CD-ROMs) , exchange.
1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
1 MM3 - Reliability and Fault tolerance in Networks Service Level Agreements Jens Myrup Pedersen.
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
Lecture: 4 WDM Networks Design & Operation
The Network Plan and Security Planning IACT424/924 Corporate Network Design and Implementation.
Performance Measurement and Management IACT 418 IACT 918 Corporate Network Planning.
Module 3.4: Switching Circuit Switching Packet Switching K. Salah.
Detecting Network Intrusions via Sampling : A Game Theoretic Approach Presented By: Matt Vidal Murali Kodialam T.V. Lakshman July 22, 2003 Bell Labs, Lucent.
CSCI 4550/8556 Computer Networks Comer, Chapter 15: Networking Ownership, Service Paradigm.
PROFITABLE CONNECTION ASSIGNMENT IN ALL OPTICAL WDM NETWORKS VISHAL ANAND LANDER (Lab. for Advanced Network Design, Evaluation and Research) In collaboration.
EE 4272Spring, 2003 Chapter 9: Circuit Switching Switching Networks Circuit-Switching Networks Circuit-Switching Concept  Space-Division Switching  Time-Division.
Semester 4 - Chapter 3 – WAN Design Routers within WANs are connection points of a network. Routers determine the most appropriate route or path through.
How to Turn on The Coding in MANETs Chris Ng, Minkyu Kim, Muriel Medard, Wonsik Kim, Una-May O’Reilly, Varun Aggarwal, Chang Wook Ahn, Michelle Effros.
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
Network Topologies.
Data Communications and Networking
8/28/2015  A. Orda, R. Rom, A. Segall, Design of Computer Networks Prof. Ariel Orda Room 914, ext 4646.
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
1 9. Circuit Switching. Prof. Sang-Jo Yoo 2 Contents  Switching Networks  Circuit-Switching Networks  Switching Concepts  Routing in Circuit-Switching.
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
Designing a Voice over IP Network Chapter 9. Internet Telephony 2 Introduction The design of any network involves striking a balance between three requirements.
EE360 PRESENTATION On “Mobility Increases the Capacity of Ad-hoc Wireless Networks” By Matthias Grossglauser, David Tse IEEE INFOCOM 2001 Chris Lee 02/07/2014.
Chapter 2 – X.25, Frame Relay & ATM. Switched Network Stations are not connected together necessarily by a single link Stations are typically far apart.
A novel approach of gateway selection and placement in cellular Wi-Fi system Presented By Rajesh Prasad.
Algorithms for Allocating Wavelength Converters in All-Optical Networks Authors: Goaxi Xiao and Yiu-Wing Leung Presented by: Douglas L. Potts CEG 790 Summer.
Managing Handoff. For operations and management to detect and isolating Handoff being particularly challenging, therefore it is important to understand.
CSCI 465 D ata Communications and Networks Lecture 13 Martin van Bommel CSCI 465 Data Communications & Networks 1.
Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.
Computer Networks with Internet Technology William Stallings
11 Experimental and Analytical Evaluation of Available Bandwidth Estimation Tools Cesar D. Guerrero and Miguel A. Labrador Department of Computer Science.
Logical Topology Design
William Stallings Data and Computer Communications Chapter 9 Circuit Switching.
TELEPHONE NETWORK Telephone networks use circuit switching. The telephone network had its beginnings in the late 1800s. The entire network, which is referred.
Data Communications and Networking Chapter 11 Routing in Switched Networks References: Book Chapters 12.1, 12.3 Data and Computer Communications, 8th edition.
Network Design with Constraints Chapter 10 Part 2.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
How Networks work?.
Performance Evaluation of TCP over Multiple Paths in Fixed Robust Routing Wenjie Chen, Yukinobu Fukushima, Takashi Matsumura, Yuichi Nishida, and Tokumi.
Interconnect simulation. Different levels for Evaluating an architecture Numerical models – Mathematic formulations to obtain performance characteristics.
Interconnect simulation. Different levels for Evaluating an architecture Numerical models – Mathematic formulations to obtain performance characteristics.
Data Communications and Networking Overview
UNIVERSITY OF JYVÄSKYLÄ 2005 Multicast Admission Control in DiffServ Networks Department of Mathematical Information Technology University of Jyväskylä.
1 Presented by Sarbagya Buddhacharya. 2 Increasing bandwidth demand in telecommunication networks is satisfied by WDM networks. Dimensioning of WDM networks.
Introducing a New Concept in Networking Fluid Networking S. Wood Nov Copyright 2006 Modern Systems Research.
Use Cases for High Bandwidth Query and Control of Core Networks Greg Bernstein, Grotto Networking Young Lee, Huawei draft-bernstein-alto-large-bandwidth-cases-00.txt.
1 Dynamic RWA Connection requests arrive sequentially. Setup a lightpath when a connection request arrives and teardown the lightpath when a connection.
2/14/2016  A. Orda, A. Segall, 1 Queueing Networks M nodes external arrival rate (Poisson) service rate in each node (exponential) upon service completion.
Introduction Computer networks: – definition – computer networks from the perspectives of users and designers – Evaluation criteria – Some concepts: –
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Wavelength-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study Dhritiman Banergee and Biswanath Mukherjee,
Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.
Data and Computer Communications Chapter 7 Circuit Switching and Packet Switching.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Muhammad Waseem Iqbal Lecture # 20 Data Communication.
Computer Network Collection of computers and devices connected by communications channels that facilitates communications among users and allows users.
Constraint-Based Routing
CprE 458/558: Real-Time Systems
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
William Stallings Data and Computer Communications
Totally Disjoint Multipath Routing in Multihop Wireless Networks Sonia Waharte and Raoef Boutaba Presented by: Anthony Calce.
Data and Computer Communications
Performance Evaluation of Computer Networks
Performance Evaluation of Computer Networks
Chapter-5 Traffic Engineering.
QoS routing Finding a path that can satisfy the QoS requirement of a connection. Achieving high resource utilization.
Presentation transcript:

Network Capacity Planning IACT 418 IACT 918 Corporate Network Planning

The Importance of Planning Network capacity planning lies at the heart of all network management functions The design of networks to route data from one location to another with the least cost is of great concern to network designers

The Importance of Planning The objective of network designers is to minimise the cost of installing and maintaining the network These problems are complicated by the need to consider many factors such as Cable capacity End-to-end blocking probabilities Delay and reliability requirements

The Importance of Planning The process of designing a network requires that many variables are determined simultaneously In designing and upgrading a network, it is necessary to simultaneously select Node location Links connecting backbone nodes Links between end users

The Importance of Planning Mathematically we can say that The objective of designing and maintaining a network is to:  Minimise the cost of installation and maintenance  Whilst meeting some given performance criteria

The Importance of Planning Or more specifically: Given  Node locations  Edge locations  Traffic requirements between node pairs  Cost of transmission capacity  Cost of node installation Minimise  Total network costs Determine  Network topology  Edge capacities  Routing policy Subject to  Performance constraints  Capacity constraints  Reliability constraints

Working It Out These models generally end up being combinatorially explosive or NP complete To simplify the problem of solving these models several assumptions are used Packet (data) arrival is independent of other traffic (Poissonian arrival) Packet size is independent of other traffic (exponential packet size)

Working It Out Modern network based applications don’t follow these assumptions Most applications have a real time component These types of applications tend to create a traffic stream that creates packets:  At fixed time intervals (deterministic)  Have a fixed size (deterministic)

Working It Out This means that all the simplifying assumptions are no longer valid Also potential savings can be achieved by installing excess capacity to meet future requirements

Developing the Network Capacity Plan We start with a knowledge of the present network and its traffic loads etc, and our prediction of the future demands of the organisation We will develop the network capacity plan in three steps, 1. facilities, 2. equipment and 3. evaluation

Facilities "A facility is a transmission path between two or more locations, not including terminating or signalling equipment. The addition of terminating equipment would produce either a channel, a central office line, or a trunk." (Terplan P 556)

Facilities A facility has a theoretical maximum capacity which is given by the bandwidth In practice it is found to be impossible to use all the bandwidth because of: Overheads Downtime Utilisation ceiling (depends on burstiness)

Facilities For practical purposes, we can estimate the effective capacity as about 60-70% of the bandwidth (See Terplan P ) As the traffic approaches this maximum, the performance drops. Response time and packet loss increase This effective capacity is the upper limit available to the network, and we can use our estimates of future traffic to predict when we will run out of capacity

Facilities Terplan shows a graph as follows: We will run out of capacity when we reach the usable limit. Then we are in trouble on this facility

Equipment Equipment is everything not included in the facility Equipment capacity can be computed in the same way as facility capacity, using overhead, downtime and utilisation ceiling.

Evaluation When major upgrades are considered, there is always a choice among several alternatives The different possibilities must be developed and evaluated Development requires thinking of the alternatives, discussion among those involved and may include brainstorming

Evaluation Evaluation requires computer modelling or simulation It can be done on a spreadsheet or a simulation package designed for the purpose (eg Arena, nm) The value of any of these exercises depends on the accuracy of the original information on present and future loads