Abstract: A metric measurement mechanism is used to determine network characteristics such as latency and round trip time with more precision than that available from layer three metric measurement mechanisms. The metric measurement mechanism can use the same architecture used by layer three metric measurement mechanisms while more accurately measuring network latency and isolating network device processing delays.

Abstract: A Resource reSerVation Protocol (RSVP) transmitter proxy reserves network resources on behalf of a multimedia server that lacks RSVP facilities. The RSVP transmitter proxy is preferably disposed in an intermediate network device that is proximate to (e.g., one hop away from) the respective server, and includes a classification engine configured to identify network traffic passing through the network device, and a media session manager for maintaining state and other information for streams and/or sessions being provided by the server. The classification engine may snoop messages exchanged between the server and a client to identify the traffic flow characteristics and bandwidth of a stream. The RSVP transmitter uses the snooped information to generate and send RSVP Path messages on behalf of the server and to terminate RSVP Reservation messages sent to the server, thereby causing network resources to be reserved for the stream.

Abstract: A system and method for searching data strings, such as network messages, for one or more predefined regular expressions is provided. Regular expressions are programmed into a pattern matching engine so that multiple characters, e.g., 32, of the data strings can be searched at the same time. The pattern matching engine includes a regular expression storage device having one or more content-addressable memories (CAMs) whose rows may be divided into sections. Each predefined regular expression is analyzed so as to identify the “borders” within the regular expression. A border is preferably defined to exist at each occurrence of one or more predefined metacharacters, such as “.*”, which finds any character zero, one or more times. The borders separate the regular expression into a sequence of sub-expressions each of which may be one or more characters in length. Each sub-expression is preferably programmed into a corresponding section of the pattern matching engine.

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 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 system automatically discovers and maintains geographic location information for entities and devices making up a computer network. The system preferably includes a computing unit and a geographic location generator, such as a Global Positioning System (GPS) receiver. The computing unit includes a location discovery entity and a message generator. The GPS receiver, which is mounted to and in communication with the computing unit, may be augmented with an inertial navigation unit to facilitate the generation of location information inside of buildings where GPS signals can be difficult to receive. The computing unit further includes a network communications facility so that it can communicate with one or more network devices, such as a network switch. The switch includes a location recording/reporting entity and a location database.

Abstract: A system and/or method to determine the location within a building of an apparatus, such as a personal computer, coupled to a computer network. A communication facility of the apparatus is configured to source and sink messages in the computer network via at least one network port coupled to the computer network. A radio frequency (RF) receiver of the apparatus is configured to receive beacon signals transmitted by a plurality of base stations, the base stations located in the building, each beacon signal encoded with location information descriptive of the location of one of the base stations. Also, a location determination engine of the apparatus is configured to compute a location of the apparatus based on the location information encoded in the beacon signals, the computed location being a point within the building.

Abstract: A computer network having multiple, dissimilar network devices includes a system for implementing high-level, network policies. The high-level policies, which are generally device-independent, are translated by one or more policy servers into a set of rules that can be put into effect by specific network devices. Preferably, a network administrator selects an overall traffic template for a given domain and may assign various applications and/or users to the corresponding traffic types of the template. Location-specific policies may also be established by the network administrator. The policy server translates the high-level policies inherent in the selected traffic template and location-specific policies into a set of rules, which may include one or more access control lists, and may combine several related rules into a single transaction.

Abstract: A system dynamically discovers the geographic location of entities of a computer network. A network entity is configured to include a location determination engine and a radio frequency (RF) receiver unit. A plurality of RF base stations are disposed in the area proximate to the network entity. Each RF base station has a beacon for transmitting a radio frequency (RF) signal encoded with the location, e.g., the physical coordinates, of the respective RF base station and the time of transmission. The encoded RF signals are received by the RF receiver unit at the network entity and passed to the location determination engine, which uses the received information to compute its location. The location determination engine then reports its location by loading the computed location into a network message and transmitting that message to a central repository.

Abstract: A Data Center Ethernet (“DCE”) network and related methods and device are provided. A DCE network simplifies the connectivity of data centers and provides a high bandwidth, low latency network for carrying Ethernet, storage and other traffic. A Fibre Channel (“FC”) frame, including FC addressing information, is encapsulated in an Ethernet frame for transmission on a Data Center Ethernet (“DCE”) network. The Ethernet address fields may indicate that the frame includes an FC frame, e.g., by the use of a predetermined Organization Unique Identifier (“OUI”) code in the D_MAC field, but also include Ethernet addressing information. Accordingly, the encapsulated frames can be forwarded properly by switches in the DCE network whether or not these switches are configured for operation according to the FC protocol. Accordingly, only a subset of Ethernet switches in the DCE network needs to be FC-enabled. Only switches so configured will require an FC Domain_ID.

Abstract: A network traffic shaper for shapping transmission of network messages includes a system time generator for generating a system time, an arithmetic logic unit (ALU) for computing a transmission start time for each network message in response to the system time, and a retrieve time generator adapted to increment a retrieve time at a rate faster than the system time. As network messages are received, they are stored in a queue along with an associated transmission start time for each message. A forwarding trigger transmits a store network messages when its associated transmission start time matches the retrieve time. Alternately, a second transmission start time representing an excess bandwidth transmission start time may be computed for each network message. If excess bandwidth is detected, a message may be transmitted when its second transmission start time matches the retrieve time.

