Pluris, Inc.

Other

Oracle America, Inc.

Fluris, Inc.

James D Carlson

Steven J Schwartz

Yuval Peduel

Norman C Nelson

Steven T Brentano

Ross W Callon

Michael D Hathaway

Glenn Faden

Eric J Spada

Eric J Pelletier

Jeffrey A Koehler

Jarrett J Lu

Douglas C Ehlert

Jr Arnold Lyle J

A mechanism is disclosed for enabling a network address to be shared by multiple containers. By allowing multiple containers to share a network address, a limit on network addresses does not limit the number of containers that can be implemented. Despite the fact that the network address is shared by multiple containers, the uniqueness and isolation of each container is still maintained. In one implementation, this is achieved by associating a unique label with each container. With this unique label, it is possible to forward a packet destined for the shared network address to a specific container despite the fact that multiple containers share the same network address. Thus, with this mechanism, it is possible to achieve container isolation and uniqueness without limiting container scalability.

Mechanism for enabling a network address to be shared by multiple labeled containers

A switching node for transferring packets, each including a destination address, in a network includes a plurality of input port modules, a plurality of output port modules and a switching fabric, including a packet meta-data processor and a packet switch. Each input port module is connected to a communication link for receiving packets thereover, and each output port module is connected to a communication link for transmitting packets thereover. Each input port module, upon receiving a packet, buffers the packet and generates a meta-data packet therefor identifying the output port module that is to transmit the packet and packet identifier information, and provides it to the packet meta-data processor. The packet meta-data processor receives the meta-data packets generated by all of the input port modules and operational status information from all of the output port modules and for each output port module, processes the meta-data packets received from all of the input port modules in connection with the operational status information to determine whether the packet should be passed or dropped. If the packet meta-data processor determines that a packet associated with a meta-data packet is to be dropped, it will notify the input port module in which the packet is buffered, which, in turn, will discard the packet. On the other hand if the packet meta-data processor determines that the packet associated with the meta-data packet is not to be dropped, it will enqueue the meta-data packet for the associated output port module. Each output port module retrieves meta-data packets from its respective meta-data packet queue maintained therefor by the packet meta-data processor. For each meta-data packet retrieved by an output port module, the output port module will request that the input port module identified in the meta-data packet transfer the packet identified in the input port module thereto through the packet switch. When the output port module receives the packet, it will transmit it over the communication link connected thereto.

Pass/drop apparatus and method for network switching node

A method and apparatus for reallocating switching circuitry in a switching fabric are disclosed. The switching fabric is used to permit data transfer among a plurality of interface units each having a plurality of data ports. The switching fabric is partitionable into a plurality of switch planes such that each switch plane can be assigned to transfer data associated with like data ports of the interface units. Each switch plane includes multiple switching channels each assignable to transfer data associated with one data port of one of the interface units, in a full implementation. The number of interface units is less than the number of switching channels in a switch plane, then the reallocation is performed such that multiple channels of at least one switch plane can be assigned to transfer data of multiple ports of at least one of the interface units. This results in switch plane channels that would otherwise be unused being utilized to transfer data. This reallocation of switch plane channels can result in the elimination of one or more switch planes from the switch fabric resulting in substantially reduced hardware complexity and cost.

Apparatus and method for scaling a switching fabric in a network switching node

An apparatus and method for efficient hashing uses both an identifying portion of a data packet, e.g., source and destination ID, and an identifying value of the node, e.g., the IP address of the node, to generate a hash result. By inserting a unique value into the hash operation at each node, the invention effectively provides for a different hash implementation at each node. As a result, in situations where multiple paths or multiple links within a path are available to forward packets, traffic can be split over the multiple paths and links. Inefficient utilization of network links found in prior systems which use the same hash operation at each node are eliminated.

Apparatus and method for efficient hashing in networks

A switching node for transferring addressed packets in a network includes a plurality of input port modules, a plurality of output port modules and a switching fabric, including a packet meta-data processor and a packet switch. Each input port module, upon receiving a packet, buffers the packet and generates a meta-data packet identifying an output port module that is to transmit the packet and packet identifier information, and provides it to the packet meta-data processor. The packet meta-data processor processes the meta-data packets received from all of the input port modules in connection with operational status information to determine whether the packet should be passed or dropped. If to be dropped, the packet is dropped at the input, otherwise enqueued for the proper output port.

Packet forwarding apparatus and method using pipelined node address processing

System and method for switching packets in a network

An apparatus and method for forwarding packets of data across a switching node on a network are disclosed. A packet of data to be forwarded includes a destination address, which can be partitioned into a plurality of subaddress fields. To improve speed of packet forwarding, destination addresses are processed in a pipelined fashion. To that end, the system includes a plurality of pipelined subaddress processors which process a respective plurality of subaddress fields of the destination addresses. Addresses are received during addressing intervals. During a first interval, a first subaddress of a first packet is processed by a first subaddress processor. During a next interval, a second subaddress processor processes a second subaddress field of the first packet destination address while the first subaddress processor processes the first subaddress field of a destination address of a next packet. Each destination address is stored in a table which associates destination addresses with output paths out of the switching node. The table is partitioned into portions associated with the subaddress fields. Each subaddress processor accesses the portion of the table associated with its subaddress to route the packet out of the node along the correct output path to facilitate delivery of the packet at the destination node.

An apparatus and method for monitoring data flow at a node on a network are disclosed. A memory location or &ldquo;bucket&rdquo; is allocated to each of a plurality of links and classes of service at the node. A free-running counter is incremented at a rate determined by the maximum allowable data rates on the various links and classes of service. When a data packet is received at a particular link and class of service, the corresponding memory location or bucket is adjusted or &ldquo;leaked&rdquo; by subtracting the present counter value from the present bucket contents. That difference is then added to the number of units of data, i.e., bytes or groups of bytes of data, contained in the incoming packet. That sum is then compared with a predetermined threshold determined by the allowable data rate associated with the link and class of service. If the threshold is exceeded, then the incoming data packet is marked accordingly. The system can include multiple stages of monitoring such that multiple thresholds can be used to assign one of multiple discard eligibility values to the incoming packet.

Growing community of inventors

North Andover, MA, United States of America

James D Carlson