WEB traffic characterization and performance analysis
|
|
- Alan Walters
- 5 years ago
- Views:
Transcription
1 WEB traffic characterization and performance analysis
2 Summary Objectives of our work Web traffic characterisation through measurements Performance evaluation and analytical model validation Packet level analysis Conclusions 2
3 Objectives of our work Modelling the behaviour of Web clients Page size, page request frequency Single client, aggregate of clients Models and criteria for link dimensioning Effect of single/multiple bottleneck on performances Simple models for performance evaluation Models and criteria for buffer dimensioning Analysis of packet level dynamics 3
4 Data collection WS Internal Traces Drogo ( proxy ) CSELT Network GW Internet External Traces 100 Mbit / sec Client Server TCPDUMP Packet Traces TCP-REDUCE List of TCP connections other 8080 && dest. = drogo Internal Web Connections External Web Connections www && Source = drogo 4
5 WEB pages reconstruction Pages downloading process (HTTP/1.0) Pages reconstruction through TCP connections temporal clustering TCP Connections List HTML- REDUCE WWW level Stats 5
6 Main results Mean Std_dev Distribution Page size LogNormal bytes bytes Page duration Sec Sec. LogNormal Objects per LogNormal + δ page Think Time Sec Sec. LogNormal Pages Inter Req. Time Sec Sec. Exponential Active clients: 9% 15% 6
7 Page size distribution 1.E+00 1-CDF 1.E-01 1.E-02 EMPIRICAL LOGNORMAL WEIBULL o u t l i a r s 1.E-03 1.E-04 1.E-05 1.E+02 1.E+03 1.E+04 1.E+05 1.E+06 1.E+07 PAGE SIZE [BYTES] Doubly-Logarithmic Scale 7
8 Think-Time distribution 1.E+00 EMPIRICAL LOGNORMAL 1.E-01 1-CDF 1.E-02 1.E-03 1.E+00 1.E+01 1.E+02 1.E+03 1.E+04 THINK TIME [SEC] Doubly-Logarithmic Scale 8
9 Inter-Pages request time 1.E+00 1.E-01 EMPIRICAL 1-CDF 1.E-02 1.E-03 WEIBULL. EXPONENTIAL 1.E-04 1.E-05 1.E-02 1.E-01 1.E+00 1.E+01 IPT [SEC] Doubly-Logarithmic Scale 9
10 Inter-arrival based model Driven by Page Size Inter Request Time Page request frequency is load-independent Cli 1 Cli 2 Cli 3 10
11 Think-Time based model Driven by Page size Think Time Frequency of page requests is load-dependent Cli 1 Cli 2 Cli 3 11
12 Single bottleneck scenario (1) Clients located on high speed LAN Router and server latency is negligible Infinite buffer space: no lost packets 12,500,000 bytes/sec 73,750 bytes/sec 12,500,000 bytes/sec Page 2 Page 1 C M/G/1/PS Model 12
13 Single bottleneck scenario (2) 25 Average Downloading Time vs offered load [sec] ,1 0,2 0,3 0,4 0,5 0,6 0,7 0,8 0,9 1 ρ 13
14 Multiple bottlenecks scenario Clients attached to low speed lines Routers and Servers latency is negligible Infinite buffer space 10 Mbit/sec Server addizionale Server addizionale 56.6 Kbit/sec Client osservati 10 Mbit/sec Traffico osservato Router1 Router2 Router Kbit/sec Server osservati Client addizionali Client addizionali 14
15 Two bottlenecks scenario Average downloading time vs offered load Download Time [sec] 8 6 MediaResponseTime MODEM MG1PS MODEM+MG1PS PAB ρ [%] 15
16 Three bottlenecks scenario Download Time [sec] MediaResponseTime MODEM MG1PS-link1 MG1PS-link2 MODEM+MG1PS1 MODEM+MG1PS1+MG1PS2 PAB ρ [%] 16
17 Packet level analysis Real traces are self similar in the range [few msec. - tens of sec.] with H 0.8 Simulated traces shows similar characteristics in the range [10 msec sec.] with H 0.73 unless the traffic is very high (> 0.8) Self similarity has to be taken into account for buffer dimensioning even though it is irrelevant for link dimensioning 17
18 Conclusions and future work The M/G/1/PS model provides good estimation of the average transmission time With multiple bottlenecks, present results indicate that the delay is additive Further analysis are required to confirm this result Buffer occupancy is overestimated by the M/G/1/PS model: models at the packet level taking into account self similarity are required 18
3. Examples. Contents. Classical model for telephone traffic (1) Classical model for telephone traffic (2)
Contents Model for telephone traffic Packet level model for data traffic Flow level model for elastic data traffic Flow level model for streaming data traffic lect03.ppt S-38.45 - Introduction to Teletraffic
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 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 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 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 informationMonitoring and Analysis
CHAPTER 3 Cisco Prime Network Analysis Module 5.1 has two types of dashboards: One type is the summary views found under the Monitor menu, and the other type is the over time views found under the Analyze
More informationWeb, HTTP and Web Caching
Web, HTTP and Web Caching 1 HTTP overview HTTP: hypertext transfer protocol Web s application layer protocol client/ model client: browser that requests, receives, displays Web objects : Web sends objects
More information2. Traffic. Contents. Offered vs. carried traffic. Characterisation of carried traffic
Contents characterisation Telephone traffic modelling Data traffic modelling at packet level Data traffic modelling at flow level lect.ppt S-8.5 - Introduction to Teletraffic Theory Spring 6 Offered vs.
More informationNET ID. CS519, Prelim (March 17, 2004) NAME: You have 50 minutes to complete the test. 1/17
CS519, Prelim (March 17, 2004) NAME: You have 50 minutes to complete the test. 1/17 Q1. 2 points Write your NET ID at the top of every page of this test. Q2. X points Name 3 advantages of a circuit network
More information2. Traffic lect02.ppt S Introduction to Teletraffic Theory Spring
lect02.ppt S-38.145 - Introduction to Teletraffic Theory Spring 2005 1 Contents Traffic characterisation Telephone traffic modelling Data traffic modelling at packet level Data traffic modelling at flow
More informationECS 152A Computer Networks Instructor: Liu. Name: Student ID #: Final Exam: March 17, 2005
ECS 152A Computer Networks Instructor: Liu Name: Student ID #: Final Exam: March 17, 2005 Duration: 120 Minutes 1. The exam is closed book. However, you may refer to one sheet of A4 paper (double sided)
More informationTracking the Evolution of Web Traffic:
The University of North Carolina at Chapel Hill Department of Computer Science 11 th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)
More informationToward a Reliable Data Transport Architecture for Optical Burst-Switched Networks
Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks Dr. Vinod Vokkarane Assistant Professor, Computer and Information Science Co-Director, Advanced Computer Networks Lab University
More informationTCP Congestion Control
6.033, Spring 2014 TCP Congestion Control Dina Katabi & Sam Madden nms.csail.mit.edu/~dina Sharing the Internet How do you manage resources in a huge system like the Internet, where users with different
More informationCS 557 Congestion and Complexity
CS 557 Congestion and Complexity Observations on the Dynamics of a Congestion Control Algorithm: The Effects of Two-Way Traffic Zhang, Shenker, and Clark, 1991 Spring 2013 The Story So Far. Transport layer:
More information6. Simulation Evaluation of Multicast Injection for Resource-initiated
6. imulation Evaluation of Multicast Injection for Resource-initiated Allocation Deployment In this chapter we describe how we implemented a simulator to verify hypothesis made in previous chapter about
More informationExperimental Networking Research and Performance Evaluation
Generating Realistic TCP Workloads Felix Hernandez-Campos Ph. D. Candidate Dept. of Computer Science Univ. of North Carolina at Chapel Hill Recipient of the 2001 CMG Fellowship Joint work with F. Donelson
More informationFrom Traffic Measurement to Realistic Workload Generation
From Traffic Measurement to Realistic Workload Generation Felix Hernandez-Campos Ph. D. Candidate Dept. of Computer Science Univ. of North Carolina at Chapel Hill Joint work with F. Donelson Smith and
More informationCS 421: COMPUTER NETWORKS SPRING FINAL May 16, minutes
CS 4: COMPUTER NETWORKS SPRING 03 FINAL May 6, 03 50 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 justification.
More information1-1. Switching Networks (Fall 2010) EE 586 Communication and. September Lecture 10
EE 586 Communication and Switching Networks (Fall 2010) Lecture 10 September 17 2010 1-1 Announcement Send me your group and get group ID HW3 (short) out on Monday Personal leave for next two weeks No
More informationECEN Final Exam Fall Instructor: Srinivas Shakkottai
ECEN 424 - Final Exam Fall 2013 Instructor: Srinivas Shakkottai NAME: Problem maximum points your points Problem 1 10 Problem 2 10 Problem 3 20 Problem 4 20 Problem 5 20 Problem 6 20 total 100 1 2 Midterm
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 informationA Generalization of a TCP Model: Multiple Source-Destination Case. with Arbitrary LAN as the Access Network
A Generalization of a TCP Model: Multiple Source-Destination Case with Arbitrary LAN as the Access Network Oleg Gusak and Tu rul Dayar Department of Computer Engineering and Information Science Bilkent
More informationCS 218- QoS Routing + CAC Fall 2003
CS 218- QoS Routing + CAC Fall 2003 M. Gerla et al: Resource Allocation and Admission Control Styles in QoS DiffServ Networks, QoS-IP 2001, Rome, Italy. A. Dubrovsky, M. Gerla, S. S. Lee, and D. Cavendish,Internet
More informationCS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 4pm
CS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 2015 @ 4pm Your Name: SUNet ID: @stanford.edu Check if you would like exam routed back via SCPD:
More informationcs144 Midterm Review Fall 2010
cs144 Midterm Review Fall 2010 Administrivia Lab 3 in flight. Due: Thursday, Oct 28 Midterm is this Thursday, Oct 21 (during class) Remember Grading Policy: - Exam grade = max (final, (final + midterm)/2)
More informationAppendix B. Standards-Track TCP Evaluation
215 Appendix B Standards-Track TCP Evaluation In this appendix, I present the results of a study of standards-track TCP error recovery and queue management mechanisms. I consider standards-track TCP error
More informationIntroduction to Real-Time Communications. Real-Time and Embedded Systems (M) Lecture 15
Introduction to Real-Time Communications Real-Time and Embedded Systems (M) Lecture 15 Lecture Outline Modelling real-time communications Traffic and network models Properties of networks Throughput, delay
More informationInvestigating the Use of Synchronized Clocks in TCP Congestion Control
Investigating the Use of Synchronized Clocks in TCP Congestion Control Michele Weigle (UNC-CH) November 16-17, 2001 Univ. of Maryland Symposium The Problem TCP Reno congestion control reacts only to packet
More informationWeek 7: Traffic Models and QoS
Week 7: Traffic Models and QoS Acknowledgement: Some slides are adapted from Computer Networking: A Top Down Approach Featuring the Internet, 2 nd edition, J.F Kurose and K.W. Ross All Rights Reserved,
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 informationNon-Cooperative End-to-End Path Characterisation
Non-Cooperative End-to-End Path Characterisation Kapil Bajaj, Balaji Kasal, Harshal Ninawe, Sriharsha and D. Manjunath Indian Institute of Technology, Bombay Powai Mumbai 400 076 INDIA Email: {kapil@cse,balaji@ee,hani@cse,harsha@ee,dmanju@ee}.iitb.ac.in
More informationCOE 431 Computer Networks. Welcome to Exam I Thursday April 02, Instructor: Wissam F. Fawaz
1 COE 431 Computer Networks Welcome to Exam I Thursday April 02, 2015 Instructor: Wissam F. Fawaz Name: Student ID: Instructions: 1. This exam is Closed Book. Please do not forget to write your name and
More informationKent State University
CS 4/54201 Computer Communication Network Kent State University Dept. of Computer Science www.mcs.kent.edu/~javed/class-net06f/ 1 A Course on Networking and Computer Communication LECT-11, S-2 Congestion
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 informationEXAM TCP/IP NETWORKING Duration: 3 hours With Solutions
SCIPER: First name: Family name: EXAM TCP/IP NETWORKING Duration: 3 hours With Solutions Jean-Yves Le Boudec January 2016 INSTRUCTIONS 1. Write your solution into this document and return it to us (you
More informationChair for Network Architectures and Services Prof. Carle Department of Computer Science Technische Universität München.
Chair for Network Architectures and Services Prof. Carle Department of Computer Science Technische Universität München Network Analysis 2b) Deterministic Modelling beyond Formal Logic A simple network
More informationSizing Router Buffers
Sizing Router Buffers Sachin Katti, CS244 Slides courtesy: Nick McKeown Routers need Packet Buffers It s well known that routers need packet buffers It s less clear why and how much Goal of this work is
More informationEng 3553 Lab #5 TCP Throughput
Eng 3553 Lab #5 TCP Throughput Overview TCP (Transmission Control Protocol) is a means for building a reliable communications stream, enabling two hosts to establish a connection and exchange streams of
More informationLow Latency via Redundancy
Low Latency via Redundancy Ashish Vulimiri, Philip Brighten Godfrey, Radhika Mittal, Justine Sherry, Sylvia Ratnasamy, Scott Shenker Presenter: Meng Wang 2 Low Latency Is Important Injecting just 400 milliseconds
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 informationCharacterizing Internet Load as a Non-regular Multiplex of TCP Streams
Characterizing Internet Load as a Non-regular Multiplex of TCP Streams J. Aracil, D. Morató Dpto. Automática y Computación Universidad Pública de Navarra {javier.aracil,daniel.morato}@unavarra.es http://www.tlm.unavarra.es
More informationTCP Performance. EE 122: Intro to Communication Networks. Fall 2006 (MW 4-5:30 in Donner 155) Vern Paxson TAs: Dilip Antony Joseph and Sukun Kim
TCP Performance 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 with thanks
More informationSTUDY OF SOCKET PROGRAMMING AND CLIENT SERVER MODEL
STUDY OF SOCKET PROGRAMMING AND CLIENT SERVER MODEL AIM: To conduct an experiment to demonstrate the working of file transfer with the UDP Server and Client. APPARATUS REQUIRED: PC with network simulation
More informationDistributed File Systems Part II. Distributed File System Implementation
s Part II Daniel A. Menascé Implementation File Usage Patterns File System Structure Caching Replication Example: NFS 1 Implementation: File Usage Patterns Static Measurements: - distribution of file size,
More informationSome economical principles
Hints on capacity planning (and other approaches) Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Some economical principles Assume users have
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 Networking
15-441 Computer Networking Lecture 17 TCP Performance & Future Eric Anderson Fall 2013 www.cs.cmu.edu/~prs/15-441-f13 Outline TCP modeling TCP details 2 TCP Performance Can TCP saturate a link? Congestion
More informationSolution to Question 1: ``Quickies'' (25 points, 15 minutes)
Solution to Question : ``Quickies'' (25 points, 5 minutes) What is meant by the term statistical multiplexing? Answer: In statistical multiplexing, data from multiple users (senders) is sent over a link.
More informationEvaluation of applications over an intranet
Evaluation of applications over an intranet 1 Intranet architecture File server 2 Lan 2 10 Mbps Eth R2 50 Unix Workstation Lan 3 10 Mbps Eth File server 1 Web server 120 Windows NT clients R1 FDDI 100
More informationChapter I: Introduction
Chapter I: Introduction UG3 Computer Communications & Networks (COMN) Myungjin Lee myungjin.lee@ed.ac.uk Slides copyright of Kurose and Ross The work core mesh of interconnected routers packet-switching:
More informationCPSC 641: WAN Measurement. Carey Williamson Department of Computer Science University of Calgary
CPSC 641: WAN Measurement Carey Williamson Department of Computer Science University of Calgary WAN Traffic Measurements There have been several studies of wide area network traffic (i.e., Internet traffic)
More informationDevoFlow: Scaling Flow Management for High Performance Networks
DevoFlow: Scaling Flow Management for High Performance Networks SDN Seminar David Sidler 08.04.2016 1 Smart, handles everything Controller Control plane Data plane Dump, forward based on rules Existing
More informationa. (4pts) What general information is contained in a LSR-PDU update that A might send?
B1: Networks (25 points) Link State Routing (LSR). (Hint: flooding and Dijkstra s Algorithm). Assume Router A has physical links to Routers W, X, Y, Z. a. (4pts) What general information is contained in
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 informationSELECTION OF METRICS (CONT) Gaia Maselli
SELECTION OF METRICS (CONT) Gaia Maselli maselli@di.uniroma1.it Computer Network Performance 2 Selecting performance metrics Computer Network Performance 3 Selecting performance metrics speed Individual
More informationFortiTester Handbook VERSION 2.4.1
FortiTester Handbook VERSION 2.4.1 FORTINET DOCUMENT LIBRARY http://docs.fortinet.com FORTINET VIDEO GUIDE http://video.fortinet.com FORTINET BLOG https://blog.fortinet.com CUSTOMER SERVICE & SUPPORT https://support.fortinet.com
More informationOverview Content Delivery Computer Networking Lecture 15: The Web Peter Steenkiste. Fall 2016
Overview Content Delivery 15-441 15-441 Computer Networking 15-641 Lecture 15: The Web Peter Steenkiste Fall 2016 www.cs.cmu.edu/~prs/15-441-f16 Web Protocol interactions HTTP versions Caching Cookies
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 informationProxy-based TCP-friendly streaming over mobile networks
Proxy-based TCP-friendly streaming over mobile networks Frank Hartung Uwe Horn Markus Kampmann Presented by Rob Elkind Proxy-based TCP over mobile nets 1 Outline Introduction TCP Friendly Rate Control
More informationCircuit Breakers for Multimedia Congestion Control
Circuit Breakers for Multimedia Congestion Control Varun Singh Aalto University Stephen McQuistin, Martin Ellis, and Colin Perkins University of Glasgow Context Video conferencing seeing increasing deployment
More informationCapacity planning and.
Hints on capacity planning (and other approaches) Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Some economical principles Assume users have
More informationGame Traffic Analysis: An MMORPG Perspective
Appeared in ACM NOSSDAV 2005 (15th International Workshop on Network and Operating System Support for Digital Audio and Video) Game Traffic Analysis: An MMORPG Perspective (MMORPG: Massive Multiplayer
More informationTransport Protocols for Networked Games
Transport Protocols for Networked Games 1 TCP or UDP? 2 Why use TCP? TCP provides reliable, in-order delivery TCP goes through most firewalls, UDP does not TCP manages connection for us 3 Why not to use
More informationCMSC 611: Advanced. Interconnection Networks
CMSC 611: Advanced Computer Architecture Interconnection Networks Interconnection Networks Massively parallel processor networks (MPP) Thousands of nodes Short distance (
More informationNetwork traffic characterization
Network traffic characterization A historical perspective 1 Incoming AT&T traffic by port (18 hours of traffic to AT&T dial clients on July 22, 1997) Name port % bytes %packets bytes per packet world-wide-web
More informationNetwork traffic characterization. A historical perspective
Network traffic characterization A historical perspective 1 Incoming AT&T traffic by port (18 hours of traffic to AT&T dial clients on July 22, 1997) Name port %bytes %packets bytes per packet world-wide-web
More informationSimulation Input Data Modeling
Introduction to Modeling and Simulation Simulation Input Data Modeling OSMAN BALCI Professor Department of Computer Science Virginia Polytechnic Institute and State University (Virginia Tech) Blacksburg,
More informationLECTURE WK4 NETWORKING
LECTURE WK4 NETWORKING Workbook and Quiz Workbook o Due in WK5 o Must hand in a hard copy to the tutor as well as an online submission Quiz o In the practical class o 30mins to complete the quiz o Short,
More informationChapter 6 Connecting Device
Computer Networks Al-Mustansiryah University Elec. Eng. Department College of Engineering Fourth Year Class Chapter 6 Connecting Device 6.1 Functions of network devices Separating (connecting) networks
More informationComputer Networks and the Internet. CMPS 4750/6750: Computer Networks
Computer Networks and the Inter CMPS 4750/6750: Computer Networks Outline What Is the Inter? Access Networks Packet Switching and Circuit Switching A closer look at delay, loss, and throughput Interconnection
More informationCSCE 463/612 Networks and Distributed Processing Spring 2018
CSCE 463/612 Networks and Distributed Processing Spring 2018 Introduction II Dmitri Loguinov Texas A& University January 25, 2018 Original slides copyright 1996-2004 J.F Kurose and K.W. Ross 1 Chapter
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 informationc) With the selective repeat protocol, it is possible for the sender to receive an ACK for a packet that falls outside of its current window.
Part 1 Question 1 [0.5 Marks] Suppose an application generates chunks of 40 bytes of data every 20 msec, and each chunk gets encapsulated by a TCP segment and then an IP datagram. What percentage of each
More informationWeb File Transmission by Object Packaging Performance Comparison with HTTP 1.0 and HTTP 1.1 Persistent Connection
Web File Transmission by Performance Comparison with and Hiroshi Fujinoki, Murugesan Sanjay, and Chintan Shah Department of Computer Science Southern Illinois University at Edwardsville Edwardsville, Illinois
More informationECE 650 Systems Programming & Engineering. Spring 2018
ECE 650 Systems Programming & Engineering Spring 2018 Networking Transport Layer Tyler Bletsch Duke University Slides are adapted from Brian Rogers (Duke) TCP/IP Model 2 Transport Layer Problem solved:
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 informationCHAPTER 5 PROPAGATION DELAY
98 CHAPTER 5 PROPAGATION DELAY Underwater wireless sensor networks deployed of sensor nodes with sensing, forwarding and processing abilities that operate in underwater. In this environment brought challenges,
More informationStreaming Video and TCP-Friendly Congestion Control
Streaming Video and TCP-Friendly Congestion Control Sugih Jamin Department of EECS University of Michigan jamin@eecs.umich.edu Joint work with: Zhiheng Wang (UofM), Sujata Banerjee (HP Labs) Video Application
More informationFairness in the IEEE network. Shun Y. Cheung
Fairness in the IEEE 802.11 network Shun Y. Cheung Simple FIFO queueing High data rate flow Output queue (infinite size) Low data rate flow Packets from low data rate flow experience excessive queueing
More informationComputer Networks & Security 2016/2017
Computer Networks & Security 2016/2017 Protocol Layering (02) Dr. Tanir Ozcelebi Courtesy: Kurose & Ross TU/e Computer Science Security and Embedded Networked Systems Your typical lunch Slide 2 What is
More informationName Student ID Department/Year. Midterm Examination. Introduction to Computer Networks Class#: 901 E31110 Fall 2006
Name Student ID Department/Year Midterm Examination Introduction to Computer Networks Class#: 901 E31110 Fall 2006 9:20-11:00 Tuesday November 14, 2006 Prohibited 1. You are not allowed to write down the
More informationCS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 4pm
CS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 2015 @ 4pm Your Name: Answers SUNet ID: root @stanford.edu Check if you would like exam routed
More informationEXAM TCP/IP NETWORKING Duration: 3 hours
SCIPER: First name: Family name: EXAM TCP/IP NETWORKING Duration: 3 hours Jean-Yves Le Boudec January 2017 INSTRUCTIONS 1. Write your solution into this document and return it to us (you do not need to
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 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 informationHomework 1. Question 1 - Layering. CSCI 1680 Computer Networks Fonseca
CSCI 1680 Computer Networks Fonseca Homework 1 Due: 27 September 2012, 4pm Question 1 - Layering a. Why are networked systems layered? What are the advantages of layering? Are there any disadvantages?
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 informationCS 218 F Nov 3 lecture: Streaming video/audio Adaptive encoding (eg, layered encoding) TCP friendliness. References:
CS 218 F 2003 Nov 3 lecture: Streaming video/audio Adaptive encoding (eg, layered encoding) TCP friendliness References: J. Padhye, V.Firoiu, D. Towsley, J. Kurose Modeling TCP Throughput: a Simple Model
More informationCS533 Modeling and Performance Evaluation of Network and Computer Systems
CS533 Modeling and Performance Evaluation of Network and Computer Systems Selection of Techniques and Metrics (Chapter 3) 1 Overview One or more systems, real or hypothetical You want to evaluate their
More informationWQM: Practical, Adaptive, and Lightweight Wireless Queue Management System
WQM: Practical, Adaptive, and Lightweight Wireless Queue Management System Basem Shihada Computer Science & Electrical Engineering CEMSE, KAUST University of Waterloo Seminar December 8 th, 2014 2 3 How
More informationRouter Router Microprocessor controlled traffic direction home router DSL modem Computer Enterprise routers Core routers
Router Router is a Microprocessor controlled device that forwards data packets across the computer network. It is used to connect two or more data lines from different net works. The function of the router
More informationCS 268: Lecture 7 (Beyond TCP Congestion Control)
Outline CS 68: Lecture 7 (Beyond TCP Congestion Control) TCP-Friendly Rate Control (TFRC) explicit Control Protocol Ion Stoica Computer Science Division Department of Electrical Engineering and Computer
More informationA Behavioral Model of Web Traffic
A Behavioral Model of Web Traffic Hyoung-Kee Choi School of Electrical and Computer Engineering John O. Limb College of Computing Georgia Institute of Technology {hkchoi, limb}@cc.gatech.edu Abstract The
More informationFortiTester Handbook VERSION 2.4.0
FortiTester Handbook VERSION 2.4.0 FORTINET DOCUMENT LIBRARY http://docs.fortinet.com FORTINET VIDEO GUIDE http://video.fortinet.com FORTINET BLOG https://blog.fortinet.com CUSTOMER SERVICE & SUPPORT https://support.fortinet.com
More informationCS 421: COMPUTER NETWORKS FALL FINAL January 10, minutes
CS 4: COMPUTER NETWORKS FALL 00 FINAL January 0, 0 50 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 informationLoad Balance Mechanism
Load Balance Application in Dual-WAN Interface Load Balance Mechanism To which WAN port the traffic will be routed is determined according to the Load Balance mechanism. Below diagram shows how Vigor router
More informationCS533 Modeling and Performance Evaluation of Network and Computer Systems
CS533 Modeling and Performance Evaluation of Network and Computer s Selection of Techniques and Metrics Overview One or more systems, real or hypothetical You want to evaluate their performance What technique
More information6.033 Lecture 12 3/16/09. Last time: network layer -- how to deliver a packet across a network of multiple links
6.033 Lecture 12 3/16/09 Sam Madden End to End Layer Last time: network layer -- how to deliver a packet across a network of multiple links Recall that network layer is best effort, meaning: - packets
More informationFIFO Service with Differentiated Queueing
ANCS 2011 1/29 FIFO Service with Differentiated Queueing Martin Karsten David R. Cheriton School of Computer Science University of Waterloo (currently on Sabbatical at University of Kaiserslautern) ANCS
More information