Abstract: A network device is configured in a manner to prevent connectivity loops such as one way connectivity loops. A user configures a port of the network device to have an associated state. The state indicates that the port is for communication up the spanning tree towards a root network device, or down the spanning tree away from the root network device. The spanning tree protocol is then executed and determines a role for the port. The role determined by the spanning tree protocol is compared to the user selected state, and if there is an inconsistency, for example one that would indicate a one way connectivity loop, the port is blocked.

Abstract: Ports of a switch are assigned by a person, for example a network manager, to be for communication up the spanning tree toward the root switch (“up ports”), or down the spanning tree away from the root switch (“down ports”). This assignment is made by enabling “Uplinkguard” status for a desired up port, and by connecting the desired port to a switch which it is desired to place in the higher layer of the spanning tree. A port having Uplinkguard enabled is prevented, for example by software or firmware in its switch, from transitioning to a designated role. Uplinkguard-enabling a port, by preventing the port from transitioning to the designated role, has at least two consequences: preventing the port from being selected by the STP to transmit to lower switches in the spanning tree; and, preventing the port from transmitting when a one way connectivity fault develops on that port. A port with Uplinkguard enabled may transition to root port role.

Abstract: Increased usage of network links is provided and smaller forwarding tables are required. A combination of STP and Multipath methods may be implemented in a network. Frames may be forwarded between switches not only according to MAC addresses, but also according to switch IDs and local IDs. Switch IDs do not need to be globally unique, but should be unique within a particular network. Local IDs need only be unique within a particular switch. Some preferred implementations allow frames to be delivered in order to devices requiring in-order delivery. Preferably, core switches need only learn the switch IDs of each core switch and each edge switch, and the appropriate exit port(s) corresponding to each switch. Preferably, the forwarding tables of each edge switch indicate the addresses of each device attached to that edge switch, the address of each device that is in communication with an attached device and the address of every other switch in the network.

Abstract: The present invention provides methods and devices for implementing a Low Latency Ethernet (“LLE”) solution, also referred to herein as a Data Center Ethernet (“DCE”) solution, which simplifies the connectivity of data centers and provides a high bandwidth, low latency network for carrying Ethernet and storage traffic. Some aspects of the invention involve transforming FC frames into a format suitable for transport on an Ethernet. Some preferred implementations of the invention implement multiple virtual lanes (“VLs”) in a single physical connection of a data center or similar network. Some VLs are “drop” VLs, with Ethernet-like behavior, and others are “no-drop” lanes with FC-like behavior. Some preferred implementations of the invention provide guaranteed bandwidth based on credits and VL. Active buffer management allows for both high reliability and low latency while using small frame buffers. Preferably, the rules for active buffer management are different for drop and no drop VLs.

Abstract: The present invention provides methods and devices for implementing a Low Latency Ethernet (“LLE”) solution, also referred to herein as a Data Center Ethernet (“DCE”) solution, which simplifies the connectivity of data centers and provides a high bandwidth, low latency network for carrying Ethernet and storage traffic. Some aspects of the invention involve transforming FC frames into a format suitable for transport on an Ethernet. Some preferred implementations of the invention implement multiple virtual lanes (“VLs”) in a single physical connection of a data center or similar network. Some VLs are “drop” VLs, with Ethernet-like behavior, and others are “no-drop” lanes with FC-like behavior. Some preferred implementations of the invention provide guaranteed bandwidth based on credits and VL. Active buffer management allows for both high reliability and low latency while using small frame buffers. Preferably, the rules for active buffer management are different for drop and no drop VLs.

Abstract: The present invention provides methods and devices for implementing a Low Latency Ethernet (“LLE”) solution, also referred to herein as a Data Center Ethernet (“DCE”) solution, which simplifies the connectivity of data centers and provides a high bandwidth, low latency network for carrying Ethernet and storage traffic. Some aspects of the invention involve transforming FC frames into a format suitable for transport on an Ethernet. Some preferred implementations of the invention implement multiple virtual lanes (“VLs”) in a single physical connection of a data center or similar network. Some VLs are “drop” VLs, with Ethernet-like behavior, and others are “no-drop” lanes with FC-like behavior. Some preferred implementations of the invention provide guaranteed bandwidth based on credits and VL. Active buffer management allows for both high reliability and low latency while using small frame buffers. Preferably, the rules for active buffer management are different for drop and no drop VLs.

Abstract: A method that rapidly reconfigures a computer network having a plurality of devices executing the spanning tree algorithm. First, one or more devices are configured and arranged so that one port, providing connectivity to the root, is in the forwarding state and the remaining ports, providing connectivity to the root, are in the blocked state. Next, one or more of the blocked ports are designated as back-up ports. Upon detection of a failure at the active forwarding port, one of the back-up ports immediately transitions from blocked to forwarding, thereby becoming the new active port for the device. Following the transition to a new active port, dummy multicast messages are transmitted, each containing the source address of an entity directly coupled to the affected device or downstream thereof. By examining the dummy multicast messages, other devices in the network learn to use to the new forwarding port of the affected device.

Abstract: A network traffic shaper provides high-speed, multi-level shaping. The traffic shaper is in communicating relationship with a forwarding engine, and includes a queue controller having a plurality of queues for storing messages, a scheduler for computing release times, at least one time-searchable memory and a corresponding memory controller. Each queue is preferably associated with a corresponding traffic specifier, and a release time is computed for each queue and stored in the time-searchable memory. When a stored release time expires, the message at the head of the corresponding queue is retrieved and is either moved into a different queue or forwarded by the network device. By moving messages through two or more queues, each having its own release time computed in response to a different traffic specifier, the traffic shaper can perform multi-level shaping on network messages.