Abstract: A hierarchy of schedules propagate minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule. The minimum guaranteed scheduling rate for a parent schedule entry is typically based on the summation of the minimum guaranteed scheduling rates of its immediate child schedule entries. This propagation of minimum rate scheduling guarantees for a class of traffic can be dynamic (e.g., based on the active traffic for this class of traffic, active services for this class of traffic), or statically configured. One embodiment also includes multiple scheduling lanes for scheduling items, such as, but not limited to packets or indications thereof, such that different categories of traffic (e.g., propagated minimum guaranteed scheduling rate, non-propagated minimum guaranteed scheduling rate, high priority, excess rate, etc.) of scheduled items can be propagated through the hierarchy of schedules accordingly without being blocked behind a lower priority or different type of traffic.

Abstract: Packets destined for the route processor of a packet switching device are rate controlled. Typically, line cards are configured to rate limit packets of offending packet flows destined for the route processor, such, but not limited to in response to a quantity of packets in the route processor. Filtering of packets of offending packet flows at the line cards reduces the work required of the route processor.

Abstract: Disclosed are, inter alia, methods, apparatus, computer-readable media, mechanisms, and means for load balancing manipulation of packet flows within a transport conduit (e.g., a tunnel, pseudo wire, etc.), typically using a load balancing value which is independent of standard routing-based parameters (e.g., source address, destination address, source port, destination port, protocol type, etc.). A load balancing value is included in encapsulated packets transported across a network using a transport conduit. This load balancing value can be used to load balance the individual flows/microflows within the transport conduit.

Abstract: Disclosed are, inter alia, methods, apparatus, computer-storage media, mechanisms, and means for transportation of IEEE 802.1ah frames over Multiprotocol Label Switching (MPLS) pseudowires for Virtual Private LAN Services (VPLS). The IEEE 802.1ah frames include a corresponding B-VLAN tag, while the MPLS packets including these frames do not include the corresponding B-VLAN tag, and disclosed are methods and apparatus for performing such translation.

Abstract: Disclosed are, inter alia, methods, apparatus, computer-readable storage media, mechanisms, and means for measuring relative one-way delay measurements over multiple paths between devices. The relative one-way delays from a networked device to a remote device can be determined based on the round-trip delay of pairs of probe/probe-return packets as each pair takes a different path to the remote device and takes the same path from the remote device to the networked device. The relative one-way delays from a remote device to a networked device can be determined based on the round-trip delay of pairs of probe/probe-return packets as each pair takes a same path to the remote device and takes a different path from the remote device to the networked device.

Abstract: Disclosed are, inter alia, methods, apparatus, mechanisms, and means for characterizing a clock signal within an application-specific integrated circuit (ASIC), and then, also on the ASIC, generating a testing clock signal based on the characterization of the operative clock signal for testing purposes. An ASIC includes a clock signal characterization circuit configured to characterize a clock signal within the ASIC; and a programmable testing clock signal generator configured for being programmed based on said characterization of the clock signal, and for generating a test clock signal based on its said programming.

Abstract: Disclosed are, inter alia, methods, apparatus, computer-readable media, mechanisms, and means for deterministically determining MPLS labels as functions of addresses of Forwarding Equivalence Classes (FECs), and using these determined labels in the forwarding of packets. By each packet switching device in a network deterministically determining the same MPLS label to use for each FEC, each packet switching device knows what label will be used by the other packet switching devices, without running Label Distribution Protocol (LDP) or another label publishing protocol. Additionally, this knowledge extends to all packet switching devices in a network, not merely neighboring packet switching devices, which allows a packet switching device to specify a stack of labels to define a desired path through the network for explicit path routing and/or fast rerouting of traffic without having to previously establish a tunnel or path using Resource Reservation Protocol (RSVP), for example.

Abstract: In one implementation, a method includes reading first component data from a first tag associated with a first component of a device. The device may be powered on or off. The first component data indicate components associated with the first component at a first time. The method may involve obtaining second component data from a second tag associated with a support structure. The second component data may indicate components disposed in the support structure at a second time. The method may also involve comparing the first component data with the second component data and determining whether the first component data match the second component data.

Abstract: Methods and apparatus for enabling mobility of a node that does not support Mobile IP are disclosed. When an AP receives a data packet, the AP may compare the data packet (e.g., source address) with the AP information for one or more APs to determine whether to send a registration request on behalf of the node. More particularly, the AP determines from the source address whether the node is located on a subnet identical to a subnet of the AP. If the node is located on the subnet of the AP, no Mobile IP service is required on behalf of the node. However, when it is determined from the source address that the node is not located on the subnet identical to the subnet of the Access Point, the AP composes and sends a mobile IP registration request on behalf of the node. For instance, the mobile IP registration request may be composed using the gateway associated with the “home” AP (e.g., having a matching subnet) as the node's Home Agent.

Abstract: In one embodiment, an apparatus comprises a network interface system having at least one input port configured for receiving frames and a logic system comprising at least one logic device. The logic system may be configured to perform the following functions: determining a source address and a destination address of a frame received at an ingress port; calculating a flow hash based at least upon the source address and the destination address; forming a congestion management (“CM”) tag that includes the flow hash; inserting the CM tag in the frame; and forwarding the frame to the destination address.

Abstract: In one embodiment, a method is described that includes receiving a conditioned bitstream that includes a digital insertion location and primary network packets that contain compressed video data. The digital insertion location includes replaceable network packets. The method also includes receiving a second bitstream that includes replacement compressed video data. The method also includes determining a location of the digital insertion location. The method further includes adjusting the bitrate of the replacement compressed video data to create adjusted replacement compressed video data. The method further includes providing timestamp information with the replacement compressed video data. The method additionally includes packetizing the adjusted replacement compressed video data and timestamp information into replacement network packets.

