Patent application number | Description | Published |
20090316583 | METHOD AND APPARATUS FOR CALCULATING MPLS TRAFFIC ENGINEERING PATHS - 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. | 12-24-2009 |
20100088706 | User Tolerance Based Scheduling Method for Aperiodic Real-Time Tasks - 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. | 04-08-2010 |
20100265956 | Border Gateway Protocol (BGP) Grouped Route Withdrawals - 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. | 10-21-2010 |
20100272104 | Implementation to Avoid the Acknowledgement-Implosion in a Multicast Group - 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 | 10-28-2010 |
20100272105 | Determining the Group Address for an Ethernet-Based Multicast Communication - 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. | 10-28-2010 |
20120136944 | Method For Dynamic Discovery of Control Plane Resources and Services - 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. | 05-31-2012 |
20120137012 | Method for Dynamic On Demand Startup of a Process or Resource - 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. | 05-31-2012 |
20120177038 | Method for Group-Based Multicast with Non-Uniform Receivers - 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. | 07-12-2012 |
20120209989 | Method for Dynamic Migration of a Process or Services from One Control Plane Processor to Another - 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. | 08-16-2012 |
20120243443 | System and Method for Topology Transparent Zoning in Network Communications - 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. | 09-27-2012 |
20120327759 | Internet Group Management Protocol Version Three for Quality of Service Support - 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. | 12-27-2012 |
20120327764 | Protocol Independent Multicast Last Hop Router Discovery - 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). | 12-27-2012 |
20120327775 | Protocol Independent Multicast with Quality of Service Support - 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. | 12-27-2012 |
20130034103 | System and Method for Finding Segments of Path for Label Switched Path Crossing Multiple Domains - 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. | 02-07-2013 |
20130089005 | Simple Topology Transparent Zoning in Network Communications - An autonomous system (AS) comprising a topology transparent zone (TTZ) comprising a plurality of TTZ nodes, wherein the plurality of TTZ nodes includes an edge node and an internal node, wherein each of the plurality of TTZ nodes is configured to connect to another TTZ node via an internal link, and a plurality of neighboring external nodes connected to the TTZ 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. | 04-11-2013 |
20130100953 | In Band Signaling in Next Generation-Multicast Virtual Private Network Using Receiver Driven Resource Reservation Protocol-Traffic Engineering Point-To-Multipoint - A method executed by a processor in a network node positioned inside a Multiprotocol Label Switching (MPLS) core network for establishing a Point to Multipoint (P2MP) Virtual Private Network (MVPN), comprising receiving a Protocol-Independent Multicast (PIM) Join message from a node outside the MPLS core network, wherein the PIM Join message comprises a source VPN identifier (ID) and propagating the source VPN ID across a P2MP Label Switched Path (LSP) established in the MPLS core network with in-band signaling using Resource Reservation Protocol-Traffic Engineering (RSVP-TE). | 04-25-2013 |
20130294453 | LAYER-3 SERVICES FOR UNITED ROUTER FARM - One embodiment of the present invention provides a computing system. The computing system includes a processor, a memory, a logical switch management mechanism, and a layer-2 path management mechanism. The logical switch management mechanism operates the computing system in conjunction with a plurality of remote switches as a single logical switch. The layer-2 path management mechanism includes a path calculation mechanism and a layer-2 forwarding table. The path calculation mechanism calculates layer-2 shortest paths among the computing system and the remote switches. The layer-2 forwarding table is for a first switch in the plurality of remote switches and created based on one or more of the shortest paths, wherein a respective entry in the forwarding table corresponds to a layer-2 network address. The layer-2 path management mechanism suppresses advertisement of the shortest paths outside of the logical switch, thereby hiding internal paths of the logical switch. | 11-07-2013 |
20130297757 | UNITED ROUTER FARM SETUP - One embodiment of the present invention provides a computing system. The computing system includes a processor, a memory, a discovery mechanism, a switch management mechanism, and a configuration management mechanism. The discovery mechanism discovers a remote switch. The switch management mechanism registers the remote switch and transmits a switch image to the remote switch, thereby allowing the remote switch to install the image. The configuration management mechanism configures the remote switch, thereby allowing the remote switch to be controlled by the computing system. | 11-07-2013 |
20130336191 | mRSVP-TE Based Fast Reroute in Detour (1:1) Protection Mode - An apparatus comprising a memory, and a processor coupled to the memory and configured to transmit a multicast Resource Reservation Protocol—Traffic Engineering (mRSVP-TE) path request (PATH) message upstream, wherein the PATH message requests reservation of a backup Label Switched Path (LSP) to protect an active LSP configured to transmit multicast data. The disclosure also includes a computer program product comprising computer executable instructions stored on a non-transitory computer readable medium such that when executed by a processor cause a network element (NE) to receive a multicast PATH message from a downstream node, wherein the NE acts as a Point of Local Repair (PLR) along an active LSP, wherein the active LSP is configured to transmit multicast data, and wherein the PATH message requests reservation of a backup LSP to protect the active LSP. | 12-19-2013 |
20130336192 | mRSVP-TE Based Fast Reroute in Facility (1:N) Protection Mode - An apparatus comprising a memory, and a processor coupled to the memory and configured to transmit a backup Label Switched Path (LSP) multicast Resource Reservation Protocol-Traffic Engineering (mRSVP-TE) path request (PATH) message upstream, wherein the backup LSP PATH message requests reservation of a first backup LSP to protect a first primary LSP configured to transmit multicast data, and wherein the backup LSP PATH message is transmitted to support a facility mode one to many ( | 12-19-2013 |
20140003245 | Providing PIM-SSM Support for mRSVP-TE Based Multicast Virtual Private Networks | 01-02-2014 |
20140003246 | Providing PIM-SM Support for mRSVP-TE Based Multicast Virtual Private Networks | 01-02-2014 |
20140003281 | Multicast Distribution Trees for mRSVP-TE Based Multicast Virtual Private Networks | 01-02-2014 |
20140003425 | Implementing a Multicast Virtual Private Network by Using Multicast Resource Reservation Protocol-Traffic Engineering | 01-02-2014 |
20140056300 | Method of Multiprotocol Label Switching Encapsulation for United Router Farm Forwarding - A network component for supporting packet forwarding in a United Router Farm (URF), the network component comprising a processor configured to receive a packet, encapsulate the packet using a URF header comprising a URF Layer Two (L2) header that indicates Media Access Control (MAC) addresses of current and next hops, an outer label that indicates a tunnel to a destination node in the URF, and an inner label that indicates an egress port on the destination node, and send the packet to a next hop in the URF after encapsulating the packet. | 02-27-2014 |
20140119367 | Encoding Packets for Transport Over SDN Networks - An ingress node in a Software Defined Network (SDN) comprising a receiver for receiving a data packet, a processor coupled to the receiver and further configured to obtain the data packet from the receiver in a transport protocol agnostic manner, and encapsulate the data packet in an SDN packet header, wherein the packet header comprises SDN flow-specific information provided by an SDN controller, and a transmitter coupled to the processor and further configured to transmit the encapsulated data packet across a single SDN toward an egress node in the SDN. | 05-01-2014 |
20140122683 | System and Method for Virtual Network Abstraction and Switching - Embodiments are provided herein to enable single level network abstraction for a service across one or more domains. The embodiments use a single network ID to identify a service and a corresponding virtual network topology across any number of domains at a physical network. A virtual network topology can be abstracted for each service, based on the physical underlying network topology. A network controller determines, for a service, the virtual network topology within a physical network, and binds the service to the virtual network topology via a virtual network ID, which defines a single forwarding domain of the virtual network topology across the physical network. The virtual network ID is then indicated to the nodes of the virtual network topology, thus enabling the nodes to identify and forward traffic for the service, within the single forwarding domain, between end clients from edge to edge of the physical network. | 05-01-2014 |
20140192645 | Method for Internet Traffic Management Using a Central Traffic Controller - A method for internet traffic management, comprising receiving a request for a path set from an application at a network traffic controller, wherein the request contains an intended traffic destination endpoint, evaluating a plurality of network devices in a network, identifying a plurality of paths usable by the application to transmit traffic from the application to the intended traffic destination endpoint, including the plurality of paths in the path set, and sharing the path set with the application. | 07-10-2014 |
20140241372 | Constructing A Topology-Transparent Zone - A network node used to construct a topology-transparent zone (TTZ). The network node may obtain a TTZ identifier (ID) that is uniquely associated with a TTZ. Additionally, the network node may obtain a first link that couples the network node to a second network node that is also assigned the TTZ ID and a second link that couples the network node to a third network node that is not assigned the TTZ ID. The network node may generate a router information (RI) link-state advertisement (LSA) that indicates whether the network node is a TTZ edge node or a TTZ internal node and that indicates the TTZ associated with the TTZ. The network node may distribute the RI LSA to the second network node that is also assigned the TTZ ID using the first link. | 08-28-2014 |
20140254427 | Discovering a Topology-Transparent Zone - A network node used to discover a topology-transparent zone (TTZ). In one example embodiment, the network node may obtain a TTZ identifier (ID) that is uniquely associated with the TTZ. Additionally, the network node may identify a link connected to a second network node that is also assigned the TTZ ID. In response to the command to initiate discovering the TTZ, the network node may generate a router information (RI) link-state advertisement (LSA) that comprises the TTZ ID and may distribute the RI LSA to the second network node using the link. In another example embodiment, the network node may not be configured as a TTZ edge node and may receive an RI LSA comprising the TTZ ID. The network node may store at least a portion of the information within the RI LSA and may flood the RI LSA using a plurality of links. | 09-11-2014 |
20150023150 | Establishing and Protecting Label Switched Paths Across Topology-Transparent Zones - A label switched path (LSP) establishing method comprising receiving a first path message from a network node outside of a topology-transparent zone (TTZ) along a path for the LSP, computing a TTZ path through the TTZ from the network component to an egress TTZ edge node along the LSP, sending a second path message to a TTZ internal node along the TTZ path, receiving a first reservation (RESV) message from the TTZ internal node that comprises a label allocated for the egress TTZ edge node, and sending a second RESV message that comprises a label allocated for the network component and the label allocated for the egress TTZ edge node to the network node. | 01-22-2015 |
20150043589 | Extending OpenFlow to Support Packet Encapsulation for Transport over Software-Defined Networks - A method for controlling a data flow in a domain of an OpenFlow protocol controlled software-defined network (SDN) comprising receiving a request from a network element for instructions to route the data flow through the OpenFlow SDN, determining a route for the data flow through the OpenFlow SDN, transmitting a unified header to the network element in the OpenFlow SDN, wherein the unified header facilitates transmission of data flows through the OpenFlow SDN that are encoded according to a plurality of network abstraction types, and transmitting instructions for forwarding the data flow along the route through the OpenFlow SDN, wherein the instructions for forwarding the data flow along the route through the OpenFlow SDN comprise one or more match fields, one or more mask values corresponding to the match fields, and one or more actions for the network element in the OpenFlow SDN to perform on the data flow. | 02-12-2015 |