Performance of Telecommunication Networks

Similar documents
Shared Ethernet Networks

Objective To examine the change in throughput in a local area network when upgrading from a hub to a switch.

Dimensioning Links for IP Telephony

RECITAL INVESTIGATION OF IPv4 AND IPv6 USING WIRED NETWORKS IN OMNET++

Lecture 2: Internet Structure

Lecture 22: Buffering & Scheduling. CSE 123: Computer Networks Alex C. Snoeren

Performance of Telecommunication Networks

Router s Queue Management

Using OPNET to Enhance Student Learning in a Data Communications

CS 3516: Computer Networks

CS 440 Computer Networks Lab 5 Ethernet LAN Simulation

Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks

end systems, access networks, links circuit switching, packet switching, network structure

EP2200 Queueing theory and teletraffic systems

Wireless Access. Practice 15 November 14, 2018

Queuing Disciplines. Order of Packet Transmission and Dropping. Laboratory. Objective. Overview

Computer Networking Introduction

Computer Networks Chapter 1: Introduction. Introduction

Objective To examine the throughput of a TCP connection as the flow control window size is varied.

Network Traffic Characterisation

The War Between Mice and Elephants

Computer Networks. ENGG st Semester, 2010 Hayden Kwok-Hay So

Chapter 4. Routers with Tiny Buffers: Experiments. 4.1 Testbed experiments Setup

CSE 461 Quality of Service. David Wetherall

A closer look at network structure:

CS 421: COMPUTER NETWORKS SPRING FINAL May 21, minutes

Introduction to Queuing Systems

Model suitable for virtual circuit networks

Lecture 5: Performance Analysis I

Performance Modeling

EP2200 Queueing theory and teletraffic systems

Order of Packet Transmission and Dropping

This Lecture. BUS Computer Facilities Network Management. Switching Network. Simple Switching Network

Problem-1: Solution-1:

Lab 1: Improving performance by LAN Hardware Upgrade

Teletraffic theory (for beginners)

Hybrid Control and Switched Systems. Lecture #17 Hybrid Systems Modeling of Communication Networks

Announcements. TAs office hours: Mohamed Grissa: Mohamed Alkalbani:

Chapter 1. Computer Networks and the Internet

10. Network dimensioning

Network Layer Enhancements

Dropping Packets in Ubuntu Linux using tc and iptables

Advanced Computer Networks Spring Set #1

Edge versus Host Pacing of TCP Traffic in Small Buffer Networks

A Delayed Vacation Model of an M/G/1 Queue with Setup. Time and its Application to SVCC-based ATM Networks

Chapter 1 Introduction

CSE3213 Computer Network I

The Network Layer and Routers

COM-208: Computer Networks - Homework 1

Internet II. CS10 : Beauty and Joy of Computing. cs10.berkeley.edu. !!Senior Lecturer SOE Dan Garcia!!! Garcia UCB!

WHITE PAPER. Latency & Jitter WHITE PAPER OVERVIEW

Real-Time Protocol (RTP)

Queuing Systems. Computer Exercise 2. Loss Systems and Queuing Networks

Network Performance: Queuing

Time-Step Network Simulation

Unit 2 Packet Switching Networks - II

Affects of Queuing Mechanisms on RTP Traffic Comparative Analysis of Jitter, End-to- End Delay and Packet Loss

Lecture 21. Reminders: Homework 6 due today, Programming Project 4 due on Thursday Questions? Current event: BGP router glitch on Nov.

Order of Packet Transmission and Dropping

Performance Evaluation of Scheduling Mechanisms for Broadband Networks

Security Lab 1 Firewall Performance

Contents. Configuring GRE 1

P D1.1 RPR OPNET Model User Guide

Wei Wang, Mehul Motani and Vikram srinivasan Department of Electrical & Computer Engineering National University of Singapore, Singapore

THE TCP specification that specifies the first original

ENSC 427 Communication Networks Final Project Presentation Spring 2012 Group 9

Outline. Computer Communication and Networks. The Network Core. Components of the Internet. The Network Core Packet Switching Circuit Switching

ENSC 427 SPRING 2011 FINAL PROJECT EXPLORING TRAFFIC FOR P2P FILE SHARING PROTOCOL USING OPNET GROUP 01

048866: Packet Switch Architectures

Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks

Introduction to OMNeT++

IT INFRASTRUCTURE PROJECT PHASE I INSTRUCTIONS

OPNET Modeler. Tommy Svensson Alex Popescu

