Abstract: A radio frequency input/output circuit with a composite inductor structure is presented. The composite inductor structure has a plurality of inductors that are interwound. The composite inductor structure is implemented on a chip. The plurality of inductors are magnetically coupled. The plurality of inductors are interwound around a core. A second inductor is coupled in series with a first inductor and the first inductor is coupled in series with the third inductor. The first inductor and the third inductor are coupled at a centre tap, such that the first inductor and the third inductor form a centre-tapped coil. The centre tap is coupled to an input terminal.

Abstract: A bias generator and a method for generating a bias voltage are presented. The bias generator is for use with an electronic circuit comprising a first switch coupled in series with a second switch. The bias generator is adapted to generate a reference voltage, a first bias voltage, and a second bias voltage. The second bias voltage is based on the reference voltage. After applying the first voltage to the first switch and the second voltage to the second switch, the bias generator controls a voltage across the first switch. The bias generator may be adapted to set a value of the reference voltage to control the voltage across the first switch. For instance, the reference voltage may be set to a fix value so that the voltage across the first switch is maintained at a constant value.

Abstract: A bias generator and a method for generating a bias voltage are presented. The bias generator is for use with an electronic circuit comprising a first switch coupled in series with a second switch. The bias generator is adapted to generate a reference voltage, a first bias voltage, and a second bias voltage. The second bias voltage is based on the reference voltage. After applying the first voltage to the first switch and the second voltage to the second switch, the bias generator controls a voltage across the first switch. The bias generator may be adapted to set a value of the reference voltage to control the voltage across the first switch. For instance, the reference voltage may be set to a fix value so that the voltage across the first switch is maintained at a constant value.

Abstract: A radio frequency input/output circuit with a composite inductor structure is presented. The composite inductor structure has a plurality of inductors that are interwound. The composite inductor structure is implemented on a chip. The plurality of inductors are magnetically coupled. The plurality of inductors are interwound around a core. A second inductor is coupled in series with a first inductor and the first inductor is coupled in series with the third inductor. The first inductor and the third inductor are coupled at a centre tap, such that the first inductor and the third inductor form a centre-tapped coil. The centre tap is coupled to an input terminal.

Abstract: Techniques for reducing the latency in performing a failover from a protected connection to its backup connection when a network event is detected affecting the protected connection. In an MPLS network, techniques are provided for failing a protected LSP to a backup LSP in a fast and efficient manner. In one embodiment, the faster failover is facilitated by storing protected LSPs and their backup LSPs information in the data plane, such as locally on a linecard.

Abstract: Techniques for configuring a local repair connection for a protected connection including determining a path for the local repair connection. The path traversed by a local repair connection starts at a node in the path associated with the protected connection and ends at a merge point node in the path associated with the protected connection that is downstream from the start node. In one embodiment, the merge point node may even be more than two hops downstream from the start node in the path associated with the protected connection. The local repair path may include zero or more nodes that are not included in the path associated with the protected connection. Techniques are also described for optimizing the path associated with a local repair connection.

Abstract: Techniques for finding an optimized local repair path that may be used to signal a local repair connection for a protected connection. The optimized local repair path starts at a node in the path associated with the protected connection and ends at a merge point node in the path associated with the protected connection that is downstream from the start node. Various techniques may be used for finding an optimized local repair path.

Abstract: Techniques for computing a path for a local repair connection to be used to protect a connection traversing an original path from an ingress node to an egress node. The computed path originates at a node (start node) in the original path and terminates at another node (end node) in the original path that is downstream from the start node. A Constraint Shortest Path First (CSPF) algorithm may be used to compute the path. The computed path is such that it satisfies one or more constraints and does not traverse a path from a first node in the original path to a second node in the original path, wherein the first and second nodes are upstream from the start node in the original path and the second node is downstream from the first node in the original path. A local repair connection may then be signaled using the computed path.

Abstract: Techniques for reducing the latency in performing a failover from a protected connection to its backup connection when a network event is detected affecting the protected connection. In an MPLS network, techniques are provided for failing a protected LSP to a backup LSP in a fast and efficient manner. In one embodiment, the faster failover is facilitated by storing protected LSPs and their backup LSPs information in the data plane, such as locally on a linecard.

Abstract: Techniques for computing a path for a local repair connection to be used to protect a connection traversing an original path from an ingress node to an egress node. The computed path originates at a node (start node) in the original path and terminates at another node (end node) in the original path that is downstream from the start node. A Constraint Shortest Path First (CSPF) algorithm may be used to compute the path. The computed path is such that it satisfies one or more constraints and does not traverse a path from a first node in the original path to a second node in the original path, wherein the first and second nodes are upstream from the start node in the original path and the second node is downstream from the first node in the original path. A local repair connection may then be signaled using the computed path.

