Abstract: In at least some embodiments, a multicast communication system includes sender and a plurality of receivers in communication with the sender. The sender is configured to multicast a data packet to the plurality of receivers. The plurality of receivers are configured to acknowledge the data packet received from the sender based on weakest member selection without a sender-side competitive time window.

Abstract: An apparatus comprising a path computation element (PCE) associated with a domain in a network and configured to find a segment of a Multiprotocol Label Switching (MPLS) Traffic Engineering (TE) Label Switched Path (LSP) that crosses a plurality of domains in the network using a Constraint Shortest Path First (CSPF) algorithm or a reverse CSPF algorithm that computes a plurality of shortest paths in the domain of which the segment is selected, wherein the CSPF algorithm or the reverse CSPF algorithm is selected to reduce the number of shortest path computations in the domain based on the number of starting nodes and ending nodes that are considered for computing the shortest paths in the domain.

Abstract: Disclosed is an apparatus comprising a first network node configured to transmit a first message to a second network node, wherein the first message comprises data designating the first network node as a member of a first multicast channel, and wherein the first message comprises data indicating a network address a third network node that is designated as a last hop router (LHR) of the first multicast channel. Also disclosed is a method comprising sending, by a first network node, a protocol independent multicast (PIM) join message, wherein the PIM join message comprises the network address of a PIM channel last hop router (LHR).

Abstract: An apparatus comprising a network node configured to communicate with a plurality of other network nodes via one or more logic links using protocol independent multicast (PIM), wherein the network node is further configured to transmit a PIM message comprising quality of service (QoS) data to at least one of the other network nodes. Also disclosed is a method comprising receiving, by a first network node, a first PIM join message comprising QoS data from a second network node, wherein the second network node is downstream from the first network node. Also disclosed is a method comprising: sending, by a first network node, a first PIM message comprising QoS data to a second network node, wherein the second network node is upstream from the first network node.

Abstract: The disclosure includes a method comprising: receiving, by a first network element, a first communication from a client device, wherein the first communication comprises a multicast channel membership query report and QoS data. The disclosure also includes a method comprising: receiving, by a first network element, a first communication from a client device, wherein the first communication comprises a multicast channel membership query report and QoS data. The disclosure also includes an apparatus comprising: a client device connected to a network element and a network via the first network element, wherein the client device is configured to send a multicast channel membership report indicating the client device wishes to receive a multicast channel communication and indicating requested QoS data relating to the multicast channel communication.

Abstract: An Autonomous System domain comprising a topology transparent zone comprising a plurality of topology transparent zone nodes at least some of which are topology transparent zone edge nodes, wherein the topology transparent zone nodes are interconnected with one another via a plurality of internal links, and a plurality of neighboring external nodes connected to the topology transparent zone edge nodes via a plurality of external links, wherein no link state advertisements (LSAs) describing the internal links are distributed to the neighboring external nodes.

Abstract: An apparatus comprising a processor configured to migrate load from a source process running on the processor to a target process running on a peer processor in a dynamic manner by monitoring an amount of resources used by the source process, wherein the load is migrated when the amount of resources utilized by the source process exceeds a threshold. Also disclosed is a network component comprising a first processor configured to select a source process to migrate a load from the first processor based on available resources on the first processor and the source process; and a second processor configured upon receiving a migration request from the first processor to one of select and start a target process to which to migrate the load based on available resources for the second processor and the target process.

Abstract: An apparatus comprising a proxy configured to couple to a sender and a receiver and to receive data from the sender at a first rate and forward the data to the receiver at a second rate that is less than the first rate. A method comprising detecting a reception speed for each of a plurality of receivers in a multicast group, assigning the receivers to a first group and a second group based on the reception speed of each of the receivers, wherein the first group has a reception speed that is faster than a reception speed of the second group, and sending multicast data intended for all of the receivers to the receivers in the first group and to a proxy at a first rate, wherein the proxy buffers the multicast data and sends the multicast data to the receivers in the second group at a second rate.