of-service Support on the Internet

The Transport Control Protocol (TCP)

Network Architecture I

Simulation and Analysis of Impact of Buffering of Voice Calls in Integrated Voice and Data Communication System

The Diffie-Hellman Key Exchange

Lecture 2 Communication services The Trasport Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it

Switched LANs. A Set of Local Area Networks Interconnected by Switches

This formula shows that partitioning the network decreases the total traffic if 1 N R (1 + p) < N R p < 1, i.e., if not all the packets have to go

cs/ee 143 Fall

Integrating Information Systems: Technology, Strategy, and Organizational Factors

Basic Switch Organization

Project Tutorial. CS 143 Communication Network. Ruijia Sun Zilong Chen. Based on version 2015, authored by Ritvik Mishra

CSC 401 Data and Computer Communications Networks

Models. Motivation Timing Diagrams Metrics Evaluation Techniques. TOC Models

end systems, access networks, links 1.3 network core

Lecture 14: Congestion Control"

Four sources of packet delay

Static Routing NETWORK INFRASTRUCTURES NETKIT - LECTURE 4 MANUEL CAMPO, MARCO SPAZIANI

Layer 3: Network Layer. 9. Mar INF-3190: Switching and Routing

KINETICS CALCS AND GRAPHS INSTRUCTIONS

L9: Intro Network Systems

Applying Fuzzy Logic Principles to Improve the Performance of the Random Early Detection Algorithm

CPSC 441 Tutorial-1. Department of Computer Science University of Calgary

On Network Dimensioning Approach for the Internet

end systems, access networks, links circuit switching, packet switching, network structure

Advanced Communication Lab OPNET Tutorial

Configuring Weighted Random Early Detection

Transcription:

MONASH UNIVERSITY DEPARTMENT OF ELECTRICAL & COMPUTER SYSTEMS ENGINEERING Performance of Telecommunication Networks Experiment IV: Delay and Queueing in Packet Switching Networks Y. Ahmet Şekercioğlu Aims In this experiment, we will learn the fundamentals of modeling and simulating packet switching networks, and compare the results of theoretical delay calculations of networks of M/M/1 queues against the results of the simulation runs. Introduction and Preliminary Work The queueing diagram of our example network is given in Figure 1. It consists of a single packet switch and two hosts communicating through the packet switch. There are M/M/1 (FIFO) queues connected to each outgoing link. Assume that each link has 1 Mb/s transmission capacity and propagation delay is 1 ms. Since we want to model M/M/1 queues, we want to generate Poisson traffic. If we randomly choose packet sizes and inter-arrival times from an exponential distribution we should be able to obtain what we want. Let s choose average packet size as 10000 bits. By increasing or decreasing the interarrival times we can vary the link load (called offered load). As an example, say we want an offered link load of 60%. 60% of 1 Mbits/sec is 600000 bits/sec. On average then, we want to generate 600000 bits/sec to load the link to 60% of its capacity. If the average packet Figure 1: Queueing diagram of our network. The router is modeled as an output-queued switch. All the links connecting the hosts and the router have 1 Mb/s transmission capacity. Also, one way propagation delay between hosts and the router is 1 ms. netperf-omnetpp-pkswitch.tex,v1.7 1

OFFERED AVERAGE AVERAGE LOAD PACKET SIZE INTERARRIVAL TIME 20% 10000 bits 40% 10000 bits 60% 10000 bits 0.0167 seconds 80% 10000 bits 90% 10000 bits 95% 10000 bits 98% 10000 bits Table 1: Offered link loads Vs interarrival times for our network of single packet switch. QUEUE LENGTH STATISTICS router[0].pk queue[0] router[0].pk queue[1] OFFERED AVERAGE AVERAGE AVERAGE AVERAGE LOAD DELAY Q LENGTH DELAY Q LENGTH CALC. MEAS. CALC. MEAS. CALC. MEAS. CALC. MEAS. 20% 40% 60% 80% 90% 95% 98% Table 2: Queue statistics size is 10000 bits, 600000/10000 = 60 packets/sec. should be generated. This means that, average interarrival time should be 1/60 = 0.0167 sec. for an offered link load of 60% for this network. If you are convinced that my logic is correct, please complete the Table 1. Then, by using the fundamental M/M/1 queue equations we have discussed in the lectures, calculate the average queue lengths and end-to-end packet delays, and write them in the CALC columns of the Tables 2 and 3. Exercise - A Network of Two Hosts and a Packet Switch I have designed and implemented a set of simple models (hosts, packet generators and sinks, and routers modeled as output queued switches) for simulating packet switching networks. The model files are accessible through this Web page: http://www.ecse.monash.edu.au/twiki/ bin/view/infocus/anetworkof4hostsand2packetswitches. In the example given in the Web page, the simulated network topology consists of four hosts and two routers. We will not use this topology. Instead, we will create a simpler network of one router and two hosts. You can find the NED file of this network in Appendix A. Let s run our first packet switching network simulation experiment: 1. Copy all the files given in the Web page above except the network model and the netperf-omnetpp-pkswitch.tex,v1.7 2