Abstract: Techniques for dynamically establishing and configuring a liveliness detection session for a local repair connection of a connection. In one set of embodiments, a signaling message is received at a node configured to maintain a local repair connection for a connection. A configuration parameter is identified in the signaling message, where the configuration parameter pertains to a liveliness detection mechanism or protocol. A liveliness detection session is then established for the local repair connection based on the configuration parameter.

Abstract: Techniques for configuring a local repair connection for a protected connection including determining a path for the local repair connection. The path traversed by a local repair connection starts at a node in the path associated with the protected connection and ends at a merge point node in the path associated with the protected connection that is downstream from the start node. In one embodiment, the merge point node may even be more than two hops downstream from the start node in the path associated with the protected connection. The local repair path may include zero or more nodes that are not included in the path associated with the protected connection. Techniques are also described for optimizing the path associated with a local repair connection.

Abstract: Techniques for configuring a local repair connection for a protected connection including determining a path for the local repair connection. The path traversed by a local repair connection starts at a node in the path associated with the protected connection and ends at a merge point node in the path associated with the protected connection that is downstream from the start node. In one embodiment, the merge point node may even be more than two hops downstream from the start node in the path associated with the protected connection. The local repair path may include zero or more nodes that are not included in the path associated with the protected connection. Techniques are also described for optimizing the path associated with a local repair connection.

Abstract: Techniques for computing a path for a local repair connection to be used to protect a connection traversing an original path from an ingress node to an egress node. The computed path originates at a node (start node) in the original path and terminates at another node (end node) in the original path that is downstream from the start node. A Constraint Shortest Path First (CSPF) algorithm may be used to compute the path. The computed path is such that it satisfies one or more constraints and does not traverse a path from a first node in the original path to a second node in the original path, wherein the first and second nodes are upstream from the start node in the original path and the second node is downstream from the first node in the original path. A local repair connection may then be signaled using the computed path.

Abstract: Techniques for finding an optimized local repair path that may be used to signal a local repair connection for a protected connection. The optimized local repair path starts at a node in the path associated with the protected connection and ends at a merge point node in the path associated with the protected connection that is downstream from the start node. Various techniques may be used for finding an optimized local repair path.

Abstract: Techniques for configuring a local repair connection for a protected connection including determining a path for the local repair connection. The path traversed by a local repair connection starts at a node in the path associated with the protected connection and ends at a merge point node in the path associated with the protected connection that is downstream from the start node. In one embodiment, the merge point node may even be more than two hops downstream from the start node in the path associated with the protected connection. The local repair path may include zero or more nodes that are not included in the path associated with the protected connection. Techniques are also described for optimizing the path associated with a local repair connection.

Abstract: A method and system for processing active AFP sessions by a multithreaded file system process. The file server is coupled to entities on a network, wherein an open AFP session is created when the file server and an entity on the network establish communication, and an active AFP session is created when an AFP session has a pending request. The method and system comprises monitoring the file server for active AFP sessions. When a first active AFP session having at least one AFP request becomes available, the method and system assigns a first one of the threads to the first active AFP session for processing. The method and system preempts the processing of the first active AFP session by the first one of the threads when additional active AFP sessions are available so that the first one of the threads becomes available to process additional active AFP sessions, whereby equal processing time is provided to each one of the active AFP sessions.

Abstract: A system and method for allowing a network application to interface with both a first transaction protocol and a second transaction protocol. The system and method provides an object-oriented base class for use by the network application. A first subclass is invoked from the base class when the network application interfaces the first protocol, and a second subclass is invoked from the base class when the network application interfaces the second protocol. The network application is made compatible with the first protocol by invoking the first subclass, and made compatible with the second protocol by invoking the second subclass.

Abstract: A system and method for increasing the number of entities that can be serviced by a file server. The file server includes a plurality of server session sockets (SSSs), and means for assigning an entity identification number and one of the plurality of SSSs to a request from one of the number of entities, wherein each SSS can support a plurality of entities.

Abstract: A system and method for maximizing the use of threads in a file server process for processing requests received from entities on a network. The file server process includes a first socket and a plurality of second sockets for receiving requests from entities on a network. The file server process comprises a first queue for storing requests received from the first socket, and a second queue for storing requests received from the plurality of second sockets. The file server processes the requests in the first queue with a first set of threads, and processes the requests in the second queue with a second set of threads.