Scheduling and transport for file transfers on high-speed optical circuits Authors: M. Veeraraghavan & Xuan Zheng (University of Virginia) Wu Feng (Los.

Slides:



Advertisements
Similar presentations
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Advertisements

Appropriateness of Transport Mechanisms in Data Grid Middleware Rajkumar Kettimuthu 1,3, Sanjay Hegde 1,2, William Allcock 1, John Bresnahan 1 1 Mathematics.
Review of Topology and Access Techniques / Switching Concepts BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013.
Switching Technology presented by Hussain Ahmad BA-Abdullah. Fawaz abdullah AL-Amri. prof : Adel Ali.
Assume that a file is transferred from a node A to a node B. The file has been fragmented in 5 frames. Frame 0 is corrupted, the ACK of frame 1 is corrupted,
Jaringan Komputer Lanjut Packet Switching Network.
Principles of Congestion Control Chapter 3.6 Computer Networking: A top-down approach.
Camarillo / Schulzrinne / Kantola November 26th, 2001 SIP over SCTP performance analysis
Transmission Control Protocol (TCP)
Traffic Shaping Why traffic shaping? Isochronous shaping
Review of Topology and Access Techniques / Switching Concepts BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013.
Enabling New Applications with Optical Circuit-Switched Networks Xuan Zheng April 27, 2004.
Secure Data Communication in Mobile Ad Hoc Networks Authors: Panagiotis Papadimitratos and Zygmunt J Haas Presented by Sarah Casey Authors: Panagiotis.
High-performance bulk data transfers with TCP Matei Ripeanu University of Chicago.
1 Chapter 3 Transport Layer. 2 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4.
1 Link Layer & Network Layer Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden Prof. Dina Katabi.
Department of Electronic Engineering City University of Hong Kong EE3900 Computer Networks Transport Protocols Slide 1 Transport Protocols.
Performance and Robustness Testing of Explicit-Rate ABR Flow Control Schemes Milan Zoranovic Carey Williamson October 26, 1999.
1 Scheduling calls with known holding times Reinette Grobler * Prof. M. Veeraraghavan University of Pretoria Polytechnic University
Switching Techniques Student: Blidaru Catalina Elena.
Data Communications and Networking
Protocols and the TCP/IP Suite Chapter 4. Multilayer communication. A series of layers, each built upon the one below it. The purpose of each layer is.
Process-to-Process Delivery:
Lect3..ppt - 09/12/04 CIS 4100 Systems Performance and Evaluation Lecture 3 by Zornitza Genova Prodanoff.
Data Transfer Case Study: TCP  Go-back N ARQ  32-bit sequence # indicates byte number in stream  transfers a byte stream, not fixed size user blocks.
CIS 725 Wireless networks. Low bandwidth High error rates.
ISO Layer Model Lecture 9 October 16, The Need for Protocols Multiple hardware platforms need to have the ability to communicate. Writing communications.
3: Transport Layer3b-1 Principles of Congestion Control Congestion: r informally: “too many sources sending too much data too fast for network to handle”
1 Scheduling file transfers on a circuit- switched network Student: Hojun Lee Advisor: Professor M. Veeraraghavan Committee: Professor E. K. P. Chong.
1 Semester 2 Module 10 Intermediate TCP/IP Yuda college of business James Chen
Experiences in Design and Implementation of a High Performance Transport Protocol Yunhong Gu, Xinwei Hong, and Robert L. Grossman National Center for Data.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
TCP/IP Essentials A Lab-Based Approach Shivendra Panwar, Shiwen Mao Jeong-dong Ryoo, and Yihan Li Chapter 5 UDP and Its Applications.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
ECEN “Internet Protocols and Modeling” Course Materials: Papers, Reference Texts: Bertsekas/Gallager, Stuber, Stallings, etc Grading (Tentative):
Fundamentals of Computer Networks ECE 478/578 Lecture #19: Transport Layer Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
TCP1 Transmission Control Protocol (TCP). TCP2 Outline Transmission Control Protocol.
Circuit & Packet Switching. ► Two ways of achieving the same goal. ► The transfer of data across networks. ► Both methods have advantages and disadvantages.
Switching breaks up large collision domains into smaller ones Collision domain is a network segment with two or more devices sharing the same Introduction.
The Transmission Control Protocol (TCP) Application Services (Telnet, FTP, , WWW) Reliable Stream Transport (TCP) Connectionless Packet Delivery.
Presented by Rajan Includes slides presented by Andrew Sprouse, Northeastern University CISC 856 TCP/IP and Upper Layer Protocols Date:May 03, 2011.
Congestion Control in CSMA-Based Networks with Inconsistent Channel State V. Gambiroza and E. Knightly Rice Networks Group
HighSpeed TCP for High Bandwidth-Delay Product Networks Raj Kettimuthu.
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
Analysis of TCP Latency over Wireless Links Supporting FEC/ARQ-SR for Error Recovery Raja Abdelmoumen, Mohammad Malli, Chadi Barakat PLANETE group, INRIA.
Chapter 24 Transport Control Protocol (TCP) Layer 4 protocol Responsible for reliable end-to-end transmission Provides illusion of reliable network to.
Deadline-based Resource Management for Information- Centric Networks Somaya Arianfar, Pasi Sarolahti, Jörg Ott Aalto University, Department of Communications.
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.
Lambda scheduling algorithm for file transfers on high-speed optical circuits Hojun Lee Polytechnic Univ. Hua Li and Edwin Chong Colorado State Univ. Malathi.
An SSCOP-based Link Layer Protocol for Wireless LANs Haoli Wang and Aravind Velayutham IEEE Global Telecommunications Conference 1-5 December, 2003 San.
5. The Transport Layer 5.1 Role of Transport Layer It bridge the gab between applications and the network layer. Provides reliable cost-effective data.
Protocol Layering Chapter 11.
Chapter 11.4 END-TO-END ISSUES. Optical Internet Optical technology Protocol translates availability of gigabit bandwidth in user-perceived QoS.
LECTURE 12 NET301 11/19/2015Lect NETWORK PERFORMANCE measures of service quality of a telecommunications product as seen by the customer Can.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
McGraw-Hill Chapter 23 Process-to-Process Delivery: UDP, TCP Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Reliable Adaptive Lightweight Multicast Protocol Ken Tang, Scalable Network Technologies Katia Obraczka, UC Santa Cruz Sung-Ju Lee, Hewlett-Packard Laboratories.
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Data Link Layer Part II – Sliding Window Protocols.
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
COMP 431 Internet Services & Protocols
Understand the OSI Model Part 2
Transport Protocols over Circuits/VCs
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Congestion Control, Internet transport protocols: udp
Process-to-Process Delivery:
Transport protocols Outline: Xuan Zheng Univ. of Virginia
Switching Techniques.
Network Performance Definitions
Chapter 5 Peer-to-Peer Protocols and Data Link Layer
Process-to-Process Delivery: UDP, TCP
Presentation transcript:

Scheduling and transport for file transfers on high-speed optical circuits Authors: M. Veeraraghavan & Xuan Zheng (University of Virginia) Wu Feng (Los Alamos National Lab) Hojun Lee (Polytechnic University) Edwin Chong & Hua Li (Colorado State University)

2 Outline  Problem statement  Varying-Bandwidth List Scheduling (VBLS)  Varying-Bandwidth Transport Protocol (VBTP)  Conclusions and future work

3 Drawback of using circuits for file transfers PS: Packet switch CS: Circuit switch Fixed bandwidth scheme Capacity C PS N 2 3 Each transfer is allocated C/N capacity N The lone remaining transfer enjoys full capacity C Capacity C CS N 2 3 Each transfer is allocated C/N capacity N The lone remaining transfer continues with capacity allocation C/N

4 VBLS: A Lambda-Scheduling Algorithm for File Transfers  End host applications request lambdas for file transfers by specifying a three-tuple : file size : a maximum bandwidth limit for the request : the desired start time for the transfer  The scheduler assigns a Time-Range-Capacity (TRC) vector for each transfer : the start of the k th time range : the end of the k th time range : the capacity allocated for the transfer in the k th time range.

5 VBLS: an example Assume the available capacity of a 4-channel link is as shown below F: 5GB Rmax: 2 channels Treq: 50 Per-channel rate: 10Gbps Time unit: 100ms In 10 time units can transfer 1.25GB TRC allocated: (50, 60, 1) (60, 70, 2) (70, 75, 2) Available capacity

6 VBLS: Simulation comparison of VBLS against FBLS and PS  Normalized delay ( D )  System load (  )

7 Discussion  Advantages of VBLS  Achieves close to idealized PS (infinite buffer) performance  Disadvantages of VBLS  Complexity: reprogram switches multiple times within one file transfer time  Currently not for heterogeneous traffic  Apriori knowledge of “ available bandwidth ”  run-time discovery of optimal sending rates not needed as with TCP enhancements

8 VBTP: overview  Flow control: rate based scheme  easier said than done!  indeed rate available through the network is not an issue – it remains constant  but, sending and receiving hosts are general- purpose hosts with generic OSs that schedule not only networking tasks but other tasks as well  Error control: selective-ARQ scheme  Congestion control: not required during the data transfer

9 VBTP: flow control  The problem with rate-based flow control (ideal rate?):  Play it safe and set a low rate: avoid/eliminate receive-buffer losses  Or send data at higher rates but have to recover from losses  Experiments with SABUL implementation (MTU=1500B, UDP buffer size=256KB, SABUL data block size=7.34MB)

10 VBTP: error control  Selective ARQ to recover from losses due to link errors and receive-buffer overflows  Will negative ACKs suffice since circuits offer in- sequence delivery?  No if disk access rates are low - performance better if a retransmission buffer is used  Implication: Need positive ACKs to keep removing data from retransmission buffer  Be utilization obssessed:  Drop circuits immediately after completion of transfer  Implication: Errors identified after the last block is sent are handled by retx. on TCP/IP path (CHEETAH paper from last PFLDN workshop)

11 VBTP: VBLS-induced effects  TRC allocation should be determined not just for the initial file transfer but also for retransmissions  Errors from receive-buffer overflows should be allowed to achieve high rates (Solution: F+  )  The sender may not be able to send the data at exactly the rates specified in the TRC vector  Due to OS scheduler at end hosts not “ honoring ” application-set data rate at which blocks are passed to the Ethernet driver for transmission

12 Conclusions and future work  VBTP overcomes a well-known drawback of using circuits for file transfers in which with a fixed-bandwidth allocation mode fails to allow users to take advantage of bandwidth that becomes available subsequent to the start of a transfer  Simulations showed that VBLS can improve performance over fixed- bandwidth schemes significantly for file transfers  The transport protocol that works in conjunction with VBLS should be a rate based, flow-control scheme along with a selective-ARQ based, error-control scheme  Future work: to include a second class of user requests for lambdas, specifically targeted at interactive applications such as remote visualization and simulation steering