Abstract: An apparatus comprising a processor configured to discover one or more peer processors associated with a network component in a dynamic manner by detecting an announcement message from a peer processor, wherein the announcement message is multicast from the peer processor when the peer processor is added or activated on the network component.

Abstract: An apparatus comprising a processor configured to startup a new process on a peer processor to off-load a load of a local process on the processor in a dynamic manner based on monitoring an amount of resources used by the processor, wherein the startup of the new process on the peer processor is initiated when the amount of resources used by the local process reaches a threshold.

Abstract: In at least some embodiments, a multicast communication system includes sender and a plurality of receivers in communication with the sender. The sender is configured to multicast a data packet to the plurality of receivers.

Abstract: A communication system, comprising a multicast group address allocator in communication with a plurality of nodes configured as at least one multicast group, wherein, upon creation of a new multicast group from among the nodes, the multicast group address allocator is configured to assign a multicast address to the new multicast group based on the assigned multicast address falling into a hash-bin for each group member of the new multicast group. A multicast group address allocator, comprising a network interface in communication with a plurality of nodes, a controller coupled to the network interface, and a storage medium coupled to the controller, wherein, upon request, the controller assigns a multicast address to a new multicast group from among the nodes, wherein the controller accesses hash-bin information for the nodes and selects the multicast address based on the hash-bin information, and wherein the hash-bin information is stored in the storage medium.

Abstract: An apparatus comprising: a first Border Gateway Protocol (BGP) device configured to communicate with a second BGP device and implement grouped route withdrawals with the second BGP device. A method comprising: announcing, by a BGP speaker, a plurality of grouped routes, and withdrawing, by the BGP speaker, a plurality of previously announced grouped routes.

Abstract: An apparatus comprising at least one processor configured to implement a method comprising analyzing a plurality of tasks, determining a privilege level for each of the task, determining a schedule for each of the tasks, and scheduling the tasks for execution based on the privilege level and the schedule of each task. Included is a memory comprising instructions for determining a privilege level for each of a plurality of tasks, wherein the privilege levels comprise periodic real-time, aperiodic real-time, and non-real time, determining an execution time for each of the tasks, and scheduling the tasks for execution on a processor based on the privilege level and the execution time of each task.

Abstract: Methods and apparatuses are provided for searching a least-cost path between a source node and a destination node in a communication network. A set of costs associated with least-cost paths from the source node to a set of intermediate nodes is first determined. A least-cost path in a reverse direction from the destination node to an intermediate node is also determined. The intermediate node is selected based at least on a first cost associated with the least-cost path from the destination node to the intermediate node, and a second cost associated with a least-cost path from the source node to the intermediate node that was first determined. Accordingly, the least-cost path between the source node and the destination node might then be calculated by using the second cost as heuristic information.

Abstract: Providing different levels of quality of service for different data flows being transported over a data link requires a very fast way to classify individual packets. Providing meaningful classification generally requires classifying data packets in several dimensions. A classification method represents a rule base as a hierarchy of linked tables and sequentially matches each parameter value in a packet signature against tables in the hierarchy. The method supports longest prefix matching and avoids time consuming backtracking by adding rules to the rule base.

Abstract: Providing different levels of quality of service for different data flows being transported over a data link requires a very fast way to schedule individual packets for forwarding on the data link. The invention provides scheduling methods which give preference to higher priority packets while treating lower priority packets fairly. The methods can provide shorter latencies for higher priority packets than can many prior scheduling methods. The methods and apparatus of the invention are readily adaptable for use with scheduling rules provided in the form of hierarchical policy trees.

Abstract: Providing different levels of quality of service for different data flows being transported over a data link requires a very fast way to classify individual packets. Providing meaningful classification generally requires classifying data packets in several dimensions. A classification method processes multiple parameter values for a packet in parallel to obtain answer sets indicating which rules are matched by each parameter value. Answer indexes identify logical blocks in each answer set which contain TRUE values. The method performs an AND operation on the answer indexes to identify those blocks in the answer sets which could contain bits corresponding to matched rules. An AND operation is performed on the identified blocks to identify the particular rule matched by the packet. The classification method allows extremely fast wire speed packet classification.