Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A path computation client (PCC) comprising: a non-transitory memory comprising programs; and a processor coupled to the processor, wherein the processor is configured to execute the programs to: receive at least one packet containing at least one label and at least a branch object; decode the branch object received to: identify if the downloading of labels is corresponding to a point-to-multipoint traffic engineering label switch path (P2MP TE LSPs); and operate as a branch node for the label switch path received in the packet; and thereby fetch at least one outgoing label specified in the branch object and associated with at least a next hop address of at least one corresponding node on the P2MP TE LSPs.
This invention relates to network routing, specifically optimizing label switching in point-to-multipoint traffic engineering label switched paths (P2MP TE LSPs). The problem addressed is efficient label distribution and branch node operation in P2MP networks, where multiple downstream nodes receive traffic from a single source. The system includes a path computation client (PCC) with a processor and memory storing programs. The PCC receives packets containing labels and a branch object. The branch object is decoded to determine if label downloading pertains to P2MP TE LSPs. If confirmed, the PCC operates as a branch node, fetching outgoing labels specified in the branch object. These labels are associated with next-hop addresses of downstream nodes on the P2MP TE LSP, enabling proper traffic forwarding. The invention improves label management in P2MP networks by automating branch node operations, reducing manual configuration, and ensuring accurate label distribution across multiple paths. The PCC dynamically processes branch objects to identify P2MP TE LSPs and retrieve necessary labels for downstream nodes, enhancing scalability and reliability in multicast routing.
2. The PCC as claimed in claim 1 , wherein the packet is a PCLabelUpd message, the PCLabelUpd message comprise a PCLabelUpd message format configured to specify the labels and a corresponding action associated with the label using the branch object for a point-to-multipoint traffic engineering label switch path (P2MP TE LSPs).
This invention relates to packet-switched communication networks, specifically to the management of point-to-multipoint traffic engineering label switch paths (P2MP TE LSPs) in label-switched networks. The problem addressed is the efficient distribution and updating of labels and associated actions for P2MP TE LSPs, ensuring proper routing and forwarding of multicast traffic in a scalable manner. The invention describes a Packet Control Channel (PCC) that processes a PCLabelUpd message, which is a control message used to convey label and action information for P2MP TE LSPs. The PCLabelUpd message includes a structured format that specifies labels and their corresponding actions, such as forwarding, dropping, or modifying packets. The message uses a branch object to define how labels are applied at branching points in the network, allowing for dynamic updates to the label forwarding state across multiple paths in a P2MP TE LSP. This ensures that multicast traffic is correctly routed to all intended destinations while maintaining network efficiency and scalability. The invention improves upon existing methods by providing a standardized and flexible way to manage label distribution in P2MP TE LSPs, reducing complexity and improving reliability in multicast traffic engineering.
3. The PCC as claimed in claim 1 , wherein the label is a multiprotocol label switching (MPLS) label.
A system for packet classification and processing in a network environment addresses the challenge of efficiently categorizing and handling data packets based on their content or attributes. The system includes a packet classification component (PCC) that examines incoming packets and assigns them to predefined categories or classes. This classification is used to determine how the packets should be processed, routed, or prioritized within the network. The PCC incorporates a labeling mechanism to mark packets with specific identifiers, enabling downstream network devices to quickly recognize and apply appropriate handling rules. In this particular implementation, the label used by the PCC is a Multiprotocol Label Switching (MPLS) label. MPLS is a high-performance routing technique that uses short path labels to make data forwarding decisions, improving speed and efficiency in packet forwarding. The PCC may also include a classification engine that analyzes packet headers or payloads to determine their class, and a processing module that applies predefined actions based on the classification results. These actions can include routing, prioritization, or modification of the packet. The system is designed to operate in real-time, ensuring minimal latency while maintaining accurate classification and processing of network traffic. This approach enhances network performance by optimizing resource utilization and ensuring that packets are handled according to their specific requirements.
4. The PCC as claimed in claim 1 , wherein the packet containing the label and the branch object is received from at least one path computation element central controller (PCECC), in a form of PCLabelUpd message, the branch object is configured to carry at least one outgoing label, encoded in the packet, associated with at least a next hop address of at least one corresponding node in the network.
This invention relates to network communication protocols, specifically in the domain of path computation and label distribution for packet-switched networks. The problem addressed is the efficient distribution and management of labels and routing information in networks that utilize centralized path computation elements (PCEs) to determine optimal paths for data transmission. The invention describes a packet containing a label and a branch object, which is received from a path computation element central controller (PCECC). The packet is transmitted in the form of a PCLabelUpd message, a standardized communication format for label updates. The branch object within the packet carries at least one outgoing label, which is encoded and associated with a next-hop address of a corresponding node in the network. This allows the receiving node to forward packets along the computed path using the provided label and next-hop information. The branch object enables the network to support multi-path routing by carrying multiple outgoing labels, each associated with a different next-hop address. This ensures that the network can efficiently distribute traffic across multiple paths, improving load balancing and resilience. The use of a centralized PCECC ensures that path computations are performed in a coordinated manner, reducing the complexity of individual nodes while maintaining optimal routing decisions. The invention enhances the scalability and reliability of label-switched networks by leveraging centralized control and standardized message formats for label distribution.
5. The PCC as claimed in claim 4 , wherein the processor is further configured to download the labels associated with the corresponding node, received in the PCLabelUpd message in encoded form, in the network of point-to-multipoint traffic engineering label switch path (P2MP TE LSPs).
This invention relates to network communication systems, specifically point-to-multipoint traffic engineering label switch paths (P2MP TE LSPs) in packet-switched networks. The problem addressed is the efficient distribution and management of labels in P2MP TE LSPs, where multiple nodes receive traffic from a single source. The invention involves a Packet Control Channel (PCC) system that includes a processor configured to handle label updates for nodes in the network. The processor receives a PCLabelUpd message containing encoded labels associated with corresponding nodes. The system decodes these labels and distributes them to the appropriate nodes in the P2MP TE LSP network. This ensures that each node can correctly process and forward traffic along the established paths. The invention improves network efficiency by reducing the overhead of label distribution and ensuring accurate label management in complex P2MP TE LSP configurations. The processor may also perform additional functions such as validating the received labels and managing label conflicts to maintain network integrity. The system is particularly useful in large-scale networks where dynamic label updates are required to support changing traffic patterns and network conditions.
6. The PCC as claimed in claim 1 , wherein the processor is further configured to download the labels specified in the branch object to data plane for a P2MP TE LSP.
A system for managing point-to-multipoint (P2MP) traffic engineering label-switched paths (TE LSPs) in a network. The system includes a path computation client (PCC) that interacts with a path computation element (PCE) to establish and manage P2MP TE LSPs. The PCC includes a processor configured to request path computations from the PCE, receive computed paths, and configure network devices to establish the P2MP TE LSPs based on the received paths. The processor is further configured to download labels specified in a branch object to the data plane of network devices. The branch object defines branching points and associated labels for the P2MP TE LSP, enabling the data plane to forward traffic along the computed paths. This system addresses the challenge of efficiently managing and configuring P2MP TE LSPs in large-scale networks, ensuring proper label distribution and traffic forwarding. The processor's ability to download labels to the data plane ensures that network devices can correctly process and forward traffic along the P2MP TE LSP, improving network efficiency and reliability.
7. A method comprising: Receiving, by a path computation client (PCC), at least one packet containing at least one label and at least a branch object; Decoding, by the PCC, the branch object received; Identifying, by the PCC, if the downloading of labels is corresponding to a Point-to-multipoint traffic engineering label switch path (P2MP TE LSPs); operating as a branch node for the label switch path received in the packet; and thereby Fetching, by the PCC, at least one outgoing label specified in the branch object and associated with at least a next hop address of at least one corresponding node on the P2MP TE LSPs.
This invention relates to network routing, specifically optimizing label distribution in Point-to-Multipoint Traffic Engineering Label Switched Paths (P2MP TE LSPs). The problem addressed is efficient label management in branch nodes of P2MP networks, where multiple downstream paths must be established from a single upstream source. The method involves a Path Computation Client (PCC) receiving packets containing labels and branch objects. The PCC decodes the branch object to determine if the labels pertain to P2MP TE LSPs. If confirmed, the PCC operates as a branch node, fetching outgoing labels specified in the branch object. These labels are associated with next-hop addresses of downstream nodes on the P2MP TE LSPs, enabling proper forwarding of traffic to multiple destinations. The branch object contains instructions for label distribution, allowing the PCC to dynamically assign and manage labels for each downstream path. This ensures efficient traffic engineering in multicast or multipoint network scenarios, reducing overhead and improving scalability. The solution automates label handling at branch points, eliminating manual configuration and improving network adaptability.
8. The method as claimed in claim 7 , wherein the packet is a PCLabelUpd message, the PCLabelUpd message comprise a PCLabelUpd message format configured to specify the labels and a corresponding action associated with the label using the branch object for a point-to-multipoint traffic engineering label switch path (P2MP TE LSPs).
This invention relates to network communication protocols, specifically methods for managing point-to-multipoint traffic engineering label switch paths (P2MP TE LSPs) in packet-switched networks. The problem addressed is the need for efficient label management in P2MP TE LSPs, where multiple downstream nodes receive traffic from a single upstream source. Traditional methods lack a standardized way to update labels and associated actions dynamically, leading to inefficiencies in network resource utilization and traffic engineering. The invention describes a method for updating labels in P2MP TE LSPs using a specialized message format called PCLabelUpd. This message format is designed to specify labels and their corresponding actions, such as label assignment or removal, for downstream nodes. The PCLabelUpd message includes a branch object that identifies the specific P2MP TE LSP and its branches, allowing precise control over label updates. The method ensures that label updates are propagated correctly across the network, maintaining synchronization between the upstream source and downstream nodes. This approach improves traffic engineering flexibility and reduces the risk of misconfigured labels in P2MP TE LSPs. The invention is particularly useful in large-scale networks where dynamic label management is critical for optimal performance.
9. The method as claimed in claim 7 , wherein the label is a Multiprotocol Label Switching (MPLS) label.
A method for network communication involves routing data packets through a network using label-based forwarding. The method includes assigning a label to a data packet, where the label is a Multiprotocol Label Switching (MPLS) label, which is a short, fixed-length identifier used to forward packets efficiently across network nodes. The label is added to the packet header, allowing network devices to make forwarding decisions based on the label rather than examining the entire packet. This approach improves routing speed and reduces processing overhead. The method further involves transmitting the labeled packet through the network, where intermediate nodes use the MPLS label to determine the next hop without deep packet inspection. The use of MPLS labels enables traffic engineering, quality of service (QoS) management, and virtual private network (VPN) support by providing a scalable and flexible forwarding mechanism. The method ensures efficient packet forwarding while maintaining network performance and reliability.
10. The method as claimed in claim 7 , wherein the branch object, received from at least one path computation element central controller (PCECC), in a form of PCLabelUpd message, is configured to carry at least one outgoing label, encoded in the packet, associated with at least a next hop address of at least one corresponding node in the network.
This invention relates to network routing, specifically optimizing path computation in software-defined networking (SDN) environments. The problem addressed is efficient label distribution and path management in networks using centralized path computation elements (PCEs). Traditional methods often lack flexibility in dynamically updating labels and next-hop addresses, leading to suboptimal routing decisions. The invention describes a method for distributing branch objects in an SDN network. A central controller, such as a PCE Central Controller (PCECC), generates and transmits a PCLabelUpd message containing a branch object. This branch object carries at least one outgoing label encoded within a packet, along with the next-hop address of the corresponding node in the network. The outgoing label is used to identify the next segment of the path, while the next-hop address specifies the immediate destination node. This allows dynamic updates to routing paths without requiring full path recomputation, improving efficiency and adaptability in network traffic management. The method ensures that the branch object can be processed by network nodes to forward packets along the intended path, leveraging centralized control for better coordination. The use of PCLabelUpd messages enables real-time adjustments to labels and next-hop addresses, supporting flexible and scalable routing in large-scale networks. This approach enhances performance by reducing latency and improving resource utilization in SDN deployments.
11. The method as claimed in claim 10 , wherein the method further comprises: downloading, by the PCC, the labels associated with the corresponding node, received in the PCLabelUpd message, in the network of point-to-multipoint traffic engineering label switch path (P2MP TE LSPs).
This invention relates to network traffic engineering, specifically for point-to-multipoint traffic engineering label switch paths (P2MP TE LSPs) in communication networks. The problem addressed is the efficient management and distribution of labels in P2MP TE LSPs, ensuring accurate and synchronized label information across network nodes to maintain optimal traffic routing and forwarding. The method involves a Packet Control Center (PCC) that manages label distribution in a P2MP TE LSP network. The PCC receives a PCLabelUpd message containing labels associated with a specific node in the network. The method further includes the PCC downloading these labels from the corresponding node. This ensures that the PCC has up-to-date label information, which is critical for maintaining proper traffic flow and avoiding misrouting in the P2MP TE LSP infrastructure. The process supports dynamic updates, allowing the network to adapt to changes in label assignments or node configurations without disrupting ongoing traffic. The invention enhances network reliability and efficiency by ensuring that label information is accurately propagated and synchronized across the network. This is particularly important in large-scale or complex networks where multiple nodes must coordinate label usage to maintain seamless traffic engineering. The method may be part of a broader system for managing P2MP TE LSPs, including label assignment, distribution, and synchronization mechanisms.
12. The method as claimed in claim 7 , wherein the method further comprises: downloading the labels specified in the branch object to data plane for a P2MP TE LSP.
A method for managing point-to-multipoint (P2MP) traffic engineering label-switched paths (TE LSPs) in a network involves dynamically distributing label information to network devices in the data plane. The method addresses the challenge of efficiently propagating labels for P2MP TE LSPs, which are used to transmit data from a single source to multiple destinations in a network. The method includes downloading label information specified in a branch object to the data plane of network devices participating in the P2MP TE LSP. This ensures that the network devices have the necessary label information to forward traffic correctly along the P2MP TE LSP. The branch object contains the label mappings required for the P2MP TE LSP, and the method ensures these labels are distributed to the appropriate network devices in the data plane. This approach optimizes label distribution, reducing manual configuration and improving scalability in networks using P2MP TE LSPs. The method may also include other steps such as establishing the P2MP TE LSP, managing label resources, and handling label conflicts to ensure reliable data transmission. The focus is on automating label distribution to support efficient and scalable P2MP traffic engineering in network environments.
13. A non-transitory computer-readable storage medium comprising instructions which, when executed by a computer, cause the computer to carry out the method of claim 7 .
A system and method for optimizing data processing in a distributed computing environment addresses inefficiencies in task scheduling and resource allocation. The invention improves performance by dynamically adjusting task distribution based on real-time system conditions, such as workload imbalance, resource availability, and network latency. The method involves monitoring computational nodes to detect performance bottlenecks, then redistributing tasks to underutilized nodes while prioritizing critical operations. It also includes predictive modeling to anticipate future resource demands and preemptively allocate resources to avoid delays. The system further incorporates fault tolerance mechanisms, such as task migration and checkpointing, to ensure continuity during node failures. The invention is particularly useful in large-scale distributed systems, such as cloud computing platforms and high-performance computing clusters, where efficient resource management is critical for minimizing processing time and maximizing throughput. By dynamically adapting to changing conditions, the system enhances overall system efficiency and reliability.
Unknown
October 13, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.