Project: Pravega (App Definition and Development / Streaming & Messaging)
File: pravega-concepts.md

<!-- Copyright Pravega Authors. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. --> * * - - - - * * - Pravega is an open source storage system implementing Streams as first-class primitive for storing/serving continuous and unbounded data. Next, we overview the key concepts in Pravega. For a concise definition of key terms of Pravega concepts, pleasesee. Pravega organizes data into Streams.A Stream is a durable, elastic, append-only, unbounded sequence of bytes having good performance and strong consistency. A Pravega Stream is similar to but more flexible than a "topic" in popular message oriented middleware such as or . Pravega Streams are based on an append-only log data structure. By using append-only logs, Pravega rapidly ingests data into durable storage. It supports a large variety of application use cases: Stream processing with frameworks like . Publish/subscribe messaging. NoSQL databases like Time Series Database (TSDB). Workflow engines. Event-oriented applications, etc. When a developer creates a Stream in Pravega, s/he gives the Stream a meaningful name such as "IoTSensorData" or "WebApplicationLog20170330" to inform about the type of data it stores. Moreover, Pravega Stream names are organized within Scopes. A Scope acts as a namespace for Stream names; all Stream names are unique within their Scope. Therefore, a Stream is uniquely identified by the combination of its name and Scope. Developers can also define meaningful Scope names, such as "FactoryMachines" or "HRWebsitelogs", to effectively organize collections of Streams. For example, Scopes can be used to classify Streams by tenant (in a multi tenant environment), by department in an organization or by geographic location. A Stream is unbounded in size Pravega itself does not impose any limits on how many (i.e., bytes) are stored in a Stream. Pravegas design horizontally scales from few machines to a whole datacenters capacity. Pravega Streams are divided into Stream Segments to handle a large volume of data within a Stream. A Stream Segment is a shard, or partition of the data within a Stream. For more information, please see section. Applications, such as a Java program reading from an IoT sensor, write data to the tail (front) of the Stream. Analytics applications, such as a or jobs, can read from any point in the Stream. Many applications can read and write the same Stream in parallel.Elasticity, scalability, support for large volume of Stream data and applications are the highlights of Pravega's design. More information on read and write operations in the Streams will be discussed in the section. Pravega's client API allows applications to write and read data to/from Pravega in the form of Events. An Event is represented as a set of bytes within a Stream.For example, an Event could be as simple as a small number of bytes containing a temperature reading from an IoT sensor composed of a timestamp, a metric identifier and a

An Event could also be a web log data associated with a user click on a website.Applications make sense of Events using standard Java serializers and deserializers, allowing them to read and write objects in Pravega similarly to reading and writing objects from files. Every Event has a Routing Key. A Routing Key isa string used by developers to group similar Events.A Routing Key is often derived from data naturally occurring in the Event, like "customer-id" or "machine-id" or a declared/user-defined string. For example, a Routing Key could be adate (to group Events together by time) or it could be a IoT sensor id (to group Events by machine). A Routing Key is important in defining the read and write semantics that Pravega guarantees. Pravega provides a client library, written in Java, that implements a convenient API for Writer and Reader applications. The Pravega Java Client Library encapsulates the Wire Protocol used to communicate Pravega clients and servers. Writer: An application that creates Events and writes them into a Stream. All data is written by appending to the tail (front) of a Stream. Reader: An application that reads Events from a Stream. Readers can read from any point in the Stream. Many Readers will be reading Events from the tail of the Stream.Tail reads corresponding to recently written Events are immediately delivered to Readers. Some Readers will read from earlier parts of the Stream (called catch-up reads). The application developer has control over the Reader's start position in the Stream. Position: Abstraction that represents where in a Stream a Reader is currently located. The Position object can be used as a recovery mechanismby replacing the failed Reader by a new Reader starting at the last saved successful read Position.Using this pattern of persisting position objects, applications can be built guaranteeing exactly-once Event processing in the presence of Reader failures. Reader Groups: Readers are organized into Reader Groups.A Reader Group is a named collection of Readers, which together perform parallel reads from a given Stream.When a Reader is created through the Pravega data plane API, the developer includes the name of the Reader Group associated with it.Pravega guarantees that each Event published to a Stream is sent to exactly one Reader within the Reader Group. There could be one or more Readers in the Reader Group and there could be many different Reader Groups simultaneously reading from any given Stream. A Reader Group can be considered as a "composite Reader" or "distributed Reader", that allows a distributed application to read and process Stream data in parallel. A large amount of Stream data can be consumed by a coordinated group of Readers in a Reader Group. For example, a collection of Flink tasks processing Stream data in parallel using Reader Group. For more details on the basics of working with Pravega Readers and Writers, please see [Working with Pravega: Basic Reader and Writer](basic-reader-and-writer.md#working-with-pravega-basic-reader-and-writer). A Stream is split into a set of shards or partitions generally referred as Stream Segments. The Stream Segments acts as a container for Events within the Stream. When an Event is written into a Stream, it is stored in one of the Stream Segments based on the Event's Routing Key. Pravega uses consistent hashing to assign Events to Stream Segments.Event Routing Keys are hashed to form a "key

