Abstract: The present disclosure provides techniques for configuring and provisioning a tenant for testing microservices in a multi-tenant instance. Code is committed for a modified microservice, and a configuration is received for a production tenant of the multi-tenant instance. The configuration is updated to include a reference to the updated microservice, and then provided to a provisioner that provisions a test tenant based on the configuration. The microservices for the test tenant are compared with versions in a code version management system and updated, then a reference to the test tenant is provided to a developer to test the modified microservice. The test tenant may be deprovisioned after a predetermined amount of time, by a command of the developer, or other automated method.

Abstract: The present disclosure provides techniques for configuring and provisioning a tenant for testing microservices in a multi-tenant instance. Code is committed for a modified microservice, and a configuration is received for a production tenant of the multi-tenant instance. The configuration is updated to include a reference to the updated microservice, and then provided to a provisioner that provisions a test tenant based on the configuration. The microservices for the test tenant are compared with versions in a code version management system and updated, then a reference to the test tenant is provided to a developer to test the modified microservice. The test tenant may be deprovisioned after a predetermined amount of time, by a command of the developer, or other automated method.

Abstract: A computer network appliance may include a memory and a processor cooperating with the memory to run a classification kernel module performing traffic shaping on data packets based upon a first set of queuing disciplines (qdiscs). The processor may further run at least one virtual device also performing traffic shaping on the data packets based upon a second set of qdiscs different than the first set of qdiscs, and provide the data packets to a network interface.

Abstract: A computer network appliance may include a memory and a processor cooperating with the memory to run a classification kernel module performing traffic shaping on data packets based upon a first set of queuing disciplines (qdiscs). The processor may further run at least one virtual device also performing traffic shaping on the data packets based upon a second set of qdiscs different than the first set of qdiscs, and provide the data packets to a network interface.

Abstract: Described herein are approaches for shaping traffic within a data network. In particular, methods and systems herein describe devices configured to classify packets based on particular criteria. Based on a classification associated with a packet, a packet can be queued at a subscriber mux device, one of a plurality of subscriber devices, and an application device. In addition, the subscriber devices and the application device include qdiscs to shape traffic. Once the traffic is shaped, it is queued based on properties associated with packets.

Abstract: Described herein are approaches for shaping traffic within a data network. In particular, methods and systems herein describe devices configured to classify packets based on particular criteria. Based on a classification associated with a packet, a packet can be queued at a subscriber mux device, one of a plurality of subscriber devices, and an application device. In addition, the subscriber devices and the application device include qdiscs to shape traffic. Once the traffic is shaped, it is queued based on properties associated with packets.

Abstract: A computer-implemented method including providing, at a first device, a packet scheduler layer between a network layer and a transport layer; receiving, at the packet scheduler layer, one or more transmission control protocol (TCP) packets from a sending layer on the first device, wherein the sending layer is one of the network layer or the transport layer; smoothing delivery of at least one of the one or more TCP packets by delaying the delivery; and sending the one or more TCP packets to a receiving layer, wherein the receiving layer is one of the network layer or the transport layer that is not the sending layer.

Abstract: A computer-implemented method including providing, at a first device, a packet scheduler layer between a network layer and a transport layer; receiving, at the packet scheduler layer, one or more transmission control protocol (TCP) packets from a sending layer on the first device, wherein the sending layer is one of the network layer or the transport layer; smoothing delivery of at least one of the one or more TCP packets by delaying the delivery; and sending the one or more TCP packets to a receiving layer, wherein the receiving layer is one of the network layer or the transport layer that is not the sending layer.

Abstract: Incremental single and multiprocess checkpointing and restoration is described, which is transparent in that the application program need not be modified, re-compiled, or re-linked to gain the benefits of the invention. The processes subject to checkpointing can be either single or multi-threaded. The method includes incremental page-boundary checkpointing, as well as storage checkpointing of data files associated with applications to ensure correct restoration without the need to restore files for other application programs. Incremental and full checkpoints are asynchronously merged to ensure proper operation while reducing checkpointing delay. By way of example a user-level programming library is described for loading into the address space of the application in conjunction with a loadable kernel module (LKM) or device driver used to capture and restore process state on behalf of the application. These techniques are particularly well suited for use with high-availability (HA) protection programming.

Abstract: Incremental single and multiprocess checkpointing and restoration is described, which is transparent in that the application program need not be modified, re-compiled, or re-linked to gain the benefits of the invention. The processes subject to checkpointing can be either single or multi-threaded. The method includes incremental page-boundary checkpointing, as well as storage checkpointing of data files associated with applications to ensure correct restoration without the need to restore files for other application programs. Incremental and full checkpoints are asynchronously merged to ensure proper operation while reducing checkpointing delay. By way of example a user-level programming library is described for loading into the address space of the application in conjunction with a loadable kernel module (LKM) or device driver used to capture and restore process state on behalf of the application. These techniques are particularly well suited for use with high-availability (HA) protection programming.