Abstract: Methods and apparatus for supporting broadcast traffic in Mobile IP are disclosed. When a Mobile Node registers via a Foreign Agent supporting Mobile IP, the Foreign Agent receives a registration request from a Mobile Node and sends the registration request to a Home Agent. A registration reply received from the Home Agent has a network mask extension including a network mask associated with the home address of the Mobile Node. The Foreign Agent then sends the registration reply to the Mobile Node. Alternatively, the Mobile Node may register via a collocated care-of address, in which case the registration reply is received directly from the Home Agent. Once the Mobile Node has obtained its network mask, it may send packets such as broadcast packets, as well as roam to its Home Agent. Additionally, in accordance with various embodiments, the Foreign Agent duplicates broadcast packets for transmission to Mobile Nodes, rather than receiving the duplicated packets from the Home Agent.

Abstract: Sequences of items may be maintained using ordered locks. These items may correspond to anything, but using ordered locks to maintain sequences of packets, especially for maintaining requisite packet orderings when distributing packets to be processed to different packet processing engines, may be particularly useful. For example, in response to a particular packet processing engine completing processing of a particular packet, a gather instruction is attached to the particular identifier of a particular ordered lock associated with the particular packet. If no longer needed for further processing, the packet processing engine is immediately released to be able to process another packet or perform another function. The gather instruction is typically performed in response to the particular ordered lock being acquired by the particular identifier, with the gather instruction causing the processed particular packet to be sent.

Abstract: Methods and apparatus are disclosed for storing tree data structures among and within multiple memory channels, which may be of particular use with, but not limited to tree bitmap data structures. A subtree (or entire tree) typically includes one or more leaf arrays and multiple tree arrays. One or more leaf arrays are typically stored in a first set of memory channels of N+1 sets of memory channels, the N+1 sets of memory channels including N sets of memory channels plus the first set of memory channels. Each of N contiguous levels of the multiple tree arrays are stored in a different one of said N sets of memory channels, wherein each of the multiple tree arrays at a same level of said N contiguous levels is stored in the same memory channel set of said N sets of memory channels. A memory channel for storing a particular level is typically assigned based on one or more current occupancy levels of the memory channels.

Abstract: Various improvements are provided for prior art policing methods, including token bucket methods and virtual time policing methods. Some preferred methods of the invention involve assigning a non-zero drop probability even when the packet would otherwise have been transmitted according to a prior art policing method. For example, a non-zero drop probability may be assigned even when there are sufficient tokens in a token bucket to allow transmission of the packet. A non-zero drop probability may be assigned, for example, when a token bucket level is at or below a predetermined threshold or according to a rate at which a token bucket is being emptied. Some implementations involve treating a token bucket as a virtual queue wherein the number of free elements in the virtual queue is proportional to the number of remaining tokens in the token bucket.

Abstract: A technique is provided for implementing online mirroring of a volume in a storage area network. A first instance of the volume is instantiated at a first port of the fibre channel fabric for enabling I/O operations to be performed at the volume. One or more mirroring procedures may be performed at the volume. In at least one implementation, the first port is able to perform first I/O operations at the volume concurrently while the mirroring procedures are being performed at the first volume. In one implementation, the mirroring procedures may be implemented at a fabric switch of the storage area network. Additionally, in at least one implementation, multiple hosts may be provided with concurrent access to the volume during the mirroring operations without serializing the access to the volume.

Abstract: A technique is provided for facilitating information management in a storage area network. The storage area network may utilize a fibre channel fabric which includes a plurality of ports. The storage area network may also comprise a first volume which includes a first mirror copy and a second mirror copy. The storage area network may further comprise a mirror consistency data structure adapted to store mirror consistency information. A mirror consistency check procedure is performed to determine whether data of the first mirror copy is consistent with data of the second mirror copy. According to one implementation, the mirror consistency check procedure may be implemented using the consistency information stored at the mirror consistency data structure.

Abstract: A technique is provided for implementing online mirroring of a volume in a storage area network. A first instance of the volume is instantiated at a first port of the fibre channel fabric for enabling I/O operations to be performed at the volume. One or more mirroring procedures may be performed at the volume. In at least one implementation, the first port is able to perform first I/O operations at the volume concurrently while the mirroring procedures are being performed at the first volume. In one implementation, the mirroring procedures may be implemented at a fabric switch of the storage area network. Additionally, in at least one implementation, multiple hosts may be provided with concurrent access to the volume during the mirroring operations without serializing the access to the volume.

Abstract: The present invention provides improved methods and devices for managing network congestion. Preferred implementations of the invention allow congestion to be pushed from congestion points in the core of a network to reaction points, which may be edge devices, host devices or components thereof. Preferably, rate limiters shape individual flows of the reaction points that are causing congestion. Parameters of these rate limiters are preferably tuned based on feedback from congestion points, e.g., in the form of backward congestion notification (“BCN”) messages. In some implementations, such BCN messages include congestion change information and at least one instantaneous measure of congestion. The instantaneous measure(s) of congestion may be relative to a threshold of a particular queue and/or relative to a threshold of a buffer that includes a plurality of queues.

Abstract: Methods and apparatus for authenticating a mobile node are disclosed. A server is configured to provide a plurality of security associations associated with a plurality of mobile nodes. A packet identifying a mobile node may then be sent to the server from a network device such as a Home Agent. A security association for the mobile node identified in the packet may then be obtained from the server. The security association may be sent to the network device to permit authentication of the mobile node. Alternatively, authentication of the mobile node may be performed at the server by applying the security association.