The key space is then divided into a number of partitions, corresponding to the number of Stream Segments. Consistent hashing determines of Events to Stream Segments. Event is written to one of the Stream Segments by the Pravega Client based on the Event Routing Key in the Stream. The Stream Segments are managed by the different Service instances in the Stream. A new connection to a Segment Store is created even when multiple Segments are owned by the same Segment Store. Every Segment being read by the Pravega client maps to a new connection. The number of connections created increases if the user is writing and reading from multiple Streams. The goal of connection pooling is to ensure a common pool of connections between the client process and the Segment Stores, which does not require a linear growth of the number of connections with the number of Segments. A unique feature of Pravega is that the number of parallel Stream Segments in a Stream can automatically grow and shrink over time based on the I/O load it receives. This feature is known as Auto Scaling. Consider the following figure that shows the relationship between Routing Keys and time. A Stream starts at time t0 with a configurable number of Stream Segments.If the rate of data written to the Stream is constant, there will be no change in the number of Stream Segments. At time t1, the system noted an increase in the ingestion rate and splits Stream Segment 1 into two parts. This process is referred as Scale-Up Event. Before t1, Events with a Routing Key that hashes to the upper part of the key space (i.e., values ranging from 200-399) would be placed in Stream Segment 1 and those that hash into the lower part of the key space (i.e., values ranging from 0-199) would be placed in Stream Segment 0. After t1, Stream Segment 1 is split into Stream Segment 2 and Stream Segment 3. The Stream Segment 1 is sealed and stops accepting writes. At this point in time, Events with Routing Key 300andabove are written to Stream Segment 3 and those between 200 and 299 would be written into Stream Segment 2. Stream Segment 0 continues acceptingthesame range of Events as before t1. Another scale-up Event occurs at time t2, as Stream Segment 0s range of Routing Key is split into Stream Segment 5 and Stream Segment 4. Also at this time, Stream Segment 0 is sealed and allows no further writes. Stream Segments covering a contiguous range of the key space can also be merged.At time t3, Stream Segment 2s range and Stream Segment 5s range are merged to Stream Segment 6 to accommodate a decrease in the load on the Stream. When a Stream is created, it is configured with a Scaling Policy that determines how a Stream handles the varying changes in its load. Pravega has three kinds of Scaling Policy: Fixed: The number of Stream Segments does not vary with load. Data-based: Pravega splits a Stream Segment into multiple ones (i.e., Scale-up Event) if the number of bytes per second written to that Stream Segment increases beyond a defined threshold. Similarly, Pravega merges two adjacent Stream Segments (i.e., Scale-down Event) if the number of bytes written to them fall below a defined

