Patent Grant
12032559
Contemporary data storage systems store data in a storage abstraction referred to as a data stream, or more simply, a stream. A stream is identified with a name, and can store continuous and potentially unbounded data; more particularly, a stream comprises a durable, elastic, append-only, sequence of stored events. New events are added to a tail (front) of a stream. One stream may be divided into one or more segments, with an event appended to a segment based on a routing key associated with the event that determines to which segment the event data is written.
Although a stream is potentially unbounded, storage resources are finite. Thus, to free up storage capacity, older events in a data stream can be deleted from a head (back) of a stream. However, deleting older event data is not straightforward, as some older data can remain more useful than other older data. For example, if a policy is configured to delete older data based on size or age so that the data do not occupy too much storage capacity (e.g., disk space), still useful data can be lost. If instead the policy is configured to delete data based on age, a lot of no longer needed data is retained, whereby a considerable amount of storage capacity needs to be reserved.
The technology described herein is illustrated by way of example and not limited in the accompanying figures in which like reference numerals indicate similar elements and in which:
The technology described herein is generally directed towards automatic time-based data expiration for streaming data storage systems, in which expiration policy can be defined at the event level based on event information, including information within the event data (payload) itself. For example, the data of log events, without adding additional metadata, can contain sufficient information by which one log event can be determined to be unexpired, while another (e.g., subsequent) log event can be determined to be expired. The technology is thus fine-grained with respect to data expiration.
In general, the technology described herein is based on a combination of stream data expiration and stream data compaction. Expiration logic, e.g., a system process, scans older source stream segments, finds stream events in those segments to retain because their expiration period is not over, and copies these unexpired events to new destination segments. The new segments replace the older, scanned segments in the data stream, after which the older segments can be deleted, releasing storage capacity. Events that have expired are deleted because they are not copied to the new destination stream segments. The resultant new replacement segments are (typically) relatively much smaller than the older source stream segments, whereby the total footprint of a data stream is significantly reduced after expiration scanning.
It should be understood that any of the examples herein are non-limiting. As one example, the technology is described using log event data streams, however other use cases for such fine-grained data expiration are numerous, and the technology can be applied to such other use cases. As another example, while virtually any stream-based data storage system may benefit from the technology described herein, one implementation uses a “stream cut object” or simply a “stream cut” that refers to a specific position in the segment of a data stream on an event boundary; expired data is deleted from a stream cut boundary (rather than arbitrarily). Other data stream storage systems can use a similar concept, or can use timestamped data; notwithstanding, as will be understood, the technology described herein can be applied to any stream-based data storage mechanism. Thus, any of the embodiments, aspects, concepts, structures, functionalities or examples described herein are non-limiting, and the technology may be used in various ways that provide benefits and advantages in computing and data storage in general.
Reference throughout this specification to “one embodiment,” “an embodiment,” “one implementation,” “an implementation,” etc. means that a particular feature, structure, or characteristic described in connection with the embodiment/implementation can be included in at least one embodiment/implementation. Thus, the appearances of such a phrase “in one embodiment,” “in an implementation,” etc. in various places throughout this specification are not necessarily all referring to the same embodiment/implementation. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments/implementations.
Aspects of the subject disclosure will now be described more fully hereinafter with reference to the accompanying drawings in which example components, graphs and/or operations are shown. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the various embodiments. However, the subject disclosure may be embodied in many different forms and should not be construed as limited to the examples set forth herein.
In general, an event writer 108 such as a streaming application program sends data writes comprising events 110 into the streaming data storage system 100 via an application programming interface (API) of a client component 112 in one implementation. As described herein, an event of events 110 comprises a routing key and the event data (payload). Also shown in
As described herein, the streaming data storage system 100 can include (or be coupled to) automated programs 116. As described herein, the automated programs 116 can be operated by or incorporated into a controller 118, and can, for example, operate on numerous nodes/distributed segment stores of a node cluster.
As described herein, the streaming data storage system 110 can include (or be coupled to) automated programs 116. As described herein, the automated programs 116 can be operated by or incorporated into a controller 118, and can, for example, operate on numerous nodes/distributed segment stores of a node cluster.
One such automated program, shown as a stream cut generator 120, automatically generates stream cuts for a data stream, such as periodically; (the frequency of automatically generated stream cuts can be specified by an administrator or the like). In general, a stream cut specifies a position in a data stream at an event boundary, and can be associated with a timestamp or the like, e.g., obtained via system time 122; (note that the correct system time 134 can be obtained via use of the Network Time Protocol (NTP)). Each stream cut tracks event boundaries (e.g., position offsets) within each data segment 104(1)-104(n). As described herein, the stream cuts for a stream can be considered a series of stream cuts. In one or more implementations, the stream cuts may be maintained as an auxiliary system stream 124 associated with the segments 104(1)-104(n) of the data stream 106. Note that although not explicitly shown in
Another automated program comprises expiration logic 126, which as described herein scans the segments 104(1)-104(n) of the data stream 106 to locate unexpired events, and copy those unexpired events to new destination segments. The new destination segments replace the original segments. This basically compacts the segments, and can thus significantly reduce the amount of data storage used for storing the retained events.
One type of event that is commonly used with data streams is a log event. A typical log event comprises fields of data such as date&time, cluster.node, component, level, and text. The date&time field contains the creation data and time for a log entry. In a clustered environment, there is also a cluster node (cluster.node) comprising an identifier or the like of the cluster node that initiated logging. Further, a component that initiates logging identifies itself in its log entries, such as the controller 118, the segment store 102, the client component 112 and so forth.
The level field, for a log event, comprises a logging level, such as a numeric value, but alternatively a string, that defines the type of a log event. Although different logging systems may use different levels, most logging systems have levels indicating whether a log event is a Debug, Status, Warning, or Error type of log event, as one non-limiting example. These logging levels can have different expiration policies (periods) associated with the event, such as the following (non-limiting) logging levels:
The main payload of each log event typically contains a human-readable piece of text that a knowledgeable user can evaluate. By way of example, consider that a typical use-case for logs in the field is to facilitate Root-Cause Analysis (RCA) of issues. However, because of stream truncation, it is a common problem that when a service engineer connects to a system to see what was wrong at the moment the issue happened, the service engineer sees that the needed logs have been executed (deleted) in accordance with the log expiration policy, e.g., based on a log rotation policy that ensures that logs do not occupy too much disk space/storage capacity. An existing solution is to block stream truncation based on the longest time of any event, e.g., one month in the above example; however this results in a potentially huge log stream footprint which is undesirable. Creating separate data streams for events with different levels, such as one stream per logging level, is not a practical solution, as doing so implies additional and non-trivial efforts on uniting data from different streams to be presented to a human, and is virtually impossible to guarantee the correct order of events when they have been written to different streams.
The technology described herein uses intelligent log data processing to manage data expiration in (log) streams. To this end, the expiration of a given log entry is based (in part) on its logging level. Thus, unlike existing stream truncation, different types of events, e.g., based on their associated logging levels, can be retained for different expiration periods.
In one implementation, the respective expiration periods associated with the respective logging levels are user configurable (e.g., by an administrator responsible for the data stream or system), which provides a useful tradeoff between how long to keep information versus how much storage capacity is needed. Selective event expiration based on data (a logging level) within each event provides a significant advantage over having to keep a log data stream based on the longest time likely needed for the full set of events, as less storage capacity/disk space is needed via the technology described herein.
The expiration logic technology described herein, which can be implemented as a periodic system process, scans old source stream segments from the data stream head, and basically compacts those segments by copying only the unexpired events to new segments and deleting the old segments. There is no need to scan the stream to its tail, as the expiration logic can stop when it detects events that have to remain because they are within the minimal expiration period set forth for the data stream. In the above log data stream example, the scanning can be stopped when events that were created less than three days ago (based on the smallest expiration period of three days for debug log entries) are detected.
Note that a data stream can be automatically scaled in real time to increase or decrease the number of active segments based on the current event ingestion rate/size. Each such “auto-scaling” change in the number of active segments corresponds to an “epoch.” The set of predecessor segments and the corresponding set of successor segments are tracked for each epoch.
Because stream auto-scaling is for stream data processing in real-time mode, one stream epoch with a fixed number of destination segments is sufficient for expiration-based stream compaction as described herein. The number of destination segments can, for example, be the number of segments with which the data stream was created with, or some other number, such as the number of segments that existed at the head of the data stream before scanning. Note that the expiration logic changes the stream past, whereby the stream-cuts created for the processed part of the stream need to be invalidated/updated. Note further that unlike existing compaction techniques, the technology described herein works with individual events, whereby there is no need for a (typically) large memory buffer for a routing keys' map.
In one implementation, the fine-grained expiration of events as described herein does not need additional per-event metadata, but rather extracts the needed information from the event data of each event. As shown in
In the example log stream, the information the expiration logic 226 uses is already present in the log event entry's data. Namely, the event creation time can be extracted from the log entry's date&time field, and the event expiration period depends on the event's logging level (e.g., one month for an error); the logging level can be extracted from the log entry as well. As for the routing key, the combination of the cluster.node and component fields is sufficient to use as a routing key for log events. The expiration logic 226 can thus extract the needed data from each log event's already existing data fields in this example.
In the example of
In contrast, in the example of
It should be noted that in the log-related examples of
In general, the controller 118 triggers an instance of the expiration logic 326, such as periodically. For example, the expiration logic can maintain its last run time (block 334), and the controller 118 can evaluate this plus the run frequency interval (which can be changed at any time by the administrator 330) versus the current time to determine when to run the logic.
When run, the expiration logic instance 326 can obtain (e.g., via the controller 118) a map 336 of the logging levels-to-expiration times. Obtaining such a map 336 per run can be more efficient than reading the policy 332 directly, and moreover, can prevent a change in the policy from changing the logging levels-to-expiration times in the middle of an expiration run, which can lead to lost events.
More particularly, in a log data stream, a user (administrator) or the like defines in data stream policy what the supported logging levels are (e.g., debug, warn, status, error) and their associated respective expiration times. These are defined outside of the events themselves because a user may choose to adjust the expiration times for each level over the course of time. In other words, per-data stream metadata (maintained by the controller) can be enhanced with a corresponding log level-to-expiration time map 336 that defines the log levels supported. Optionally, the map 336 may also define a default expiration time, in case events are received that do not map to any predefined log level.
Note that in
Turning to
Note that in additional to scanning Tier-2 segments as described herein, it is possible to scan and process a segment's Tier-1 events to maintain only the unexpired Tier-1 events in Tier-1 storage. However, in most practical implementations, the expiration time of any event in the system is greater than the time to move the event to move from Tier-1 storage to Tier-2 storage. Thus, the technology described herein focuses on processing events that have already been written to Tier-2 storage; (the expiration logic can stop when the “tail” of Tier-2 data has been reached, for example).
As shown in
To this end, the metadata of a segment's Tier-1 events can include a segment most recent time 443 comprising a timestamp indicating the numerically highest creation time of any event in the segment. The metadata of a segment's Tier-1 events can also include a logging level dataset 444 comprising a set of distinct logging levels encountered throughout the Tier-1 events in the segment; (the logging levels dataset is expected to be a finite and small set.
Similarly, the metadata 446 of a segment's Tier-2 events can include a per-chunk most recent time 447 comprising a timestamp indicating the numerically highest creation time of any event in that chunk. The metadata of a segment's Tier-2 events can also include a per-chunk logging levels dataset 448 comprising a set of the distinct logging levels encountered throughout a chunk.
Thus, certain system metadata can be associated with each chunk of stream data stored to Tier-2, and that metadata can be leveraged to often avoid having to read at least some of the Tier-2 chunks. This includes the most recent creation time (block 447) among the events within the chunk, and the logging level dataset 448, from which the longest expiration period among the logging levels present in the chunk's events can be ascertained.
When the expiration logic 326 reaches a chunk of stream (segment) data, the expiration logic 326 can calculate the chunk's expiration time as the chunk's most recent creation time plus the chunk's longest expiration period. If this expiration time is already in the past relative to the current time, the expiration logic 326 can safely cast away the entire chunk without individual event scanning, as it is guaranteed that the chunk contains no events to keep. For example, if the expiration logic 326 runs every week and encounters a week-old chunk (based on its most recent time) full of only debug events with the three-day expiration period, the expiration logic does not need to read the chunk contents to know the chunk contains only expired log events, which is significantly more efficient.
As can be understood, the overall efficiency of the expiration technology described herein generally depends on the distribution of expiration periods. In case of log streams, if the vast majority of events normally have low logging levels with short expiration periods, and the expiration logic does not run too often, the expiration logic has relatively little work to do. Namely, in such a scenario the number of events to copy is expected to be small and the major part of chunks can be cast away without scanning of their content.
As represented by operations 508, 510 and 512, which are atomic operations in one implementation, the segment store instance handles the event as follows. At operation 510, the segment store instance appends the event E to the segment Sg. At operations 510 and 512, the segment store also updates the segment's metadata most recent time data structure (S.MostRecentTime:=Max(S.MostRecentTime, E.CreationTime), operation 510) and updates the segment's logging level dataset by unioning the event's logging level with any logging level(s) already in the dataset, (S.LoggingLevels:=S.LoggingLevels∪{E.LogLevel}, operation 512).
As set forth above, older events of a data stream's segments are maintained in Tier-2 storage, and thus are moved from Tier-1 storage to Tier-2 storage (chunks), such as in accordance with a policy setting (e.g., size-based or age based). To take into consideration fine-grained event expiration as described herein, certain operations are performed to make fine-grained event expiration of Tier-2 storage events highly efficient.
At operation 604, the segment store calculates the segment's most recent time as the maximum of the segment's events' creation times, e.g., SE.MostRecentTime:=Max(E.CreationTime) for the events E in the segment's event set SE. At operation 606, the segment store determines the segment logging levels dataset as the union of distinct logging levels of the segment's events, e.g., SE.LoggingLevels:=Distinct_Union(E.LogLevel) for the events E in in the segment event set SE.
When writing the segment event set SE to a data chunk C (operation 608, whether the chunk C already exists or is created as part of this update), the segment store also updates the chunk C's metadata at operations 610 and 612. Operations 608, 610 and 612 can be atomic operations. This metadata updating includes maintaining, via operation 610, the chunk's most recent time as the maximum of the existing most recent time for chunk or the segment's most recent time, e.g., C.MostRecentTime:=Max(C.MostRecentTime, SE.MostRecentTime). This also includes operation 612, which updates the chunk logging level dataset as the union of the chunk logging levels dataset and the segment's logging levels dataset, e.g., C.LoggingLevels:=C.LoggingLevels∪SE.LoggingLevels.
Turning to event expiration as described herein, the expiration logic is generally a service that may coexist with any existing streaming data storage system and/or be run on a processor node. The streaming data storage system needs to determine when the expiration logic needs to run (which can be referred to as the expiration logic run frequency, or alternatively the expiration logic run interval).
The run frequency can be manually defined. For example, as shown in
Operation 704 represents the expiration logic obtaining the logging levels-to-expiration times map, e.g., by querying the controller. Operation 706 represents the expiration logic querying the controller for the set of segments (SgE) that mark the head of the data stream S (that is, the oldest segments). Operation 708 queries the controller for the set of stream cuts SC that overlap the segments in segment set SgE.
For each segment Si in the segment set SgE, (selected via operations 710, 718 and 720), at operation 712 the expiration logic determines the selected segment's expiration time as the selected segment's most recent time plus the maximum logging level expiration time (based on the selected segment's logging levels dataset), that is, calculate Si.ExpirationTime:=Si.MostRecentTime+Max(Si.LoggingLevels.ExpirationTime). Note that the process does not store the logging level expiration time in each segment, as the logging level expiration time can be changed at will by the user, whereby each execution fetches the latest values for those log levels.
Operation 714 evaluates whether the selected segment's expiration time is less than or equal to the current time, and if so, operation 716 deletes the segment without further processing, as the entire selected Tier-2 segment Si is expired. That is, if Si.ExpirationTime<=CurrentTime, delete the selected segment Si and move to operations 718 and 720 to select a next segment until no segments remain to be processed.
If the selected segment Si is not expired the process continues to
Returning to operation 806, it the chunk is not expired, that is, if Ci.ExpirationTime>CurrentTime, the events in the chunk are read and evaluated to determine whether each event expired or unexpired. This part of the process is shown in
To run the expiration logic for the remaining chunks that are part of the currently selected segment Si, which is part of the data stream S, operation 902 creates a new destination chunk corresponding to the currently selected chunk, that is, the currently selected chunk is the “source” chunk (note that the current chunk is already selected, e.g., via operation 812 of
Operation 908 evaluates whether the calculated expiration time of the selected event is greater the current time, and if so, operation 910 appends (copies) the selected event to the counterpart destination chunk, (more formally, if E.ExpirationTime>CurrentTime, append E to Cj′ at chunk offset E.ChunkOffset). Operation 912 adjusts the destination chunk's offset accordingly, E.NewSegmentOffset==Cj′.SegmentOffset+E.ChunkOffset.
Operations 914 and 916 repeat this part of the process for the next event until none remain in the selected chunk. Operations 918 and 920 repeat this part of the process for the next chunk and so on, until no chunks remain to be processed, (or a stopping point is otherwise reached). Note that as set forth above, if it is detected that based on the minimal expiration time no events in the selected chunk can be expired, this can be considered the last chunk for processing with respect to expiration as described herein. Any such chunk and later chunks can be automatically considered “destination” chunks without actually creating such destination chunks or having events copied thereto.
When the chunks' events have finished being evaluated, the expiration process continues to
If the segment set Si is not empty, operation 1008 substitutes the destination Tier-2 segment part Si′ for the currently selected segment Si in data stream S. To this end, operation 1010 sets the predecessor segments of the new destination segment Si′ to the selected segment's predecessor segments, that is, Si′.Predecessors:=Si.Predecessors, and operation 1012 updates the successors of the predecessors to point to the new destination segment Si′ instead of the selected segment Si. Similarly, operation 1014 sets the successors segments of the new destination segment Si′ to the selected segment's successors segments, that is, Si′.Successors:=Si.Successors, and operation 1016 updates the predecessors of the successors to point to the new destination segment Si′ instead of the selected segment Si.
As set forth above, the expiration process described herein needs to consider stream cuts, as generally represented in
In contrast, if at least one segment in the segment set SgE remains (or is replaced), then the stream cuts are considered for each Segment Si in the segment set SgE as selected via operations 1106, 1116 and 1118.
If as evaluated at operation 1108 the selected segment Si is deleted, then operation 1110 replaces the stream cut offset entries in stream cut set for selected segment and successor segments with zeros, that is, replace {Si, Si.Offset} with {Si.Successors, 0} for the Stream Cuts in the stream cut set SC. Note there may be more than one successor segment (if the segment Si was split).
If instead as evaluated at operation 1112 the selected segment Si is truncated, then operation 1114 updates the stream cut offset entries in the stream cut set for the selected segment with the segment's new offset value, that is, update {Si, Si.OldOffset} with {Si, Si.NewStartOffset} for all Stream Cuts in SC. Note that Si.NewStartOffset is known as previously described herein.
Otherwise the selected segment was modified into a new destination segment as described herein, and the process branches to
It should be noted that at least some of the operations of
At operation 1202, the first stream cut in the stream cut set SC is selected as the selected stream cut SCm. Operation 1204 evaluates whether the old offset segment exists in the selected stream cut, that is, whether {Si, E.OldSegmentOffset} exists in SCm. If not, the next stream cut is selected for similar processing, until none remain, via operations 1214 and 1216.
If instead at operation 1204 the old offset segment event exists in the selected stream cut, operation 1206 removes the segment's offset from the selected stream cut, that is, remove {Si, E.OldSegmentOffset} from SCm. Then, the offset is replaced based on whether the corresponding event was copied (operation 1208), that is, if copied operation 1210 inserts the corresponding copied event's offset into the selected stream cut for that selected segment, that is, Insert {Si′, E.NewSegmentOffset} into SCm. If not copied, then the segment length at the point of copied is instead inserted into selected stream cut for that selected segment via operation 1212, that is, Insert {Si′, Si′.Length} into SCm. As can be seen, if not copied, the stream cut is updated to point to a valid event boundary that is as close as possible to where the stream cut originally pointed.
Returning to
With respect to deletion of a segment, it is feasible to delete the currently selected segment Si once it has been fully processed as described herein. Note however that as an option, deletion can be deferred, if, for example, there are active readers that are still reading from the selected segment Si. To not fail such readers, the system can delay deleting the selected segment until such readers are done reading (note that no new readers will read from the selected segment Si because Si is no longer part of the data stream S; those readers can read from a replacement segment Si′ and any subsequent segments). A timeout can be configured to delete Si if its reader is idle for a too long time.
One or more aspects can be embodied in a system, such as represented in
Determining the unexpired stream events can comprise, for a selected log event, determining a log event expiration period based on a log event creation time and a logging level of the selected log event, and, in response to a current time being within the expiration period, determining that the selected log event is an unexpired event.
Determining the unexpired stream events can comprise, for a selected log event, determining a log event expiration period based on a log event creation time and the event payload data of the selected log event, and, in response to a current time being within the expiration period, determining that the selected log event is an unexpired event.
Further operations can comprise updating stream cut data associated with the data stream.
Copying the unexpired log events to the destination segments associated with the data stream can comprise, for a selected log event, determining a selected destination segment based on a routing key extracted from the event payload data of the selected log event. Determining the selected destination segment based on the routing key can comprise generating the routing key based on a cluster node field and a component field in the event payload data of the selected log event.
Part of the source segments can be maintained in a data chunk, and further operations can comprise determining a data chunk expiration time, evaluating the data chunk expiration time relative to a current time, and in response to determining that the data chunk expiration time is prior to the current time, determining that the data chunk contains no unexpired log events, and deleting the chunk as part of deleting the source segments. Determining the data chunk expiration time can comprise obtaining system metadata corresponding to a most recent creation time among log events in the data chunk, and determining a longest expiration period among the log events in the data chunk. Determining the longest expiration period among the log events in the data chunk can comprise maintaining a dataset comprising distinct logging levels of the log events in the chunk.
Further operations can comprise halting the scanning upon reaching a log event that with a log event creation time that is more recent than a predetermined minimal data stream expiration period.
Further operations can comprise waiting, based on a reader of one or more of the source segments, before the deleting the source segments.
One or more example aspects, such as corresponding to example operations of a method, are represented in
Determining the respective expiration periods of the respective log events can comprise obtaining respective creation times and respective logging levels from respective log event data of the respective log events, and wherein the respective logging levels map to expiration data associated with the data stream.
Operations can comprise determining, for a selected log event, a destination segment based on at least one of: a cluster node field in data of the selected log event, or a component field in the data of the selected log event data.
Part of the source segments can be maintained as log events in a data chunk, and further operations can comprise determining a data chunk expiration time, evaluating the data chunk expiration time relative to a current time, and, in response to determining that the data chunk expiration time is prior to the current time, determining that the data chunk contains no unexpired log events, and deleting the chunk as part of deleting the source segments.
Determining the data chunk expiration time can comprise obtaining system metadata corresponding to a most recent creation time of log events in the chunk, and determining a longest expiration period of the log events in the chunk based on evaluating a dataset comprising distinct logging levels of the log events in the chunk, in which respective distinct logging levels map to respective expiration periods associated with the data stream.
Processing the data stream source segment can comprise, for each log event, extracting an event creation time based on an event logging time in the event payload data, and extracting, from the event payload data, a logging level that maps to an expiration period associated with the data stream source segment.
Part of the data stream source segments can be maintained as log events in a data chunk, and further operations can comprise determining a data chunk expiration time based on a most recent creation time among the log events in the chunk and distinct logging levels of the log events in the chunk, evaluating the data chunk expiration time relative to a current time, and, in response to determining that the data chunk expiration time is prior to the current time, determining that the data chunk contains no unexpired log events, and deleting the chunk as part of deleting the data stream source segment.
Further operations can comprise, selecting the data stream destination segment based on the log event payload data.
As can be seen, described herein is a technology that facilitates fine-grained data expiration. The technology is practical, can be relatively lightweight and needs relatively little additional metadata. In some implementations and scenarios, the technology can operate without any additional per-event metadata.
The system 1600 also comprises one or more local component(s) 1620. The local component(s) 1620 can be hardware and/or software (e.g., threads, processes, computing devices). In some embodiments, local component(s) 1620 can comprise an automatic scaling component and/or programs that communicate/use the remote resources 1610 and 1620, etc., connected to a remotely located distributed computing system via communication framework 1640.
One possible communication between a remote component(s) 1610 and a local component(s) 1620 can be in the form of a data packet adapted to be transmitted between two or more computer processes. Another possible communication between a remote component(s) 1610 and a local component(s) 1620 can be in the form of circuit-switched data adapted to be transmitted between two or more computer processes in radio time slots. The system 1600 comprises a communication framework 1640 that can be employed to facilitate communications between the remote component(s) 1610 and the local component(s) 1620, and can comprise an air interface, e.g., Uu interface of a UMTS network, via a long-term evolution (LTE) network, etc. Remote component(s) 1610 can be operably connected to one or more remote data store(s) 1650, such as a hard drive, solid state drive, SIM card, device memory, etc., that can be employed to store information on the remote component(s) 1610 side of communication framework 1640. Similarly, local component(s) 1620 can be operably connected to one or more local data store(s) 1630, that can be employed to store information on the local component(s) 1620 side of communication framework 1640.
In order to provide additional context for various embodiments described herein,
Generally, program modules include routines, programs, components, data structures, etc., that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the methods can be practiced with other computer system configurations, including single-processor or multiprocessor computer systems, minicomputers, mainframe computers, Internet of Things (IoT) devices, distributed computing systems, as well as personal computers, hand-held computing devices, microprocessor-based or programmable consumer electronics, and the like, each of which can be operatively coupled to one or more associated devices.
The illustrated embodiments of the embodiments herein can be also practiced in distributed computing environments where certain tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules can be located in both local and remote memory storage devices.
Computing devices typically include a variety of media, which can include computer-readable storage media, machine-readable storage media, and/or communications media, which two terms are used herein differently from one another as follows. Computer-readable storage media or machine-readable storage media can be any available storage media that can be accessed by the computer and includes both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer-readable storage media or machine-readable storage media can be implemented in connection with any method or technology for storage of information such as computer-readable or machine-readable instructions, program modules, structured data or unstructured data.
Computer-readable storage media can include, but are not limited to, random access memory (RAM), read only memory (ROM), electrically erasable programmable read only memory (EEPROM), flash memory or other memory technology, compact disk read only memory (CD-ROM), digital versatile disk (DVD), Blu-ray disc (BD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, solid state drives or other solid state storage devices, or other tangible and/or non-transitory media which can be used to store desired information. In this regard, the terms “tangible” or “non-transitory” herein as applied to storage, memory or computer-readable media, are to be understood to exclude only propagating transitory signals per se as modifiers and do not relinquish rights to all standard storage, memory or computer-readable media that are not only propagating transitory signals per se.
Computer-readable storage media can be accessed by one or more local or remote computing devices, e.g., via access requests, queries or other data retrieval protocols, for a variety of operations with respect to the information stored by the medium.
Communications media typically embody computer-readable instructions, data structures, program modules or other structured or unstructured data in a data signal such as a modulated data signal, e.g., a carrier wave or other transport mechanism, and includes any information delivery or transport media. The term “modulated data signal” or signals refers to a signal that has one or more of its characteristics set or changed in such a manner as to encode information in one or more signals. By way of example, and not limitation, communication media include wired media, such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media.
With reference again to
The system bus 1708 can be any of several types of bus structure that can further interconnect to a memory bus (with or without a memory controller), a peripheral bus, and a local bus using any of a variety of commercially available bus architectures. The system memory 1706 includes ROM 1710 and RAM 1712. A basic input/output system (BIOS) can be stored in a non-volatile memory such as ROM, erasable programmable read only memory (EPROM), EEPROM, which BIOS contains the basic routines that help to transfer information between elements within the computer 1702, such as during startup. The RAM 1712 can also include a high-speed RAM such as static RAM for caching data.
The computer 1702 further includes an internal hard disk drive (HDD) 1714 (e.g., EIDE, SATA), and can include one or more external storage devices 1716 (e.g., a magnetic floppy disk drive (FDD) 1716, a memory stick or flash drive reader, a memory card reader, etc.). While the internal HDD 1714 is illustrated as located within the computer 1702, the internal HDD 1714 can also be configured for external use in a suitable chassis (not shown). Additionally, while not shown in environment 1700, a solid state drive (SSD) could be used in addition to, or in place of, an HDD 1714.
Other internal or external storage can include at least one other storage device 1720 with storage media 1722 (e.g., a solid state storage device, a nonvolatile memory device, and/or an optical disk drive that can read or write from removable media such as a CD-ROM disc, a DVD, a BD, etc.). The external storage devices 1716 can be facilitated by a network virtual machine. The HDD 1714, external storage device(s) 1716 and storage device (e.g., drive) 1720 can be connected to the system bus 1708 by an HDD interface 1724, an external storage interface 1726 and a drive interface 1728, respectively.
The drives and their associated computer-readable storage media provide nonvolatile storage of data, data structures, computer-executable instructions, and so forth. For the computer 1702, the drives and storage media accommodate the storage of any data in a suitable digital format. Although the description of computer-readable storage media above refers to respective types of storage devices, it should be appreciated by those skilled in the art that other types of storage media which are readable by a computer, whether presently existing or developed in the future, could also be used in the example operating environment, and further, that any such storage media can contain computer-executable instructions for performing the methods described herein.
A number of program modules can be stored in the drives and RAM 1712, including an operating system 1730, one or more application programs 1732, other program modules 1734 and program data 1736. All or portions of the operating system, applications, modules, and/or data can also be cached in the RAM 1712. The systems and methods described herein can be implemented utilizing various commercially available operating systems or combinations of operating systems.
Computer 1702 can optionally comprise emulation technologies. For example, a hypervisor (not shown) or other intermediary can emulate a hardware environment for operating system 1730, and the emulated hardware can optionally be different from the hardware illustrated in
Further, computer 1702 can be enabled with a security module, such as a trusted processing module (TPM). For instance with a TPM, boot components hash next in time boot components, and wait for a match of results to secured values, before loading a next boot component. This process can take place at any layer in the code execution stack of computer 1702, e.g., applied at the application execution level or at the operating system (OS) kernel level, thereby enabling security at any level of code execution.
A user can enter commands and information into the computer 1702 through one or more wired/wireless input devices, e.g., a keyboard 1738, a touch screen 1740, and a pointing device, such as a mouse 1742. Other input devices (not shown) can include a microphone, an infrared (IR) remote control, a radio frequency (RF) remote control, or other remote control, a joystick, a virtual reality controller and/or virtual reality headset, a game pad, a stylus pen, an image input device, e.g., camera(s), a gesture sensor input device, a vision movement sensor input device, an emotion or facial detection device, a biometric input device, e.g., fingerprint or iris scanner, or the like. These and other input devices are often connected to the processing unit 1704 through an input device interface 1744 that can be coupled to the system bus 1708, but can be connected by other interfaces, such as a parallel port, an IEEE 1794 serial port, a game port, a USB port, an IR interface, a BLUETOOTH® interface, etc.
A monitor 1746 or other type of display device can be also connected to the system bus 1708 via an interface, such as a video adapter 1748. In addition to the monitor 1746, a computer typically includes other peripheral output devices (not shown), such as speakers, printers, etc.
The computer 1702 can operate in a networked environment using logical connections via wired and/or wireless communications to one or more remote computers, such as a remote computer(s) 1750. The remote computer(s) 1750 can be a workstation, a server computer, a router, a personal computer, portable computer, microprocessor-based entertainment appliance, a peer device or other common network node, and typically includes many or all of the elements described relative to the computer 1702, although, for purposes of brevity, only a memory/storage device 1752 is illustrated. The logical connections depicted include wired/wireless connectivity to a local area network (LAN) 1754 and/or larger networks, e.g., a wide area network (WAN) 1756. Such LAN and WAN networking environments are commonplace in offices and companies, and facilitate enterprise-wide computer networks, such as intranets, all of which can connect to a global communications network, e.g., the Internet.
When used in a LAN networking environment, the computer 1702 can be connected to the LAN 1754 through a wired and/or wireless communication network interface or adapter 1758. The adapter 1758 can facilitate wired or wireless communication to the LAN 1754, which can also include a wireless access point (AP) disposed thereon for communicating with the adapter 1758 in a wireless mode.
When used in a WAN networking environment, the computer 1702 can include a modem 1760 or can be connected to a communications server on the WAN 1756 via other means for establishing communications over the WAN 1756, such as by way of the Internet. The modem 1760, which can be internal or external and a wired or wireless device, can be connected to the system bus 1708 via the input device interface 1744. In a networked environment, program modules depicted relative to the computer 1702 or portions thereof, can be stored in the remote memory/storage device 1752. It will be appreciated that the network connections shown are examples, and other means of establishing a communications link between the computers can be used.
When used in either a LAN or WAN networking environment, the computer 1702 can access cloud storage systems or other network-based storage systems in addition to, or in place of, external storage devices 1716 as described above. Generally, a connection between the computer 1702 and a cloud storage system can be established over a LAN 1754 or WAN 1756 e.g., by the adapter 1758 or modem 1760, respectively. Upon connecting the computer 1702 to an associated cloud storage system, the external storage interface 1726 can, with the aid of the adapter 1758 and/or modem 1760, manage storage provided by the cloud storage system as it would other types of external storage. For instance, the external storage interface 1726 can be configured to provide access to cloud storage sources as if those sources were physically connected to the computer 1702.
The computer 1702 can be operable to communicate with any wireless devices or entities operatively disposed in wireless communication, e.g., a printer, scanner, desktop and/or portable computer, portable data assistant, communications satellite, any piece of equipment or location associated with a wirelessly detectable tag (e.g., a kiosk, news stand, store shelf, etc.), and telephone. This can include Wireless Fidelity (Wi-Fi) and BLUETOOTH® wireless technologies. Thus, the communication can be a predefined structure as with a conventional network or simply an ad hoc communication between at least two devices.
The above description of illustrated embodiments of the subject disclosure, comprising what is described in the Abstract, is not intended to be exhaustive or to limit the disclosed embodiments to the precise forms disclosed. While specific embodiments and examples are described herein for illustrative purposes, various modifications are possible that are considered within the scope of such embodiments and examples, as those skilled in the relevant art can recognize.
In this regard, while the disclosed subject matter has been described in connection with various embodiments and corresponding Figures, where applicable, it is to be understood that other similar embodiments can be used or modifications and additions can be made to the described embodiments for performing the same, similar, alternative, or substitute function of the disclosed subject matter without deviating therefrom. Therefore, the disclosed subject matter should not be limited to any single embodiment described herein, but rather should be construed in breadth and scope in accordance with the appended claims below.
As it employed in the subject specification, the term “processor” can refer to substantially any computing processing unit or device comprising, but not limited to comprising, single-core processors; single-processors with software multithread execution capability; multi-core processors; multi-core processors with software multithread execution capability; multi-core processors with hardware multithread technology; parallel platforms; and parallel platforms with distributed shared memory. Additionally, a processor can refer to an integrated circuit, an application specific integrated circuit, a digital signal processor, a field programmable gate array, a programmable logic controller, a complex programmable logic device, a discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. Processors can exploit nano-scale architectures such as, but not limited to, molecular and quantum-dot based transistors, switches and gates, in order to optimize space usage or enhance performance of user equipment. A processor may also be implemented as a combination of computing processing units.
As used in this application, the terms “component,” “system,” “platform,” “layer,” “selector,” “interface,” and the like are intended to refer to a computer-related entity or an entity related to an operational apparatus with one or more specific functionalities, wherein the entity can be either hardware, a combination of hardware and software, software, or software in execution. As an example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration and not limitation, both an application running on a server and the server can be a component. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. The components may communicate via local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the Internet with other systems via the signal). As another example, a component can be an apparatus with specific functionality provided by mechanical parts operated by electric or electronic circuitry, which is operated by a software or a firmware application executed by a processor, wherein the processor can be internal or external to the apparatus and executes at least a part of the software or firmware application. As yet another example, a component can be an apparatus that provides specific functionality through electronic components without mechanical parts, the electronic components can comprise a processor therein to execute software or firmware that confers at least in part the functionality of the electronic components.
In addition, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or.” That is, unless specified otherwise, or clear from context, “X employs A or B” is intended to mean any of the natural inclusive permutations. That is, if X employs A; X employs B; or X employs both A and B, then “X employs A or B” is satisfied under any of the foregoing instances.
While the embodiments are susceptible to various modifications and alternative constructions, certain illustrated implementations thereof are shown in the drawings and have been described above in detail. It should be understood, however, that there is no intention to limit the various embodiments to the specific forms disclosed, but on the contrary, the intention is to cover all modifications, alternative constructions, and equivalents falling within the spirit and scope.
In addition to the various implementations described herein, it is to be understood that other similar implementations can be used or modifications and additions can be made to the described implementation(s) for performing the same or equivalent function of the corresponding implementation(s) without deviating therefrom. Still further, multiple processing chips or multiple devices can share the performance of one or more functions described herein, and similarly, storage can be effected across a plurality of devices. Accordingly, the various embodiments are not to be limited to any single implementation, but rather are to be construed in breadth, spirit and scope in accordance with the appended claims.
| Number | Name | Date | Kind |
|---|---|---|---|
| 9298707 | Zhang | Mar 2016 | B1 |
| 9715505 | Mondal | Jul 2017 | B1 |
| 10311042 | Kumar | Jun 2019 | B1 |
| 11249655 | Chen | Feb 2022 | B1 |
| 20180004745 | Finkelstein | Jan 2018 | A1 |
| 20180332325 | Kaitchuck | Nov 2018 | A1 |
| 20200250210 | Busjaeger | Aug 2020 | A1 |
| 20210019255 | Akin | Jan 2021 | A1 |
| 20220197861 | Wang | Jun 2022 | A1 |
| Number | Date | Country | |
|---|---|---|---|
| 20220374417 A1 | Nov 2022 | US |
