A method, system, and device for using an interface controller to validate and authenticate controller code for a commodity device to be included within a computer system (e.g., a power supply) are provided. In one example, a commodity device controller includes dynamic memory for control software (e.g., control code to control operation of the commodity device) that may be validated (and/or updated) using an interface controller. The interface controller may perform this update/validation at startup (or run-time) to ensure secure control over aspects of the computer device including the commodity device control code. If a security risk is detected it may be mitigated in various ways, including disabling of the commodity device. Control code provided by third-parties (e.g., supplier of commodity device) may be validated and secured using disclosed techniques.
G06F 21/64 - Protecting data integrity, e.g. using checksums, certificates or signatures
G06F 21/71 - Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information
G06F 21/79 - Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure storage of data in semiconductor storage media, e.g. directly-addressable memories
G06F 21/81 - Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer by operating on the power supply, e.g. enabling or disabling power-on, sleep or resume operations
2.
PRESSURE REGULATOR ASSEMBLY FOR A COOLANT DISTRIBUTION UNIT
Example implementations relate to a pressure regulator assembly for a closed fluid loop of a CDU. The pressure regulator assembly has a cylinder having an internal volume, and first and second hollow pistons slidably connected to the cylinder to split the internal volume into a first volume portion having cooling fluid, a second volume portion having driver fluid, and a third volume portion having compressible matter. The first volume portion is fluidically connected to the closed fluid loop. The first hollow piston is reciprocated by the compressible matter to maintain operating pressure of the cooling fluid in the closed fluid loop. The second hollow piston is driven by the driver fluid in response to predefined pressure drop of the cooling fluid during predefined time period, to inject additional cooling fluid from the first volume portion into the closed fluid loop to restore pressure level of cooling fluid to operating pressure.
G05D 16/10 - Control of fluid pressure without auxiliary power the sensing element being a piston or plunger
F15B 1/02 - Installations or systems with accumulators
F15B 1/027 - Installations or systems with accumulators having accumulator charging devices
F15B 1/033 - Installations or systems with accumulators having accumulator charging devices with electrical control means
F15B 1/24 - Accumulators using a gas cushion; Gas charging devices; Indicators or floats therefor with rigid separating means, e.g. pistons
F15B 21/00 - Common features of fluid actuator systems; Fluid-pressure actuator systems or details thereof, not covered by any other group of this subclass
An example axial pump for delivering liquid coolant to cool an electronic device comprises a conduit defining a flow path from an inlet of the conduit to an outlet of the conduit and an impeller in the conduit. The impeller is rotatable about an axis of rotation parallel to the flow path. The pump also has a motor stator configured to drive rotation of the impeller body about the axis of rotation. In addition, the pump comprises an adjustment mechanism coupling the impeller to the conduit. The adjustment mechanism is actuatable to cause translation of the impeller relative to the conduit. This may allow for adjustment of a clearance between a blade tip of a blade of the impeller and a wall of the conduit.
Swarm learning systems and methods can perform hyperparameter tuning. Network nodes train a common machine learning (ML) algorithm using data local to each of the network nodes. Hyperparameter optimization is also performed at each of the network nodes. Model parameters and optimized hyperparameters are shared by the network nodes, and are subsequently merged. An updated version of the common ML algorithm based on the merged model parameters and the merged optimized hyperparameters is generated. That updated version of the common ML algorithm is re-trained at each of the network nodes.
Secured data access in virtual data processing is described. An example includes instructions to receive a request from an application in a compute node of a compute cluster in a virtual data processing environment to access a secured data source for a user, the virtual data processing environment including a multiple secured data sources that are accessible by compute nodes of the virtual compute cluster; fetch a credential in a current application context and forward the credential for validation; validate the credential with a credential authority; and, upon successfully validating the credential, authenticate the user at the secured data source and establish a connection with the secured data source.
In some examples, a system includes a plurality of memory servers managing access of data in a memory. A computer node includes a plurality of buffers associated with the memory servers. A processor executes a plurality of functions accessible by the computer node to access the data of the memory servers, the plurality of functions including associating, with the plurality of buffers, information specifying a type of an operation to be performed on the data using the plurality of buffers, queueing the operation in the plurality of buffers, initiating an execution of the operation, based on the type specified by the information, at the memory servers associated with the plurality of buffers, and providing results of the operation from the memory servers to the computer node.
Systems are methods are provided for implementing an intelligent optical transceiver. The intelligent optical transceiver implements dynamic health monitoring and “time to fail” prediction functions to predict a failure of a component before it malfunctions during use. By employing the intelligent optical transceiver, a network can prevent failures in its optical connectivity that can degrade the network performance, such as experiencing outages and data unavailability. For example, the intelligent optical transceiver includes a module health monitor, which monitors, in real-time, health parameters of optical communication components in the intelligent optical transceiver. Also, the intelligent optical transceiver includes a time to fail predictor which predicts a time to fail for the optical communication components of the optical transceiver based on a result of a defined regression function.
H04L 41/149 - Network analysis or design for prediction of maintenance
H04B 10/077 - Arrangements for monitoring or testing transmission systems; Arrangements for fault measurement of transmission systems using an in-service signal using a supervisory or additional signal
H04L 41/147 - Network analysis or design for predicting network behaviour
8.
METHOD FOR TRANSMITTING AND RECEIVING MULTIMEDIA DATA
A method for transmitting/receiving multimedia data between mobile devices comprising the steps: a) preparing a plurality of 4G and/or 5G mobile private networks each comprising a corresponding Home Subscriber Server (HSS) node for a 4G network or an Unified Data Management (UDM) for a 5G network, the mobile private networks of said plurality being mutually isolated to each other; b) preparing a plurality of mobile devices associated with users; c) registration of a group of mobile devices in the HSS or UDM node of a corresponding mobile private network to define groups of mobile devices whose connectivity is provided by separate and isolated mobile private network; d) preparing one or more central networks each comprising a corresponding HSS or UDM node and a corresponding Interrogating Call Section Control Function (I-CSCF) node; e) connecting one or more central network to two or more mobile private networks of said plurality. The method comprises a step f) of forwarding the registration of each user's mobile device already registered during execution of the step c) in the HSS or UDM node of one or more central networks.
A system for facilitating segmentation by a first switch of an overlay tunnel fabric is provided. During operation, the system can receive a route update packet for the fabric. The packet can be based on a control plane that allows the exchange of route information via the tunnel and can include a first media access control (MAC) address learned at a second switch and a first role identifier of a first role. The first role can indicate a level of access granted to a first device associated with the first MAC address. The system can store the first MAC address and the first role identifier in a local address data structure. Upon receiving a packet from the first device, the system can then determine, based on the first role identifier and a first segmentation policy, whether a local device is allowed to receive the packet from the first device.
A power over ethernet (PoE) power sourcing equipment (PSE) includes PoE ports connectable via communications links to powered devices (PDs). The PSE also includes a power supply unit (PSU) that supplies PoE power to the PDs via the PoE ports and one or more fans that provide airflows through the PSE, including at least a first fan that provides an airflow to the PSU. The PSE also has control circuitry comprising fan control logic configured to monitor a PoE power usage parameter indicative of an amount of the PoE power supplied by the PSU. The fan control logic is also configured to control the speed of at least the first fan based at least in part on the PoE power usage parameter.
Implementations of the present disclosure relate to dynamic mesh service set identifiers (SSIDs). In the implementations, a first AP broadcasts a probe request including a first identifier and a first random number. The first AP receives a probe response including a second identifier and a second random number from a second AP. The first AP generates a first SSID based on the first identifier, the first random number, the second identifier and the second random number. The first AP transmits an authentication request including the first SSID to the second AP. The first AP receives an authentication response to the authentication request from the second AP. In this way, the mesh SSIDs associated with different mesh links are different so that other mesh APs would not be attacked even if a mesh SSID of one mesh AP in the same mesh cluster is exposed.
Examples described herein relate to fetching network device topologies using a timestamp-callback map. The timestamp-callback map includes timestamps paired with references to unique callback functions that fetch topologies for network devices when executed. Examples include setting an alarm for each timestamp in the timestamp-callback map. When an alarm generates a notification, examples create worker threads of a network profiler service. Each worker thread executes a respective unique callback function to fetch a topology for a network device from a topology service. Examples describe different implementations of the timestamp-callback map that can be optimized in various embodiments.
H04L 51/02 - User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail using automatic reactions or user delegation, e.g. automatic replies or chatbot-generated messages
H04L 41/12 - Discovery or management of network topologies
13.
OPTIMAL DISPATCHING OF FUNCTION-AS-A-SERVICE IN HETEROGENEOUS ACCELERATOR ENVIRONMENTS
Systems and methods are provided for incorporating an optimized dispatcher with an FaaS infrastructure to permit and restrict access to resources. For example, the dispatcher may assign requests to “warm” resources and initiate a fault process if the resource is overloaded or a cache-miss is identified (e.g., by restarting or rebooting the resource). The warm instances or accelerators associated with the allocation size that are identified may be commensurate to the demand and help dynamically route requests to faster accelerators.
In an example implementation consistent with the features disclosed herein, high availability of a stateful application is achieved by orchestrating multiple computing clusters. A stateful application is deployed at a first application operator and a second application operator of a first computing cluster and a second computing cluster, respectively. The first application operator includes a first control loop that changes the first computing cluster based on first resources of the first computing cluster. The second application operator includes a second control loop that changes the second computing cluster based on second resources of the second computing cluster. Synchronization of the first resources with the second resources is configured, such as via an object storage service. The first application operator and the second application operator are scaled to, respectively, nonzero and zero. A load balancer is configured to route requests to the first computing cluster.
G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
Systems and methods are provided for agentless attestation. Agentless attestation can measure the integrity of customer servers without requiring an agent software program to be downloaded to each of the enterprise computer devices. In particular, the system can integrate several standalone components to measure the integrity of monitored devices. This also allows the data center to authenticate, verify, audit, and update any hardware change, including a Platform Certificate.
G06F 21/57 - Certifying or maintaining trusted computer platforms, e.g. secure boots or power-downs, version controls, system software checks, secure updates or assessing vulnerabilities
16.
WIFI-7 OPTIMIZED SPLIT BAND ARCHITECTURE AND METHOD OF OPERATION
A system or Access Point having a split band architecture. A first radio communicates with a 6G front end module (FEM) that is connected to a first filter switch bank (FSB) configured to enable a 6G high bandpass filter, a 6G wide bandpass filter, or a 6G narrow bandpass filter. A second radio communicates with a 5G FEM that is connected to a second FSB configured to enable a 6G low bandpass filter, a first 5G low bandpass filter, a 5G wide bandpass filter, or a 5G narrow bandpass filter. A third radio communicates with a 2-5G dual band FEM that is connected to a third FSB configured to enable a 6G full bandpass filter, a 5G high bandpass filter, or a second 5G low bandpass filter. The 2-5G dual FEM may also be connected to a fourth FSB configured to enable a 2G application.
H04B 1/00 - TRANSMISSION - Details of transmission systems not characterised by the medium used for transmission
H01Q 1/22 - Supports; Mounting means by structural association with other equipment or articles
H01Q 5/20 - Arrangements for simultaneous operation of antennas on two or more different wavebands, e.g. dual-band or multi-band arrangements characterised by the operating wavebands
17.
WIRELESS PACKET FOR ACTIVATING A WIRELESS LOCAL AREA NETWORK CAPABILITY ON A USER DEVICE
Some examples relate to using a wireless packet for activating a wireless local area network capability on a user device. In an example, a user device receives a wireless packet comprising carrier network identification information from a low energy wireless broadcast enabled access point of a carrier network. In response to determining that the carrier network identification information in the wireless packet matches with carrier network information on the user device, the user device provides a notification message to activate a wireless local area network capability on the user device. After the wireless local area network capability is activated, the user device establishes a network connection with the access point and access the wireless local area network of the carrier network via the network connection.
In some examples, a system creates a partition map that maps partitions of a data bucket to respective virtual processors executed in a cluster of computer nodes. Responsive to a request to access a data object in the data bucket, the system identifies which partition contains metadata for the data object based on a key associated with the data object, and identifies, based on the identified partition and using the partition map, a virtual processor that has the metadata for the data object. Responsive to a migration of a first virtual processor from a first to a second computer node, the system updates a virtual processor-computer node map that maps the respective virtual processors to corresponding computer nodes of the cluster of computer nodes, where the partition map remains unchanged in response to the migration of the first virtual processor from the first computer node to the second computer node.
In some examples, a security processor detects a potential attack in a system. In response to detecting the potential attack in the system, the security processor issues a command block indication to block processing of commands to access a nonvolatile memory. The security processor determines, based on monitored information, a likelihood of the potential attack being a real attack, and in response to the determined likelihood, triggers an erase of the nonvolatile memory.
An apparatus includes a host and a baseboard management controller. The baseboard management controller includes a semiconductor package; and the semiconductor package includes a memory, a security hardware processor; and a main hardware processor. The main hardware processor causes the baseboard management controller to serve as an agent that, independently from the host, responds to communications with a remote management entity to manage the host. The security hardware processor manages the storage of a secret of the host in the memory.
G06F 21/78 - Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure storage of data
G06F 21/33 - User authentication using certificates
G06F 21/53 - Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems during program execution, e.g. stack integrity, buffer overflow or preventing unwanted data erasure by executing in a restricted environment, e.g. sandbox or secure virtual machine
One aspect of the instant application facilitates automatic policy engine selection. During operation, a system can monitor a network including a set of network devices. The system can receive, based on the monitoring, a set of attributes associated with the network. At least two network devices are equipped with a different policy enforcement engine for enforcing one or more given policy rules. The system can apply a unified policy model to determine, based on the set of attributes, an assignment of the one or more given policy rules to the first policy enforcement engine and the second policy enforcement engine for providing an optimized policy enforcement. The system may then select based on the assignment, one or both of the first policy enforcement engine and the second policy enforcement engine. The system may activate the selected one or both policy enforcement engines for enforcing the given policy rules.
Examples described herein are generally directed to facilitating access to container state through multiple protocols. According to an example, a distributed state store is provided in which container state is accessible by multiple client containers via nodes of the distributed state store across which the container state is replicated. Responsive to receipt from a first client container of a storage request via a first application programming interface (API) method of the distributed state store that is associated with a first protocol, the container state is stored within the distributed state store. Responsive to receipt from a second client container of an access request via a second API method of the distributed state store that is associated with a second protocol, the container state is returned to the second client container via the second protocol.
Example implementations relate to storing data in a storage system. An example includes receiving, by a storage controller of a storage system, a data unit to be stored in persistent storage of the storage system. The storage controller calculates multiple entropy values for the data unit. The storage controller selects, based on the multiple entropy values, at least one reduction operation from multiple different reduction operations. The storage controller performs the selected at least one reduction operation on the received data unit.
H03M 7/30 - Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
H03M 7/42 - Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code using table look-up for the coding or decoding process, e.g. using read-only memory
24.
DATA ACCESS BY VIRTUAL PROCESSORS IN A DISTRIBUTED SYSTEM
In some examples, a distributed system includes a plurality of computer nodes comprising respective physical input/output (I/O) interfaces to a network-attached storage system. A virtual I/O interface is between a distributed virtual management program and a guest operating system (OS) of a virtual machine (VM). A plurality of virtual processors access the network-attached storage system through the virtual I/O interface in parallel using the respective physical I/O interfaces, where a first virtual processor in a first computer node is to use a data structure in the virtual I/O interface to submit a request to access data in the network-attached storage system and to receive a result of the request, and where the access of data from the network-attached storage system to satisfy the request is performed locally at the first computer node using the physical I/O interface of the first computer node. The distributed virtual management program maintains coherency of the data structure across multiple computer nodes.
In an example implementation consistent with the features disclosed herein, a tenant service in an internal network is made accessible to clients in an external network through a load balancer service. A request is transmitted by a tenant computing cluster in response to discovering creation of the tenant service at the tenant computing cluster. The request is received by a gateway computing cluster. The load balancer service is deployed at the gateway computing cluster in response to receiving the request. An external IP address for the external network is assigned to the load balancer service. The load balancer service is configured to forward client requests received at the external IP address to the tenant service. The external IP address is then sent to the tenant computing cluster.
Examples of the present technology provide “tensorized” integrated coherent Ising machines that improve scalability by leveraging a tensorized optical coupling matrix comprising layers of multi-wavelength photonic tensor-train (TT) cores cascaded together via passive optical cross-connects. A multi-wavelength photonic TT core may comprise a Mach Zehnder interferometer (MZI) mesh (i.e., a lattice/array of interconnected MZIs) that modulates the phase and/or amplitude of optical signals. Tensorized integrated CIMs of the present technology can achieve further scalability optimizations by implementing bistable Ising nodes via one or more multi-wavelength Ising node collections. A multi-wavelength Ising node collection may comprise a bistable Ising nodes implemented on a common MZI, where each bistable Ising node of the multi-wavelength Ising node collection is associated with a separate wavelength of light.
A power supply unit (PSU) comprises power conversion circuitry to convert input power into output power for an electronic system, microcontrollers to control operations of the power conversion circuitry, and a secure element communicably connected to a first microcontroller. The secure element and the microcontrollers are all paired together with each storing shared pairing information. The secure element and the microcontrollers comprise security logic. The security logic may be configured to, in response to a power on sequence being initiated, validate the secure element and the microcontrollers based on the shared pairing information, and make completion of the power on sequence conditional on successful validation. The security logic may be configured to, in response to receiving a new firmware image for updating one of the microcontrollers, use the secure element to validate the new firmware image and make acceptance of the new firmware image conditional on successful validation.
G06F 21/81 - Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer by operating on the power supply, e.g. enabling or disabling power-on, sleep or resume operations
G06F 21/57 - Certifying or maintaining trusted computer platforms, e.g. secure boots or power-downs, version controls, system software checks, secure updates or assessing vulnerabilities
In some examples, a system having a plurality of computer nodes receives a command based on program code of a program being developed in an interactive programming session. The system distributes data items from a network-attached memory to a distributed data object having data in node memories of the plurality of computer nodes. A dataset manager performs an operation specified by the command on the distributed data object, the operation executed in parallel on the plurality of computer nodes. The dataset manager produces derived data generated by the operation on the distributed data object, the derived data accessible by a programmer in the interactive programming session.
A system maintains a queue structure used for storing packets and comprising a plurality of sub-queues used to process the packets, wherein the packets in the queue structure are to be dequeued by a scheduler. The system computes a respective packet virtual time for a respective packet based on at least a packet virtual time of a previous packet processed by the same sub-queue. The system computes a global virtual time based on a packet virtual time of a packet being dequeued from the queue structure. The system measures a rate at which the global virtual time progresses based on the virtual time of packets dequeued from the queue structure. The system manages congestion in the sub-queues based on the rate at which the global virtual time progresses, a metric of a respective sub-queue, and an amount of a resource for the queue structure.
Systems and methods are provided for implementing pattern detection as a first step for security improvements of a computer network. The pattern detection may utilize a machine learning (ML) model for predicting network tuple parameters. The ML model can be trained on labelled data flow information and deployed by a central server for preventing network-wide cyber-security challenges (e.g., including DNS flux, etc.). Networking devices (e.g. switches, etc.) can monitor the data flow traffic that it receives from the networking devices and classify network tuple parameters based on the flow behavior. The system can compare the output of the ML model (e.g., a classification of the data flow traffic, etc.) to an implicit label (e.g., the network tuple parameter included with the data flow traffic, etc.). When the classification matches a particular network tuple parameter, the system can generate an alert and/or otherwise identify potential network intrusions and other abnormalities.
A system for efficient traffic management is provided. During operation, the system can receive a first route update via a first tunnel coupling a first switch in a first overlay tunnel fabric of a network site. The first route update can include a first set of hierarchical identifiers associated with the first switch. Here, a respective identifier can correspond to a distinct networking hierarchy with respect to the first switch. The system can also receive a second route update via a second tunnel coupling a second switch in a second overlay tunnel fabric of the site. The second route update can include a second set of hierarchical identifiers associated with the second switch. Upon receiving a packet via a tunnel, the system can determine whether to forward the packet to the first switch and the second switch based on the first and second sets of hierarchical identifiers, respectively.
A system for facilitating service discovery at an access point is provided. During operation, the system can receive, from a cloud-based service management system, an enhanced record indicating a set of services provided by a service-providing device (SPD). The enhanced record can be associated with one or more policies that indicate which device is eligible for receiving a service provided by the SPD. The system can cache the enhanced record in a service cache in a local storage device of the access point. The system can then receive a request for discovering a service from a client device wirelessly coupled to the access point. Subsequently, the system can determine whether to respond to or filter out the request based on the enhanced record and the one or more policies. Upon determining not to filter out the request, the system can respond to the request based on the enhanced record.
Example implementations relate to a cooling assembly of a host circuit device, a circuit assembly including the host circuit device and a removable circuit device, and a method for thermal management of the removable circuit device removably connected to the host circuit device. The cooling assembly includes a cooling component and a thermal gap pad having an elastomer component movably connected to the cooling component and a plurality of beams embedded in the elastomer component. Each beam includes a first end portion, a second end portion, and a body portion extended between the first and second end portions. The first end portion of each of one or more beams is disposed in a first thermal contact with the cooling component and a second end portion of each of the one or more beams is disposed in a second thermal contact with a heat sink of the removable circuit device.
A system and method are provided to detect an event corresponding to the system powering up or a storage device being inserted into the backplane. In response to detecting the event, the system obtains configuration information associated with a physical topology of the backplane, the configuration information associated with: a first bus between a storage controller and a redriver; a second bus between the redriver and the storage device; the backplane; and the storage device. The system searches, in a data structure based on the configuration information, for an optimized redriver setting. The system activates, based on the optimized setting, the redriver by enhancing signals sent via the second bus to the storage device and by enhancing signals sent via the first bus to the storage controller, thereby facilitating enhancement of signal integrity between the storage components in the backplane.
Systems and methods are provided for optimizing energy consumption, flexible load shifting, and battery operation decisions simultaneously in real-time through Reinforcement Learning (RL). Examples include obtaining states of a system comprising a plurality of subsystems and receiving, by RL agents, rewards from a digital twin of the system, the rewards comprising a plurality of rewards each associated with a subsystem. The example also include determining actions, by the RL agents, based on the states and each of the rewards. Each RL agent is associated with a subsystem and assigns a weight to a reward corresponding to the associated subsystem that is greater than weights assigned to rewards of the other subsystems. The system can then be controlled according to the actions to transition the system to updated states.
Example techniques for granting permissions for performing an operation related to a backup copy are described. The backup copy corresponds to first device data and the first device data is stored in a first device. In an example, in response to receiving a request to perform the operation related to the backup copy, telemetry data received from the first device is analyzed. Based on the analysis, it is determined that security of the first device is uncompromised. Based on the determination, a permission to perform the operation related to the backup copy is granted.
G06F 9/455 - Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
G06F 11/14 - Error detection or correction of the data by redundancy in operation, e.g. by using different operation sequences leading to the same result
G06F 11/34 - Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation
G06F 21/33 - User authentication using certificates
G06F 21/52 - Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems during program execution, e.g. stack integrity, buffer overflow or preventing unwanted data erasure
G06F 21/55 - Detecting local intrusion or implementing counter-measures
G06F 21/56 - Computer malware detection or handling, e.g. anti-virus arrangements
H04W 12/65 - Environment-dependent, e.g. using captured environmental data
A packet-processing method includes looking up a first match-action table on a network interface card (NIC) for a received packet; in response to finding a matching entry indicating an action, queuing the received packet in a first queue and storing the action data in an instruction memory; and responsive to not finding a matching entry, queuing the received packet in the first queue and a second queue. The method includes selecting a first packet from the first queue for processing, which comprises performing a corresponding action stored in the instruction memory; selecting a second packet from the second queue for processing, which comprises forwarding a portion of the second packet to a processor, which looks up a second match-action table; and receiving, from the processor, a lookup result, thereby allowing a third packet in the first queue corresponding to the second packet to be processed based on the lookup result.
A first switch port receives a first control packet, a header having a source media access control (MAC) address of a first MAC of a first interface of a sending device and a payload containing a second MAC of a second interface of the same sending device. The first and second interfaces form a bonded interface for failover purposes on the sending device. A second switch port receives a second control packet, a header having the second MAC as its source MAC and a payload containing the first MAC. The switch associates the first and second MAC addresses as related MAC addresses associated with the bonded interface. The switch facilitates failover between the secure interfaces via multiple uplinks while maintaining the port security on the switch by allowing transmission of data from either the first or second MAC address, associated as related MAC addresses, without triggering a port security violation.
H04L 69/40 - Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection
39.
FEDERATED MANAGEMENT OF DATA OPERATORS ON NEAR-MEMORY COMPUTE NODES
Examples described herein relate to federated management of data operators across multiple near-memory compute (NMC) nodes attached to memory devices in a network-attached memory system. Federated management includes loading, executing, and scaling data operators across the multiple NMC nodes together as a group. Examples include receiving a data access request from a client application and loading data operators in the multiple NMC nodes based on a data access pattern associated with the data access request. Examples include scaling the data operators based on performance metrics for the data operators or the multiple NMC nodes in correlation with client application performance. The multiple NMC nodes may dynamically scale the data operators based on request-load, execution frequency of data operators, resource availability, or other scaling strategies. Examples also include loading and scaling the data operators based on one or more of request characteristics or data operator characteristics.
Optical devices and methods of fabricating the same are provided. An example of the disclosed optical devices includes an epitaxial mesa formed on a silicon substrate and a single crystal semiconductor material layer formed between the silicon substrate and the epitaxial mesa. The single crystal semiconductor material layer comprises a bandgap that is wider than a bandgap of the epitaxial mesa. The example optical device also includes a semiconductor device layer formed between the single crystal semiconductor material layer and the epitaxial mesa. Examples of the optical devices include vertical injection optical devices, which can include an optically active region. In these examples, the bandgap of the single crystal semiconductor material layer is wider than a bandgap of the optically active region.
H01S 5/183 - Surface-emitting [SE] lasers, e.g. having both horizontal and vertical cavities having only vertical cavities, e.g. vertical cavity surface-emitting lasers [VCSEL]
A system maintains a queue for storing packets, which are enqueued at a tail of the queue and dequeued at a head of the queue. The system computes a queue utilization value, based on the packets stored in the queue. The system computes an excess amount value, based on the packets stored in the queue and previously tagged as excess packets. The system receives a first packet at the tail of the queue and determines whether a difference between the queue utilization value and the excess amount value exceeds a predetermined threshold. Responsive to determining that the difference exceeds the predetermined threshold, the system tags the first packet as an excess packet. Responsive to tagging the first packet as an excess packet, the system performs an operation associated with the first packet or a second packet at the head of the queue to reduce congestion.
A system maintains ordered sub-queues used for storing packets, which are to be dequeued by a scheduler. A respective is enqueued into a sub-queue, and a virtual time associated with the respective packet is based on a current sub-queue virtual time corresponding to a previously enqueued packet in the sub-queue. The system dequeues, by the scheduler, a first packet from a selected sub-queue and determines a packet virtual time associated with a next packet in the currently selected sub-queue. Responsive to determining that the packet virtual time associated with the next packet is greater than a current global virtual time, the system selects a next sub-queue in the ordered plurality of sub-queues. The system updates the current global virtual time based on a packet virtual time of the dequeued first packet.
Systems and methods are provided for receiving a time series dataset from a monitored processor and group the dataset into a plurality of clusters. Using an unsupervised machine learning model, the system may combine a subset of the plurality of clusters by data signature similarities to form a plurality of motifs and combine the plurality of motifs into one or more shapelets. In some examples, the system may train a supervised machine learning model using the plurality of motifs and the one or more shapelets as input to the supervised machine learning model. The system can perform various actions in response to labelling the time series dataset, including predicting a second time series dataset, determining that a monitored processor corresponds with an overutilization at a particular time, or suggesting a reduction of additional utilization of the monitored processor.
A screw-latching assembly is provided. The assembly includes a screw with a head, a tip, and a body between the head and tip. The body includes a threaded portion adjacent to the tip and an unthreaded portion adjacent to the head, and the unthreaded portion includes a built-in collar with an outer diameter larger than that of the body. The assembly includes a supporting bracket supporting and partially encompassing a first portion of the screw. The supporting bracket includes a base and multiple sidewalls, with a first sidewall comprising a first opening to allow a second portion of the screw to extend out of the supporting bracket and a second sidewall comprising a second opening to allow access to the head by a torquing tool. The assembly includes a spring surrounding at least a portion of the body, with the spring positioned between the built-in collar and the first sidewall.
F16B 5/02 - Joining sheets or plates to one another or to strips or bars parallel to them by means of fastening members using screw-thread
F16B 35/04 - Screw-bolts; Stay bolts; Screw-threaded studs; Screws; Set screws with specially-shaped head or shaft in order to fix the bolt on or in an object
45.
MANAGING USE OF MANAGEMENT CONTROLLER SECRETS BASED ON FIRMWARE OWNERSHIP HISTORY
A management controller of a computer platform, determines whether an ownership history of management firmware for the management controller represents multiple owners. The management controller includes a set of one-time programmable elements that represent a first secret. The management controller manages use of the first secret based on the ownership history. The management includes, responsive to determining, by the management controller, that the ownership history represents multiple owners, generating, by the management controller, a second secret to replace the first secret. The management further includes, responsive to determining, by the management controller, that the ownership history represents multiple owners, storing, by the management controller, the second secret in a non-volatile memory and generating, by the management controller, cryptographic keys based on the second secret.
G06F 21/57 - Certifying or maintaining trusted computer platforms, e.g. secure boots or power-downs, version controls, system software checks, secure updates or assessing vulnerabilities
Systems and methods are provided for automatically grouping branch devices based on device information (e.g., IPSec tunnel connectivity, etc.). The devices with similar branch gateways which would customarily receive similar route information and/or properties (e.g., AS-PATH, cost, MED, Metric1, Metric2, community/extended community) and/or devices with similar connectivity graphs can be grouped together. This can reduce the number of electronic communications transmitted throughout the network and increase computational efficiency for the controller and devices.
A system for facilitating the dynamic selection of a gateway at an access node is provided. During operation, the system can select primary and standby gateways for a client device coupling the access node from a list of gateways associated with a gateway cluster based on an identifier of the client device. The gateway cluster can include a plurality of gateways coupled to the access node. The system can then forward traffic from the client device to the primary gateway. If there is a change in a set of parameters associated with the gateway cluster, the system can receive a policy indicating a change of gateway for the client device. The set of parameters indicates performance associated with the plurality of gateways. The system can select a new primary gateway for the client device based on the policy and redirect traffic from the client device to the new primary gateway.
A cable system includes a printed circuit board (PCB) comprising a set of connector pin pads and a card-side connector, with the card-side connector comprising a housing attached to the PCB and a set of pins. A first subset of the set of pins is soldered on and electrically coupled to the connector pin pads. The cable system includes first and second cables electrically coupled to the card-side connector. The first cable includes a first end soldered onto the connector pin pads to couple to the first subset of the pins and a second end coupled to a first host-side connector. The second cable includes a first end soldered onto a second subset of the set of pins of the card-side connector and a second end coupled to a second host-side connector, thereby facilitating electrical coupling between the card-side connector and the first and second host-side connectors.
One aspect can provide a system and method for fast Wi-Fi roaming. The system can identify forwarding data associated with a first active session of a first application running on a client device coupled to a home access point (AP), determine a number of neighboring APs comprising a target AP, maintain a roaming cache on each of the neighboring APs, and synchronize the identified forwarding data associated with the first active session to the roaming cache on each neighboring AP. In response to determining that the client device is roaming to the target AP, the system can access the roaming cache on the target AP to obtain the forwarding data associated with the first active session in order to continue the first active session on the client device with reduced roaming latency, thereby facilitating fast roaming of the client device from the home AP to the target AP.
AB/or mounting an electronic device to a ceiling suspension system is disclosed. The adjustable mounting bracket assembly includes clips, a device holder, and a base component having a plurality of first apertures. The clips are disposed spaced apart from each other and configured to engage with opposite edges of a beam of the ceiling suspension system. Each clip includes locking knobs, where each of the locking knobs is configured to be received within one of the plurality of first apertures to attach the clips to the base component, and the plurality of first apertures are arranged to allow the clips to be attached to the base component in a plurality of configurations including different separation distances between the clips. The device holder is coupled to the base component, where the device holder is configured to mount the electronic device to the adjustable mounting bracket assembly.
F16M 13/02 - Other supports for positioning apparatus or articles; Means for steadying hand-held apparatus or articles for supporting on, or attaching to, an object, e.g. tree, gate, window-frame, cycle
F16M 11/04 - Means for attachment of apparatus; Means allowing adjustment of the apparatus relatively to the stand
51.
DETECTING MICROSERVICE SECURITY ATTACKS BASED ON METRIC SENSITIVE DEPENDENCIES
A process includes aggregating a time sequence of samples. Each sample has a plurality of dimensions that correspond to respective metrics that are associated with a microservice. Each sample includes, for each dimension, a measurement of the metric that corresponds to the dimension. The process includes identifying a given sample of the time sequence of samples based on measurements of first samples of the time sequence of samples and determining a sensitivity dependency of the metrics based on the measurements of the given sample. The process includes determining whether the microservice has been subjected to a security attack based on the sensitive dependency.
An assembly may comprise a mounting tray configured to have at least one printed circuit board mounted to its top surface and further comprises a set of spools extending from an outer surface of the first mounting tray, each spool including a barrel and a flange. The assembly may comprise a base pan including a set of keyholes, each keyhole including an entry hole and a slot extending from the entry hole. The base pan is configured to attach to the mounting tray by engaging the set of spools with a group of keyholes, respectively, by inserting the flange of each spool through the entry hole of a corresponding keyhole and moving the mounting tray relative to the base pan such that the barrel of each spool is received within the slot, and the flange of each spool of the set of spools is secured by a rim of the slot of the corresponding keyhole.
Systems and methods are provided for generating extract-transform-load (“ETL”) machine learning (“ML”) pipeline validation rules based on user-input, wherein the ETL ML pipeline validation rules may be applicable to validate an ETL ML pipeline against multiple test datasets. The ETL ML pipeline validation rules may comprise compute-type validation rules for computing expected values of data structures within a dataset output by the ETL ML pipeline. The ETL ML pipeline validation rules may comprise check-type validation rules for checking whether data structures within a dataset output by the ETL ML pipeline have intended characteristics.
Systems and methods are provided for an accelerator system that includes a baseline (production) accelerator, optimizing accelerator, and control hardware accelerator, and an operation of alternatingly switching the production/optimizing accelerators between production and optimizing. With two production/optimizing accelerators, at any given point in time, one accelerator adapts while another accelerator processes data. Once the second accelerator starts doing a better job (e.g., has adapted to data drift), the accelerators change their modes, and the trainable accelerator becomes the “optimized” one. The accelerators do this non-stop, thus maintaining redundancy, providing expected quality of service (QOS) and adapting to data/concept drift.
Systems and methods are provided for implementing an iterative function deployment in a Function-as-a-Service (FaaS) computing environment. For example, the system may receive a request to execute a program and convert machine-readable code from the request into functions that are deployable in the FaaS computing environment. The system may determine a first deployment of the functions that defines scheduling and execution tasks, and also an execution metric by a trained prediction model. The system may adjust execution of the plurality of functions and also adjust the execution metric in a second deployment. The system may implement the second deployment at run-time, such that the machine-readable code from the request is executed by the computing components of the FaaS infrastructure in accordance with the second deployment.
A process includes prioritizing candidate network traffic flow profiles. The prioritization includes associating perception scores with respective candidate network traffic flow profiles. Each candidate network traffic flow profile is a member of a profile group of a plurality of profile groups. The process includes associating weights with respective profile groups of the plurality of categories. The process includes, responsive to a network traffic flow, identifying, by a traffic analysis engine, a first observed profile of the network traffic flow corresponding to a first candidate network traffic flow profile. The process includes, based on the perception score associated the first candidate network traffic flow profile and the weight associated with the profile group in which the first candidate network traffic flow profile is a member, determining a policy score; and selecting, by the network analysis engine, a policy to be applied to the network traffic flow based on the policy score.
Systems and methods are provided for implementing a low power and area ternary content addressable memory (TCAM). An example of a TCAM comprises a match line, and a plurality of TCAM cells connected along the match line. Each TCAM cell stores a state of a threshold value. The TCAM cells are configured to pull down a signal over the match line in response to inequality between an input search and the threshold value. The plurality of TCAM cells comprises a number of TCAM cells that is less than the threshold value. The input values can be encoded according to a first encoding scheme and the threshold value can be encoded according to one of a second and a third encoding scheme based on an inequality check mapped to the plurality of TCAM cells.
G11C 15/04 - Digital stores in which information comprising one or more characteristic parts is written into the store and in which information is read-out by searching for one or more of these characteristic parts, i.e. associative or content-addressed stores using semiconductor elements
G11C 13/00 - Digital stores characterised by the use of storage elements not covered by groups , , or
58.
MODULAR REAR PANEL SYSTEM FOR CHASSIS OF ELECTRONIC DEVICE
A modular rear panel system for a chassis of an electronic device includes modular brackets and modular rear panel sections. The brackets are each configured to be selectively coupled to the chassis at a corresponding one of multiple bracket mounting locations. The rear panel sections are each configured to be selectively coupled to one or more corresponding ones of the modular brackets. The brackets and the plurality of rear panel sections comprise, i.e., can be grouped into, multiple different combinations, with each combination comprising a subset of the rear panel sections and subset of the brackets that can be assembled together to form a rear panel of the chassis, with the subset of brackets coupled to the mounting locations and the subset of rear panel sections coupled to the subset of brackets. The respective rear panels formable by the plurality of combinations have mutually different rear panel configurations.
Implementations of the present disclosure relate to parallel channel switching for mesh network. In the implementations, a first access point (AP) receives a first beacon including an indication of a first channel switch count (CSC) for a first link between the first AP and the second AP from a second AP. The first AP obtains a second CSC for a second link between the first AP and a station. Then, the first AP transmits a second beacon including an indication of the second CSC to the station and within a beacon interval of the second AP upon receipt of the first beacon. In this way, the idle time period for the channel switching procedure of the mesh network can be reduced and minimized, thereby improving the Wi-Fi mesh link stability and reducing the latency.
A networking device may comprise ports connectable via respective communications links to remote devices. Each of the ports is associated with at least one port status light that is configured to indicate a status of the port. The networking device may also comprise one or more fans, which are configured to provide an airflow through the networking device. The networking device may additionally comprise control circuitry. The control circuitry may, in a state of at least one remote device being connected to at least one of the ports, be configured to monitor drive signals for driving the port status lights and control the airflows provided by the one or more fans based at least in part on the drive signals for driving the port status lights.
A method for harmonic channel detection is provided. The method comprises receiving, by a first AP working on a first channel, a beacon frame transmitted by a second AP and parsing the beacon frame to obtain information of a second channel indicated in the beacon frame. The method further comprises determining a plurality of candidate harmonic channels and validating that the second channel is one of the candidate harmonic channels. In addition, the method further comprises validating that the beacon frame is transmitted on the second channel based on a sequence number and a TBTT indicated in the beacon frame and discarding the beacon frame. Implementations of the present disclosure can reduce harmonic frames from being reported to a controller at upper layer, and improve the performance of the network.
H04W 72/0453 - Resources in frequency domain, e.g. a carrier in FDMA
H04L 1/1607 - Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals - Details of the supervisory signal
H04L 5/00 - Arrangements affording multiple use of the transmission path
H04W 72/044 - Wireless resource allocation based on the type of the allocated resource
62.
MACHINE LEARNING-BASED TROUBLESHOOTING ANALYSIS ENGINE TO IDENTIFY CAUSES OF COMPUTER SYSTEM ISSUES
A process includes responsive to an issue occurring with the computer system, receiving, by a troubleshooting analysis engine, data from the computer system representing information about the computer system. The process includes processing, by the troubleshooting analysis engine, the data to identify a parameter of the computer system having an unexpected value; and searching, by the troubleshooting analysis engine, a design database to identify a design infrastructure of the computer system that is causally linked to the issue. The process includes analyzing, by the troubleshooting analysis engine, the design infrastructure using machine learning to identify a candidate cause of the issue.
A technique includes enqueueing, by a host processor of a compute node, a stream of first operations to be executed by an accelerator of the compute node. The stream is associated with a compute kernel boundary. The technique includes synchronizing a network operation to the compute kernel boundary; and offloading, by the host processor and to the accelerator, the synchronizing to the accelerator. The offloading includes enqueueing, by the host processor and to a network communication interface of the compute node, a network communication operation to be performed by the network communication interface. The offloading further includes adding, by the host processor and to the stream, a second operation to synchronize the network operation with the compute kernel boundary.
An example method for selectively filtering Wi-Fi signals is presented. A first radio and a second radio of a wireless networking device (WND) are respectively operated on a first channel and a second channel. The first channel and the second channel are respectively within a first sub-band of a first frequency band and second sub-band of a second frequency band. A control unit of the WND may select one of a first filter or a second filter based on the first channel, and one of a third filter or a fourth filter based on the second channel. After the filters are selected, signals over the first channel are communicated through a selected one of the first filter or the second filter, and signals over the second channel are communicated through a selected one of the third filter or the fourth filter.
Example implementations relate to deduplication operations in a storage system. An example includes receiving a stream of data units to be stored in a persistent storage of a deduplication storage system; loading a first container index into the memory to index one or more data units included in the stream; updating the first container index to indicate a storage location of a first data unit included in the stream; reading a manifest list in the first container index to identify a first manifest indexed by the first container index; and, while the first container index remains loaded in the memory to index the one or more data units, in response to a determination that the identified first manifest is included in the first backup item that has been marked for deletion, decrementing a reference count of a second data unit.
G06F 11/14 - Error detection or correction of the data by redundancy in operation, e.g. by using different operation sequences leading to the same result
66.
SERVING APPLICATION PROGRAMMING INTERFACE CALLS DIRECTED TO HIERARCHICAL DATA FORMAT FILES STORED IN FABRIC-ATTACHED MEMORIES
In accordance with example implementations, a process includes receiving, by a connector that is associated with a compute node and is associated with a fabric-attached memory (FAM), an application programming interface (API) called to perform an operation that is associated with a hierarchical data format (HDF) object of an HDF file. The API call includes a HDF object identifier, which corresponds to the HDF object. The process includes, responsive to the request, based on the HDF object identifier, accessing, by the connector, mapping information that is stored in the FAM; and using, by the connector, the mapping information to identify a FAM descriptor corresponding to a first data item that is stored in the FAM and corresponds to the HDF object. The process includes, responsive to the request, serving, by the connector, the API call responsive to the identification of the FAM descriptor.
In implementations of the present disclosure, a retry mechanism for access point multi-link device is provided. An access point (AP) multi-link device (MLD) detects a trigger condition for a retry on a first link. After detecting the trigger condition, the AP MLD further selects a second link from a plurality of links. The AP MLD then selects a retry mode from a plurality of retry modes for the second link, and transmits a retry packet on the second link using the selected retry mode. Implementations of the present disclosure can fully utilize the MLD properties to help speed up the transmissions of the retry frames, and can reduce the channel occupation and increase the channel utilization of the retry frames.
In some examples, a system maintains, for a base storage structure and a collection of snapshots associated with the base storage structure, statistics relating to usage of storage space based on data of the base storage structure and the collection of snapshots. The system checks metadata of a first snapshot to determine validity of references in the metadata and a presence of any child of the first snapshot or a grandparent of the first snapshot. The system associates, based on the validity of the references in the metadata and the presence of any child or grandparent of the first snapshot, a hint with a metadata entry of a parent of the first snapshot to indicate that a metadata entry of the child or the grandparent is to be checked. The system updates, using the hint, the statistics relating to usage of storage space.
G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
Systems and methods are provided for performing live upgrading of Access Points (APs) in WiFi-7. A method of upgrading an AP having Multi-Link Operation (MLO) and a Multi-Link Device (MLD) comprising a UMAC sublayer (MLD UMAC) and an LMAC sublayer (MLD LMAC), includes determining whether the MLD is in tunnel mode, and when the MLD is not in tunnel mode, switching the MLD to tunnel mode. Contents of the MLD UMAC are transferred to a controller; and contents of the MLD LMAC, comprising one or more MLD links, are transferred to one or more neighbor APs. Live upgrade of the upgrading AP is performed, after which the upgrading AP is rebooted. The MLD links previously transferred to the one or more neighbor APs are transferred back to the upgraded AP, and the contents of the MLD UMAC are copied from the controller to the UMAC of the upgraded AP.
disclosed. The electronic device includes a chassis, electronic components disposed within the chassis, the cooling containers, and a coolant loop. The chassis has an internal volume partly filled with coolant to form coolant pool in the internal volume. The containers are disposed within the chassis such that each container contains at least one electronic component. The coolant loop circulates the coolant from the coolant pool to the containers. For example, each container receives an inflow of the coolant from the coolant loop or from another one container and immerse the at least one electronic component in the coolant to remove heat from the at least one electronic component and output an outflow of the coolant that overflows into the coolant pool or into at least one adjacent container, where a level of the coolant in the coolant pool is lower than respective levels of the coolant in the containers.
Implementations of the present disclosure relate to packet capture for a multi-link device. In the implementations, an access point (AP) obtains a media access control (MAC) address of a multi-link device (MLD) to be monitored. Further, the AP determines a plurality of links of the MLD to be monitored based on the MAC address. Based on the MAC address of the MLD, the AP captures packets transmitted by the AP MLD on the plurality of links, as a monitor AP. For each of the captured packets, the AP inserts the MAC address of the MLD into an MLD MAC field in a packet capture headroom associated with the packet. In this way, the present disclosure can support flexible packet capture (PCAP) for a specific MLD instead of for a specific link.
Some examples relate to providing a fabric-attached memory (FAM) for applications using message passing procedure. In an example, a remotely accessible memory creation function of a message passing procedure is modified to include a reference to a region of memory in a FAM. A remotely accessible memory data structure representing a remotely accessible memory is created through the remotely accessible memory creation function. When an application calls a message passing function of the message passing procedure, a determination is made whether the remotely accessible memory data structure in the message passing function includes a reference to the region of memory in the FAM. In response to a determination that the remotely accessible memory data structure includes a reference to the region of memory in the FAM, the message passing function call is routed to a FAM message passing function corresponding to the message passing function.
Systems and methods are provided for a dynamic communication architecture that can include decentralized heterogenous accelerators, and an operation of mapping corresponding decentralized virtualized accelerators. The mapping of corresponding decentralized virtualized accelerators is performed on top of, for example, a memory-mapped multi-accelerator communication architecture to enable effective and flexible sharing of data. The mapping can be dynamically adjusted with regard to the workload running by analyzing workflow communication.
Systems and methods for providing low latency connection by a network device is described herein. Upon receiving a request for a low latency connection from a client device, a lower frequency filter in a primary 6 GHz radio, a secondary 6 GHz radio and an upper frequency filter in the secondary 6 GHz radio may be enabled. A transition band between the lower frequency filter and the upper frequency filter may be enabled such that there is no interference between a primary frequency channel allowed by the lower frequency filter and a secondary frequency channel allowed by the upper frequency filter. An operating frequency channel of an existing communication session with the client device may be determined. Based on the operating frequency channel, the primary frequency channel and the secondary frequency channel may be determined to provide a first communication connection and a second communication connection to the client device.
Systems and methods are provided for identifying an alternative network function (NF) service consumer to which a notification regarding an observed event may be sent (in the event that a notification sent to an originally-intended/targeted NF service consumer fails). NF discovery request and response operations between a NF service producer and a data repository (at which a NF profile associated with the NF service consumer is registered) may be performed to identify and receive (as part of a NF discovery response operation), binding indication information. The binding information may be used to determine the aforementioned, alternative NF service consumer to receive the notification.
Systems and methods are provided for a cross-vendor fabric capable of deploying and managing network functions associated with different operating conditions or considerations. A cross-vendor fabric may deploy/manage components or groups of components making up a network function through the use of deployment-agnostic descriptors are used to define the components/groups of components, and from which deployment-specific descriptors can be derived. Begin and end states associated with the deployment-specific descriptors can be analyzed to determine a workflow of operations to be performed to accomplish the deployment or management of the network functions.
One aspect provides a programmable logic device. The device includes an input circuit for detecting a multi-level input signal and an output circuit. The input circuit includes: an input pin for receiving the multi-level input signal; first and second programmable voltage generators to generate, respectively, first and second multi-level voltage signals; a pair of comparators, each comparator having a first input coupled to the input pin and a second input coupled to a corresponding programmable voltage generator; and a logic gate coupled to the comparators, thereby facilitating the detection of the multi-level input signal based on outputs of the comparators. The output circuit includes a third programmable voltage generator to generate a third multi-level voltage signal, an output pin, and a voltage buffer coupling the third programmable voltage generator to the output pin, thereby facilitating the programmable logic device to output, over the output pin, the third multi-level voltage signal.
H03K 19/173 - Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits using specified components using elementary logic circuits as components
H03K 19/20 - Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits characterised by logic function, e.g. AND, OR, NOR, NOT circuits
H03M 1/78 - Simultaneous conversion using ladder network
78.
EFFICIENT MULTICAST FORWARDING BY SHARED GATEWAY SWITCH IN MULTI-FABRIC NETWORK
A system for efficient multicast forwarding at a switch is provided. During operation, the switch can maintain a first tunnel with a first switch in a first overlay tunnel fabric, and a second tunnel with a second switch in a second overlay tunnel fabric. The switch can operate as the gateway for both fabrics. The system can obtain a first fabric identifier and a second fabric identifier from multicast control packets received via the first and second tunnels, respectively. A fabric identifier can uniquely identify a fabric. The system can then store, in a data structure, a first network address of the first switch and a second network address of the second switch in association with the first and second fabric identifiers, respectively. The system can determine whether to forward multicast traffic to either one of the first and second fabrics based on the first and second fabric identifiers, respectively.
A system for efficient multicast forwarding at a switch is provided. During operation, the switch can maintain a first tunnel with a first switch in a first overlay tunnel fabric, and a second tunnel with a second switch in a second overlay tunnel fabric. The switch can operate as the gateway for both fabrics. The system can obtain a first fabric identifier and a second fabric identifier from multicast control packets received via the first and second tunnels, respectively. A fabric identifier can uniquely identify a fabric. The system can then store, in a data structure, a first network address of the first switch and a second network address of the second switch in association with the first and second fabric identifiers, respectively. The system can determine whether to forward multicast traffic to either one of the first and second fabrics based on the first and second fabric identifiers, respectively.
In certain embodiments, a computer-implemented method includes monitoring, over time, values for a service metric associated providing a computerized service over a communication network and evaluating, according to a statistical model, the values for the service metric to determine whether the values are anomalous values. The statistical model includes a predicted distribution of the values for the service metric and a normal value range within the predicted distribution of the values for the service metric. Anomalous values may be values for the service metric outside the normal value range. The method includes detecting a performance issue with the computerized service and determining, in response to detecting the performance issue, whether one or more of the values for the service metric are anomalous. The method includes automatically setting, in accordance with whether one or more of the values are anomalous, a value of a service level threshold for the service metric.
G06F 15/173 - Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star or snowflake
H04L 41/16 - Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using machine learning or artificial intelligence
H04L 41/50 - Network service management, e.g. ensuring proper service fulfilment according to agreements
H04L 41/5025 - Ensuring fulfilment of SLA by proactively reacting to service quality change, e.g. by reconfiguration after service quality degradation or upgrade
During operation, a layer-3 (L3) router can receive a trace query to trace multicast paths associated with a multicast group. In response to detecting a layer-2 (L2) switch coupled to the L3 router, the L3 router can construct a request packet and send the request packet to the coupled L2 switch. The request packet comprises a first data block indicating that the request packet is an L2 multicast trace request, thereby causing the L2 switch to propagate the request packet to downstream L2 switches until the request packet reaches a last-hop L2 switch. The L3 router can receive, from the last-hop L2 switch, a reply packet responsive to the L2 multicast trace request, the reply packet comprising one or more data blocks, with each data block comprising information about an L2 switch or client device present on a traversed multicast path for the multicast group.
G06F 15/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
H04L 45/00 - Routing or path finding of packets in data switching networks
Systems and methods are provided for utilization of optimal data access interface usage in machine learning pipelines. Examples of the systems and methods disclosed herein include identifying data access interfaces comprising at least a first data access interface for a persistent storage distributed across a plurality of storage nodes and at least a second data access interface for an in-memory object store, and receiving, from a compute node, a data operation request as part of a machine learning pipeline. Additionally, performance metrics are obtained for the plurality of access interfaces, and based on a type of data operation request, the data operation is executed using a data access interface selected from the plurality of data access interface based on the performance metrics and providing an object handle to the compute node.
Systems and methods are provided for distributing a system power cap amongst system equipment for efficient utilization of power cap ranges without requiring an understanding of intricacies of the system architecture. An example of the system and methods obtain power cap ranges for controllable system equipment and power cap values for non-controllable system equipment; calculate a settable power cap range for the system based on the power cap ranges and power cap values; based on a requested power cap, determine power caps for controllable system equipment from a comparison of the requested power cap against the settable power cap range; and provide the determined power caps to the system for application to each of the controllable system equipment. In various examples, the power caps for the controllable system equipment can be determined through application of one or more distribution schemes.
In some examples, based on the information relating to the wear of physical memories in computer nodes of the distributed system, a system initiates a migration of a memory page from a first physical memory in a first computer node to a second physical memory in a second computer node. As part of the migration, the system updates a mapping between a first address space accessible by programs in the distributed system and a physical address space comprising memory locations in the physical memories.
Systems and methods are provided for managing multicast data transmission in a network having a plurality of switches arranged in a Dragonfly network topology, including: receiving a multicast transmission at an edge port of a switch and identifying the transmission as a network multicast transmission; creating an entry in a multicast table within the switch; routing the multicast transmission across the network to a plurality of destinations via a plurality of links, wherein at each of the links the multicast table is referenced to determine to which ports the multicast transmission should be forwarded; and changing, when necessary, the virtual channel used by each copy of the multicast transmission as the copy progresses through the network.
G06F 12/0862 - Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches with prefetch
G06F 12/1036 - Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] for multiple virtual address spaces, e.g. segmentation
G06F 12/1045 - Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] associated with a data cache
G06F 13/14 - Handling requests for interconnection or transfer
G06F 13/16 - Handling requests for interconnection or transfer for access to memory bus
G06F 13/28 - Handling requests for interconnection or transfer for access to input/output bus using burst mode transfer, e.g. direct memory access, cycle steal
H04L 47/24 - Traffic characterised by specific attributes, e.g. priority or QoS
H04L 47/2441 - Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
H04L 47/2466 - Traffic characterised by specific attributes, e.g. priority or QoS using signalling traffic
H04L 47/2483 - Traffic characterised by specific attributes, e.g. priority or QoS involving identification of individual flows
H04L 47/30 - Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes
H04L 47/32 - Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
H04L 47/34 - Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers
H04L 47/52 - Queue scheduling by attributing bandwidth to queues
H04L 47/62 - Queue scheduling characterised by scheduling criteria
H04L 47/625 - Queue scheduling characterised by scheduling criteria for service slots or service orders
H04L 47/6275 - Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
H04L 47/629 - Ensuring fair share of resources, e.g. weighted fair queuing [WFQ]
H04L 47/76 - Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
H04L 47/762 - Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions triggered by the network
H04L 49/9005 - Buffering arrangements using dynamic buffer space allocation
H04L 49/9047 - Buffering arrangements including multiple buffers, e.g. buffer pools
H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
H04L 69/28 - Timers or timing mechanisms used in protocols
H04L 69/40 - Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection
86.
AUTOMATED POWER CONSUMPTION MANAGEMENT THROUGH APPLYING OF A SYSTEM POWER CAP ON HETEROGENOUS SYSTEMS
Automated systems and methods are provided for distributing a system power cap amongst system equipment for efficient utilization of power cap ranges without requiring an understanding of intricacies of the system architecture. Examples of the systems and methods automatically, responsive to trigger events, distribute the system power cap amongst system equipment. Another example provides for grouping of system equipment into multiple pools and distributing the system power cap to system equipment on a per-pool basis, according to a prioritized order.
In some examples, a first computing node receives a write request, where the first computing node is part of a collection of multiple computing nodes, and a plurality of virtual processors are executable in the multiple computing nodes to manage access of data in a shared storage system. In response to the write request, a first virtual processor at the first computing node sends, to a second virtual processor, a request for metadata stored by the second virtual processor. The first virtual processor updates an intent structure in a nonvolatile memory with information indicating an intent to write data for the write request. In response to the metadata received at the first virtual processor from the second virtual processor, a write of the data is initiated to cause storage of the data in the shared storage system.
In an example implementation consistent with the features disclosed herein, publisher-subscriber message mapping is performed. A message is received from a publisher, with the message including a first topic. The first topic includes a gateway identifier of a gateway for the publisher. The gateway identifier is then mapped to a user identifier. The first topic of the message is modified to a second topic by replacing the gateway identifier with the user identifier. The message is then sent to a subscriber that is subscribed to the second topic.
H04L 67/12 - Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Systems and methods of routing a data communication across a network having a plurality switches are provided by monitoring the operation of the plurality of global links to determine which of the plurality of global links provide working paths. A routing table indicative of a status for the plurality of links is maintained, where the routing table provides weighting for each of the working paths. When routing, a link using a weighted pseudo-random selection from the choices available in the routing table is selected. Routing along one of the working paths commensurate with the selected link is performed, and the weighting is updated based upon the operation of the plurality of links.
G06F 12/0862 - Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches with prefetch
G06F 12/1036 - Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] for multiple virtual address spaces, e.g. segmentation
G06F 12/1045 - Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] associated with a data cache
G06F 13/14 - Handling requests for interconnection or transfer
G06F 13/16 - Handling requests for interconnection or transfer for access to memory bus
G06F 13/28 - Handling requests for interconnection or transfer for access to input/output bus using burst mode transfer, e.g. direct memory access, cycle steal
H04L 47/24 - Traffic characterised by specific attributes, e.g. priority or QoS
H04L 47/2441 - Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
H04L 47/2466 - Traffic characterised by specific attributes, e.g. priority or QoS using signalling traffic
H04L 47/2483 - Traffic characterised by specific attributes, e.g. priority or QoS involving identification of individual flows
H04L 47/30 - Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes
H04L 47/32 - Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
H04L 47/34 - Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers
H04L 47/52 - Queue scheduling by attributing bandwidth to queues
H04L 47/62 - Queue scheduling characterised by scheduling criteria
H04L 47/625 - Queue scheduling characterised by scheduling criteria for service slots or service orders
H04L 47/6275 - Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
H04L 47/629 - Ensuring fair share of resources, e.g. weighted fair queuing [WFQ]
H04L 47/76 - Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
H04L 47/762 - Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions triggered by the network
H04L 49/9005 - Buffering arrangements using dynamic buffer space allocation
H04L 49/9047 - Buffering arrangements including multiple buffers, e.g. buffer pools
H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
H04L 69/28 - Timers or timing mechanisms used in protocols
H04L 69/40 - Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection
90.
METHOD AND SYSTEM FOR PROVIDING NETWORK INGRESS FAIRNESS BETWEEN APPLICATIONS
Methods and systems are provided to facilitate network ingress fairness between applications. At an ingress port of a network, the applications providing data communications are reviewed so that and arbitration process can be used to fairly allocate bandwidth at that ingress port. In a typical process, the bandwidth is allocated based upon the number of flow channels, irrespective of the source and characteristics of those flow channels. At the ingress port, an examination of the application providing the data communication will allow for a more appropriate allocation of input bandwidth.
G06F 12/0862 - Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches with prefetch
G06F 12/1036 - Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] for multiple virtual address spaces, e.g. segmentation
G06F 12/1045 - Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] associated with a data cache
G06F 13/14 - Handling requests for interconnection or transfer
G06F 13/16 - Handling requests for interconnection or transfer for access to memory bus
G06F 13/28 - Handling requests for interconnection or transfer for access to input/output bus using burst mode transfer, e.g. direct memory access, cycle steal
H04L 47/24 - Traffic characterised by specific attributes, e.g. priority or QoS
H04L 47/2441 - Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
H04L 47/2466 - Traffic characterised by specific attributes, e.g. priority or QoS using signalling traffic
H04L 47/2483 - Traffic characterised by specific attributes, e.g. priority or QoS involving identification of individual flows
H04L 47/30 - Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes
H04L 47/32 - Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
H04L 47/34 - Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers
H04L 47/52 - Queue scheduling by attributing bandwidth to queues
H04L 47/62 - Queue scheduling characterised by scheduling criteria
H04L 47/625 - Queue scheduling characterised by scheduling criteria for service slots or service orders
H04L 47/6275 - Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
H04L 47/629 - Ensuring fair share of resources, e.g. weighted fair queuing [WFQ]
H04L 47/76 - Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
H04L 47/762 - Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions triggered by the network
H04L 49/9005 - Buffering arrangements using dynamic buffer space allocation
H04L 49/9047 - Buffering arrangements including multiple buffers, e.g. buffer pools
H04L 67/1097 - Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
H04L 69/28 - Timers or timing mechanisms used in protocols
H04L 69/40 - Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection
A system monitors metrics relating to link flapping associated with a physical link in a ring network. Network management traffic is transported via a first VLAN and customer data traffic is transported via a second VLAN. The system maintains a signal fail state for the ring network based on the monitored metrics. If a first condition associated with the first VLAN is detected, the system disallows customer data traffic on the second VLAN. If a second condition associated with the monitored metrics is detected, the system disallows network management traffic on the first VLAN and disallows customer data traffic on the second VLAN, resulting in the signal fail state. If the second condition is no longer met, the system allows network management traffic on the first VLAN. If the first condition is no longer met, the system allows customer data traffic on the second VLAN, resulting in the idle state.
H04L 43/0811 - Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
92.
OBTAINING PRE-SHARED KEYS FOR WIRELESS DEVICES USING A REFERENCE SHARED WITH THE WIRELESS DEVICES
In some examples, a system receives, from an identity and access management server, information of whether a portal for obtaining pre-shared keys (PSKs) is enabled. Responsive to receiving an indication that the portal for obtaining PSKs is enabled, the system adds, to a policy, a service set identifier (SSID) that is associated with use of a multi-pre-shared key (MPSK) arrangement. The system retrieves, in response to the policy, a reference useable by wireless devices to obtain respective PSKs of the wireless devices, and outputs a representation of the reference to share with the wireless devices to obtain from the portal the respective PSKs by the wireless devices for connecting to the WLAN.
In some examples, a system including physical graphics processing units (GPUs) receives a request to schedule a new job to be executed in the system that is accessible by a plurality of tenants to use the physical GPUs. The system allocates the new job to a collection of vGPUs of the physical GPUs based on an operational cost reduction objective to reduce a cost associated with a usage of the physical GPUs and based on a tenant isolation constraint to provide tenant isolation wherein a single tenant of the plurality of tenants is to use a physical GPU at a time.
A chassis for an electronic device includes a tray and a frame. The tray is removably coupled to the frame and includes engagement members to engage with complementary engagement members of electronic modules mounted to the tray. The engagement members include pairs of engagement members disposed adjacent to each other on the tray. The engagement members in each of a first pair and a second pair are spaced apart from each other by a first distance. The first pair and the second pair of engagement members are spaced apart from each other by a second distance different from the first distance. The engagement members are configured to allow for mounting of a first electronic module having a first width to the tray and to allow for mounting of a second electronic module having a second width to the tray, where the second width is different from the first width.
Systems and methods are provided for determining a root cause of an access point (AP) failure or error even with the AP is unable to communicate or interact with a network management system (NMS). The AP may transmit health information (that can reflect the cause of the AP failure) in an information element (IE) that can be included in a beacon frame or other data frame transmitted by the AP. The IE can be relayed to the NMS by one or more APs that neighbor the failed or errant AP or a client device capable of consuming the IE.
H04L 41/0631 - Management of faults, events, alarms or notifications using analysis of correlation between notifications, alarms or events based on decision criteria, e.g. hierarchy, tree or time analysis
H04L 41/0654 - Management of faults, events, alarms or notifications using network fault recovery
96.
MULTI AP MICROBRANCH DEPLOYMENT CONFIGURATION BASED ON OPTIMIZED PACKET FORWARDING
Systems and methods are provided for authenticating client devices in microbranch deployment. In response to a client device connecting to a LAN AP, a first client-entry associated with the client device can be created to indicate that the client device is local to the LAN AP. An authentication request can be transmitted to a WAN AP to be forwarded to an authentication server. A second client-entry associated with the client device at the WAN AP can be created based on the authentication request. Upon successful authentication, the second client-entry can be designated as being foreign to the WAN AP based on the first client-entry being local to the LAN AP. Accordingly, data packets from the client device can be analyzed via a first firewall of the LAN AP, while bypassing a second firewall of the WAN AP based on the foreign designation of the second client-entry at the WAN AP.
Examples of the present technology provide automated CI/CD systems that unify the CI/CD methodology for virtualized and containerized software environments. To realize this unification, CI/CD systems of the present technology are intelligently designed to leverage a common set of inputs (i.e., artifacts and deployment descriptors) that can facilitate automatic deployment of the software system in either a virtualized environment, a containerized environment, or both. Accordingly, CI/CD systems of the present technology provide a flexible software development tool that facilitates efficient, and automated deployment of software systems in both virtualized and containerized environments.
In some examples, a virtual manager in an electronic device generates a seed based on a first key stored in a physical security processor of the electronic device. The virtual manager initializes a virtual security processor by providing the seed to the virtual security processor. The electronic device creates, in the virtual security processor, a virtual security processor key based on the seed, and a virtual security processor certificate based on the virtual security processor key. The virtual security processor key is bound to the physical security processor based on the virtual security processor key being generated from the first key stored in the physical security processor. An identity of a virtual entity in the electronic device is included in the virtual security processor certificate.
H04L 9/32 - Arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system
A first hypervisor running on a first processor cluster is provided. During operation, the first hypervisor can determine a first set of processing nodes and a first memory unit of the first processor cluster in response to the booting up of a first Basic Input/Output System (BIOS) of the first processor cluster. The first hypervisor can discover a second hypervisor running on a second processor cluster comprising a second set of processing nodes and a second memory unit. The first hypervisor can operate, with the second hypervisor, a distributed system comprising the first and second sets of processing nodes and the first and second memory units. The first hypervisor can then operate, with the second hypervisor, a global virtual machine on the distributed system. The virtual memory space of the global virtual machine can be mapped to respective memory spaces of the first and second processor clusters.