Note that, even if the load for a Stream Segment reaches the defined threshold, Pravega does not immediately trigger a Scale-up/down Event. Instead, the load should be satisfying the scaling policy threshold for a . Event-based:Similar to the data-based scaling policy, but it uses number of Events instead of bytes. As mentioned earlier in this section, that an Event is written into one of the Stream Segments. By considering Auto Scaling, Stream Segments performs bucketing of Events based on Routing Key and time.It is obvious that, at any given time, Events published to a Stream with a given value of Routing Key will appear in the same Stream Segment. It is also worth emphasizing that Events are written only on the active Stream Segments.Stream Segments that are sealed do not accept writes.In the figure above, at time now, only Stream Segments 3, 6 and 4 are active and the entire key space is covered between those three Stream Segments. Stream Segments play a major role in understanding the way Reader Groups work. Pravega assigns zero or more Stream Segments to each Reader in a Reader Group. Pravega tries to balances the number of Stream Segments assigned to each Reader. In the figure above, Reader B1 reads from two Stream Segments (Segment 0 and Segment 3), while the other Reader Group (Reader B2, Reader B3) have only only one Stream Segment to read from.Pravega makes sure that each Stream Segment is read exactly by one Reader in any Reader Group configured with that Stream. Irrespective of Readers being added to the Reader Group or removed from the Reader Group due to crash, Pravega reassigns Stream Segments to maintain balance among the Readers. The number of Stream Segments in a Stream determines the upper bound of parallelism of readers within a Reader Group. If there are more Stream Segments, different Reader Groups and many parallel sets of Readers can effectively consume the Stream.In the above figure, Stream 1 has four Stream Segments. The largest effective Reader Group would contain four Readers. Reader Group B in the above figure is not quite optimal. If one more Reader was added to the Reader Group, each Reader would have one Stream Segment to process, thus maximizing read parallelism. However, the number of Readers in the Reader Group increases beyond 4, at least one of the Readers will not be assigned a Stream Segment. If Stream 1 in the figure above experienced a Scale-Down event, by reducing the number of Stream Segments to three, then the Reader Group B will have an ideal number of Readers. The number of Stream Segments change over time by using the Pravega's Auto Scaling feature as we discussed in the section. The size of any Stream is determined by the storage capacity of the Pravega cluster. More Streams can be obtained by increasing the storage of the Pravega cluster. Applications can react to changes in the number of Stream Segments in a Stream by adjusting the number of Readers within a Reader Group to maintain optimal read parallelism.As a cool use case, Pravega may allow Flink to increase or decrease the number of task instances that are processing a Stream in parallel. A Stream comprises a set of Segments that can change over time. Segments that overlap in their area of key space have a defined

An Event written to a Stream is written to a single Stream Segment, and is ordered with respect to the Events of that Stream Segment. The existence and position of an Event within a Stream Segment is strongly consistent. Readers can be assigned multiple parallel Stream Segments (from different parts of key space). A Reader reading from multiple Stream Segments will interleave the Events of the Stream Segments, but the order of Events per Stream Segment is retained. Specifically, if s is a Stream Segment, and s contains two Events i.e., s = {e~1,e~2} where e~1 precedes e~2. Thus, for a Reader reading Stream Segments, it is guaranteed that e~1 will be read before e~2. This results in the following ordering guarantees: Events with the same Routing Key are consumed in the order they were written. Events with different Routing Keys are sent to a specific Stream Segment and will always be read in the same order even if the Reader performs back ups and re-reads. If an Event has been acknowledged to its Writer or has been read by a Reader, it is guaranteed that it will continue to exist in the same location or position for all subsequent reads until it is deleted. If there are multiple Readers reading a Stream and they all back up to any given point, they will never see any reordering with respect to that point. (It will never be the case that an event that they read before the chosen point now comes after or vice versa). Pravega provides the ability for an application to initiate a Checkpoint on a Reader Group. The idea with a Checkpoint is to create a consistent "point in time" persistence of the state of each Reader in the Reader Group, by using a specialized Event (Checkpoint Event) to signal each Reader to preserve its state. Once a Checkpoint has been completed, the application can use the Checkpoint to reset all the Readers in the Reader Group to the known consistent state represented by the Checkpoint. For more details on working with Reader Groups, please see. Pravega supports Transactions. The idea of a Transaction is that a Writer can "batch" up a bunch of Events and commit them as a unit into a Stream. This is useful, for example, in Flink jobs, using Pravega as a sink.The Flink job can continuously produce results for some data processing and use the Transaction to durably accumulate the results of the processing.For example, at the end of some sort of time window, the Flink job can commit the Transaction and therefore make the results of the processing available for downstream processing, or in the case of an error, the Transaction is aborted and the results disappear. A key difference between Pravega's Transactions and similar approaches (Kafka's producer-side batching) vary with the feature durability. Events added to a Transaction are durable when the Event is acknowledged back to the Writer.However, the Events in the Transaction are not visible to Readers until the Transaction is committed by the Writer.A Transaction is similar to a Stream and is associated with multiple Stream Segments. When an Event is published into a Transaction, the Event itself is appended to a Stream Segment of the Transaction. For example, a Stream has five Stream Segments, when a Transaction is created on that Stream, conceptually that Transaction also has five Stream

