Performance of Telecommunication Networks
|
|
- Maximillian Hoover
- 5 years ago
- Views:
Transcription
1 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 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 bits/sec. On average then, we want to generate 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
2 OFFERED AVERAGE AVERAGE LOAD PACKET SIZE INTERARRIVAL TIME 20% bits 40% bits 60% bits seconds 80% bits 90% bits 95% bits 98% 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 bits, /10000 = 60 packets/sec. should be generated. This means that, average interarrival time should be 1/60 = 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: 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
3 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
4 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 = bps; // bits/sec 5 } 6 network single_pkswitch_net 7 { 8 submodules: 9 host[2]: Host { 10 parameters: 11 address = index; 13 } 14 router[1]: Router { 15 parameters: 16 address = index+sizeof(host); 18 } 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 = sim-time-limit = 0s # seconds 7 netperf-omnetpp-pkswitch.tex,v1.7 4
5 8 # tkenv-default-run = single_pkswitch_net.host[0].destaddresslist = "0" 11 single_pkswitch_net.host[1].destaddresslist = "1" 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 [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, netperf-omnetpp-pkswitch.tex,v1.7 5
Shared Ethernet Networks
Lab 1 Shared Ethernet Networks Overview In a shared Ethernet network, end systems are typically connected together using a hub. The hub retransmits any incoming frames on all outgoing lines creating a
More informationObjective To examine the change in throughput in a local area network when upgrading from a hub to a switch.
Lab 2 Switches versus Hubs Overview Ethernet hubs work at the physical layer, simply repeating any frames they receive on one port onto all other ports. For this reason, they are also called multiport
More informationDimensioning Links for IP Telephony
Dimensioning Links for IP Telephony Ian Marsh (SICS/KTH) Bengt Ahlgren, Anders Andersson (SICS) Olof Hagsand (Dynarc) ianm@sics.se Columbia University, USA Monday 2nd April, 2001 http://www.sics.se/ ianm/talks/columbia.
More informationRECITAL INVESTIGATION OF IPv4 AND IPv6 USING WIRED NETWORKS IN OMNET++
RECITAL INVESTIGATION OF IPv4 AND IPv6 USING WIRED NETWORKS IN OMNET++ 1 Pallavi Gupta, 2 Savita Shiwani Computer Science Department, Suresh Gyan Vihar University,India ABSTRACT-Internet protocol was designed
More informationLecture 2: Internet Structure
Lecture 2: Internet Structure COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016, J.F Kurose and K.W. Ross,
More informationLecture 22: Buffering & Scheduling. CSE 123: Computer Networks Alex C. Snoeren
Lecture 22: Buffering & Scheduling CSE 123: Computer Networks Alex C. Snoeren Lecture 23 Overview Buffer Management FIFO RED Traffic Policing/Scheduling 2 Key Router Challenges Buffer management: which
More informationPerformance of Telecommunication Networks
MONASH UNIVERSITY DEPARTMENT OF ELECTRICAL & COMPUTER SYSTEMS ENGINEERING Performance of Telecommunication Networks Experiment V: Introduction to Modeling Wireless Networks and Their Network Layer Protocols
More informationRouter s Queue Management
Router s Queue Management Manages sharing of (i) buffer space (ii) bandwidth Q1: Which packet to drop when queue is full? Q2: Which packet to send next? FIFO + Drop Tail Keep a single queue Answer to Q1:
More informationUsing OPNET to Enhance Student Learning in a Data Communications
Using OPNET to Enhance Student Learning in a Data Communications Course Michael W Dixon Murdoch University, Perth, Australia m.dixon@murdoch.edu.au Terry W Koziniec Murdoch University, Perth, Australia
More informationCS 3516: Computer Networks
Welcome to CS 3516: Computer Networks Prof. Yanhua Li Time: 9:00am 9:50am M, T, R, and F Location: AK219 Fall 2018 A-term 1 Some slides are originally from the course materials of the textbook Computer
More informationCS 440 Computer Networks Lab 5 Ethernet LAN Simulation
CS 440 Computer Networks Fall 2005 Bob Wall Lab 5 Ethernet LAN Simulation The objective of the lab was to simulate an Ethernet Local Access Network (LAN) using OpNet ITGuru. The simulation was of a 10Base5
More informationQueuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks
Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute Troy, NY bisnin@rpi.edu, abouzeid@ecse.rpi.edu
More informationend systems, access networks, links circuit switching, packet switching, network structure
Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge end systems, access networks, links 1.3 Network core circuit switching, packet switching, network structure 1.4 Delay, loss and throughput
More informationEP2200 Queueing theory and teletraffic systems
EP2200 Queueing theory and teletraffic systems Viktoria Fodor Laboratory of Communication Networks School of Electrical Engineering Lecture 1 If you want to model networks Or a complex data flow A queue's
More informationWireless Access. Practice 15 November 14, 2018
Practice 15 November 14, 2018 Wireless Access Graduate course in Telecommunications School of Engineering University of Rome La Sapienza Rome, Italy 2018-2019 Token ring queueing time analysis with OMNeT++
More informationQueuing Disciplines. Order of Packet Transmission and Dropping. Laboratory. Objective. Overview
Laboratory 2 Queuing Disciplines Order of Packet Transmission and Dropping Objective The objective of this lab is to examine the effect of different queuing disciplines on packet delivery and delay for
More informationComputer Networking Introduction
Computer Networking Introduction Halgurd S. Maghdid Software Engineering Department Koya University-Koya, Kurdistan-Iraq Lecture No.2 Chapter 1: roadmap 1.1 what is the Inter? 1.2 work edge end systems,
More informationComputer Networks Chapter 1: Introduction. Introduction
Computer Networks Chapter 1: Introduction CSC 249 January 25, 2018 Introduction What is the Inter? Define work edge: hosts,, physical media Define the work core & Inter structure First glimpse at the layers
More informationObjective To examine the throughput of a TCP connection as the flow control window size is varied.
Lab 7 TCP Throughput Overview TCP uses a sliding window mechanism to provide flow control. The destination advertises how much space it has available in its buffers, and the source restricts its transmissions
More informationNetwork Traffic Characterisation
Modeling Modeling Theory Outline 1 2 The Problem Assumptions 3 Standard Car Model The Packet Train Model The Self - Similar Model 4 Random Variables and Stochastic Processes The Poisson and Exponential
More informationThe War Between Mice and Elephants
The War Between Mice and Elephants Liang Guo and Ibrahim Matta Computer Science Department Boston University 9th IEEE International Conference on Network Protocols (ICNP),, Riverside, CA, November 2001.
More informationComputer Networks. ENGG st Semester, 2010 Hayden Kwok-Hay So
Computer Networks ENGG1015 1 st Semester, 2010 Hayden Kwok-Hay So Where are we in the semester? High Level Applications Systems Digital Logic Image & Video Processing Computer & Embedded Systems Computer
More informationChapter 4. Routers with Tiny Buffers: Experiments. 4.1 Testbed experiments Setup
Chapter 4 Routers with Tiny Buffers: Experiments This chapter describes two sets of experiments with tiny buffers in networks: one in a testbed and the other in a real network over the Internet2 1 backbone.
More informationCSE 461 Quality of Service. David Wetherall
CSE 461 Quality of Service David Wetherall djw@cs.washington.edu QOS Focus: How to provide better than best effort Fair queueing Application Application needs Transport Traffic shaping Guarantees IntServ
More informationA closer look at network structure:
T1: Introduction 1.1 What is computer network? Examples of computer network The Internet Network structure: edge and core 1.2 Why computer networks 1.3 The way networks work 1.4 Performance metrics: Delay,
More informationCS 421: COMPUTER NETWORKS SPRING FINAL May 21, minutes
CS 421: COMPUTER NETWORKS SPRING 2015 FINAL May 21, 2015 150 minutes Name: Student No: Show all your work very clearly. Partial credits will only be given if you carefully state your answer with a reasonable
More informationIntroduction to Queuing Systems
Introduction to Queuing Systems Queuing Theory View network as collections of queues FIFO data-structures Queuing theory provides probabilistic analysis of these queues Examples: Average length Probability
More informationModel suitable for virtual circuit networks
. The leinrock Independence Approximation We now formulate a framework for approximation of average delay per packet in telecommunications networks. Consider a network of communication links as shown in
More informationLecture 5: Performance Analysis I
CS 6323 : Modeling and Inference Lecture 5: Performance Analysis I Prof. Gregory Provan Department of Computer Science University College Cork Slides: Based on M. Yin (Performability Analysis) Overview
More informationPerformance Modeling
Performance Modeling EECS 489 Computer Networks http://www.eecs.umich.edu/~zmao/eecs489 Z. Morley Mao Tuesday Sept 14, 2004 Acknowledgement: Some slides taken from Kurose&Ross and Katz&Stoica 1 Administrivia
More informationEP2200 Queueing theory and teletraffic systems
EP2200 Queueing theory and teletraffic systems Viktoria Fodor Laboratory of Communication Networks School of Electrical Engineering Lecture 1 If you want to model networks Or a complex data flow A queue's
More informationOrder of Packet Transmission and Dropping
Laboratory 9 Queuing Disciplines Order of Packet Transmission and Dropping Objective The objective of this lab is to examine the effect of different queuing disciplines on packet delivery and delay for
More informationThis Lecture. BUS Computer Facilities Network Management. Switching Network. Simple Switching Network
This Lecture BUS0 - Computer Facilities Network Management Switching networks Circuit switching Packet switching gram approach Virtual circuit approach Routing in switching networks Faculty of Information
More informationProblem-1: Solution-1:
Problem-1: olution-1: Tollbooths are 75 km apart, and the cars propagate at 100km/hr. A tollbooth services a car at a rate of one car every 12 seconds. a) There are ten cars. It takes seconds, or 2 minutes,
More informationLab 1: Improving performance by LAN Hardware Upgrade
Lab 1: Improving performance by LAN Hardware Upgrade Objective In this lab, OPNET s IT Guru Academic Edition advanced modeling software will be used to study performance improvements in LAN obtained by
More informationTeletraffic theory (for beginners)
Teletraffic theory (for beginners) samuli.aalto@hut.fi teletraf.ppt S-38.8 - The Principles of Telecommunications Technology - Fall 000 Contents Purpose of Teletraffic Theory Network level: switching principles
More informationHybrid Control and Switched Systems. Lecture #17 Hybrid Systems Modeling of Communication Networks
Hybrid Control and Switched Systems Lecture #17 Hybrid Systems Modeling of Communication Networks João P. Hespanha University of California at Santa Barbara Motivation Why model network traffic? to validate
More informationAnnouncements. TAs office hours: Mohamed Grissa: Mohamed Alkalbani:
Announcements TAs office hours: Mohamed Grissa: grissam@oregonstate.edu Tuesday: 4-5 Friday: 11-12 Mohamed Alkalbani: alkalbmo@oregonstate.edu Wednesday: 11-12 Thursday: 11-12 Lecture slides: Will be posted
More informationChapter 1. Computer Networks and the Internet
Chapter 1 Computer Networks and the Internet Internet traffic What s the Internet? (hardware) PC server wireless laptop cellular handheld wired links millions of connected computing devices: hosts = end
More information10. Network dimensioning
Partly based on slide material by Samuli Aalto and Jorma Virtamo ELEC-C7210 Modeling and analysis of communication networks 1 Contents Introduction Parameters: topology, routing and traffic Dimensioning
More informationNetwork Layer Enhancements
Network Layer Enhancements EECS 122: Lecture 14 Department of Electrical Engineering and Computer Sciences University of California Berkeley Today We have studied the network layer mechanisms that enable
More informationDropping Packets in Ubuntu Linux using tc and iptables
Dropping Packets in Ubuntu Linux using tc and... 1 Dropping Packets in Ubuntu Linux using tc and iptables By Steven Gordon on Tue, 18/01/2011-8:13pm There are two simple ways to randomly drop packets on
More informationAdvanced Computer Networks Spring Set #1
Advanced Computer Networks Spring 2019- Set #1 Prof. Zygmunt J. Haas Computer Science Department The University of Texas at Dallas ECSS 4.405 Richardson, TX 75080 http://www.utdallas.edu/~haas/courses/acn
More informationEdge versus Host Pacing of TCP Traffic in Small Buffer Networks
Edge versus Host Pacing of TCP Traffic in Small Buffer Networks Hassan Habibi Gharakheili 1, Arun Vishwanath 2, Vijay Sivaraman 1 1 University of New South Wales (UNSW), Australia 2 University of Melbourne,
More informationA Delayed Vacation Model of an M/G/1 Queue with Setup. Time and its Application to SVCC-based ATM Networks
IEICE TRANS. COMMUN., VOL. 0, NO. 0 1996 1 PAPER Special Issue on Telecommunications Network Planning and Design A Delayed Vacation Model of an M/G/1 Queue with Setup Time and its Application to SVCCbased
More informationChapter 1 Introduction
Chapter 1 Introduction A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the animations;
More informationCSE3213 Computer Network I
CSE3213 Computer Network I Introduction Course page: http://www.cse.yorku.ca/course/3213 1 Course Contents 3 general areas: data communications, networking, and protocols 1. Data communications: basic
More informationThe Network Layer and Routers
The Network Layer and Routers Daniel Zappala CS 460 Computer Networking Brigham Young University 2/18 Network Layer deliver packets from sending host to receiving host must be on every host, router in
More informationCOM-208: Computer Networks - Homework 1
COM-208: Computer Networks - Homework 1 1. Design an application-level protocol to be used between an TM (automatic teller machine) and a bank s centralized server. The protocol should allow: verifying
More informationInternet II. CS10 : Beauty and Joy of Computing. cs10.berkeley.edu. !!Senior Lecturer SOE Dan Garcia!!! Garcia UCB!
cs10.berkeley.edu CS10 : Beauty and Joy of Computing Internet II!!Senior Lecturer SOE Dan Garcia!!!www.cs.berkeley.edu/~ddgarcia CS10 L17 Internet II (1)! Why Networks?! Originally sharing I/O devices
More informationWHITE PAPER. Latency & Jitter WHITE PAPER OVERVIEW
Latency & Jitter In Networking Performance Evaluation OVERVIEW Latency and jitter are two key measurement parameters when evaluating and benchmarking the performance of a network, system or device. Different
More informationReal-Time Protocol (RTP)
Real-Time Protocol (RTP) Provides standard packet format for real-time application Typically runs over UDP Specifies header fields below Payload Type: 7 bits, providing 128 possible different types of
More informationQueuing Systems. Computer Exercise 2. Loss Systems and Queuing Networks
Queuing Systems Computer Exercise 2 Loss Systems and Queuing Networks 1 Instructions To be able to understand the computer exercise and to complete it within the given time limits, you have to prepare
More informationNetwork Performance: Queuing
Network Performance: Queuing EE 122: Intro to Communication Networks Fall 2006 (MW 4-5:30 in Donner 155) Vern Paxson TAs: Dilip Antony Joseph and Sukun Kim http://inst.eecs.berkeley.edu/~ee122/ Materials
More informationTime-Step Network Simulation
Time-Step Network Simulation Andrzej Kochut Udaya Shankar University of Maryland, College Park Introduction Goal: Fast accurate performance evaluation tool for computer networks Handles general control
More informationUnit 2 Packet Switching Networks - II
Unit 2 Packet Switching Networks - II Dijkstra Algorithm: Finding shortest path Algorithm for finding shortest paths N: set of nodes for which shortest path already found Initialization: (Start with source
More informationAffects of Queuing Mechanisms on RTP Traffic Comparative Analysis of Jitter, End-to- End Delay and Packet Loss
Comparative Analysis of Jitter, End-to- End Delay and Packet Loss Gregory Epiphaniou 1 Carsten Maple 1 Paul Sant 1 Matthew Reeves 2 1 Institute for Research in Applicable Computing University of Bedfordshire
More informationLecture 21. Reminders: Homework 6 due today, Programming Project 4 due on Thursday Questions? Current event: BGP router glitch on Nov.
Lecture 21 Reminders: Homework 6 due today, Programming Project 4 due on Thursday Questions? Current event: BGP router glitch on Nov. 7 http://money.cnn.com/2011/11/07/technology/juniper_internet_outage/
More informationOrder of Packet Transmission and Dropping
LAB 11 Queuing Disciplines Order of Packet Transmission and Dropping OBJECTIVES The objective of this lab is to examine the effect of various queuing disciplines on packet delivery and delay for different
More informationPerformance Evaluation of Scheduling Mechanisms for Broadband Networks
Performance Evaluation of Scheduling Mechanisms for Broadband Networks Gayathri Chandrasekaran Master s Thesis Defense The University of Kansas 07.31.2003 Committee: Dr. David W. Petr (Chair) Dr. Joseph
More informationSecurity Lab 1 Firewall Performance
Security Lab 1 Firewall Performance This lab has been partially based on OPNET Lab Manual To Accompany Data and Computer Communications, by Kevin Brown and Leann Christianson, Prentice Hall, 2004. Objective
More informationContents. Configuring GRE 1
Contents Configuring GRE 1 Overview 1 GRE encapsulation format 1 GRE tunnel operating principle 1 GRE security mechanisms 2 GRE application scenarios 2 Protocols and standards 4 Configuring a GRE/IPv4
More informationP D1.1 RPR OPNET Model User Guide
P802.17 D1.1 RPR OPNET Model User Guide Revision Nov7 Yan F. Robichaud Mark Joseph Francisco Changcheng Huang Optical Networks Laboratory Carleton University 7 November 2002 Table Of Contents 0 Overview...1
More informationWei Wang, Mehul Motani and Vikram srinivasan Department of Electrical & Computer Engineering National University of Singapore, Singapore
Wei Wang, Mehul Motani and Vikram srinivasan Department of Electrical & Computer Engineering National University of Singapore, Singapore CCS '08: Proceedings of the 15th ACM conference on Computer and
More informationTHE TCP specification that specifies the first original
1 Median Filtering Simulation of Bursty Traffic Auc Fai Chan, John Leis Faculty of Engineering and Surveying University of Southern Queensland Toowoomba Queensland 4350 Abstract The estimation of Retransmission
More informationENSC 427 Communication Networks Final Project Presentation Spring 2012 Group 9
ENSC 427 Communication Networks Final Project Presentation Spring 2012 Group 9 1 Darren Tong, Vincent Guan, and Barry Zou {dta15, vqa, lfz3}@sfu.ca Simon Fraser University Vancouver, BC, Canada Introduction
More informationOutline. Computer Communication and Networks. The Network Core. Components of the Internet. The Network Core Packet Switching Circuit Switching
Outline Computer Communication and Networks 1 Department of Computer Science & Information Technology University of Balochistan Lecture 03 1/26 2/26 Two major components The mesh of packet switches and
More informationENSC 427 SPRING 2011 FINAL PROJECT EXPLORING TRAFFIC FOR P2P FILE SHARING PROTOCOL USING OPNET GROUP 01
SFU Communication Networks ENSC 427 SPRING 2011 FINAL PROJECT EXPLORING TRAFFIC FOR P2P FILE SHARING PROTOCOL USING OPNET GROUP 01 Abhishek Dubey ada4@sfu.ca Ashkan Mirnabavvi amirnaba@sfu.ca Vikas Yadav
More information048866: Packet Switch Architectures
048866: Packet Switch Architectures Output-Queued Switches Deterministic Queueing Analysis Fairness and Delay Guarantees Dr. Isaac Keslassy Electrical Engineering, Technion isaac@ee.technion.ac.il http://comnet.technion.ac.il/~isaac/
More informationPerformance of Multihop Communications Using Logical Topologies on Optical Torus Networks
Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks X. Yuan, R. Melhem and R. Gupta Department of Computer Science University of Pittsburgh Pittsburgh, PA 156 fxyuan,
More informationIntroduction to OMNeT++
Introduction to OMNeT++ Acknowledgment The source material for this presentation was borrowed from the OMNeT++ User Manual Version 4.1 What is OMNeT++ OMNeT++ is an object-oriented modular discrete event
More informationIT INFRASTRUCTURE PROJECT PHASE I INSTRUCTIONS
Project Overview IT INFRASTRUCTURE PROJECT PHASE I INSTRUCTIONS This project along with the Phase II IT Infrastructure Project will help you understand how a network administrator improves network performance
More informationOPNET Modeler. Tommy Svensson Alex Popescu
OPNET Modeler Development of laboratory exercises based on OPNET Modeler Tommy Svensson This thesis is presented as a part of the Master of Science Degree in Electrical Engineering with emphasis on Telecommunications
More informationof-service Support on the Internet
Quality-of of-service Support on the Internet Dept. of Computer Science, University of Rochester 2008-11-24 CSC 257/457 - Fall 2008 1 Quality of Service Support Some Internet applications (i.e. multimedia)
More informationThe Transport Control Protocol (TCP)
TNK092: Network Simulation - Nätverkssimulering Lecture 3: TCP, and random/short sessions Vangelis Angelakis Ph.D. The Transport Control Protocol (TCP) Objectives of TCP and flow control Create a reliable
More informationNetwork Architecture I
Network Architecture I Degree in: Communications Electronic Engineering Telecommunication Systems Engineering Telecommunication Technologies Engineering Telematics Engineering Universidad de Alcalá 2016/17
More informationSimulation and Analysis of Impact of Buffering of Voice Calls in Integrated Voice and Data Communication System
Simulation and Analysis of Impact of Buffering of Voice Calls in Integrated Voice and Data Communication System VM Chavan 1, MM Kuber 2 & RJ Mukhedkar 3 1&2 Department of Computer Engineering, Defence
More informationThe Diffie-Hellman Key Exchange
ISC: SECURITY AND QOS The Diffie-Hellman Key Exchange A mechanism to establish secret keys without the need for CAs Based on the difficulty of computing discrete logarithms of large numbers Public (or
More informationLecture 2 Communication services The Trasport Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 2 Communication services The Trasport Layer Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it The structure edge: applications and hosts core: routers of s access s, media:
More informationSwitched LANs. A Set of Local Area Networks Interconnected by Switches
Laboratory 3 Switched LANs A Set of Local Area Networks Interconnected by Switches Objective This lab is designed to demonstrate the implementation of switched local area networks. The simulation in this
More informationThis 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
Chapter 3 Problem 2 In Figure 3.43 of the text every node transmits R bps, and we assume that both network partitions consist of 1 N nodes. So the total traffic generated by the nodes 2 of each Ethernet
More informationcs/ee 143 Fall
cs/ee 143 Fall 2018 5 2 Ethernet 2.1 W&P, P3.2 3 Points. Consider the Slotted ALOHA MAC protocol. There are N nodes sharing a medium, and time is divided into slots. Each packet takes up a single slot.
More informationIntegrating Information Systems: Technology, Strategy, and Organizational Factors
MASSACHUSETTS INSTITUTE OF TECHNOLOGY SLOAN SCHOOL OF MANAGEMENT 15.565 Integrating Information Systems: Technology, Strategy, and Organizational Factors 15.578 Global Information Systems: Communications
More informationBasic Switch Organization
NOC Routing 1 Basic Switch Organization 2 Basic Switch Organization Link Controller Used for coordinating the flow of messages across the physical link of two adjacent switches 3 Basic Switch Organization
More informationProject Tutorial. CS 143 Communication Network. Ruijia Sun Zilong Chen. Based on version 2015, authored by Ritvik Mishra
Project Tutorial CS 143 Communication Network Ruijia Sun Zilong Chen Based on version 2015, authored by Ritvik Mishra Outline Project Overview Requirements Network Components Design Remarks Tools Schedule
More informationCSC 401 Data and Computer Communications Networks
CSC 401 Data and Computer Communications Networks Computer Networks and The Inter Sec 1.3 Prof. Lina Battestilli Fall 2017 Outline Computer Networks and the Inter (Ch 1) 1.1 What is the Inter? 1.2 work
More informationModels. Motivation Timing Diagrams Metrics Evaluation Techniques. TOC Models
Models Motivation Timing Diagrams Metrics Evaluation Techniques TOC Models Motivation Understanding Network Behavior Improving Protocols Verifying Correctness of Implementation Detecting Faults Choosing
More informationend systems, access networks, links 1.3 network core
Chapter 1: roadmap 1.1 what is the Inter? 1.2 work edge end systems, works, links 1.3 work core packet switching, circuit switching, work structure 1.4 delay, loss, throughput in works 1.5 protocol layers,
More informationLecture 14: Congestion Control"
Lecture 14: Congestion Control" CSE 222A: Computer Communication Networks Alex C. Snoeren Thanks: Amin Vahdat, Dina Katabi Lecture 14 Overview" TCP congestion control review XCP Overview 2 Congestion Control
More informationFour sources of packet delay
Outline q Major Internet components q Network architecture and protocols q Switching strategies q Internet protocol stack, history q to network performance Four sources of packet delay q 1. nodal processing:
More informationStatic Routing NETWORK INFRASTRUCTURES NETKIT - LECTURE 4 MANUEL CAMPO, MARCO SPAZIANI
Static Routing NETWORK INFRASTRUCTURES NETKIT - LECTURE 4 MANUEL CAMPO, MARCO SPAZIANI Routing Routing is the process of selecting a path for traffic in a network. This process defines the shortest or
More informationLayer 3: Network Layer. 9. Mar INF-3190: Switching and Routing
Layer 3: Network Layer 9. Mar. 2005 1 INF-3190: Switching and Routing Network Layer Goal Enable data transfer from end system to end system End systems Several hops, (heterogeneous) subnetworks Compensate
More informationKINETICS CALCS AND GRAPHS INSTRUCTIONS
KINETICS CALCS AND GRAPHS INSTRUCTIONS 1. Open a new Excel or Google Sheets document. I will be using Google Sheets for this tutorial, but Excel is nearly the same. 2. Enter headings across the top as
More informationL9: Intro Network Systems
L9: Intro Network Systems Dina Katabi 6.033 Spring 2007 http://web.mit.edu/6.033 Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, Sam Madden, and Robert Morris
More informationApplying Fuzzy Logic Principles to Improve the Performance of the Random Early Detection Algorithm
Applying Fuzzy ogic Principles to Improve the Performance of the Random Early Detection Algorithm A. I. A. Jabbar, PhD Professor Department of Electrical Engineering osul University Ahmed I. Al-Ghannam.Sc.
More informationCPSC 441 Tutorial-1. Department of Computer Science University of Calgary
CPSC 441 Tutorial-1 Department of Computer Science University of Calgary Question-1 A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the
More informationOn Network Dimensioning Approach for the Internet
On Dimensioning Approach for the Internet Masayuki Murata ed Environment Division Cybermedia Center, (also, Graduate School of Engineering Science, ) e-mail: murata@ics.es.osaka-u.ac.jp http://www-ana.ics.es.osaka-u.ac.jp/
More informationend systems, access networks, links circuit switching, packet switching, network structure
Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge end systems, access networks, links 1.3 Network core circuit switching, packet switching, network structure 1.4 Delay, loss and throughput
More informationAdvanced Communication Lab OPNET Tutorial
Advanced Communication Lab OPNET Tutorial SS 2013 Authors: Mohammad M. Siddique, Andreas J. Könsgen 1 1. Log on to the computer. 2. Open the OPNET program by clicking on the respective icon. 3. After the
More informationConfiguring Weighted Random Early Detection
Feature History Release Cisco IOS Modification For information about feature support in Cisco IOS software, use Cisco Feature Navigator. This module describes the tasks for configuring Weighted Random
More information