END-TO-END PACKET DELAY STATISTICS host[0] sink host[1] sink OFFERED AVERAGE AVERAGE AVERAGE AVERAGE LOAD PK. SIZE E-E DELAY PK. SIZE E-E DELAY CALC. MEAS. CALC. MEAS. CALC. MEAS. CALC. MEAS. 20% 40% 60% 80% 90% 95% 98% Table 3: Packet statistics omnetpp.ini. Instead, use the ones provided in In Appendices A and B. 2. Generate the executable file of the simulation by following the steps you have learnt in the previous experiments. 3. Start running the simulation to view the main graphical user interface window, but do not press the run button yet. We need to open up some more windows to observe the progress of queues and packet size distributions: (a) Double-click on host[1] icon to view the model components. (b) Double-click on app sink icon, click on Contents tab. (c) Double-click on pksizestats (a window with light blue background should (d) Double-click on pkdelayvector (a window with light yellow background should (e) Double-click on router[0] icon to view the model components. (f) Double-click on pk queue[1], click on Contents tab. (g) Double-click on qlengthvector (a window with light yellow background should (h) Double-click on qlengthstats (a window with light blue background should 4. Now, click on the fast run button to start the simulation and observe the statistics windows. 5. Have a look at the histograms and interpret them. 6. When the simulation completes (controlled by sim-time-limit in the omnetpp.ini file), it dumps plenty of statistics. Locate the relevant ones and fill in the CALC columns of the Tables 2 and 3 belonging to the row 60% offered link load. Do measured values and calculated values match? netperf-omnetpp-pkswitch.tex,v1.7 3

7. Now obtain the measured values for the remaining offered link loads and compare calculated and measured values. Show the completed tables to your laboratory supervisor. 8. Plot the graph of offered link load Vs average queue size for both router queues router[0].pk queue[0] and router[0].pk queue[1]. Compare the graph with Figure 8.5 of [Sta02]. Do they match? Show the graph to your laboratory supervisor. A Topology Description (NED file) of the single pkswitch net 1 channel adsllink extends ned.dataratechannel 2 { 3 delay =0.01ms; 4 datarate =100000000bps; // bits/sec 5 } 6 network single_pkswitch_net 7 { 8 submodules: 9 host[2]: Host { 10 parameters: 11 address = index; 12 @display("i=device/pc2"); 13 } 14 router[1]: Router { 15 parameters: 16 address = index+sizeof(host); 17 @display("i=abstract/router"); 18 } 19 20 connections: 21 host[0].out++ --> adsllink --> router[0].in++; 22 host[0].in++ <-- adsllink <-- router[0].out++; 23 host[1].out++ --> adsllink --> router[0].in++; 24 host[1].in++ <-- adsllink <-- router[0].out++; 25 } B omnetpp.ini File of the single pkswitch net 1 [General] 2 network = single_pkswitch_net 3 rng-class = "cmersennetwister" 4 num-rngs = 1 5 seed-0-mt = 1000 6 sim-time-limit = 0s # seconds 7 netperf-omnetpp-pkswitch.tex,v1.7 4

8 # tkenv-default-run = 1 9 10 single_pkswitch_net.host[0].destaddresslist = "0" 11 single_pkswitch_net.host[1].destaddresslist = "1" 12 13 single_pkswitch_net.**.pksize = pk_geometric(500,8000) # min. packet size: 500 bits 14 # avg. packet size: 8000 bits 15 single_pkswitch_net.**.pk_queue[*].pkcapacity = 100 # packets - queue capacity 16 17 [Config One] 18 description = "10% router-to-router link utilization" 19 single_pkswitch_net.**.iatime = exponential(0.152) # seconds References [Sta02] W. Stallings. High-Speed Networks and Internets: Performance and Quality of Service. Prentice Hall, 2 nd edition, 2002. netperf-omnetpp-pkswitch.tex,v1.7 5