Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A method comprising: receiving, at a first node associated with a first instance identifier, a packet from a first host addressed to a second host; sending, from the first node to a second node associated with a second instance identifier, the packet from the first host addressed to the second host, wherein sending, from the first node to the second node, the packet from the first host addressed to the second host comprises identifying the second node based on a map-cache entry of the second host stored by the first node; receiving, from the second node, a solicit map-request for the second host, the solicit map-request including the first instance identifier of the first node and the second instance identifier of the second node; sending, in response to receiving the solicit map-request for the second host, a map-request for the second host; receiving, in response to sending the map-request for the second host, a map-reply indicating a third node associated with the second instance identifier; sending, from the first node to the third node, the packet from the first host addressed to the second host; updating the map-cache entry of the second host stored by the first node to include information regarding the third node rather than information regarding the second node; and sending one or more additional map-requests for other instance identifiers of the second host to update additional map-cache entries of the second host stored by the first node.
This invention relates to a method for packet routing in a network environment where nodes dynamically map host identifiers to instance identifiers. The problem addressed is efficient packet forwarding in systems where host locations may change, requiring nodes to update their routing information dynamically. The method involves a first node receiving a packet from a first host destined for a second host. The first node forwards the packet to a second node by consulting a local map-cache entry for the second host. If the second node is not the correct destination, it sends a solicit map-request to the first node, including both instance identifiers. The first node then sends a map-request for the second host, receives a map-reply indicating a third node as the correct destination, and forwards the packet to the third node. The first node updates its map-cache to reflect the third node's association with the second host and sends additional map-requests to ensure other instance identifiers for the second host are updated in its cache. This ensures accurate and up-to-date routing information across the network.
2. The method of claim 1 , further comprising encapsulating the packet with the second instance identifier prior to sending the packet from the first node to the second node.
A method for managing packet transmission in a network involves encapsulating data packets with instance identifiers to ensure proper routing and processing. The method addresses the challenge of efficiently routing packets in complex network environments where multiple instances of network functions may exist, potentially causing routing conflicts or misdelivery. The solution involves assigning a unique instance identifier to each network function instance and encapsulating packets with these identifiers before transmission. This encapsulation ensures that packets are correctly routed to the intended instance, preventing misdelivery and improving network reliability. The method is particularly useful in virtualized or cloud-based networks where multiple instances of the same function may operate simultaneously. By encapsulating packets with instance identifiers, the method enables precise routing and reduces the risk of packet loss or misrouting, enhancing overall network performance and security. The technique can be applied in various network architectures, including software-defined networks (SDNs) and network function virtualization (NFV) environments, where dynamic routing and instance management are critical. The encapsulation step ensures that packets are properly tagged with the correct instance identifier before being sent from one network node to another, maintaining accurate routing throughout the network.
3. The method of claim 1 , wherein the first instance identifier of the first node is included in an Endpoint Identifier (EID)-Prefix field of the solicit map-request.
A system and method for network communication involves a network architecture where nodes are identified by unique instance identifiers. The method addresses the challenge of efficiently locating and communicating with nodes in a network by using a solicit map-request message to discover the network location of a target node. The solicit map-request message includes an Endpoint Identifier (EID)-Prefix field, which contains the instance identifier of the first node. This field allows the network to map the instance identifier to a corresponding network location, enabling efficient routing of messages to the target node. The method ensures that the solicit map-request is processed by intermediate nodes to determine the correct path to the target node, improving communication efficiency and reliability in dynamic network environments. The inclusion of the instance identifier in the EID-Prefix field of the solicit map-request facilitates accurate node discovery and reduces the overhead associated with traditional address resolution mechanisms. This approach is particularly useful in networks where nodes frequently change locations or where network topology is dynamic, ensuring seamless communication without manual configuration. The method enhances scalability and adaptability in network communication systems by leveraging instance identifiers for precise node identification and routing.
4. The method of claim 1 , wherein the second instance identifier of the second node is included in a Source-Endpoint Identifier (EID) field of the solicit map-request.
A system and method for network communication involves nodes exchanging mapping information to facilitate data transmission. The invention addresses the challenge of efficiently locating and communicating with nodes in a network where identifiers may not directly correspond to physical addresses. A first node generates a solicit map-request message to query a second node for its network location. The solicit map-request includes a Source-Endpoint Identifier (EID) field, which contains the second node's instance identifier. This identifier helps the second node recognize the request and respond appropriately. The method ensures that nodes can dynamically discover and communicate with each other by exchanging these identifiers in standardized message fields. The system supports scalable and flexible network communication by allowing nodes to update and share their instance identifiers as needed. This approach improves network efficiency by reducing the need for centralized address resolution and enabling direct communication between nodes. The invention is particularly useful in decentralized or dynamic network environments where nodes frequently change their locations or identifiers.
5. The method of claim 1 , wherein the map-request for the second host includes the first instance identifier of the first node received in the solicit map-request.
A system and method for managing network communications in a distributed computing environment involves nodes that exchange mapping information to facilitate data routing. The problem addressed is the efficient and accurate dissemination of network topology data among nodes to enable reliable communication in dynamic or large-scale networks. The method includes a first node receiving a solicit map-request from a second host, where the solicit map-request includes an instance identifier of the first node. The first node then generates a map-request for the second host, incorporating the received instance identifier. This ensures that the second host can accurately identify and respond to the first node's request, maintaining consistency in the network's mapping data. The process supports dynamic updates to the network topology, allowing nodes to adapt to changes such as node additions, removals, or failures. The method may also involve validating the received instance identifier to prevent unauthorized or malicious requests, enhancing network security. The system is particularly useful in decentralized networks where centralized management is impractical or inefficient.
6. The method of claim 1 , wherein the solicit map-request is received in response to determining that the second host is not associated with the second node.
A method for managing network communications involves dynamically routing requests between hosts and nodes in a distributed system. The problem addressed is inefficient or failed communication when a host attempts to connect to a node it is not associated with, leading to delays or errors. The method includes generating a solicit map-request when a second host attempts to communicate with a second node but is not associated with it. This request triggers a lookup in a mapping system to determine the correct node for the host. The mapping system maintains associations between hosts and nodes, ensuring requests are routed to the appropriate destination. If the second host is not associated with the second node, the solicit map-request is generated to resolve the routing issue. The method may also involve updating the mapping system to reflect new associations or re-routing requests based on the latest mappings. This ensures efficient and accurate communication in dynamic network environments where host-node associations may change frequently. The solution improves reliability and performance by dynamically resolving routing conflicts without manual intervention.
7. The method of claim 1 , wherein the second instance identifier is different than the first instance identifier.
This invention relates to a method for managing identifiers in a distributed computing system, addressing the challenge of ensuring unique instance identification across multiple computing nodes. The method involves generating and assigning instance identifiers to computing instances, where each instance represents a virtual or physical computing resource. The key innovation is the requirement that a second instance identifier must be different from a first instance identifier, preventing conflicts and ensuring proper tracking of distinct instances. This differentiation is critical in environments where multiple instances may be created, modified, or terminated dynamically, such as in cloud computing or containerized applications. The method ensures that each instance can be uniquely referenced, enabling accurate monitoring, management, and communication between instances. By enforcing distinct identifiers, the system avoids collisions and maintains operational integrity, particularly in large-scale or high-availability deployments where instance identifiers must remain unique across the entire system. The solution is applicable to various computing architectures, including virtual machines, containers, and serverless functions, where instance identification is essential for resource allocation, load balancing, and fault tolerance.
8. A first node associated with a first instance identifier, the first node comprising: a network interface; and one or more processors configured to: receive, via the network interface, a packet from a first host addressed to a second host; send, via the network interface to a second node associated with a second instance identifier, the packet from the first host addressed to the second host, wherein the one or more processors being configured to send the packet from the first host addressed to the second host comprises the one or more processors being operative to identify the second node based on a map-cache entry of the second host stored by the first node; receive, via the network interface from the second node, a solicit map-request for the second host, the solicit map-request including the first instance identifier of the first node and second instance identifier of the second node; send, via the network interface in response to receiving the solicit map-request for the second host, a map-request for the second host; receive, via the network interface in response to sending the map-request for the second host, a map-reply indicating a third node associated with the second instance identifier; send, via the network interface to the third node, the packet from the first host addressed to the second host; update the map-cache entry of the second host stored by the first node to include information regarding the third node rather than information regarding the second node; and send one or more additional map-requests for other hosts associated with the second instance identifier to update additional map-cache entries of the other hosts stored by the first node.
This invention relates to a distributed network system where nodes dynamically manage packet routing and address resolution. The problem addressed is efficient and scalable packet forwarding in a network where host locations may change, requiring nodes to dynamically update their routing information. A first node, identified by a first instance identifier, includes a network interface and processors that handle packet forwarding. When the first node receives a packet from a first host destined for a second host, it forwards the packet to a second node identified by a second instance identifier. The first node determines the second node by consulting a local map-cache entry for the second host. If the second node later sends a solicit map-request for the second host, including both instance identifiers, the first node responds by sending a map-request for the second host. The first node then receives a map-reply indicating a third node associated with the second instance identifier, updates its map-cache to replace the second node with the third node, and forwards the original packet to the third node. Additionally, the first node sends further map-requests for other hosts associated with the second instance identifier to update its cache entries for those hosts. This ensures that routing information remains current across the network, improving packet delivery efficiency and reducing latency.
9. The first node of claim 8 , wherein the first instance identifier of the first node is included in an Endpoint Identifier (EID)-Prefix field of the solicit map-request and the second instance identifier of the second node is included in a Source-Endpoint Identifier (EID) field of the solicit map-request.
This invention relates to a network communication system where nodes exchange mapping information to facilitate data routing. The problem addressed is the efficient and accurate transmission of instance identifiers between nodes to establish communication paths in a network, particularly in scenarios where nodes need to dynamically discover and map each other's locations. The system involves a first node and a second node, each having a unique instance identifier. The first node generates a solicit map-request message to query the second node for its location information. The first node's instance identifier is placed in the Endpoint Identifier (EID)-Prefix field of the solicit map-request, while the second node's instance identifier is placed in the Source-Endpoint Identifier (EID) field of the same message. This structured placement ensures that the message can be correctly routed and processed by the second node, enabling the first node to obtain the necessary mapping data to establish a communication path. The invention improves network communication by standardizing the format of solicit map-request messages, reducing errors in identifier transmission, and ensuring that nodes can reliably discover and communicate with each other in dynamic network environments. The use of specific fields for instance identifiers ensures compatibility and interoperability across different network implementations.
10. A non-transitory computer readable storage medium that stores a set of instructions which when executed by a processor perform a method comprising: receiving, at a first node associated with a first instance identifier, a packet from a first host addressed to a second host; sending, from the first node to a second node associated with a second instance identifier, the packet from the first host addressed to the second host, wherein sending, from the first node to the second node, the packet from the first host addressed to the second host includes identifying the second node based on a map-cache entry of the second host stored by the first node; receiving, from the second node, a solicit map-request for the second host, the solicit map-request including the first instance identifier of the first node and the second instance identifier of the second node; sending, in response to receiving the solicit map-request for the second host, a map-request for the second host; receiving, in response to sending the map-request for the second host, a map-reply indicating a third node associated with the second instance identifier; sending, from the first node to the third node, the packet from the first host addressed to the second host; updating the map-cache entry of the second host stored by the first node to include information regarding the third node rather than information regarding the second node; and sending one or more additional map-requests for other instance identifiers of the second host to update additional map-cache entries of the second host stored by the first node.
This invention relates to a distributed network system for efficiently routing packets between hosts using a mapping mechanism. The problem addressed is the need for dynamic and scalable packet forwarding in a network where host locations may change, requiring efficient updates to routing information without disrupting communication. The system involves multiple nodes, each associated with an instance identifier, that facilitate packet delivery between hosts. When a first node receives a packet from a first host destined for a second host, it forwards the packet to a second node based on a cached mapping entry for the second host. If the second node is not the correct destination, it sends a solicit map-request to the first node, which then initiates a map-request to locate the correct node (a third node) associated with the second host. Once the correct node is identified, the first node updates its cache to reflect the third node's information and forwards the packet accordingly. The system also periodically updates its cache entries for the second host by sending additional map-requests to ensure accurate routing. This approach ensures that network nodes maintain up-to-date routing information, minimizing packet loss and improving efficiency in dynamic network environments. The use of cached mappings and on-demand updates reduces latency and overhead in packet forwarding.
11. The non-transitory computer readable storage medium of claim 10 , further comprising encapsulating the packet with the second instance identifier prior to sending the packet from the first node to the second node.
This invention relates to network communication systems, specifically methods for managing packet transmission between nodes in a network. The problem addressed is ensuring reliable and efficient packet delivery in distributed systems where multiple instances of a service may exist, leading to potential routing or processing conflicts. The invention involves a non-transitory computer-readable storage medium containing instructions for a method of transmitting packets between a first node and a second node in a network. The method includes generating a packet at the first node, where the packet is associated with a first instance identifier corresponding to a service instance at the first node. The packet is then encapsulated with a second instance identifier, which corresponds to a service instance at the second node, before being sent from the first node to the second node. This encapsulation ensures that the packet is correctly routed and processed by the intended service instance at the destination node, preventing misrouting or conflicts in distributed environments where multiple instances of a service may operate. The method also involves receiving the encapsulated packet at the second node, where the second instance identifier is used to identify the correct service instance for processing the packet. The encapsulation step ensures that the packet is properly directed to the intended service instance, improving reliability and efficiency in network communication. The invention is particularly useful in distributed systems where service instances may be dynamically created or destroyed, requiring robust mechanisms for packet routing and processing.
12. The non-transitory computer readable storage medium of claim 10 , wherein the first instance identifier of the first node is included in an Endpoint Identifier (EID)-Prefix field of the solicit map-request.
A system and method for network communication involves a non-transitory computer-readable storage medium storing instructions that, when executed, perform operations related to endpoint identifier (EID) mapping in a network. The system includes a first node configured to generate a solicit map-request message to discover the location of a second node within the network. The solicit map-request message includes an EID-Prefix field that contains a first instance identifier of the first node. This identifier helps in uniquely identifying the first node within the network. The system also includes a second node configured to receive the solicit map-request message and respond with a map-reply message that includes a second instance identifier of the second node. The second node may also include a third instance identifier of a third node in the map-reply message, which can be used to facilitate further communication or routing within the network. The system ensures efficient and accurate mapping of endpoint identifiers to their respective network locations, improving communication reliability and reducing latency in network operations. The instructions stored on the medium also handle the generation and processing of these messages, ensuring proper routing and communication between nodes in the network.
13. The non-transitory computer readable storage medium of claim 10 , wherein the second instance identifier of the second node is included in a Source-Endpoint Identifier (EID) field of the solicit map-request.
A system and method for network communication involves a non-transitory computer-readable storage medium storing instructions that, when executed, perform operations related to network mapping and routing. The system addresses the problem of efficiently managing and updating network topology information in a decentralized network environment, particularly in scenarios where nodes need to discover and communicate with other nodes without relying on centralized infrastructure. The system includes a first node that generates a solicit map-request message to discover a second node in the network. The solicit map-request message includes a Source-Endpoint Identifier (EID) field, which contains an identifier of the second node. This identifier, referred to as the second instance identifier, is used to uniquely identify the second node within the network. The system also includes a second node that receives the solicit map-request message and processes it to establish communication with the first node. The second node may respond with a map-reply message to confirm its presence and provide additional routing information. The system further includes a network mapping module that processes the solicit map-request and map-reply messages to update the network topology map, ensuring that nodes can efficiently route data packets to their intended destinations. The network mapping module may also handle conflicts or errors in the mapping process, such as duplicate identifiers or unreachable nodes, to maintain network stability. The overall system enables dynamic and scalable network communication by allowing nodes to autonomously discover and communicate with each other while maintaining an up-to-date network topology map.
14. The non-transitory computer readable storage medium of claim 10 , wherein the map-request for the second host includes the first instance identifier of the first node received in the solicit map-request.
A system and method for managing network communication in a distributed computing environment involves nodes exchanging map-requests to locate resources. The system includes a first node that receives a solicit map-request from a second host, where the solicit map-request includes an instance identifier of the first node. The first node then generates a map-request for the second host, incorporating the first instance identifier from the solicit map-request. This map-request is transmitted to a third node, which processes it to facilitate communication between the first and second hosts. The system ensures efficient resource discovery and routing by leveraging instance identifiers to track and manage communication paths. The method involves receiving a solicit map-request, extracting the instance identifier, generating a new map-request with the identifier, and forwarding it to another node for processing. This approach improves network efficiency by maintaining accurate routing information and reducing redundant communication. The system is particularly useful in large-scale distributed networks where dynamic resource allocation and communication management are critical.
15. The non-transitory computer readable storage medium of claim 10 , wherein the solicit map-request is received in response to determining that the second host is not associated with the second node.
A system and method for managing network communications in a distributed computing environment addresses the challenge of efficiently routing requests between hosts and nodes in a dynamic network topology. The invention involves generating a solicit map-request when a second host attempts to communicate with a second node but is not associated with it. The solicit map-request is transmitted to a network controller, which then determines the appropriate routing path for the request. The network controller may update routing tables or other network configuration data to ensure proper communication between the second host and the second node. The system may also include mechanisms for handling multiple hosts and nodes, dynamically updating network mappings, and optimizing communication paths based on network conditions. The invention improves network efficiency by reducing latency and ensuring reliable communication in distributed systems.
16. The non-transitory computer readable storage medium of claim 10 , wherein the second instance identifier is different than the first instance identifier.
A system and method for managing software instances in a computing environment addresses the challenge of tracking and differentiating multiple instances of the same software application running on different computing devices or virtual machines. The invention provides a way to uniquely identify and manage these instances to prevent conflicts and ensure proper operation. The system generates and assigns unique instance identifiers to each software instance, where each identifier is distinct from others to avoid duplication. These identifiers are stored in a non-transitory computer-readable storage medium, allowing the system to track and reference each instance separately. The identifiers may be used for various purposes, such as logging, monitoring, or coordinating operations between instances. By ensuring that each instance has a unique identifier, the system prevents errors that could arise from overlapping or conflicting instance references, improving reliability and manageability in distributed computing environments. The invention is particularly useful in cloud computing, virtualization, and multi-tenant systems where multiple instances of the same software may run concurrently. The unique identifiers can be generated using algorithms that guarantee uniqueness, such as UUIDs or timestamp-based methods, and may include additional metadata to further distinguish instances. The system may also include mechanisms to validate and update these identifiers as needed, ensuring consistency across the computing environment.
Unknown
August 18, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.