The Influence of Realism on Congestion in Network Simulations* K. Mills (joint work with C. Dabrowski) NIST December 1, 2015 *For more details see: NIST.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 9 Fundamentals.
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
William Stallings Data and Computer Communications 7 th Edition Chapter 13 Congestion in Data Networks.
School of Information University of Michigan Network resilience Lecture 20.
CS 408 Computer Networks Congestion Control (from Chapter 05)
Bilal Gonen University of Alaska Anchorage Murat Yuksel University of Nevada, Reno.
Module 3.4: Switching Circuit Switching Packet Switching K. Salah.
Real Time Flow Handoff in Ad Hoc Wireless Networks using Mobility Prediction William Su Mario Gerla Comp Science Dept, UCLA.
Traffic Engineering With Traditional IP Routing Protocols
EE 4272Spring, 2003 Chapter 10 Packet Switching Packet Switching Principles  Switching Techniques  Packet Size  Comparison of Circuit Switching & Packet.
Multiple constraints QoS Routing Given: - a (real time) connection request with specified QoS requirements (e.g., Bdw, Delay, Jitter, packet loss, path.
Data Communications Packet Switching.
ACN: IntServ and DiffServ1 Integrated Service (IntServ) versus Differentiated Service (Diffserv) Information taken from Kurose and Ross textbook “ Computer.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
Chapter 8: Internet Operation Business Data Communications, 5e.
1 Lecture 24: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Sections 8.1 – 8.5)
Graphs and Topology Yao Zhao. Background of Graph A graph is a pair G =(V,E) –Undirected graph and directed graph –Weighted graph and unweighted graph.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
CS335 Networking & Network Administration Tuesday, April 20, 2010.
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
Layer-3 Routing Natawut Nupairoj, Ph.D. Department of Computer Engineering Chulalongkorn University.
SDN: Systemic Risks due to Dynamic Load Balancing Vladimir Marbukh IRTF SDN.
ROUTING ON THE INTERNET COSC Aug-15. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Lecture 2 TCP/IP Protocol Suite Reference: TCP/IP Protocol Suite, 4 th Edition (chapter 2) 1.
Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.
TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.
Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.
Computer Networks with Internet Technology William Stallings
COP 4930 Computer Network Projects Summer C 2004 Prof. Roy B. Levow Lecture 3.
Group 3 Sandeep Chinni Arif Khan Venkat Rajiv. Delay Tolerant Networks Path from source to destination is not present at any single point in time. Combining.
Chapter 8: Internet Operation. Network Classes Class A: Few networks, each with many hosts All addresses begin with binary 0 Class B: Medium networks,
1 Week 5 Lecture 2 IP Layer. 2 Network layer functions transport packet from sending to receiving hosts transport packet from sending to receiving hosts.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
Networking Fundamentals. Basics Network – collection of nodes and links that cooperate for communication Nodes – computer systems –Internal (routers,
Detection of Routing Loops and Analysis of Its Causes Sue Moon Dept. of Computer Science KAIST Joint work with Urs Hengartner, Ashwin Sridharan, Richard.
TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
TELE202 Lecture 6 Routing in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »Packet switching in Wide Area Networks »Source: chapter 10 ¥This Lecture.
Lecture # 03 Switching Course Instructor: Engr. Sana Ziafat.
Symbiotic Routing in Future Data Centers Hussam Abu-Libdeh Paolo Costa Antony Rowstron Greg O’Shea Austin Donnelly MICROSOFT RESEARCH Presented By Deng.
Computer Simulation of Networks ECE/CSC 777: Telecommunications Network Design Fall, 2013, Rudra Dutta.
An Efficient Gigabit Ethernet Switch Model for Large-Scale Simulation Dong (Kevin) Jin.
Internet Measurement and Analysis Vinay Ribeiro Shriram Sarvotham Rolf Riedi Richard Baraniuk Rice University.
Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China
Computer Communication & Networks Lecture # 03 Circuit Switching, Packet Switching Nadeem Majeed Choudhary
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
ROUTING ON THE INTERNET COSC Jun-16. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
Network Processing Systems Design
William Stallings Data and Computer Communications
Congestion Control in Data Networks and Internets
Chapter 8: Internet Operation
Congestion Control in Data Networks and Internets
A Computational Approach to Percolation Theory
Data and Computer Communications
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
pathChirp Efficient Available Bandwidth Estimation
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Presentation transcript:

The Influence of Realism on Congestion in Network Simulations* K. Mills (joint work with C. Dabrowski) NIST December 1, 2015 *For more details see: NIST Technical Note

Total talk is 20 slides Motivation – 6 slides Research Questions and Approach – 2 slides Models – 5 slides Experiment Design – 1 slide Results – 5 slides Findings – 1 slide December 1, 2015NIST TN 19012

Congestion Spreads across Networks in Space and Time Empty 2D Lattice Congestion Persistent Congestion Spreading Congestion Widespread TIME IMPLICATION: SHOULD BE POSSIBLE TO DETECT THE SPREADING PROCESS AND PROVIDE EARLY WARNING OF INCIPIENT CONGESTION COLLAPSE December 1, 2015NIST TN PACKET-INJECTION RATE 2D lattice animation taken from “Percolation Theory Lecture Notes”, Dr. Kim Christensen, Imperial College London, October 9, 2002 Congestion Sporadic

Spreading Processes often Modeled as Percolation Below p c no GCC Above p c GCC forms and grows to include all nodes Percolation  spread of some property in a lattice (or graph) leading to the formation of a giant connected component (GCC), as measured by P ∞, the proportion of nodes encompassed by the GCC p is probability a node has property p c is known as the critical point p < p c  no spread p = p c  percolation phase transition p > p c  spread occurs, and expands with increasing p Near a critical point, the process exhibits signals, typically attributable to increasing, systemic correlation NIST TN 19014December 1, 2015

Academics Model Spreading Network Congestion as a Percolation Process Finding that Signals Appear Near a Critical Point in Abstract Network Models NIST TN 19015December 1, 2015

Penn State Researchers (Sarkar, Mukherjee, Srivastav, and Ray 2009) find increasing transit delay as p > p c = 0.3 Increasing slope in time series of selected measured variables could signal crossing a critical point, allowing network managers to be alerted prior to network collapse Aggregate Avg. Transit Delay (D * ) vs. Network Load ( λ ) Sampled Avg. Transit Delays (D) for Four Network Loads ( λ ) NIST TN 19016December 1, 2015

Boston University Researchers (Rykalova, Levitan, and Browe 2010) find increased correlation in time series of packets in transit as p nears p c = 0.2 # Packets fluctuate between 260 and 380# Packets fluctuate between 18,000 and 34,000 Increasing autocorrelation in time series could signal an approaching critical point, allowing network managers to be warned prior to network collapse NIST TN 19017December 1, 2015

Abstract Models Lack Key Traits of Real Networks 1.Human-engineered, tiered topologies, with propagation 2.Router buffer sizes finite 3.Router speeds varied to meet demands, limit losses 4.Injection from sources and receivers only at lowest tier 5.Distribution of sources and receivers non-uniform 6.Connection of sources/receivers with few varied speeds 7.Duty cycle of sources exhibits cyclic behavior 8.Human sources exhibit limited patience 9.Sources transfer flows of various sizes 10.Flows use the Transmission Control Protocol (TCP) to modulate injection rate based on measured congestion Routers & Links Computers Users Protocols NIST TN 19018December 1, 2015 DOES LACK OF REALISM MATTER WHEN SIMULATATING NETWORK CONGESTION?

Specific Research Questions Does congestion spread in abstract models mirror spread in realistic models? Are some elements of realism essential to capture when modeling network congestion? Are some elements unnecessary? What measures of congestion can be compared, and how, across diverse network models? NIST TN 19019December 1, 2015

Research Approach Abstract Model from Literature Realistic Model from Literature Flexible Network Simulator (FxNS) Basic Model Behaviors Factor Into Realism Elements that can be enabled or disabled Simulate Combinations of Realism Elements and Compare Patterns of Congestion NIST TN December 1, 2015

Models Abstract EGM Model→high abstraction Realistic MesoNet Model→high realism Flexible FxNS Model→combinations of realism from low to high December 1, 2015NIST TN

The Abstract (EGM) Model P. Echenique, J. Gomez-Gardenes, and Y. Moreno, “Dynamics of Jamming Transitions in Complex Networks”, Europhysics Letters, 71, 325 (2005) Simulations based on 11,174-node scale-free graph, P k ~ k -γ & γ=2.2, taken from a 2001 snapshot of the Internet Autonomous System (AS) topology collected by the Oregon Router Server (image courtesy Sandy Ressler) γ = -2.2 NIST TN December 1, 2015

Details of the EGM Model h is a traffic awareness parameter, whose value where i is the index of a node’s neighbor, d i is minimum #hops to destination via neighbor i, and c i is the queue length of i. Node Buffer Size: ∞ for EGM, all packets buffered, no packets dropped Injection Rate: p packets injected at random nodes (uniform) at each time step Destination Node: chose randomly (uniform) for each packet Forwarding Rate: 1 packet per node at each time step Routing Algorithm: If node is destination, remove packet; Otherwise select next-hop as neighboring node i with minimum d i System Response: proportion ρ of injected packets queued in the network Computing d i Measuring ρ h = 1 is shortest path (in hops) A = aggregate number of packets t = time t = measurement interval size p = packet inject rate NIST TN

Comparative Simulation Results p ρ h=1 h=0.85 p ρ EGM Simulations FxNS Simulations with All Realism Elements Disabled NIST TN December 1, 2015

The Realistic (MesoNet) Model K. Mills, E. Schwartz, and J. Yuan, "How to Model a TCP/IP Network using only 20 Parameters", WSC 2010, Dec. 5-8, Baltimore, MD. Comparisons of MesoNet Simulations vs. FxNS Simulations (all realism elements enabled) for eight MesoNet responses are available in NIST TN 1901 – Appendix A NIST TN December 1, 2015 Figure 2.

FxNS Combinations Dependencies among Realism Elements34 Valid FxNS Combinations NIST TN December 1, 2015

Experiment Design FIXED PARAMETERS 218-Router Topology (Fig. 2) Routing (SPF propagation delay) Duration (200,000 ts per p) VARIABLE PARAMETERS Packet-Injection Rate p (up to 2500) FxNS Combination RESPONSES Congestion Spread χ=|G χ |/|G N | Connectivity Breakdown α=|G α |/|G N | Proportion of Packets Delivered π Scaled (0..1) Latency of Delivered Packets δ NIST TN December 1, 2015 Only concepts in common among all 34 combinations: graph and packet

Results 1,2 [1] 136 xy-plots (34 FxNS combinations × 4 responses) are available at: [2] Related FxNS simulation data can be explored interactively using a multidimensional visualization created by Phillip Gough of CSIRO:

Results I – Abstract (C0) vs. Realistic (C127) NIST TN December 1, 2015 Plots for all responses and all 34 combinations available: C0 C127 C0 C127 C0 C127 C0

Results II – Congestion Spread χ All Combinations NIST TN December 1, 2015

Results III – Connectivity Breakdown α All Combinations NIST TN December 1, 2015

Results IV – Packet Delivery π All Combinations NIST TN December 1, 2015

Results V – Scaled Packet Latency δ All Combinations NIST TN December 1, 2015

Findings Congestion spreads differently in abstract and realistic models Hierarchical Router Speeds and TCP very important to model Packet dropping important to model for accurate packet latencies Propagation delay not important to model in a continental US network, but would be important to model in topologies where propagation delays exceed queuing delays Congestion spread, connectivity breakdown and the effectiveness and efficiency of packet delivery can be measured using only two concepts: graphs and packets NIST TN December 1, 2015