VLBI_UDP An application for transferring VLBI data via UDP protocol Simon Casey e-VLBI meeting, Haystack 20 Sep 2006.

Slides:



Advertisements
Similar presentations
24-1 Chapter 24. Congestion Control and Quality of Service (part 1) 23.1 Data Traffic 23.2 Congestion 23.3 Congestion Control 23.4 Two Examples.
Advertisements

Project Partners Project Collaborators The Council for the Central Laboratory of the Research Councils Funded by EPSRC GR/T04465/01
IS333, Ch. 26: TCP Victor Norman Calvin College 1.
TCP Lightweight Agent Project Goal : Implementation of a generic agent that will be able to measure connection parameters between a client and a server.
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.
Lecture 3  A round up of the most important basics I haven’t covered yet.  A round up of some of the (many) things I am missing out of this course (ATM,
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. March 2005, presentation to AVT draft-ietf-dccp-tfrc-voip-01.txt.
JIVE VLBI Network Meeting 15 Jan 2003 R. Hughes-Jones Manchester The EVN-NREN Project Richard Hughes-Jones The University of Manchester.
Transport Layer 3-1 outline r TCP m segment structure m reliable data transfer m flow control m congestion control.
Transport Layer 3-1 Fast Retransmit r time-out period often relatively long: m long delay before resending lost packet r detect lost segments via duplicate.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
A CHAT CLIENT-SERVER MODULE IN JAVA BY MAHTAB M HUSSAIN MAYANK MOHAN ISE 582 FALL 2003 PROJECT.
Transport Layer 3-1 Transport Layer r To learn about transport layer protocols in the Internet: m TCP: connection-oriented protocol m Reliability protocol.
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
Reliable Networking Systems Software Systems Laboratory Presented by : Iliya Golub Galina Sagdeev Supervisor : Yonatan Kaspi.
Medium Start in TCP-Friendly Rate Control Protocol CS 217 Class Project Spring 04 Peter Leong & Michael Welch.
Introduction. 2 What Is SmartFlow? SmartFlow is the first application to test QoS and analyze the performance and behavior of the new breed of policy-based.
1 K. Salah Module 6.1: TCP Flow and Congestion Control Connection establishment & Termination Flow Control Congestion Control QoS.
ESLEA Bits&Bytes, Manchester, 7-8 Dec 2006, R. Hughes-Jones Manchester 1 VLBI & Protocols vlbi_udp Multiple Flow Tests Richard Hughes-Jones The University.
Better Behaved, Better Performing Multimedia Networking Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic Institute Proceedings.
Gursharan Singh Tatla Transport Layer 16-May
CS 218 F 2003 Nov 3 lecture:  Streaming video/audio  Adaptive encoding (eg, layered encoding)  TCP friendliness References: r J. Padhye, V.Firoiu, D.
TCP: flow and congestion control. Flow Control Flow Control is a technique for speed-matching of transmitter and receiver. Flow control ensures that a.
ISO Layer Model Lecture 9 October 16, The Need for Protocols Multiple hardware platforms need to have the ability to communicate. Writing communications.
Lecture 2 TCP/IP Protocol Suite Reference: TCP/IP Protocol Suite, 4 th Edition (chapter 2) 1.
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
NetSim ZigBee Simulation Code Walkthrough in 10 steps
Experiences in Design and Implementation of a High Performance Transport Protocol Yunhong Gu, Xinwei Hong, and Robert L. Grossman National Center for Data.
Packet Analysis Fluke Protocol Expert & Misc Applications Brian D. Sterck.
Final Year Project Presentation by Daire O’Neill 4EE.
Implementing High Speed TCP (aka Sally Floyd’s) Yee-Ting Li & Gareth Fairey 1 st October 2002 DataTAG CERN (Kinda!)
Transport Layer: UDP, TCP
CSE679: Computer Network Review r Review of the uncounted quiz r Computer network review.
High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.
Chapter 5 Peer-to-Peer Protocols and Data Link Layer PART I: Peer-to-Peer Protocols ARQ Protocols and Reliable Data Transfer Flow Control.
2000 년 11 월 20 일 전북대학교 분산처리실험실 TCP Flow Control (nagle’s algorithm) 오 남 호 분산 처리 실험실
Rate Control Rate control tunes the packet sending rate. No more than one packet can be sent during each packet sending period. Additive Increase: Every.
VTP: VDIF Transport Protocol Chris Phillips, Alan Whitney, Mamoru Sekido & Mark Kettenis November 2011.
Introduction VLBI_UDP is an application being developed to transfer VLBI data using the UDP protocol. Initially developed by Richard Hughes- Jones for.
Vertical Optimization Of Data Transmission For Mobile Wireless Terminals MICHAEL METHFESSEL, KAI F. DOMBROWSKI, PETER LANGENDORFER, HORST FRANKENFELDT,
Data Transport Challenges for e-VLBI Julianne S.O. Sansa* * With Arpad Szomoru, Thijs van der Hulst & Mike Garret.
Copyright 2008 Kenneth M. Chipps Ph.D. Controlling Flow Last Update
High bit rate tests between Manchester and JIVE Looking at data rates attainable with UDP along with packet loss and reordering statistics Simon Casey,
What is TCP? Connection-oriented reliable transfer Stream paradigm
1 CS 4396 Computer Networks Lab TCP – Part II. 2 Flow Control Congestion Control Retransmission Timeout TCP:
ECE 4110 – Internetwork Programming
Data Transport Challenges for e-VLBI Julianne S.O. Sansa* * With Arpad Szomoru, Thijs van der Hulst & Mike Garret.
Development of a QoE Model Himadeepa Karlapudi 03/07/03.
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
UDP File Transfer Nathan Kiel CSE434. Goal Explore difficulties of UDP transport in a file transfer application Direct experience by writing an FTP style.
1 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 5 End-to-End Protocols Computer Networks, 5th Edition.
LKr readout and trigger R. Fantechi 3/2/2010. The CARE structure.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
Final EU Review - 24/03/2004 DataTAG is a project funded by the European Commission under contract IST Richard Hughes-Jones The University of.
1 eVLBI Developments at Jodrell Bank Observatory Ralph Spencer, Richard Hughes- Jones, Simon Casey, Paul Burgess, The University of Manchester.
ESLEA VLBI Bits&Bytes Workshop, 31 Aug 2006, R. Hughes-Jones Manchester 1 vlbi_udp Throughput Performance and Stability. Richard Hughes-Jones The 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,
Data delayed Real Time Data Transfer for Very Long Baseline Interferometry Simon Casey, Richard Hughes-Jones, Stephen Kershaw, Ralph Spencer, Matt Strong.
INDIANAUNIVERSITYINDIANAUNIVERSITY Tsunami File Transfer Protocol Presentation by ANML January 2003.
11 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
1 TCP ProtocolsLayer name DNSApplication TCP, UDPTransport IPInternet (Network ) WiFi, Ethernet Link (Physical)
WP18, High-speed data recording Krzysztof Wrona, European XFEL
Chapter 3 outline 3.1 transport-layer services
TCP - Part II Relates to Lab 5. This is an extended module that covers TCP flow control, congestion control, and error control in TCP.
Lecture 19 – TCP Performance
Chapter 5 Peer-to-Peer Protocols and Data Link Layer
VTP: VDIF Transport Protocol
Chapter 5 Peer-to-Peer Protocols and Data Link Layer
Lecture 4 Peer-to-Peer Protocols and Data Link Layer
Presentation transcript:

VLBI_UDP An application for transferring VLBI data via UDP protocol Simon Casey e-VLBI meeting, Haystack 20 Sep 2006

Overview Originally developed by Richard Hughes-Jones Originally developed by Richard Hughes-Jones Sent multiple, continuous memory-memory UDP streams Sent multiple, continuous memory-memory UDP streams Multi-threaded, contained ring buffer Multi-threaded, contained ring buffer Web interface to manage streams & graph throughput Web interface to manage streams & graph throughput Modified to allow disk-disk transfers Modified to allow disk-disk transfers Currently implementing selective packet dropping Currently implementing selective packet dropping

Ring buffer Input thread Ring buffer Send thread Disk Memory Receive thread Output thread Disk Memory UDP Data TCP Control Control thread Vlbi_control vlbi_send vlbi_recv vlbi_udp Flow Diagram

Geant2 Launch event, June 2005

Stability Instability in sending rate when not saturating link Instability in sending rate when not saturating link ~20Mbit/s variation ~20Mbit/s variation Change thread implementation to use sched_yield() Change thread implementation to use sched_yield() Stable to within 1Mbit/s Stable to within 1Mbit/s

Packet loss & correlation Packets are lost - networks (congestion) and/or end-hosts (lack of processing power) Packets are lost - networks (congestion) and/or end-hosts (lack of processing power) Lost packets will have some effect on final correlation Lost packets will have some effect on final correlation Want to measure this effect Want to measure this effect

Goals Determine optimal way to lose packets whilst having least effect on correlation Determine optimal way to lose packets whilst having least effect on correlation Find reasonable loss rate which can be sustained by station units Find reasonable loss rate which can be sustained by station units Implement findings into VLBI_UDP Implement findings into VLBI_UDP Can be used to selectively drop packets if congestion present yet keep correlation running Can be used to selectively drop packets if congestion present yet keep correlation running

Correlation tests at JIVE Run disk2file to create standard linux file Run disk2file to create standard linux file Use VLBI_UDP in disk-disk mode Use VLBI_UDP in disk-disk mode Add extra mode to write to local file instead of sending to network Add extra mode to write to local file instead of sending to network Filter each packet through a dropping function Filter each packet through a dropping function Algorithm can be selected by user and parameters varied Algorithm can be selected by user and parameters varied Place modified data file(s) back on to disk pack Place modified data file(s) back on to disk pack Play back into correlator Play back into correlator

Packet dropping function Pass pointer to valid packet as parameter Pass pointer to valid packet as parameter Function decides if packet will be dropped Function decides if packet will be dropped Returns either original pointer or pointer to some dummy data Returns either original pointer or pointer to some dummy data What dropping algorithms are used? What dropping algorithms are used?

Keeping in sync Station units look for valid headers Station units look for valid headers No header? Work out where next header should be and keep looking No header? Work out where next header should be and keep looking How many missing headers before sync is lost? How many missing headers before sync is lost? Lose only VLBI data, keep headers Lose only VLBI data, keep headers SUs will be happy – only care about headers SUs will be happy – only care about headers Actual correlation will suffer Actual correlation will suffer

Keeping in sync Assume losing every other header acceptable Assume losing every other header acceptable At 256Mbit/s, headers occur every bytes At 256Mbit/s, headers occur every bytes 32 * 2500 byte tracks = 1 'frame' 32 * 2500 byte tracks = 1 'frame' bytes data sandwiched between 384 bytes header and 256 byte footer bytes data sandwiched between 384 bytes header and 256 byte footer ~54 UDP packets/'frame' ~54 UDP packets/'frame' Lose ≤ 1 packet in 56 (1.79%) – will never lose 2 consecutive headers Lose ≤ 1 packet in 56 (1.79%) – will never lose 2 consecutive headers N.B. assumes losses don't occur randomly! N.B. assumes losses don't occur randomly!

Dropping strategies Leave first 2 mins of each run intact Leave first 2 mins of each run intact Use loss rates: Use loss rates: 0.5%; 1%; 1.5%; 1.75%; 2%; 2.25% 0.5%; 1%; 1.5%; 1.75%; 2%; 2.25% Run each rate twice, dropping in series of long bursts or evenly spaced individual packets Run each rate twice, dropping in series of long bursts or evenly spaced individual packets Expect rates 2%, 2.25% sync may be lost, below 2% should stay in sync Expect rates 2%, 2.25% sync may be lost, below 2% should stay in sync Total 12 runs Total 12 runs

Dropping strategies Prepare 13 th file to test SUs... Prepare 13 th file to test SUs... Remove only headers, different loss rate every 2 mins (file 14 mins long) Remove only headers, different loss rate every 2 mins (file 14 mins long)

Preliminary Results Packet losses produced clear effect Packet losses produced clear effect Average amplitude differences for each loss rate Average amplitude differences for each loss rate Linear relationship Linear relationship % Amp decrease = 1.8x % loss rate % Amp decrease = 1.8x % loss rate Header dropping partially successful Header dropping partially successful Dropping every other header, SU LEDs orange but no difference in correlation Dropping every other header, SU LEDs orange but no difference in correlation

Future work Enable VLBI_UDP to communicate with Mk5A Streamstor card Enable VLBI_UDP to communicate with Mk5A Streamstor card Deploy and test within e-VLBI test run Deploy and test within e-VLBI test run