an Event is published into the Transaction, it is routed and assigned to the same numbered Stream Segment similar to Stream (i.e., Event assigned to Stream Segment 3 in the Stream will be assigned to Segment 3 in the Transaction).Once the Transaction is committed, all the Transaction Segments are automatically appended to their corresponding Stream Segment in the Stream. If the Transaction is aborted, the Transaction, all its Stream Segments and all the Events published into the Transaction are removed from Pravega. Events published into a Transaction are visible to the Reader only after the Transaction is committed. For more details on working with Transactions, please see[Working with Pravega: Transactions](transactions.md). Pravega implements various building blocks to materialize the Stream primitive. One of such building blocks, namely State Synchronizer, is aimed at coordinating processes in a distributed computing environment. Internally, the State Synchronizer uses a Pravega Stream to provide a synchronization mechanism for state shared between multiple processes running in a cluster and making it easier to build distributed applications. With State Synchronizer, an application developer can use Pravega to read and make changes to shared state consistently and perform optimistic locking. State Synchronizer could be used to maintain a single, shared copy of an application's configuration property across all instances of thatapplicationin a cloud. State Synchronizer could also be used to store one piece of data or a map with thousands of different key value pairs. In Pravega, managing the state of Reader Groups and distribution of Readers throughout the network is implemented using State Synchronizer. An application developer creates a State Synchronizer on a Stream similar to the creation of a Writer. The State Synchronizer keeps a local copy of the shared state and allows faster access to the data for the application. State Synchronizer keeps trackof all the changes happening in the shared state and it is responsible for performing any modification to the shared state in the Stream.Eachapplicationinstance uses the State Synchronizer, to remain updated with the changes by pulling updates to the shared state and modifying the local copy of the data. Consistency is maintained through a conditional append style of updates to the shared state through the State Synchronizer, making sure that updates are made only to the most recent version of the shared state. The State Synchronizer can occasionally be "compacted" by compressing and removing older updates, while retaining only the most recent version of the state in the backing Stream. This feature assures the application developers, that the shared state does not grow unchecked. State Synchronizer works effectively when most updates to shared state are small in comparison to the total data size being stored. This can be achieved by allowing them to be written as small deltas. As with any optimistic concurrency system, State Synchronizer is not at its best when many processes attempt for simultaneous updates on the same piece of data. For more details on working with State Synchronizers, please see[Working with Pravega: State Synchronizer](state-synchronizer.md). The following figure depicts the components deployed by Pravega: Pravega is deployed as a distributed system a cluster of servers and storage coordinated to run Pravega called a Pravega cluster. Pravega presents a software-defined storage (SDS) architecture formed by Controller instances (control plane) and Pravega Servers (data

