An End-to-End Approach to Scalable Network Storage Micah Beck, Associate Professor Director, Logistical Computing & Internetworking (LoCI) Lab Terry Moore,

Slides:



Advertisements
Similar presentations
Recent Developments in Logistical Networking Micah Beck, Assoc. Prof. & Director Logistical Computing & Internetworking (LoCI) Lab Computer Science Department.
Advertisements

Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Interprocess Communication CH4. HW: Reading messages: User Agent (the user’s mail reading program) is either a client of the local file server or a client.
Computer Networks20-1 Chapter 20. Network Layer: Internet Protocol 20.1 Internetworking 20.2 IPv IPv6.
Chapter 17 Networking Patricia Roy Manatee Community College, Venice, FL ©2008, Prentice Hall Operating Systems: Internals and Design Principles, 6/E William.
Jaringan Komputer Dasar Network Layer dan IP (1) Aurelio Rahmadian.
Dr. Kalpakis CMSC 621, Advanced Operating Systems. Fall 2003 URL: Distributed System Architectures.
The Internet Protocol.
Internet Backplane Protocol: Storage in the Network James S. Plank, Micah Beck, Wael Elwasif, Terry Moore, Martin Swany, Rich Wolski University of Tennessee.
An End-to-End Approach to Globally Scalable Network Storage Presented in cs294-4 P2P Systems by Sailesh Krishnamurthy 15 October 2003.
Network Layer and Transport Layer.
Scalable Sharing of Network Storage Micah Beck, Research Assoc. Professor Director, Logistical Computing & Internetworking (LoCI) Lab Computer Science.
COS 420 Day 18. Agenda Group Project Discussion Program Requirements Rejected Resubmit by Friday Noon Protocol Definition Due April 12 Assignment 3 Due.
An Overlay Multicast Infrastructure for Live/Stored Video Streaming Visual Communication Laboratory Department of Computer Science National Tsing Hua University.
Networks 1 CS502 Spring 2006 Network Input & Output CS-502 Operating Systems Spring 2006.
Network Architectures Week 3 – OSI and The Internet.
Internetworking Fundamentals (Lecture #2) Andres Rengifo Copyright 2008.
 The Open Systems Interconnection model (OSI model) is a product of the Open Systems Interconnection effort at the International Organization for Standardization.
Lecture 1, 1Spring 2003, COM1337/3501Computer Communication Networks Rajmohan Rajaraman COM1337/3501 Textbook: Computer Networks: A Systems Approach, L.
Switching Techniques Student: Blidaru Catalina Elena.
Chapter 17 Networking Dave Bremer Otago Polytechnic, N.Z. ©2008, Prentice Hall Operating Systems: Internals and Design Principles, 6/E William Stallings.
What is a Protocol A set of definitions and rules defining the method by which data is transferred between two or more entities or systems. The key elements.
Protocol Layering Chapter 10. Looked at: Architectural foundations of internetworking Architectural foundations of internetworking Forwarding of datagrams.
Protocols and the TCP/IP Suite
TCP/IP Yang Wang Professor: M.ANVARI.
CH2 System models.
Networks – Network Architecture Network architecture is specification of design principles (including data formats and procedures) for creating a network.
TCP/IP Essentials A Lab-Based Approach Shivendra Panwar, Shiwen Mao Jeong-dong Ryoo, and Yihan Li Chapter 5 UDP and Its Applications.
Lect1..ppt - 01/06/05 CDA 6505 Network Architecture and Client/Server Computing Lecture 2 Protocols and the TCP/IP Suite by Zornitza Genova Prodanoff.
Fundamentals of Computer Networks ECE 478/578 Lecture #19: Transport Layer Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
1 The Internet and Networked Multimedia. 2 Layering  Internet protocols are designed to work in layers, with each layer building on the facilities provided.
1 CSCI 233 Internet Protocols Class 2 Dave Roberts.
Switching breaks up large collision domains into smaller ones Collision domain is a network segment with two or more devices sharing the same Introduction.
Introduction to Logistical Networking Micah Beck, Assoc. Prof. & Director Logistical Computing & Internetworking (LoCI) Lab APAN Advanced.
Internet Protocol B Bhupendra Ratha, Lecturer School of Library and Information Science Devi Ahilya University, Indore
Chapter 81 Internet Protocol (IP) Our greatest glory is not in never failing, but in rising up every time we fail. - Ralph Waldo Emerson.
Computer Networks with Internet Technology William Stallings
1 Logistical Computing and Internetworking: Middleware for the Use of Storage in Communication Micah Beck Jack Dongarra Terry Moore James Plank University.
Internetworking Internet: A network among networks, or a network of networks Allows accommodation of multiple network technologies Universal Service Routers.
Logistical Networking Micah Beck, Research Assoc. Professor Director, Logistical Computing & Internetworking (LoCI) Lab Computer.
Chapter 15 – Part 2 Networks The Internal Operating System The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
Internetworking Internet: A network among networks, or a network of networks Allows accommodation of multiple network technologies Universal Service Routers.
Logistical Networking as an Advanced Engineering Testbed Micah Beck, Assoc. Prof. & Director Logistical Computing & Internetworking (LoCI) Lab
An Exposed Approach to Reliable Multicast in Heterogeneous Logistical Networks Micah Beck, Assoc. Prof. & Director Logistical Computing & Internetworking.
1 Mobile Management of Network Files Alex BassiMicah Beck Terry Moore Computer Science Department University of Tennessee.
CSC 600 Internetworking with TCP/IP Unit 7: IPv6 (ch. 33) Dr. Cheer-Sun Yang Spring 2001.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
Wide Area Data Sharing with Logistical Networking Micah Beck, Assoc. Prof. & Director Logistical Computing & Internetworking (LoCI) Lab Computer Science.
Chapter 2 Protocols and the TCP/IP Suite 1 Chapter 2 Protocols and the TCP/IP Suite.
An End-to-End Approach to Globally Scalable Programmable Networking Micah Beck, Assoc. Prof. & Director Terry Moore, Assoc. Director James S. Plank, Assoc.
Latency Reduction Techniques for Remote Memory Access in ANEMONE Mark Lewandowski Department of Computer Science Florida State University.
11 CLUSTERING AND AVAILABILITY Chapter 11. Chapter 11: CLUSTERING AND AVAILABILITY2 OVERVIEW  Describe the clustering capabilities of Microsoft Windows.
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
End-to-End Principle Brad Karp UCL Computer Science CS 6007/GC15/GA07 25 th February, 2009.
1 IEX8175 RF Electronics Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.
Challenges in the Next Generation Internet Xin Yuan Department of Computer Science Florida State University
An Architectural Approach to Managing Data in Transit Micah Beck Director & Associate Professor Logistical Computing and Internetworking Lab Computer Science.
09/13/04 CDA 6506 Network Architecture and Client/Server Computing Peer-to-Peer Computing and Content Distribution Networks by Zornitza Genova Prodanoff.
Data Communications and Networks Chapter 6 – IP, UDP and TCP ICT-BVF8.1- Data Communications and Network Trainer: Dr. Abbes Sebihi.
A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their original slides that accompany the.
What is a Protocol A set of definitions and rules defining the method by which data is transferred between two or more entities or systems. The key elements.
Chapter 5 Network and Transport Layers
Transport Protocols Relates to Lab 5. An overview of the transport protocols of the TCP/IP protocol suite. Also, a short discussion of UDP.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Transport Layer Unit 5.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Switching Techniques.
Scheduled Accomplishments
EE 122: Lecture 22 (Overlay Networks)
Transport Protocols Relates to Lab 5. An overview of the transport protocols of the TCP/IP protocol suite. Also, a short discussion of UDP.
Presentation transcript:

An End-to-End Approach to Scalable Network Storage Micah Beck, Associate Professor Director, Logistical Computing & Internetworking (LoCI) Lab Terry Moore, Associate Director James S. Plank, Associate Professor & Director Computer Science Department SIGCOMM 2002, Pittsburgh August 23, 2002

A Generalized Communication Scenario »A quantum of data originates from a node N at time t »and either does or does not arrive at a destination at a node N at time t »and if it does arrive it may be corrupted.

Scenario: Networking »Characteristics N and N can be members of a globally scalable network t-t is a delay we seek in general to minimize fairly »Fits the characteristics of layers 1 through 3 of the Internet stack. »When delivering data in a network, one cannot count on : low delay, high probability of correct delivery

Scenario: Storage »Characteristics N and N are identical or part of a non-scalable network There is no a priori bound on t-t »Fits the characteristics of directly connected or closely coupled storage »When storing data in a closely coupled network, we count on: low delay, high probability of correct delivery

The End-to-End Approach to Networking »No reliance on the timely or accurate delivery of any particular quantum of data »High delay and corruption must only be of sufficiently low probably »Fairness between competing network participants. »This allows a high degree of autonomy and faulty behavior in the operation of the network »Scalability! 12

End-to-End is Unnecessary for Closely Coupled Storage »If a storage device can be relied on to operate with predictable delay high accuracy and high availability »Then it can be used without the burden of implementing layered end-to-end services. »But the assumption of reliability can impose a cost when the assumption fails to hold true and the resource fails.

Scenario: Scalable Network Storage »Characteristics N and N can be members of a globally scalable network There is no a priori bound on t-t »Fits the characteristics of storage accessed over a globally scalable Internet »When storing data in a network, one cannot count on: low delay, high probability of correct delivery

Scalable Network Services Are Like the Network Itself »Intermittently inaccessible »Vulnerable to partition »Prone to corruption in transit »Unpredictable latencies/jitter »End-to-End: Never require a network service to be bigger, better or more complex than wide area access allows

An End-to-End Approach to Storage »No reliance on the timely or accurate delivery of any particular packet »High delay and corruption must only be of sufficiently low probably »Fairness between competing network participants. »This allows a high degree of autonomy and faulty behavior in the operation of the network »Scalability!

Internet Backplane Protocol (IBP) depot NaNa allocate! capability depot NwNw store! depot load! N r data

Allocation Attributes »Duration (  permanent) »Hard vs. Soft »Read/Write semantics: Linear Append (write to end) Linear Truncate (write to start) Circular FIFO (with interlock) Circular Queue (no interlock) »Depots implemented using disk and RAM same API and semantics performance differs

Internet Backplane Protocol (IBP) »Depots (servers) that make allocation of primitive “byte arrays” available to clients »A depot is implemented as a daemon, protocol is RPC over TCP »Byte arrays are not blocks (more abstract) Network capabilities (primitive security) Variable extents »Byte arrays are not files (weaker semantics) Size & duration are limited “Volatile” allocations Best effort reliability and availability No directory structure, accounting No caching, replication

Building on IBP »Many applications assume file semantics Unbounded size & duration High reliability & availability Caching & replication »In a layered architecture, these are implemented through aggregation and additional intelligence at the next level »Resource discovery: Logistical Backbone Directory of depots, active probing Client library

The Network Storage Stack Applications Logistical File System Logistical Tools L-Bone IBP Local Access Physical exNode Our adaption of the network stack architecture for storage Like the IP Stack Each level encapsulates details from the lower levels, while still exposing details to higher levels

ExNode vs inode exNode inode IBP Allocations the network local system disk blocks kernel capabilities block addresses user

IBP-Mail: SMTP attachments by reference »The Problem: How to attach huge files? 1.Store the file on an IBP depot 2.Send capability with the mail message. 3.The receiver gets the file from the depot. »Future work: Asyncrhonous routing

IBP Mail sender receiver SMTP IBP write IBP read IBP copy exNode

Logistical Networking Application Areas »Source routing »Bandwidth adaption »Reducing (BWdelay) »Reliable multicast »Content Distribution »Remote access to structured data »Managing computation state »Temporary storage »Very large data sets »Multimedia »Collaborative computing & visualization

Software & Infrastructure »Tools open source, multiplatform »IBP Depot (server) and C client library »exNode and end-to-end services library »Logistical Backbone server (LDAP-based) »Linux/C is primary development platform Java clients are under development »Command-line utilities, GUI »Public L-Bone deployment Currently 1.6 TB in North America and Europe »

Lbone + exNode + GUI: Download

Logistical Networking is a TCP »Storage is a fundamental element of communication »The end-to-end approach can apply to services other than data transmission »Logistical Networking achieves the benefits of adherence to end-to-end principles: Application autonomy, network transparency Aggressive innovation »Logistical Networking is a Transformative Community Project

Some Further Thoughts (it’s a position paper, after all)

IBP depots vs. IP routers »IBP enables an intermediate node in a scalable network to implement high-performance storage »What about putting storage on IP routers? That other E2E principle tells us not to add functionality to the network in order to serve particular applications Current IP applications have no use for storage at intermediate nodes »This would interfere with the IP fast path in order to support a subset of applications…

… On The Other Hand »IP datagrams are stored, then forwarded »Every router implements substantial RAM buffers »The management of this storage is highly specialized: Limited size allocation (MTU) Fast forwarding (FIFO, fair queuing, pipelining) »This specialization of buffer management supports interactive & near-real time applications »Hypothesis: a requirement of fast forwarding at IP intermediate nodes violates end-to-end

Are We In For a Tussle? »A intermediate node with storage can support an “MTU” the size of its maximum allocation: O(1GB) IPv6 has a 32-bit datagram size field »Low latency forwarding may be incompatible with such a monstrous MTU at intermediate nodes. »A network that abandoned low-latency forwarding as a requirement would be more truly “best effort” and would allow greater autonomy, generality. »Asynchronous applications are important! »Does the need to support interactive applications limit the scalability of the Internet?

Let’s not give up on end-to-end until we’ve really given it a try!