Patent classifications
H04L47/786
SENDING DATA USING A PLURALITY OF CREDIT POOLS AT THE RECEIVERS
Examples relate to methods for sending data between a senders and receivers coupled by a link. These methods comprise allocating a plurality of credit pools in a buffer on the receiver. These credits represent a portion of memory space in the buffer to store data received from the sender. Then, the sender allocates a number of credits from a plurality of credits to each virtual channel. A number of virtual channels from the plurality of virtual channels is mapped to the credit pools. The sender sends a data block to the receiver through a particular virtual channel when there are enough credits available in at least one of the particular virtual channel and the data pool to which the particular virtual channel is mapped. The sender decrements a credit counter associated with the corresponding at least one of the particular virtual channel and the data pool.
System and method for reducing latency time with cloud services
A system and method for reducing service latency includes dividing an information technology service for a customer into an infrastructure management service and a data management service. Data associated with the information technology service is stored in a backup memory. A set of infrastructure images related to the information technology service is stored at a cloud service provider. The infrastructure images are updated with software updates and hardware updates, as needed, and the data associated with the information technology service is updated through backup and restore mechanisms. The set of infrastructure images that have been updated with data with latest updates are started for recovery, continuity, testing, etc.
Intelligent exception recovery in network services
A system and method for responding to exceptions in network services. A network management system (NMS) configures a first network service having an endpoint and a plurality of externally mapped attributes, the externally mapped attributes including one or more service level attributes and an endpoint attribute associated with the endpoint. The NMS detects an exception in the first network service, modifies the first network service in response to the exception, wherein modifying the first network service includes assigning the current value of the endpoint attribute of the first network service to the endpoint attribute of a second network service and validates the externally mapped attributes of the second network service.
Efficient buffer utilization for network data units
Approaches, techniques, and mechanisms are disclosed for efficiently buffering data units within a network device. A traffic manager or other network device component receives Transport Data Units (TDUs), which are sub-portions of Protocol Data Units (PDUs). Rather than buffer an entire TDU together, the component divides the TDU into multiple Storage Data Units (SDUs) that can fit in SDU buffer entries within physical memory banks. A TDU-to-SDU Mapping (TSM) memory stores TSM lists that indicate which SDU entries store SDUs for a given TDU. Physical memory banks in which the SDUs are stored may be grouped together into logical SDU banks that are accessed together as if a single bank. The TSM memory may include a number of distinct TSM banks, with each logical SDU bank having a corresponding TSM bank. Techniques for maintaining inter-packet and intra-packet linking data compatible with such buffers are also disclosed.
SHARED STORAGE MODEL FOR HIGH AVAILABILITY WITHIN CLOUD ENVIRONMENTS
Techniques are provided for a high availability solution (e.g., a network attached storage (NAS) solution) with address preservation during switchover. A first virtual machine is deployed into a first domain and a second virtual machine is deployed into a second domain of a computing environment. The first and second virtual machines are configured as a node pair for providing clients with access to data stored within an aggregate comprising one or more storage structures within shared storage of the computing environment. A load balancer is utilized to manage logical interfaces used by clients to access the virtual machines. During switchover, the load balancer preserves an IP address used to mount and access a data share of the aggregate used by a client.
System and method for resource overriding in a multitenant application server environment
In accordance with an embodiment, described herein is a system and method for providing a partition file system in a multitenant application server environment. The system enables application server components to work with partition-specific files for a given partition, instead of or in addition to domain-wide counterpart files. The system also allows the location of some or all of a partition-specific storage to be specified by higher levels of the software stack. In accordance with an embodiment, also described herein is a system and method for resource overriding in a multitenant application server environment, which provides a means for administrators to customize, at a resource group level, resources that are defined in a resource group template referenced by a partition, and to override resource definitions for particular partitions.
Resource allocation method under heterogeneous network under intermediate processing constraints
The present disclosure provides a resource allocation method of a heterogeneous network under intermediate processing constraints. The method includes: generating a preference list for each intermediate node; obtaining network topology information of the heterogeneous network, and calculating a transmission path length of the data stream passing through the intermediate node according to the network topology information; obtaining a quasi-service list of each intermediate node; obtaining a mapping relationship between the intermediate nodes and the data flows according to the quasi-service list of each intermediate node, and sequentially scheduling the data flows according to the mapping relationship and the preference list of each intermediate node. A device for resource allocation of a heterogeneous network under intermediate processing constraints and a non-transitory computer storage medium are also disclosed.
RESOURCE INDICATION METHOD, AND RELATED DEVICE AND SYSTEM
This application discloses a resource indication method, and a related device and system. The method includes: generating resource indication information, where the resource indication information is used to indicate a reference signal resource allocated to a terminal device in a reference signal resource group in which the terminal device is located among a plurality of reference signal resource groups; and sending the resource indication information. According to the foregoing solution, flexibility of configuring the reference signal resource can be improved, so that better resource sharing is implemented and resource overheads are reduced.
METHOD OF AND SERVER FOR DETECTING ASSOCIATED WEB RESOURCES
A method of determining associated network resources from a plurality of network resources available on a network, the method executable by a server that is communicatively coupled to the network. The method comprises: scanning, by the server, the network to identify a first network resource and a second network resource of the plurality of network resources; retrieving, by the server, information associated with the first network resource and the second network resource, the information comprising at least one parameter of the first network resource and at least one parameter of the second network resource; in response to a match between the at least one parameter of the first network resource and at least one parameter of the second network resource, determining a connection between the first network resource and the second network resource.
Virtual shortest path tree establishment and processing methods and path computation element
The present application provides virtual shortest path tree establishment and processing methods and a path computation element, so as to improve a resource utilization rate in a process of establishing and processing a virtual shortest path tree. In a process of establishing the virtual shortest path tree, a cost of an established path from a root node (a destination node) to a leaf node is compared with a cost threshold, and a new path branch is added to the VSPT when the cost is less than the cost threshold. In a process of processing the virtual shortest path tree, a resource occupied by a path branch in the VSPT that does not belong to an optimal path is released after the optimal path is obtained.