The set of Pravega Servers is collectively known as the Segment Store. The set of Controller instances together forms the control plane of Pravega, providing functionality to create, update and delete Streams. Further, it extends the functionality to retrieveinformation about the Streams,monitor the health of the Pravega cluster, gather metrics, etc. There are usually multiple (recommended at least 3) Controller instances running in a running in a cluster for high availability. The implements the Pravega data plane. Pravega Servers provide the API to read and write data in Streams.Data storage is comprised of two tiers: Tier 1:It provides short term, low-latency data storage,guaranteeing the durability of data written to Streams. Pravega usesto implement Tier 1 Storage. Tier 1 Storage typically runs within the Pravega cluster. Tier 2: It provides long term storage for Stream data. Pravega uses HDFS, Dell EMC's Isilon or Dell EMC's Elastic Cloud Storage (ECS) to implement Tier 2 Storage. Tier 2 Storage is normally deployed outside the Pravega cluster. Storage tiering allows Pravega to achieve a sweet spot in the latency vs throughput trade-off. This makes Pravega an ideal storage substrate for serving data to both real-time and batch (analytics) applications. Moreover, as data in Tier 1 Storage ages, it is automatically moved into Tier 2 Storage. Thus, Pravega can store vasts amounts of Stream data and applications can read it at any time, while being oblivious to its actual location. Pravega uses as the coordination mechanism for the components in the Pravega cluster. Pravega is a distributed storage system providing the Stream primitive first and foremost. Pravega is carefully designed to take advantage of software-defined storage, so that the amount of data stored in Pravega is limited only by the total storage capacity of the data center. Once an Event is written to Pravega, it is durably stored and replicated so it can survive permanent crashes of datacenter nodes. Pravega provides a Java Client Library, for building client-side applications such as analytics applications using Flink.The Pravega Java Client Library manages the interaction between the application code and Pravega via a custom TCP Wire Protocol. The concepts in Pravega are depicted in the following figure: Pravega clients are Writers and Readers.Writers write Events into a Stream.Readers read Events from a Stream. Readers are grouped into Reader Groups to read from a Stream in parallel. The Controller is a server-side component that manages the control plane of Pravega.Streams are created, updated and listed using the Controller API. The Pravega Server is a server-side component that implements reads, writes and other data plane operations. Streams are the fundamental storage primitive in Pravega. Streams contain a set of data elements called Events. Events are appended to the tail of the Stream by Writers. Readers can read Events from anywhere in the Stream. A Stream ispartitioned into a set of Stream Segments. The number of Stream Segments in a Stream can change over time. Events are written into exactly one of the Stream Segments based on Routing Key. For any Reader Group reading a Stream, each Stream Segment is assigned to one Reader in that Reader Group. Each Stream Segment is stored in a combination of Tier 1 and Tier 2 Storage. The tail of the Stream Segment is stored in Tier 1 providing low latency reads and

The rest of the Stream Segment is stored in Tier 2, providing high throughput read access with horizontal scalability and low cost. To deliver an efficient implementation of Streams, Pravega is based on a tiered storage model.Events are persisted in low latency/high IOPS storage(Tier 1 Storage, write-ahead log) and higher throughput Tier 2 storage (e.g., file system, object store). Writers and Readers are oblivious to the tiered storage model from an API perspective. In Pravega, Tier 1 is based on an append-only Log data structure.As Leigh Stewart , there are really three data access mechanisms in a Log: All of the write activity, and much of the read activity happens at the tail of the log.Writes are appended to the log and many clients try to read data immediately as it is written to the log.These two data access mechanisms are dominated by the need for low latency low latency writes by Writers and near real-time access to the published data by Readers. Please note that not all Readers read from the tail of the log. Some Readers read by starting at some arbitrary position in the log.These reads are known as catch-up reads.Access to historical data traditionally was done by batch analytics jobs, often using HDFS and Map/Reduce.However with new streaming applications, we can access historical data as well as current data by just accessing the log. One approach would be to store all the historical data in SSDs similar to tail data operations, but that leads to an expensive task and force customers to economize by deleting historical data. Pravega offers a mechanism that allows customers to use cost-effective, highly-scalable, high-throughput storage for the historical part of the log, that way they wont have to decide on when to delete historical data.Basically, if storage is cheap enough, why not keep all of the history? Tier 1 Storage aids in faster writes to the Streams by assuring durability and makes reading from the tail of a Stream much quicker.Tier 1 Storage is based on the open source Apache BookKeeper Project. Though not essential, we presume that the Tier 1 Storage will be typically implemented on faster SSDs or even non-volatile RAM. Tier 2 Storage provides a highly-scalable, high-throughput cost-effective storage. We expect this Tier 2 to be typically deployed on spinning disks. Pravega asynchronously migrates Events from Tier 1 to Tier 2 to reflect the different access patterns to Stream data. Tier 2 Storage is based on an HDFS model. Pravega allows users to store data in Tier 2 as long as there is storage capacity available. But sometimes, users may not be interested to keep all the historical data related to a Stream. Instead, there are use-cases in which it may be useful to retain just a fraction of a Stream's data. For this reason, Streams can be configured with Retention Policies. Pravega supports the following Retention Policies: Time-based Retention: It allows the developer to control for how long the data is kept in a Stream before it is deleted. The developer can specify the time limit (milliseconds) in the Stream policy, which is ideal for situations like regulatory compliance that mandate certain retention periods. Size-based Retention: Retains the newest subset of a Stream's data that does not exceed the specified size in bytes. Consumption-based Retention: Attempts to retain only unconsumed data in the Stream. For details about retention policies and their working, please refer to .