Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Measurement Introduction
Internet measurement is done to either analyze/characterize network phenomena or to test new tools, protocols, systems, etc. Measuring Internet performance is easier said than done What does performance mean? Workload (what and where youre measuring) selection is critical Reproducibility is often essential Many tools have been developed to measure/monitor general characteristics of network performance traceroute and ping are two of the most popular These are examples of active measurement tools Passive tools are the other major category Representative and reproducible workload generation will be a focus
Pathchar: per-hop bandwidth, latency, loss measurement Pchar, clink: open-source reimplementation of pathchar Problem: measurement timescales vary widely
Workload Generation
Local and/or wide area experiments often require representative and reproducible workloads How do we select a workload? Currently HTTP makes up the majority of Internet traffic Trace-based workloads Capture traces and replay them Black-box method Synthetic workloads Abstraction of actual operation May not capture all aspects of workload Analytic workloads Attempt to model workload precisely Very difficult
SURGE components: Statistical distribution generator Hyper Text Transfer Protocol (HTTP) request generator
SURGE Architecture
Queuing Models
One of the key modeling techniques for computer systems in general Vast literature on queuing theory Nicely suited for network analysis Prof. Mary Vernon is our local expert Generally, queuing systems deal with a situation where jobs (of which there are many) wait in line for a resource (of which there are few) Queuing theory can enable us to determine response time Examples? Example: packets arriving at a router how can we determine how long it takes for packets to be forwarded by the router? Characteristics necessary to specify a queuing system Arrival process Service time distribution Number of servers System capacity (number of buffers) Population size Service discipline Kendal notation: A/S/m/B/K/SD Response time = waiting time + service time For stability, mean arrival rate must be less than mean service rate
Littles Law
One of the most basic theorems in queuing theory (1961) Mean number jobs in system = arrival rate * mean response time Treats a system as a black box Applies whenever number of jobs entering the system equals number of jobs leaving the system No jobs created or lost inside system Can be extended to include systems with finite buffers
Simulation Models
Simulation is one of the most common/important methods of analysis/modeling Typically an abstraction of the system under consideration Can provide significant insight to systems behavior Network simulation is difficult because of the different layers of operation and the complexity at each layer Simulation options: build your own, use someone elses Canonical network simulator is ns developed at LBL