V1.0 - 20050426 Telecommunications Industry AssociationTR-30.3/08-12-018 Lake Buena Vista, FL December 8 - 9, 2008.

Slides:



Advertisements
Similar presentations
Routing Routing in an internetwork is the process of directing the transmission of data across two connected networks. Bridges seem to do this function.
Advertisements

IWSSC 2008 – Oct 3 rd 2008 Raffaello Secchi Scheduling TCP-Friendly Flows over a Satellite Network R. Secchi, A. Sathiaseelan, and G. Fairhurst Electronics.
Technische universiteit eindhoven 1 Problem 16: Design-space Exploration Jeroen Voeten, Bart Theelen Eindhoven University of Technology Embedded Systems.
10/11/2014Anue Systems, Inc. 1 v Telecommunications Industry AssociationTR-30.3/ Lake Buena Vista, FL December.
Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
Telecommunications Industry AssociationTR-30.3/
CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.
International Telecommunication Union Workshop on End-to-End Quality of Service.What is it? How do we get it? Geneva, 1-3 October 2003 Common VoIP Metrics.
PERSISTENT DROPPING: An Efficient Control of Traffic Aggregates Hani JamjoomKang G. Shin Electrical Engineering & Computer Science UNIVERSITY OF MICHIGAN,
“On Designing Improved Controllers for AQM Routers Supporting TCP Flows” The PI Controller Presented by Bob Kinicki.
Internetworking Different networks –Different bit rates –Frame lengths –Protocols.
Controlling High- Bandwidth Flows at the Congested Router Ratul Mahajan, Sally Floyd, David Wetherall AT&T Center for Internet Research at ICSI (ACIRI)
Congestion Pricing Overlaid on Edge-to-Edge Congestion Control Murat Yuksel, Shivkumar Kalyanaraman and Anuj Goel Rensselaer Polytechnic Institute, Troy,
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
Multiple constraints QoS Routing Given: - a (real time) connection request with specified QoS requirements (e.g., Bdw, Delay, Jitter, packet loss, path.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
Katz, Stoica F04 EECS 122: Introduction to Computer Networks Performance Modeling Computer Science Division Department of Electrical Engineering and Computer.
1 Architectural Results in the Optical Router Project Da Chuang, Isaac Keslassy, Nick McKeown High Performance Networking Group
Introduction to Management Information Systems Chapter 5 Data Communications and Internet Technology HTM 304 Fall 07.
And now … Graphs simulation input file parameters 10,000 requests 4 categories of file sizes 1K- 80% frequency 4K – 15% 16K – 4% 64K –1% poisson arrival.
Color Aware Switch algorithm implementation The Computer Communication Lab (236340) Spring 2008.
UCB Improvements in Core-Stateless Fair Queueing (CSFQ) Ling Huang U.C. Berkeley cml.me.berkeley.edu/~hlion.
1 Networking Basics: A Review Carey Williamson iCORE Professor Department of Computer Science University of Calgary.
Copyright Telchemy Inc 2001 Embedded Passive Monitoring of Voice over IP Service Quality Alan Clark Telchemy, Inc Atlanta, GA
Computer Networks Layering and Routing Dina Katabi
1 Performance Evaluation of Ring- based Peer-to-Peer Virtual Private Network (RING-P2P-VPN) Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.
Tiziana FerrariQuality of Service for Remote Control in the High Energy Physics Experiments CHEP, 07 Feb Quality of Service for Remote Control in.
Active Measurement tool for the EuQoS project René Serral-Gracià (Universitat Politècnica de Catalunya)
1 Enabling Large Scale Network Simulation with 100 Million Nodes using Grid Infrastructure Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.
Network Analysis A brief introduction on queues, delays, and tokens Lin Gu, Computer Networking: A Top Down Approach 6 th edition. Jim Kurose.
Time Parallel Simulations II ATM Multiplexers and G/G/1 Queues.
Performance Evaluation of L3 Transport Protocols for IEEE (2 nd round) Richard Rouil, Nada Golmie and David Griffith National Institute of Standards.
Document Number PXE PacketExpert™ - IPLinkSim WAN Link Emulator (PXE200)
Bridging. Bridge Functions To extend size of LANs either geographically or in terms number of users. − Protocols that include collisions can be performed.
Computer Networking. 2 Outline 3 Objectives Understand the state-of-the-art in network protocols, architectures and applications Understand how networking.
Link Scheduling & Queuing COS 461: Computer Networks
Fluid-based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED Vishal Misra Wei-Bo Gong Don Towsley University of Massachusetts,
All Rights Reserved © Alcatel-Lucent | TIA 30.3 Contribution | August 2010 Telecommunications Industry AssociationTR-30.3/ Arlington, VA.
Anue Systems Inc1 v Telecommunications Industry AssociationTR-30.3/ Lake Buena Vista, FL December 8 - 9, 2008.
10/24/2015Anue Systems, Inc. 1 v Telecommunications Industry AssociationTR-30.3/ Lake Buena Vista, FL December.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. August 2005 draft-ietf-dccp-tfrc-voip-02.txt Slides:
1 Modeling and Performance Evaluation of DRED (Dynamic Random Early Detection) using Fluid-Flow Approximation Hideyuki Yamamoto, Hiroyuki Ohsaki Graduate.
Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005.
1 On Scalable Edge-based Flow Control Mechanism for VPN Tunnels --- Part 2: Scalability and Implementation Issues Hiroyuki Ohsaki Graduate School of Information.
1 On Dynamic Parallelism Adjustment Mechanism for Data Transfer Protocol GridFTP Takeshi Itou, Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.
Copyright 1999, S.D. Personick. All Rights Reserved. Telecommunications Networking II Lecture 34 Routing Algorithms Ref: Tanenbaum pp ;
Efficient Cache Structures of IP Routers to Provide Policy-Based Services Graduate School of Engineering Osaka City University
Active Queue Management in Internet and Wireless Networks X. Deng, S. Yi, G. Kesidis and C. R. Das The Pennsylvania State University Stabilized queue size.
Stainov - DataComMET CS TC5353 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Distance Vector Routing (Bellman-Ford, Ford-Fulkenson). It was used.
Network teleology Damon Wischik
CS 740: Advanced Computer Networks IP Lookup and classification Supplemental material 02/05/2007.
An Efficient Gigabit Ethernet Switch Model for Large-Scale Simulation Dong (Kevin) Jin.
Anue Systems Inc1 v Telecommunications Industry AssociationTR-30.3/ Via Teleconference, February 10, 2010.
University of Wollongong AUSTRALIA The Institute for Telecommunications and Information Technology Research (TITR) 1 Call Setup Delay Modelling for Internet.
1 Routing and Resilience in Future Optical Broadband Telecommunications Networks 21 st January 2004 Andrew S. T. Lee Supervisor: Dr. David Harle Broadband.
1 CSE 5346 Spring Network Simulator Project.
Indian Institute of Technology Bombay 1 Abhay Karandikar Associate Professor Department of Electrical Engineering
An Efficient Gigabit Ethernet Switch Model for Large-Scale Simulation Dong (Kevin) Jin.
7/11/0666th IETF1 QoS Enhancements to BGP in Support of Multiple Classes of Service Andreas Terzis Computer Science Department Johns Hopkins University.
1 Sheer volume and dynamic nature of video stresses network resources PIE: A lightweight latency control to address the buffer problem issue Rong Pan,
Network Topology. Network Topology Cont. Sender = 0 and Receiver = 5 Sender = 0 and Receiver = 5 Sender transmits ftp traffic over TCP/IP to receiver.
3/18/2016Anue Systems, Inc. 1 v Telecommunications Industry AssociationTR-30.3/ Arlington, VA July ,
Univ. of TehranIntroduction to Computer Network1 An Introduction to Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.
Introduction to Simulation What is a simulation? A system that represents or emulates the behavior of another system over time; a computer simulation is.
V Telecommunications Industry AssociationTR-30.3/ Lake Buena Vista, FL December 8 - 9, 2008.
Graciela Perera Department of Computer Science and Information Systems Slide 1 of 18 INTRODUCTION NETWORKING CONCEPTS AND ADMINISTRATION CSIS 3723 Graciela.
Inferring Queue Sizes in Access Networks by Active Measurement
Project-2 (20%) – DiffServ and TCP Congestion Control
Congestion Control.
OSPF Protocol.
Presentation transcript:

v Telecommunications Industry AssociationTR-30.3/ Lake Buena Vista, FL December 8 - 9, 2008

Update on new IP network emulation algorithm Alan Clark, Telchemy 10/14/08

Structures system src_model netblock qlink netblock

System init Create system –Establish root for everything, set system params (e.g. time) Create source –Define src type, parameters Create netblock –Define link speeds, max queue sizes for rtl and ltr qlinks Create interconnections –Link netblocks, link sources Start

qlink typedef struct qlink { u32link_speed; u32max_qbytes; emtimemax_qdelay; emtimemax_shared_qdelay; probloss_prob; emtimeqdelay; } qlink_t; Allows maxqsize to be set in terms of delay or bytes (manipulated in terms of delay). Emtime is a localized scaled integer time representation Prob is a scaled integer probability i.e. all integer representation

source typedef struct src_model { u16traffic_type; probp12, p21; u32burst_rate; /*pps*/ u16state; emtimetransition_time_to_burst; emtimeremaining_duration_in_burst; qlink_t*output; src_model_t *prev, *next; } src_model_t; Traffic type = TCP, VoIP, IPTV…. P12, p21 = probabilities associated with transition to/from packet bursts Burst rate = packet burst rate Times = when did burst state, how much time left Output = destination qlink Prev/ next = links to other sources (for maintenance)

Next step Compute delays –Main simulation function