Abstract:
Techniques for using Network Address Translation (NAT), Mobile Internet Protocol (MIP), and/or other techniques in conjunction with Domain Name System (DNS) to anonymize server-side addresses in data communications and verify an authenticity of a client device attempting to use a virtual IP (VIP) address. Rather than having DNS provide a client device with an IP address of an endpoint device, such as a server, the DNS instead returns a VIP address that is mapped to the client device and the endpoint device. The client device may then communicate data packets to the server using the VIP address as the destination address, and a virtual network service that works in conjunction with DNS can verify an authenticity of the client device and convert the VIP address to the actual IP address of the server using NAT and forward the data packet onto the server.
Abstract:
A power source that supplies power to authorized computing devices generates a query requesting the power usage of the computing devices over a predetermined time period. Each computing device receives the query and provides a response with an indication of the measured or estimated power usage during the predetermined time period. The power source adds up the power usage of each authorized computing device to determine a difference between the reported power usage and the power supplied to the authorized computing devices. The power source may mitigate any discrepancy by cutting off power to ports that are providing more power than is being reported as consumed by the authorized computing devices.
Abstract:
Various methods, systems, and/or processes are described herein that rely on a demand-based optimization logic that aims to improve wireless network performance. It involves selecting a floorplan, identifying access points associated with the floorplan, and assessing network demands of client devices within the area. Based on the demands, a demand-based power configuration is generated to adjust the output power of one or more access points. This configuration is transmitted to the identified access points to optimize network performance. By adjusting the power of access points to match the needs of client devices, more efficient and effective wireless network usage is realized.
Abstract:
Various methods, systems, and/or processes are described herein that can operate on a minimally energized power level to detect motion and paths of motion within an environment. A device suitable for carrying out these operations may include an energization optimization logic which can be responsible for selecting a floorplan, identifying access points associated with the floorplan, determining identities, such as persons, located within the floorplan, and tracking their motion. Once this information is gathered, the logic determines a reduced power configuration and passes it to various access points in the floorplan area to reduce the energy consumption based on the configuration. This allows for energy optimization while still maintaining the tracked motion of the identities within the floorplan. The logic allows for efficient power usage in areas with high traffic flow, while still maintaining the quality of service for the identities within the space, which can change dynamically over time.
Abstract:
Described herein are devices, systems, methods, and processes for managing power congestion in multi-path routing systems. Indications may be similar to the ECN, and may be used in network headers, including headers for IPv6, SRv6, NSH, or other tunneling protocols. The indications, namely EOPN, PTE, and ECMP-exclude, can provide a mechanism for managing network power consumption and controlling ECMP routing based on flow priority and characteristics. The power budget can be dynamically adjusted based on the current power source mix, which may help to achieve sustainability goals. Hashing optimizations and signaling can be utilized to manage network power congestion and bandwidth-normalized power efficiency availability. A process may be implemented to ensure there is sufficient capacity to serve the expected traffic for different next-hop paths. Additionally, the ECN can be used to quickly react to congestion, bring capacity back online, and maintain optimal network performance, even in the absence of congestion.
Abstract:
Stateless network address privacy may be provided. A data packing may be received with an obfuscated destination address and an un-obfuscated source address. An un-obfuscated destination address may be determined based on the obfuscated destination address. An obfuscated source address may be determined based on the un-obfuscated source address. The obfuscated destination address may be replaced with the un-obfuscated destination address and the un-obfuscated source address may be replaced with the obfuscated source address. The packet may be forwarded.
Abstract:
An aspect of the present disclosure aims to reduce problems associated with data acquisition of a rule set. Systems and methods enabling a semantic reasoner to stage acquisition of data objects necessary to bring each of the rules stored in the knowledge base to a conclusion are disclosed. To that end, a dependency chain is constructed, identifying whether and how each rule depends on other rules. Based on the dependency chain, the rules are assigned to difference epochs and reasoning engine is configured to perform machine reasoning over rules of each epoch sequentially. Moreover, when processing rules of each epoch, data objects referenced by the rules assigned to a currently processed epoch are acquired according to a certain order established based on criteria such as e.g. cost of acquisition of data objects. Such an approach provides automatic determination and just-in-time acquisition of data objects required for semantic reasoning.
Abstract:
An example method for facilitating network control and management using semantic reasoners in a network environment is provided and includes generating a fully populated semantics model of the network from network data according to a base network ontology of the network, mapping the fully populated semantics model to a network knowledge base, feeding contents of the network knowledge base to a semantic reasoner, and controlling and managing the network using the semantic reasoner. In specific embodiments, generating the model includes receiving the network data from the network, parsing the network data, loading the parsed network data into in-memory data structures, accessing a manifest specifying binding between a network data definition format and ontology components of the base network ontology, identifying ontology components associated with the network data based on the manifest, and populating the identified ontology components with individuals and properties from the corresponding data structures.
Abstract:
An aspect of the present disclosure aims to reduce problems associated with data acquisition of a rule set. Systems and methods enabling a semantic reasoner to stage acquisition of data objects necessary to bring each of the rules stored in the knowledge base to a conclusion are disclosed. To that end, a dependency chain is constructed, identifying whether and how each rule depends on other rules. Based on the dependency chain, the rules are assigned to difference epochs and reasoning engine is configured to perform machine reasoning over rules of each epoch sequentially. Moreover, when processing rules of each epoch, data objects referenced by the rules assigned to a currently processed epoch are acquired according to a certain order established based on criteria such as e.g. cost of acquisition of data objects. Such an approach provides automatic determination and just-in-time acquisition of data objects required for semantic reasoning.
Abstract:
An example method executed by a semantic reasoner is disclosed. The method includes identifying, from a plurality of rules, one or more pairs of chained rules, and, from the one or more pairs of chained rules, assigning rules chained together to a respective rule-set of P rule-sets. The method also includes assigning individuals, from a plurality of individuals referenced by the plurality of rules, referenced by each rule-set of the P rule-sets to an individual-set associated with the each rule-set and mapping the rules from the each rule-set and the individuals from the individual-set associated with the each rule-set into a respective knowledge base instance associated with the each rule-set. Such a method ensures knowledge completeness and sound inference while allowing parallel semantic reasoning within a given stream window.