Abstract: This document describes techniques for storing virtual disk payload data. In an exemplary configuration, each virtual disk extent can be associated with state information that indicates whether the virtual disk extent is described by a virtual disk file. Under certain conditions the space used to describe a virtual disk extent can be reclaimed and state information can be used to determine how read and/or write operations directed to the virtual disk extent are handled. In addition to the foregoing, other techniques are described in the claims, figures, and detailed description of this document.

Abstract: Data is identified that defines a known good state for a current operating system. The identified data includes read-only sets that are not updated during operation of the computing device, and modifiable sets that can be updated during operation of the computing device. The read-only sets are captured on an opportunistic basis and the modifiable sets are captured when the computing device is to be rebooted. A first and second virtual disk are allocated as snapshots of the identified data. The first virtual disk is updated to generate an updated state. The updates to the first virtual disk are isolated from the second virtual disk. The second virtual disk is maintained as an immutable snapshot of the identified data. In response to a failed reboot with the updated state, the computing device reverts to the known good state using the snapshot of the identified data.

Abstract: This document describes techniques for storing virtual disk payload data. In an exemplary configuration, each virtual disk extent can be associated with state information that indicates whether the virtual disk extent is described by a virtual disk file. Under certain conditions the space used to describe a virtual disk extent can be reclaimed and state information can be used to determine how read and/or write operations directed to the virtual disk extent are handled. In addition to the foregoing, other techniques are described in the claims, figures, and detailed description of this document.

Abstract: GTP firewall service to block or allow GTP-C v1 messages from specific SGSN/GGSN and GTP-C v2 messages from specific SGW/PGW to prevent fraudulent activity occurring from any specific serving node or home node. GTP Traffic from specific SGSN (3G) or SGW (4G) can be blocked going to specific home operator, including 3G GSM to 4G LTE and 4G LTE to 3G GSM protocol interoperability provided by GTP Firewall. Individual Information Elements within GTP-C v1 and GTP-C v2 messages will be monitored based on home and serve operator configuration as well as GTP messages and Information Elements mapped from GTP-C v1 to GTP-C v2 for 3G GSM to 4G LTE interoperability and GTP-C v2 to GTP-C v1 for 4G LTE to 3G GSM interoperability.

Abstract: A contextual SS7 firewall filter is inserted between a network operator and its roaming partners intra network and inter network SS7 traffic. SS7 firewall filter validates GSM MAP and GSM CAP messages based on specific criteria as provisioned for those message types and either allows them or blocks them from reaching their intended destination based on the validation results. The validation step involves verification of MSU correctness, verification of correctness of SS7 MTP fields for each MSU, and verification of correctness of SS7 SCCP fields for each MSU. SS7 firewall filter blocks GSM messages that fail at least one of the verification steps.

Abstract: A Virtual Global Title Translation (V-GTT) Service implemented in a Signaling Connection Control Part (SCCP) Gateway using a single American National Standards Institute (ANSI) SS7 Point Code and a single International Telecommunications Union (ITU) SS7 Point Code for access to destination hubs on ITU and ANSI SS7 side of the SS7 network. The V-GTT enables ANSI SS7 and ITU SS7 operators to send their destination SS7 hub-specific traffic to a single hub-specific protocol for either the ANSI or ITU SS7 Point Code of V-GTT. The V-GTT Service application manages the traffic between ANSI/ITU SS7 operator and destination SS7 hub operators and performs ANSI SS7 to ITU SS7 (or ITU SS7 to ANSI SS7) protocol conversion if the destination hub is on a different SS7 protocol, thereby enabling an originating operator to send traffic to a single V-GTT Service hub-specific point code using the protocol that the originating operator currently employs.

Abstract: A method of enabling a home network to identify a location of its subscriber roaming within a visited network. An Intelligent Data Routing (IDR) application functions as a proxy between a Serving GPRS Support Node (SGSN) of the visited network and a Gateway GPRS Support Node (GGSN) of the home network. The IDR receives a Create PDP Context Request message or an Update PDP Context Request message that is sent from the SGSN to GGSN. The IDR determines whether the Routing Area Identity (RAI) and User Location Information (ULI) Information Elements (IEs) of the Request message have been populated by the SGSN. If the IDR application determines that at least one of these IEs is absent, the IDR application populates them with appropriate values obtained from the SGSN. The routing application sends the modified Request message having the populated RAI and ULI IEs to the GGSN.

Abstract: Data is identified that defines a known good state for a current operating system. The identified data includes read-only sets that are not updated during operation of the computing device, and modifiable sets that can be updated during operation of the computing device. The read-only sets are captured on an opportunistic basis and the modifiable sets are captured when the computing device is to be rebooted. A first and second virtual disk are allocated as snapshots of the identified data. The first virtual disk is updated to generate an updated state. The updates to the first virtual disk are isolated from the second virtual disk. The second virtual disk is maintained as an immutable snapshot of the identified data. In response to a failed reboot with the updated state, the computing device reverts to the known good state using the snapshot of the identified data.

Abstract: A first storage device configured to store data associated with a user is allocated. The data stored on the first storage device is mirrored at a second storage device. A resiliency mechanism is implemented at the first and second storage devices. The first and second storage devices are associated with a unit of allocation. When the second storage device is not available, a data structure is instantiated that is configured to track which subunits of the first and second storage devices have been modified. The data structure is updated to track which subunits of the second storage device are stale. The subunits have a smaller granularity than the unit of allocation. When the second storage device is available, data on the first storage device is resilvered to the second storage device. Only the subunits that are marked as stale in the data structure are resilvered.

