A Virtual Circuit Multicast Transport Protocol (VCMTP) for Scientific Data Distribution Jie Li and Malathi Veeraraghavan University of Virginia Steve Emmerson.

Slides:



Advertisements
Similar presentations
Streaming Video over the Internet
Advertisements

Web Server Benchmarking Using the Internet Protocol Traffic and Network Emulator Carey Williamson, Rob Simmonds, Martin Arlitt et al. University of Calgary.
IS333, Ch. 26: TCP Victor Norman Calvin College 1.
BZUPAGES.COM 1 User Datagram Protocol - UDP RFC 768, Protocol 17 Provides unreliable, connectionless on top of IP Minimal overhead, high performance –No.
Scalable On-demand Media Streaming with Packet Loss Recovery Anirban Mahanti Department of Computer Science University of Calgary Calgary, AB T2N 1N4 Canada.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Restricted Slow-Start for TCP William Allcock 1,2, Sanjay Hegde 3 and Rajkumar Kettimuthu 1,2 1 Argonne National Laboratory 2 The University of Chicago.
A Flexible Model for Resource Management in Virtual Private Networks Presenter: Huang, Rigao Kang, Yuefang.
Copyright 1999, S.D. Personick. All Rights Reserved. Telecommunications Networking II Lecture 32 Transmission Control Protocol (TCP) Ref: Tanenbaum pp:
The War Between Mice and Elephants LIANG GUO, IBRAHIM MATTA Computer Science Department Boston University ICNP (International Conference on Network Protocols)
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
ATM Networks An Engineering Approach to Computer Networking.
Data Communication and Networks
Resilient Multicast Support for Continuous-Media Applications X. Xu, A. Myers, H. Zhang and R. Yavatkar CMU and Intel Corp NOSSDAV, 1997.
Copyright © 2005 Department of Computer Science CPSC 641 Winter Tutorial: TCP 101 The Transmission Control Protocol (TCP) is the protocol that sends.
An Active Reliable Multicast Framework for the Grids M. Maimour & C. Pham ICCS 2002, Amsterdam Network Support and Services for Computational Grids Sunday,
ICTCP: Incast Congestion Control for TCP in Data Center Networks∗
Receiver-driven Layered Multicast Paper by- Steven McCanne, Van Jacobson and Martin Vetterli – ACM SIGCOMM 1996 Presented By – Manoj Sivakumar.
SEPT, 2005CSI Part 2.2 Protocols and Protocol Layering Robert Probert, SITE, University of Ottawa.
Network Topologies.
What Can IP Do? Deliver datagrams to hosts – The IP address in a datagram header identify a host IP treats a computer as an endpoint of communication Best.
Midterm Review - Network Layers. Computer 1Computer 2 2.
3: Transport Layer3b-1 Principles of Congestion Control Congestion: r informally: “too many sources sending too much data too fast for network to handle”
Experiences in Design and Implementation of a High Performance Transport Protocol Yunhong Gu, Xinwei Hong, and Robert L. Grossman National Center for Data.
Jaringan Komputer Dasar OSI Transport Layer Aurelio Rahmadian.
High Performance User-Level Sockets over Gigabit Ethernet Pavan Balaji Ohio State University Piyush Shivam Ohio State University.
POSTECH DP&NM Lab. Internet Traffic Monitoring and Analysis: Methods and Applications (1) 2. Network Monitoring Metrics.
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
Computer networks Funded projects (GRA openings) NSF SDCI: 2 years left DOE HNTES: 4 years left (new grant awarded) NSF CC-NIE (new): 3 years NSF SCRP:
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
UDT: UDP based Data Transfer Yunhong Gu & Robert Grossman Laboratory for Advanced Computing University of Illinois at Chicago.
UDT: UDP based Data Transfer Protocol, Results, and Implementation Experiences Yunhong Gu & Robert Grossman Laboratory for Advanced Computing / Univ. of.
On the use of Reliable Multicast for Content Distribution Vassilis Chatzigiannakis
University of the Western Cape Chapter 12: The Transport Layer.
1 Review of NSF OCI EAGER and NSF OCI SDCI projects M. Veeraraghavan University of Virginia Sept. 30, 2011 This work was carried out.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Identifying Application Impacts on Network Design Designing and Supporting.
Copyright 2002, S.D. Personick. All Rights Reserved.1 Telecommunications Networking II Topic 20 Transmission Control Protocol (TCP) Ref: Tanenbaum pp:
1 Review of NSF OCI EAGER and NSF OCI SDCI projects Jie Li, Zhengyang Liu, and Malathi Veeraraghavan University of Virginia {jl3yh, zl4ef,
The Transmission Control Protocol (TCP) Application Services (Telnet, FTP, , WWW) Reliable Stream Transport (TCP) Connectionless Packet Delivery.
Transport Control Protocol (TCP) Features of TCP, packet loss and retransmission, adaptive retransmission, flow control, three way handshake, congestion.
A Measurement Based Memory Performance Evaluation of High Throughput Servers Garba Isa Yau Department of Computer Engineering King Fahd University of Petroleum.
S4-Chapter 3 WAN Design Requirements. WAN Technologies Leased Line –PPP networks –Hub and Spoke Topologies –Backup for other links ISDN –Cost-effective.
Contents Causes and cost of congestion Three examples How to handle congestion End-to-end Network-assisted TCP congestion control ATM ABR congestion control.
HighSpeed TCP for High Bandwidth-Delay Product Networks Raj Kettimuthu.
Björn Landfeldt School of Information Technologies NETS 3303 Networked Systems Multicast.
1 On Dynamic Parallelism Adjustment Mechanism for Data Transfer Protocol GridFTP Takeshi Itou, Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.
QoS provisioning for large, high-rate file transfers Zhenzhen Yan, Malathi Veeraraghavan, Chris Tracy, and Chin Guok University of Virginia and ESnet Apr.
Interconnect simulation. Different levels for Evaluating an architecture Numerical models – Mathematic formulations to obtain performance characteristics.
Lec 17. 4/2/14 Anthony D. Joseph CS162 ©UCB Spring 2014 CS162 S ECTION 8.
Planning and Analyzing Wireless LAN
1 Network Tomography Using Passive End-to-End Measurements Venkata N. Padmanabhan Lili Qiu Helen J. Wang Microsoft Research DIMACS’2002.
Lambda scheduling algorithm for file transfers on high-speed optical circuits Hojun Lee Polytechnic Univ. Hua Li and Edwin Chong Colorado State Univ. Malathi.
1 Traffic Engineering of High-Rate Large-sized Flows Acknowledgment: UVA work is supported by DOE ASCR grants DE-SC and DE-SC , and NSF grants,
Midterm Review Chapter 1: Introduction Chapter 2: Application Layer
1 Transport Layer: Basics Outline Intro to transport UDP Congestion control basics.
1 Advanced Transport Protocol Design Nguyen Multimedia Communications Laboratory March 23, 2005.
79 Sidevõrgud IRT 4060/ IRT 0020 vooruloeng 8 / 3. nov 2004 Vooülekanne Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.
INDIANAUNIVERSITYINDIANAUNIVERSITY Tsunami File Transfer Protocol Presentation by ANML January 2003.
TCP/IP1 Address Resolution Protocol Internet uses IP address to recognize a computer. But IP address needs to be translated to physical address (NIC).
Transmission Control Protocol (TCP) TCP Flow Control and Congestion Control CS 60008: Internet Architecture and Protocols Department of CSE, IIT Kharagpur.
Performance Evaluation of L3 Transport Protocols for IEEE (2 nd round) Richard Rouil, Nada Golmie, and David Griffith National Institute of Standards.
Process-to-Process Delivery:
Internet Networking recitation #9
Network Layer Goals: Overview:
TCP Congestion Control
TCP-LP Distributed Algorithm for Low-Priority Data Transfer
Internet Networking recitation #10
IP Multicast COSC /5/2019.
Computer Networks Protocols
Presentation transcript:

A Virtual Circuit Multicast Transport Protocol (VCMTP) for Scientific Data Distribution Jie Li and Malathi Veeraraghavan University of Virginia Steve Emmerson University Corporation for Atmospheric Research Robert D. Russell University of New Hampshire April 23, This work was supported by the NSF grants OCI and OCI , and DOE grants DE-SC and DESC

I. Case Study of A Scientific Data Distribution Application 2

Background Internet Data Distribution (IDD) Project – Developed by University Corporation for Atmospheric Research (UCAR) – Distributes real-time meteorology data – 10 GB/hour data generation rate – Subscriber base: 170 institutions – Software used for distribution: Local Data Manager (LDM) 3

Question Which of these network services is best suited for IDD data? – IP routed service + unicast TCP (current mechanism) – Static circuits (leased lines) if continuous data flow, is this an option? – Scheduled dynamic circuit service (DCS) if data flow is long-lived, option? – P2P – Multicast 4

To answer this question Per-flow data characteristics insufficient – typical classification: loss-sensitive, high throughput delay-sensitive, low latency Instead, need distribution topology – consider whole network view 5

CONDUIT data Installed and configured the LDM to receive CONDUIT data from UCAR Parsed and analyzed the log files for received data(9 sample days) – Peak throughput: 250 MB/minute (SD: 28.8 MB/minute) – Total size of generated data: ~60 GB/day (SD: 0.3 GB/day) 6

Distribution structure Downloaded and parsed real-time statistics of the CONDUIT feed tree Data Distribution Topology of the CONDUIT feedtype – For the max fan-out of 104 receivers, the peak bandwidth requirement is 104 * 250 MB/minute ≈ 3.5Gbps – This is just for a single feedtype of a single application ParameterNumber # Distinct Hosts163 # Root Hosts22 # Intermediate Hosts35 # Leaf Hosts106 Max. Fan-out Number104* CONDUIT Feed Tree Topology Information * This maximum fan-out number is for the UCAR site (idd.unidata.ucar.edu)

CONDUIT distribution topology 8

Answer to question Different network service types – Static unicast VCs: unsuitable Divide NCAR access link bandwidth between 104 subscribers: if 10 Gbps, then ~10 Mbps per subscriber Subscribers would like to receive the data asap (low rate VC will increase latency) – Dynamic unicast VCs: unsuitable For the worst-case fanout of 104, the total delay will be greater than with IP service, since for each receiver a new circuit needs to be set up, which can only be done after the transfer to the previous receiver is complete and the circuit to that receiver is released. – Multicast: can save bandwidth and computing resource 9

New options: multicast and P2P Multicast – Pros: total delay for distributing the data to the receivers will be lower for a given computing capacity of the upstream servers, or conversely, the same transfer delay can be achieved as with IP-routed service or P2P but with smaller upstream server computing capacity. – Cons: one or more slow receivers can slow down everyone P2P – Pros: scales better with the number of receivers; suitable when files are obtained by different participants at different times – Cons: not suitable for real-time or near real-time delivery (which is a key requirement of IDD) 10

II. VCMTP: Design and Prototyping 11

VCMTP Requirements Goal: Design and implement a reliable and scalable transport protocol for data distribution over high-speed multipoint virtual circuits Requirements – Reliability: error control, flow control – Scalability: support at least hundreds of receivers – High-speed multicast: support Gbps transfers 12

VCMTP Operational Overview 13 A Negative Acknowledgment (NACK) based reliable transport protocol Data blocks transmitted over a multicast network service (can be unreliable) Retransmissions carried over a reliable unicast service (e.g., TCP)

VCMTP Prototyping A user-level library implemented in C++ for Linux OS environment Asynchronous programming model Simultaneous data multicast and retransmission 14 Sending Thread Retransmission Thread 1 Retransmission Thread N Coordinator Thread … VCMTP Sender Process VCMTP Receiver Process 1 Receiving Thread Retransmission Request Thread VCMTP Receiver Process N Receiving Thread Retransmission Request Thread …

Evaluation Metrics for Continuous File Transfers Metric for fast receivers: Throughput – n f : number of fast receivers – m: number of continuously sent files – F i : size of file i – T i,vcmtp : transfer time for file i Metric for slow receivers: Robustness – n s : number of slow receivers – m: number of continuous files – S ij : an indicator variable that is set to 1 if file i was successfully received at receiver j, or 0 otherwise 15

Experimental Evaluation: Throughput 16 Experiments conducted in the Emulab testbed (hosted by Univ. of Utah) 40% slow receivers experienced random packet drops at different rates Rho is the traffic intensity calculated from the average file size (Pareto distribution) and inter- arrival time (exponential distribution); link rate = 100 Mbps Experiment: 500 files; repeat 5 times

Experimental Evaluation: Robustness 17

Key Evaluation Observations Increase in total number of receivers (and hence number of slow receivers) has adverse impact on both robustness and throughput because of resource contention Both robustness and throughput decrease as traffic intensity (Rho) or loss rate increases The sending-side retransmission timeout factor offers a knob for trading off robustness against throughput 18

Summary Multicast VCs are suitable for scientific data distribution applications VCMTP: a reliable multicast transport protocol is designed, prototyped, and evaluated Tradeoff between robustness and throughput for continuous file delivery 19

Thank You! & Questions? 20