Abstract: Aspects of the present invention provide an approach for providing network intrusion detection and prevention service (NIDPS) capabilities to a microservice in a networked computing environment. In an embodiment, a set of rules for accessing the microservice is retrieved. A NIDPS microservice is created within the environment of the microservice fabric that supports the microservice using the set of rules. The NIDPS microservice is established as a proxy communications destination for communications to the microservice such that communications that are intended for the microservice are instead rerouted to the NIDPS microservice. These communications are filtered by the NIDPS microservice according to the set of rules (e.g., to remove any communications that are determined to be threats).

Abstract: Embodiments of the present invention provide systems and methods for organization of data logging in a networked computing environment. A plurality of logging and monitoring zones, referred to as “logmon” zones are defined. Each zone is associated with one or more policies. The policies specify various parameters such as storage limits, priority, periodicity, and retention time, among others. A networked application operating in a cloud (networked) environment is associated with a zone. The tenant for the application can be billed according to the zone.

Abstract: A method, computer program product, and system includes a processor(s) obtaining historical data related to buffer space usage of a common shared storage resource by a group of journals. The processor(s) monitors each journal over repeating temporal periods and determined a predictability for each journal (i.e., predictable or unpredictable. The processor(s) generates usage statistics for each journal during each monitored period dependent on whether the journal was predictable or unpredictable during the monitored period. For each monitored period, the processor(s) ranks predictable journals by a buffer space requirement for each journal of the predictable journals. Based on the rankings, the processor(s) determined a buffer space requirement for each journal for a current period, where the current period shares temporal qualities with the given monitored period. The processor(s) allocates, for use during the current period, based on the buffer space requirement, buffer space to each journal.

Abstract: A method, computer program product, and system includes a processor(s) obtaining historical data related to buffer space usage of a common shared storage resource by a group of journals. The processor(s) monitors each journal over repeating temporal periods and determined a predictability for each journal (i.e., predictable or unpredictable. The processor(s) generates usage statistics for each journal during each monitored period dependent on whether the journal was predictable or unpredictable during the monitored period. For each monitored period, the processor(s) ranks predictable journals by a buffer space requirement for each journal of the predictable journals. Based on the rankings, the processor(s) determined a buffer space requirement for each journal for a current period, where the current period shares temporal qualities with the given monitored period. The processor(s) allocates, for use during the current period, based on the buffer space requirement, buffer space to each journal.

Abstract: A method, computer program product, and system includes a processor(s) obtaining historical data related to buffer space usage of a common shared storage resource by a group of journals. The processor(s) monitors each journal over repeating temporal periods and determined a predictability for each journal (i.e., predictable or unpredictable. The processor(s) generates usage statics for each journal during each monitored period dependent on whether the journal was predictable or unpredictable during the monitored period. For each monitored period, the processor(s) ranks predictable journals by a buffer space requirement for each journal of the predictable journals. Based on the rankings, the processor(s) determined a buffer space requirement for each journal for a current period, where the current period shares temporal qualities with the given monitored period. The processor(s) allocates, for use during the current period, based on the buffer space requirement, buffer space to each journal.

Abstract: A method, computer program product, and system includes a processor(s) obtaining historical data related to buffer space usage of a common shared storage resource by a group of journals. The processor(s) monitors each journal over repeating temporal periods and determined a predictability for each journal (i.e., predictable or unpredictable. The processor(s) generates usage statistics for each journal during each monitored period dependent on whether the journal was predictable or unpredictable during the monitored period. For each monitored period, the processor(s) ranks predictable journals by a buffer space requirement for each journal of the predictable journals. Based on the rankings, the processor(s) determined a buffer space requirement for each journal for a current period, where the current period shares temporal qualities with the given monitored period. The processor(s) allocates, for use during the current period, based on the buffer space requirement, buffer space to each journal.

Abstract: A method, computer program product, and system includes a processor(s) obtaining historical data related to buffer space usage of a common shared storage resource by a group of journals. The processor(s) monitors each journal over repeating temporal periods and determined a predictability for each journal (i.e., predictable or unpredictable. The processor(s) generates usage statics for each journal during each monitored period dependent on whether the journal was predictable or unpredictable during the monitored period. For each monitored period, the processor(s) ranks predictable journals by a buffer space requirement for each journal of the predictable journals. Based on the rankings, the processor(s) determined a buffer space requirement for each journal for a current period, where the current period shares temporal qualities with the given monitored period. The processor(s) allocates, for use during the current period, based on the buffer space requirement, buffer space to each journal.

Abstract: A method, computer program product, and system includes a processor(s) obtaining historical data related to buffer space usage of a common shared storage resource by a group of journals. The processor(s) monitors each journal over repeating temporal periods and determined a predictability for each journal (i.e., predictable or unpredictable. The processor(s) generates usage statics for each journal during each monitored period dependent on whether the journal was predictable or unpredictable during the monitored period. For each monitored period, the processor(s) ranks predictable journals by a buffer space requirement for each journal of the predictable journals. Based on the rankings, the processor(s) determined a buffer space requirement for each journal for a current period, where the current period shares temporal qualities with the given monitored period. The processor(s) allocates, for use during the current period, based on the buffer space requirement, buffer space to each journal.

Abstract: Aspects of the present invention provide an approach for providing network intrusion detection and prevention service (NIDPS) capabilities to a microservice in a networked computing environment. In an embodiment, a set of rules for accessing the microservice is retrieved. A NIDPS microservice is created within the environment of the microservice fabric that supports the microservice using the set of rules. The NIDPS microservice is established as a proxy communications destination for communications to the microservice such that communications that are intended for the microservice are instead rerouted to the NIDPS microservice. These communications are filtered by the NIDPS microservice according to the set of rules (e.g., to remove any communications that are determined to be threats).

Abstract: Aspects of the present invention provide an approach for providing network intrusion detection and prevention service (NIDPS) capabilities to a microservice in a networked computing environment. In an embodiment, a set of rules for accessing the microservice is retrieved. A NIDPS microservice is created within the environment of the microservice fabric that supports the microservice using the set of rules. The NIDPS microservice is established as a proxy communications destination for communications to the microservice such that communications that are intended for the microservice are instead rerouted to the NIDPS microservice. These communications are filtered by the NIDPS microservice according to the set of rules (e.g., to remove any communications that are determined to be threats).

Abstract: Aspects of the present invention provide an approach for providing network intrusion detection and prevention service (NIDPS) capabilities to a microservice in a networked computing environment. In an embodiment, a set of rules for accessing the microservice is retrieved. A NIDPS microservice is created within the environment of the microservice fabric that supports the microservice using the set of rules. The NIDPS microservice is established as a proxy communications destination for communications to the microservice such that communications that are intended for the microservice are instead rerouted to the NIDPS microservice. These communications are filtered by the NIDPS microservice according to the set of rules (e.g., to remove any communications that are determined to be threats).

Abstract: A method, computer program product, and system includes a processor(s) obtaining historical data related to buffer space usage of a common shared storage resource by a group of j ournals. The processor(s) monitors each journal over repeating temporal periods and determined a predictability for each journal (i.e., predictable or unpredictable. The processor(s) generates usage statics for each journal during each monitored period dependent on whether the journal was predictable or unpredictable during the monitored period. For each monitored period, the processor(s) ranks predictable journals by a buffer space requirement for each journal of the predictable journals. Based on the rankings, the processor(s) determined a buffer space requirement for each journal for a current period, where the current period shares temporal qualities with the given monitored period. The processor(s) allocates, for use during the current period, based on the buffer space requirement, buffer space to each journal.

Abstract: A method, computer program product, and system includes a processor(s) obtaining historical data related to buffer space usage of a common shared storage resource by a group of journals. The processor(s) monitors each journal over repeating temporal periods and determined a predictability for each journal (i.e., predictable or unpredictable. The processor(s) generates usage statics for each journal during each monitored period dependent on whether the journal was predictable or unpredictable during the monitored period. For each monitored period, the processor(s) ranks predictable journals by a buffer space requirement for each journal of the predictable journals. Based on the rankings, the processor(s) determined a buffer space requirement for each journal for a current period, where the current period shares temporal qualities with the given monitored period. The processor(s) allocates, for use during the current period, based on the buffer space requirement, buffer space to each journal.

Abstract: The system, method, and computer program product described herein provide automatic scaling of resources allocated to microservices based on projected demand data received from consumers of the microservices. In an aspect of the present disclosure, a method for scaling up or down a capacity allocated to a microservice is disclosed. The method includes receiving projected demand data for a microservice from a plurality of consumers, aggregating the projected demand data together, calculating a total projected demand for the microservice for a future period of time based on the aggregated projected demand data, and determining, based at least in part on the total projected demand, whether to scale up or scale down a capacity allocated to the microservice for the future period of time.

Abstract: Embodiments of the present invention provide systems and methods for organization of data logging in a networked computing environment. A plurality of logging and monitoring zones, referred to as “logmon” zones are defined. Each zone is associated with one or more policies. The policies specify various parameters such as storage limits, priority, periodicity, and retention time, among others. A networked application operating in a cloud (networked) environment is associated with a zone. The tenant for the application can be billed according to the zone.

Abstract: According to embodiments of the present invention, one or more computer processors publish a resource detail displayed and an associated first usage context, wherein the resource detail is displayed by a dashboard associated with a leader application. The one or more computer processors determine an appropriate graphical representation for a follower application, to display a first resource having a relationship to a second resource, wherein the second resource is displayed in the dashboard associated with the leader application. The one or more computer processors generate a dashboard universal resource locator for the follower application utilizing the resource detail. The one or more computer processors instruct the follower application to update an associated dashboard with information included in the generated dashboard universal resource locator.

Abstract: According to embodiments of the present invention, one or more computer processors publish a resource detail displayed and an associated first usage context, wherein the resource detail is displayed by a dashboard associated with a leader application. The one or more computer processors determine an appropriate graphical representation for a follower application, to display a first resource having a relationship to a second resource, wherein the second resource is displayed in the dashboard associated with the leader application. The one or more computer processors generate a dashboard universal resource locator for the follower application utilizing the resource detail. The one or more computer processors instruct the follower application to update an associated dashboard with information included in the generated dashboard universal resource locator.

Abstract: A first queue stores messages to be consumed. A second queue temporarily stores completely duplicative messages that have message identifiers equal to message identifiers of messages currently being processed s and that have times equal to times of the messages being processed; processing of the completely duplicative messages never occurs. By comparison, a partially duplicative message has its processing delayed until the message of which it is partially duplicative has been finished being processed. A partially duplicative message has a message identifier equal to a message identifier of a message referenced within the non-persistent store and has a time unequal to a time of the message referenced within the non-persistent store is moved from the first to the second queue. A non-persistent store stores references to the messages currently being processed. Once the messages are finished being processed, the references to them are removed from the non-persistent store.

Abstract: A first queue stores messages to be consumed. A second queue temporarily stores completely duplicative messages that have message identifiers equal to message identifiers of messages currently being processed s and that have times equal to times of the messages being processed; processing of the completely duplicative messages never occurs. By comparison, a partially duplicative message has its processing delayed until the message of which it is partially duplicative has been finished being processed. A partially duplicative message has a message identifier equal to a message identifier of a message referenced within the non-persistent store and has a time unequal to a time of the message referenced within the non-persistent store is moved from the first to the second queue. A non-persistent store stores references to the messages currently being processed. Once the messages are finished being processed, the references to them are removed from the non-persistent store.