Abstract: A virtual disk is instantiated as a representation of a storage volume. The virtual disk is configured with metadata corresponding to the storage volume. A storage stack is instantiated that is operable to provide an active I/O path to the storage volume. The storage stack is modified by adding an alternative I/O path to the virtual disk. The alternative I/O path includes a layout driver configured to manage a converted storage layout for the storage volume. The storage volume is encapsulated to the virtual disk. The active I/O path is closed and the alternative I/O path is enabled for I/O requests to the virtual disk. The storage layout of the storage device is converted without taking the storage volume offline.

Abstract: Data is stored that defines a known good state for a current operating system that can launch the computing device to the known good state in response to a reboot of a computing device. The data is associated with an indication that the data is usable to reboot the computing device. The operating system is updated to generate an updated state that can launch the computing device to the updated state in response to a reboot. The updated state is associated with an indication that the data is usable to reboot the computing device for a limited number of attempts. In response to a failed reboot, the reboot is retried until the known good state is to be used for reboot. When the known good state is to be used for reboot, the known good state is reverted to and the computing device is rebooted using the known good state.

Abstract: A virtual disk is instantiated as a representation of a storage volume. The virtual disk is configured with metadata corresponding to the storage volume. A storage stack is instantiated that is operable to provide an active I/O path to the storage volume. The storage stack is modified by adding an alternative I/O path to the virtual disk. The alternative I/O path includes a layout driver configured to manage a converted storage layout for the storage volume. The storage volume is encapsulated to the virtual disk. The active I/O path is closed and the alternative I/O path is enabled for I/O requests to the virtual disk. The storage layout of the storage device is converted without taking the storage volume offline.

Abstract: A first storage node configured to store data associated with a user is allocated. The data stored on the first storage node is mirrored at a second storage node. A resiliency mechanism is implemented at the first and second storage nodes. The resiliency mechanism is configured to restore data on at least one of the storage devices of the first and second storage nodes. In response to a loss of availability of either the first or second storage node and a loss of availability of one or more storage device on an available storage node, data on the unavailable storage devices of the available storage node is recovered using the resiliency mechanism of the available storage node.

Abstract: In a parity-based redundancy scheme, allocation information indicative of free and allocated portions of storage is accessed. In response to a request for a write operation, when the write request shares its parity with a non-free portion of the storage, a record of writes to the storage is updated to include the requested write and associated parity. The parity is updated with the requested write, and the write request is executed. When the write request shares its parity with a free portion of the storage or the write request spans all portions of storage that shares the parity, the write request is allowed to be executed in the free portion of the storage without updating the record.

Abstract: Virtual storage free space management techniques may calculate a data allocation value of a virtual storage entity based on a number of storage slabs allocated with data. The virtual storage free space management techniques may further analyze a physical storage entity to determine a storage allocation value associated with the physical storage entity. The storage allocation value may be obtained by summing the storage amount in bytes associated with each of the storage slabs of the physical storage entity that is allocated to one or more virtual storage entities. A free space value associated with the virtual storage entity may be determined based on the storage allocation value and the data allocation value.

Abstract: One embodiment of the present invention sets forth a technique for increasing available storage space within compressed blocks of memory attached to data processing chips, without requiring a proportional increase in on-chip compression status bits. A compression status bit cache provides on-chip availability of compression status bits used to determine how many bits are needed to access a potentially compressed block of memory. A backing store residing in a reserved region of attached memory provides storage for a complete set of compression status bits used to represent compression status of an arbitrarily large number of blocks residing in attached memory. Physical address remapping (“swizzling”) used to distribute memory access patterns over a plurality of physical memory devices is partially replicated by the compression status bit cache to efficiently integrate allocation and access of the backing store data with other user data.

Abstract: A method and a processing device are provided for sequentially aggregating data to a write log included in a volume of a random-access medium. When data of a received write request is determined to be suitable for sequentially aggregating to a write log, the data may be written to the write log and a remapping tree, for mapping originally intended destinations on the random-access medium to one or more corresponding entries in the write log, may be maintained and updated. At time periods, a checkpoint may be written to the write log. The checkpoint may include information describing entries of the write log. One or more of the checkpoints may be used to recover the write log, at least partially, after a dirty shutdown. Entries of the write log may be drained to respective originally intended destinations upon an occurrence of one of a number of conditions.

Abstract: In a parity-based redundancy scheme, a log is maintained that contains a record of storage writes and associated redundancy backups. A mapping of allocation information indicative of free and allocated portions of storage is stored. An indication is received of a change to the free and allocated portions of storage. An update to the mapping of allocation information is determined, and the update to the mapping of allocation information is stored. The stored update is accessed and the redundancy backup is synchronized with stored data in response to a power interruption.

Abstract: Techniques are disclosed for implementing a resilient object layer and namespace that are operable to provide a communication path to storage devices underlying virtualized storage services of a computing environment. The resilient object layer and namespace comprise a compression of at least two layers of a storage stack. A request is received for an operation that includes access to the virtualized storage services. Storage destination locations of the virtualized storage services associated with the request are mapped, using the resilient object layer and namespace, to a plurality of physical locations of the corresponding underlying storage devices.

Abstract: In a parity-based redundancy scheme, a log is maintained that contains a record of storage writes and associated redundancy backups. A mapping of allocation information indicative of free and allocated portions of storage is stored. An indication is received of a change to the free and allocated portions of storage. An update to the mapping of allocation information is determined, and the update to the mapping of allocation information is stored. The stored update is accessed and the redundancy backup is synchronized with stored data in response to a power interruption.