Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUS20110044340 A1
Publication typeApplication
Application numberUS 12/900,279
Publication dateFeb 24, 2011
Priority dateAug 22, 2006
Also published asUS7903654, US20080049742
Publication number12900279, 900279, US 2011/0044340 A1, US 2011/044340 A1, US 20110044340 A1, US 20110044340A1, US 2011044340 A1, US 2011044340A1, US-A1-20110044340, US-A1-2011044340, US2011/0044340A1, US2011/044340A1, US20110044340 A1, US20110044340A1, US2011044340 A1, US2011044340A1
InventorsDeepak Bansal, Yuen Wong
Original AssigneeFoundry Networks, Llc
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
System and method for ecmp load sharing
US 20110044340 A1
Abstract
A packet classifier and a method for routing a data packet are provided. The packet classifier includes a content addressable memory, a translation table and a parameter memory. The method includes looking up a content addressable memory for a base address into a parameter memory using a header of the data packet. The base address is related to the routes under ECMP for forwarding the data packet. From among these addresses, using multiple headers of the data packet, an adjustment to the base address is computed. The adjustment specifies an actual address to the parameter memory corresponding to a selected route for forwarding the data packet. The parameter memory is then accessed using the actual address to obtain parameter values relevant to the selected route. The data packet is then forwarded according to the parameter values thus obtained.
Images(2)
Previous page
Next page
Claims(2)
1. A network device comprising:
at least one port configured to receive a data packet; and
a first memory and a second memory,
wherein the network device is configured to:
retrieve a first entry in the first memory based on a portion of a first received data packet;
retrieve a first entry in the second memory based on the first entry in the first memory, the first entry in the second memory including information associated with a route over which the first received data packet should be forwarded;
retrieve the first entry in the first memory based on a portion of a second received data packet; and
retrieve a second entry in the second memory based on the first entry in the first memory, the second entry in the second memory being distinct from the first entry in the second memory, the second entry in the second memory including information associated with a route over which the second received data packet should be forwarded,
wherein the portion of the first received data packet and the portion of the second received data packet are substantially the same.
2. The network device of claim 1 wherein the first memory is a content addressable memory (CAM) and wherein the second memory is a parameter random access memory (PRAM).
Description
    CROSS REFERENCE TO RELATED APPLICATIONS
  • [0001]
    The present application claims priority of U.S. provisional patent application No. 60/823,178, filed Aug. 22, 2006, incorporated herein by reference.
  • BACKGROUND OF THE INVENTION
  • [0002]
    1. Field of the Invention
  • [0003]
    The present invention relates to routing data packets in a computer network. In particular, the present invention relates to routing data packets in a computer network in which equal cost multi-path (ECMP) load sharing is available.
  • [0004]
    2. Discussion of the Related Art
  • [0005]
    In a router, a data packet is directed from an input port to an output port based on the data specified in the header of the data packet. Typically, a content addressable memory (CAM) quickly maps the IP header information or layer 3 header of the data packet to a memory location of a parameter random access memory (PRAM) which stores information that indicates the route over which the data packet should be forwarded, and the parameter values relevant to the route. In one prior art router, the data stored in the PRAM includes a forwarding identifier (FID), types of service (TOS), priority, number of copies (e.g., a multicast address) and other information. The circuit including the CAM and the PRAM is sometimes referred to as a “packet classifier.” The packet classifier encodes the FID and other data into an internal header for the data packet which is used by the router to direct the data packet at line speed to an output port, where the data packet is forwarded to the next switch on a path to its destination.
  • [0006]
    In that prior art router, the CAM entries are mapped one-to-one to the PRAM entries. That is, only one FID can result from the CAM look-up based on the header of the data packet. In an Internet Protocol (IP) network, a data packet may be routed through any of a number of paths through multiple switches to its destination. ECMP load sharing is one method known to those skilled in the art by which multiple-path routing of IP data traffic can be accomplished. One method to support ECMP is to resolve the level 3 (IP layer) and level 4 (“transport control protocol” or TCP layer) headers of a data packet into any one of a number of FIDs, where each FID represents a different output port of the router that is connected to a switch on a different one of the possible paths for the data packet. However, because the CAM entries are mapped one-to-one with the PRAM entries, the prior art router does not provide efficient hardware support for ECMP load sharing.
  • [0007]
    “JetCore™ Based Chassis System: An Architecture Brief on NetIron, BigIron and FastIron Systems” and “Next Generation Terabit System Architecture: The High Performance Revolution for 10 Gigabit Networks” are white papers available from Foundry Networks, Inc. that disclose designs for high performance routers in the prior art. These white papers are hereby incorporated by reference in their entireties to provide background information.
  • SUMMARY OF THE INVENTION
  • [0008]
    According to one embodiment of the present invention, a packet classifier and a method for routing a data packet are provided. The packet classifier includes a content addressable memory, a translation table and a parameter memory. The method includes looking up a content addressable memory for a base address into a parameter memory using a first portion of the data packet. The base address is related to the various routes for forwarding the data packet. From among these addresses, using a second portion of the data packet, an adjustment to the base address is computed, the adjustment specifying an actual address to the parameter memory corresponding to a selected route for forwarding the data packet. The parameter memory is then accessed using the actual address to obtain parameter values relevant to the selected route. The data packet is then forwarded according to the parameter values thus obtained.
  • [0009]
    The present invention is better understood upon consideration of the detailed description below, in conjunction with the accompany drawings.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • [0010]
    FIG. 1 shows packet classifier 100 that provides translation table 102 between CAM 101 and PRAM 103, according to one embodiment of the present invention.
  • DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
  • [0011]
    The present invention provides hardware support for ECMP by an indirect coupling between the CAM and the PRAM. (While the detailed description herein uses a CAM in one example to illustrate one way to implement a parameter look-up or search function in a packet classifier, other implementations are possible. Other memory elements, such as dynamic random access memories (DRAM) or static random access memories (SRAM) may also be used). According to one embodiment of the present invention, FIG. 1 shows a packet classifier 100 that provides translation table 102 between CAM 101 and PRAM 103. In the embodiment of FIG. 1, the header of a data packet is used to perform a route look-up in CAM 101 to obtain an index (“route lookup result”) into translation table (or “re-mapping RAM”) 102, which provides a base address to PRAM 103. This base address is then modified to obtain the address of one of a number of entries in PRAM 103. Each of these entries contains a different FID pointing to a different output port representing the next hop in a different ECMP route.
  • [0012]
    According to the embodiment of the present invention shown in FIG. 1, CAM 101 is logically organized as a 256 k723-bit memory, which provides a 21-bit index (TCAM_INDEX) into translation table 102. Translation table 102 is logically organized into 2 M32-bit memory. The 32-bit output datum read from translation table 102 includes a base index to PRAM 103. In one embodiment, the 31-bit output datum includes a 19-bit base index (“PRAM_INDEX_BASE”), a 4-bit field “ECMP_MASK” and management information (e.g., an aging bit). The ECMP_MASK field may encode the number of ECMP paths available for that data packet. The 19-bit base index is combined with a hash function of the IP and TCP headers of the data packet to obtain an actual 19-bit index into PRAM 103. Each entry of PRAM 103 contains an FID and other information relevant to the routing of the data packet. Mathematically, the 32-bit output datum CAM2PRAM_DATA is given by
  • [0013]
    CAM2PRAM_DATA[31:0]=READ (TCAM_INDEX[20:0])
  • [0014]
    where the function READ( )represents the data read from translation table 102 using the 21-bit TCAM_INDEX as address into translation table 102.
  • [0015]
    According to one embodiment of the present invention, an 8-bit ECMP index is obtained by a hash function using the MAC, IP and TCP headers of the data packet, and a random number. The portions of the MAC, IP and TCP headers that are used may be, for example, the source and destination MAC addresses, the IP source and destination addresses and the TCP source and destination port number. The random number is a number generated at the initialization process of the router. The random number provides a personalization for the router (i.e., from the same data packet, a different router would map to a different address in the PRAM). One advantage of using the Random_Number is a more distributed load balance in situations where multiple routers are connected in a hierarchical fashion. Mathematically, the 8-bit ECMP index is given by:
  • [0016]
    ECMP_INDEX[7:0]=hash(L2, L3, L4, Random_Number)
  • [0017]
    where hash is a hash function with low collision probability, L2, L3 and L4 represent selected fields in the MAC, IP and TCP headers of the data packet, and Random_Number is the personality random number of the router.
  • [0018]
    In one embodiment, the ECMP_INDEX is mapped into one of possible the routes (up to a maximum of 16, i.e., a 5-bit number). As mentioned above, the number of possible routes is encoded in the ECMP_MASK field. The number of possible routes (“ECMP_BASE”) is given by adding one to the 4-bit ECMP_MASK field:
  • [0019]
    ECMP_BASE[4:0]=ECMP_MASK[3:0]+4′h1;
  • [0020]
    Using the ECMP_INDEX and the ECMP_BASE, a 4-bit offset to the 19-bit base index to PRAM 103 (“ECMPADJUST) is obtained using the modulo function (i.e., taking the remainder from an integer divide of ECMP_INDEX by ECMP_BASE):
  • [0021]
    ECMP_ADJUST[3:0]=(ECMP_INDEX[7:0]% ECMP_BASE[4:0]);
  • [0022]
    The modulo operation provides close to perfect load balancing across equal cost paths. The 4-bit offset ECMP_ADJUST is logically OR'd with the 19-bit base index PRAM_INDEX_BASE to obtain the actual index into PRAM 103:
  • [0023]
    PRAM_INDEX_TO_USE=PRAM_INDEX_BASE|ECMP_ADJUST[3:0]
  • [0024]
    Using this actual index, the parameter values and the FID are obtained from PRAM 103 to perform forwarding of the data packet.
  • [0025]
    In this manner, hardware support for load balanced ECMP computations is provided without requiring a line card or central processing unit management intervention. ECMP traffic can therefore be processed at line rate. Further, increasing the number of routes handled by the CAM for ECMP can be achieved without a corresponding increase in PRAM size, as the PRAM entries can be shared for the same next hop, thereby providing significant cost savings. Because software controls the many-to-one or one-to many mappings between route lookups of CAM 101 and the associated pram entries in PRAM 103, the present invention allows certain statistics to be collected (e.g., for route groups).
  • [0026]
    The detailed description above is provided to illustrate specific embodiments of the present invention and is not intended to be limiting. Numerous variations and modifications within the scope of the present invention are possible. The present invention is set forth in the following claims.
Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US3866175 *Apr 24, 1974Feb 11, 1975Ncr CoData communication system between a central computer and a plurality of data terminals
US4723243 *Dec 2, 1985Feb 2, 1988Advanced Micro Devices, Inc.CRC calculation machine with variable bit boundary
US4807280 *Sep 18, 1987Feb 21, 1989Pacific BellCross-connect switch
US4896277 *May 3, 1988Jan 23, 1990Thermo King CorporationMethod of mapping refrigerated containers in a power line carrier based monitoring system
US4985889 *Feb 2, 1989Jan 15, 1991Sprint International Communications CorporationData packet switching
US5101404 *Aug 21, 1989Mar 31, 1992Hitachi, Ltd.Signalling apparatus for use in an ATM switching system
US5195181 *Jan 10, 1992Mar 16, 1993Digital Equipment CorporationMessage processing system having separate message receiving and transmitting processors with message processing being distributed between the separate processors
US5280582 *Feb 16, 1993Jan 18, 1994Digital Equipment CorporationNo-owner frame and multiple token removal mechanism for token ring networks
US5282196 *Oct 15, 1991Jan 25, 1994Hughes Aircraft CompanyBursted and non-bursted data router
US5287477 *Aug 7, 1991Feb 15, 1994Hewlett-Packard CompanyMemory-resource-driven arbitration
US5299190 *Dec 18, 1992Mar 29, 1994International Business Machines CorporationTwo-dimensional round-robin scheduling mechanism for switches with multiple input queues
US5299195 *Aug 14, 1992Mar 29, 1994National Semiconductor CorporationRepeater interface controller with multiple port node interfaces
US5390173 *Oct 22, 1992Feb 14, 1995Digital Equipment CorporationPacket format in hub for packet data communications system
US5392279 *Jan 15, 1993Feb 21, 1995Fujitsu LimitedInterconnection network with self-routing function
US5490258 *Sep 29, 1992Feb 6, 1996Fenner; Peter R.Associative memory for very large key spaces
US5598410 *Dec 29, 1994Jan 28, 1997Storage Technology CorporationMethod and apparatus for accelerated packet processing
US5600795 *Aug 29, 1994Feb 4, 1997U.S. Philips CorporationLocal network operating in asynchronous transfer mode (ATM) generating control cell containing information about the user, address of the station, and user-related identification
US5721819 *May 5, 1995Feb 24, 1998Silicon Graphics CorporationProgrammable, distributed network routing
US5732080 *Jul 12, 1995Mar 24, 1998Bay Networks, Inc.Method and apparatus for controlling data flow within a switching device
US5734826 *Sep 17, 1992Mar 31, 1998International Business Machines CorporationVariable cyclic redundancy coding method and apparatus for use in a multistage network
US5862350 *Jan 3, 1997Jan 19, 1999Intel CorporationMethod and mechanism for maintaining integrity within SCSI bus with hot insertion
US5864555 *Jul 5, 1996Jan 26, 1999General Datacomm, Inc.Method and apparatus for generating a proxy connection endpoint for operation administration and management (OAM) asynchronous transfer mode (ATM) cells
US5867675 *Aug 6, 1996Feb 2, 1999Compaq Computer CorpApparatus and method for combining data streams with programmable wait states
US5870538 *Jul 18, 1996Feb 9, 1999Fujitsu Network Communications, Inc.Switch fabric controller comparator system and method
US5872769 *Jul 18, 1996Feb 16, 1999Fujitsu Network Communications, Inc.Linked list structures for multiple levels of control in an ATM switch
US5872783 *Jul 24, 1996Feb 16, 1999Cisco Systems, Inc.Arrangement for rendering forwarding decisions for packets transferred among network switches
US5875200 *Mar 28, 1997Feb 23, 1999Cirrus Logic, Inc.Reed-Solomon code system employing k-bit serial techniques for encoding and burst error trapping
US6011910 *Apr 8, 1997Jan 4, 20003Com CorporationSupporting authentication across multiple network access servers
US6016310 *Jun 30, 1997Jan 18, 2000Sun Microsystems, Inc.Trunking support in a high performance network device
US6023471 *Feb 27, 1998Feb 8, 2000Extreme NetworksNetwork interconnect device and protocol for communicating data among packet forwarding devices
US6031843 *Nov 21, 1996Feb 29, 2000Alcatel Data Networks Inc.Digital communications switching fabric
US6035414 *Nov 3, 1997Mar 7, 2000Hitachi, Ltd.Reliability of crossbar switches in an information processing system
US6038288 *Dec 31, 1997Mar 14, 2000Thomas; Gene GillesSystem and method for maintenance arbitration at a switching node
US6172990 *Nov 12, 1997Jan 9, 2001Xaqti CorporationMedia access control micro-RISC stream processor and method for implementing the same
US6178520 *Jul 31, 1997Jan 23, 2001Lsi Logic CorporationSoftware recognition of drive removal or insertion in a storage system
US6181699 *Jul 1, 1998Jan 30, 2001National Semiconductor CorporationApparatus and method of assigning VLAN tags
US6185222 *Sep 28, 1995Feb 6, 2001Cisco Technology, Inc.Asymmetric switch architecture for use in a network switch node
US6195335 *Jul 6, 1998Feb 27, 2001International Business Machines CorporationData switch
US6201492 *May 28, 1999Mar 13, 2001Cirrus Logic, Inc.Techniques for converting a plurality of channels continuously in an A/D converter
US6335932 *Jun 30, 1999Jan 1, 2002Broadcom CorporationHigh performance self balancing low cost network switching architecture based on distributed hierarchical shared memory
US6335935 *Jun 30, 1999Jan 1, 2002Broadcom CorporationNetwork switching architecture with fast filtering processor
US6343072 *Dec 31, 1997Jan 29, 2002Cisco Technology, Inc.Single-chip architecture for shared-memory router
US6351143 *Jun 15, 2001Feb 26, 2002Xilinx, Inc.Content-addressable memory implemented using programmable logic
US6356550 *Jul 30, 1999Mar 12, 2002Mayan Networks CorporationFlexible time division multiplexed bus using sonet formatting
US6356942 *Sep 29, 1998Mar 12, 2002Axis AbIntegrated circuit and method for bringing an integrated circuit to execute instructions
US6359879 *May 6, 1998Mar 19, 2002Avici SystemsComposite trunking
US6363077 *Feb 12, 1999Mar 26, 2002Broadcom CorporationLoad balancing in link aggregation and trunking
US6505281 *Jul 18, 2001Jan 7, 2003Raymond C. SherryHard disk drives employing high speed distribution bus
US6510138 *Feb 25, 1999Jan 21, 2003Fairchild Semiconductor CorporationNetwork switch with head of line input buffer queue clearing
US6522656 *Sep 29, 1998Feb 18, 20033Com CorporationDistributed processing ethernet switch with adaptive cut-through switching
US6532229 *Jan 15, 1999Mar 11, 2003Brian Weatherred JohnsonLow cost link aggregation method and system
US6532234 *Jun 30, 1998Mar 11, 2003Nec CorporationBack-pressure type ATM switch
US6535504 *Jan 15, 1999Mar 18, 2003Brian Weatherred JohnsonLink aggregation path selection method
US6678248 *Jun 20, 2000Jan 13, 2004Extreme NetworksPolicy based quality of service
US6681332 *Mar 13, 2000Jan 20, 2004Analog Devices, Inc.System and method to place a device in power down modes/states and restore back to first mode/state within user-controlled time window
US6683872 *Jul 30, 1999Jan 27, 2004The University Of TokyoVariable rate digital switching system
US6687217 *May 4, 1999Feb 3, 2004Carriercomm, Inc.Method of and system for one plus one protection for radio equipment
US6687247 *Oct 27, 1999Feb 3, 2004Cisco Technology, Inc.Architecture for high speed class of service enabled linecard
US6691202 *Dec 22, 2000Feb 10, 2004Lucent Technologies Inc.Ethernet cross point switch with reduced connections by using column control buses
US6696917 *Sep 21, 2000Feb 24, 2004Nortel Networks LimitedFolded Clos architecture switching
US6697359 *Jul 2, 1999Feb 24, 2004Ancor Communications, Inc.High performance switch fabric element and switch systems
US6697368 *May 15, 2001Feb 24, 2004Foundry Networks, Inc.High-performance network switch
US6839346 *Mar 22, 2000Jan 4, 2005Nec CorporationPacket switching apparatus with high speed routing function
US6842422 *Jun 15, 1999Jan 11, 2005Marconi Communications, Inc.Data striping based switching system
US6854117 *Oct 31, 2000Feb 8, 2005Caspian Networks, Inc.Parallel network processor array
US6856600 *Jan 4, 2000Feb 15, 2005Cisco Technology, Inc.Method and apparatus for isolating faults in a switching matrix
US6859438 *Dec 5, 2003Feb 22, 2005Extreme Networks, Inc.Policy based quality of service
US6982974 *Jan 4, 2000Jan 3, 2006Cisco Technology, Inc.Method and apparatus for a rearrangeably non-blocking switching matrix
US6990102 *May 10, 2001Jan 24, 2006Advanced Micro Devices, Inc.Parallel lookup tables for locating information in a packet switched network
US6993032 *Jun 29, 2000Jan 31, 2006Intel CorporationBuffer arrangements to support differential link distances at full bandwidth
US6996663 *Sep 12, 2001Feb 7, 2006Cisco Technology, Inc.Method and apparatus for performing address translation using a CAM
US7005812 *Jul 22, 2002Feb 28, 2006Lawrence Hardy MitchellCommutation converter for a brushless servo motor
US7161948 *Jun 17, 2002Jan 9, 2007Broadcom CorporationHigh speed protocol for interconnecting modular network devices
US7167471 *Aug 28, 2001Jan 23, 2007International Business Machines CorporationNetwork processor with single interface supporting tree search engine and CAM
US7176911 *Feb 2, 2000Feb 13, 2007Olympus CorporationSolid-state imaging apparatus
US7185141 *Oct 16, 2002Feb 27, 2007Netlogic Microsystems, Inc.Apparatus and method for associating information values with portions of a content addressable memory (CAM) device
US7185266 *Feb 12, 2003Feb 27, 2007Alacritech, Inc.Network interface device for error detection using partial CRCS of variable length message portions
US7190696 *Mar 5, 2002Mar 13, 2007Force10 Networks, Inc.System and method for distributing packets among a plurality of paths to a destination
US7324509 *Feb 26, 2002Jan 29, 2008Broadcom CorporationEfficient optimization algorithm in memory utilization for network applications
US7414979 *May 26, 2006Aug 19, 2008Cisco Technology, Inc.Method and apparatus for per session load balancing with improved load sharing in a packet switched network
US7649885 *May 6, 2002Jan 19, 2010Foundry Networks, Inc.Network routing system for enhanced efficiency and monitoring capability
US7657703 *Apr 28, 2005Feb 2, 2010Foundry Networks, Inc.Double density content addressable memory (CAM) lookup scheme
US20020001307 *Mar 12, 2001Jan 3, 2002Equipe Communications CorporationVPI/VCI availability index
US20030009466 *Jun 21, 2001Jan 9, 2003Ta John D. C.Search engine with pipeline structure
US20030012198 *Mar 7, 2002Jan 16, 2003Nec CorporationPacket processing unit
US20030043800 *Aug 30, 2001Mar 6, 2003Sonksen Bradley StephenDynamic data item processing
US20030043848 *Aug 30, 2001Mar 6, 2003Sonksen Bradley StephenMethod and apparatus for data item processing control
US20030061459 *Sep 27, 2001Mar 27, 2003Nagi AbouleneinMethod and apparatus for memory access scheduling to reduce memory access latency
US20040022263 *Aug 2, 2002Feb 5, 2004Xiaodong ZhaoCross point switch with out-of-band parameter fine tuning
US20040028060 *Jan 31, 2003Feb 12, 2004Samsung Electronics Co., Ltd.Link state synchronization method and apparatus on ad-hoc network, and data structure therefor
US20040054867 *Sep 13, 2002Mar 18, 2004Paulus StraversTranslation lookaside buffer
US20050010630 *May 13, 2004Jan 13, 2005International Business Machines CorporationMethod and apparatus for determining a remainder in a polynomial ring
US20050010849 *Mar 18, 2003Jan 13, 2005Cisco Technology, Inc., A Corporation Of CaliforniaMethod and system for emulating a Fibre Channel link over a SONET/SDH path
US20050041684 *Jul 27, 2004Feb 24, 2005Agilent Technologies, Inc.Multi-channel network monitoring apparatus, signal replicating device, and systems including such apparatus and devices, and enclosure for multi-processor equipment
US20060031610 *Aug 3, 2004Feb 9, 2006Liav Ori RFIFO sub-system with in-line correction
US20060034452 *Jun 20, 2002Feb 16, 2006Hitachi, Ltd.Code calculating device
US20070038798 *Jan 18, 2006Feb 15, 2007Bouchard Gregg ASelective replication of data structures
US20080031263 *Aug 7, 2006Feb 7, 2008Cisco Technology, Inc.Method and apparatus for load balancing over virtual network links
US20080037544 *Jul 31, 2007Feb 14, 2008Hiroki YanoDevice and Method for Relaying Packets
US20100046521 *Oct 29, 2009Feb 25, 2010Foundry Networks, Inc.System and Method for High Speed Packet Transmission
US20110002340 *Jan 6, 2011Foundry Networks, Inc.Pipeline method and system for switching packets
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US8037399Jul 18, 2007Oct 11, 2011Foundry Networks, LlcTechniques for segmented CRC design in high speed networks
US8090901May 14, 2009Jan 3, 2012Brocade Communications Systems, Inc.TCAM management approach that minimize movements
US8149839Aug 26, 2008Apr 3, 2012Foundry Networks, LlcSelection of trunk ports and paths using rotation
US8155011Dec 10, 2007Apr 10, 2012Foundry Networks, LlcTechniques for using dual memory structures for processing failure detection protocol packets
US8170044May 1, 2012Foundry Networks, LlcPipeline method and system for switching packets
US8194666Jan 29, 2007Jun 5, 2012Foundry Networks, LlcFlexible method for processing data packets in a network routing system for enhanced efficiency and monitoring capability
US8238255Aug 7, 2012Foundry Networks, LlcRecovering from failures without impact on data traffic in a shared bus architecture
US8271859Jul 18, 2007Sep 18, 2012Foundry Networks LlcSegmented CRC design in high speed networks
US8395996Dec 10, 2007Mar 12, 2013Foundry Networks, LlcTechniques for processing incoming failure detection protocol packets
US8448162Dec 27, 2006May 21, 2013Foundry Networks, LlcHitless software upgrades
US8493988Sep 13, 2010Jul 23, 2013Foundry Networks, LlcMethod and apparatus for aggregating input data streams
US8509236Aug 26, 2008Aug 13, 2013Foundry Networks, LlcTechniques for selecting paths and/or trunk ports for forwarding traffic flows
US8599850Jan 7, 2010Dec 3, 2013Brocade Communications Systems, Inc.Provisioning single or multistage networks using ethernet service instances (ESIs)
US8671219May 7, 2007Mar 11, 2014Foundry Networks, LlcMethod and apparatus for efficiently processing data packets in a computer network
US8718051Oct 29, 2009May 6, 2014Foundry Networks, LlcSystem and method for high speed packet transmission
US8730961Apr 26, 2004May 20, 2014Foundry Networks, LlcSystem and method for optimizing router lookup
US8811390Oct 29, 2009Aug 19, 2014Foundry Networks, LlcSystem and method for high speed packet transmission
US8989202Feb 16, 2012Mar 24, 2015Foundry Networks, LlcPipeline method and system for switching packets
US9030943Jul 12, 2012May 12, 2015Foundry Networks, LlcRecovering from failures without impact on data traffic in a shared bus architecture
US9112780Feb 13, 2013Aug 18, 2015Foundry Networks, LlcTechniques for processing incoming failure detection protocol packets
US9166818Nov 18, 2013Oct 20, 2015Brocade Communications Systems, Inc.Provisioning single or multistage networks using ethernet service instances (ESIs)
US9338100Jun 24, 2013May 10, 2016Foundry Networks, LlcMethod and apparatus for aggregating input data streams
US9378005Apr 12, 2013Jun 28, 2016Foundry Networks, LlcHitless software upgrades
US20070208876 *May 7, 2007Sep 6, 2007Davis Ian EMethod and apparatus for efficiently processing data packets in a computer network
US20080205407 *Feb 20, 2008Aug 28, 2008Andrew ChangNetwork switch cross point
US20090279423 *Jul 31, 2007Nov 12, 2009Foundry Networks, Inc.Recovering from Failures Without Impact on Data Traffic in a Shared Bus Architecture
US20090279440 *Nov 12, 2009Foundry Networks, Inc.Techniques for processing incoming failure detection protocol packets
US20090279542 *Nov 12, 2009Foundry Networks, Inc.Techniques for using dual memory structures for processing failure detection protocol packets
US20090279546 *Jan 29, 2007Nov 12, 2009Ian Edward DavisFlexible method for processing data packets in a network routing system for enhanced efficiency and monitoring capability
US20090279549 *Dec 27, 2006Nov 12, 2009Foundry Networks, Inc.Hitless software upgrades
US20090282148 *Nov 12, 2009Foundry Networks, Inc.Segmented crc design in high speed networks
US20090282322 *Jul 18, 2007Nov 12, 2009Foundry Networks, Inc.Techniques for segmented crc design in high speed networks
US20100046521 *Oct 29, 2009Feb 25, 2010Foundry Networks, Inc.System and Method for High Speed Packet Transmission
US20100135313 *Nov 23, 2009Jun 3, 2010Foundry Networks, Inc.Network routing system for enhanced efficiency and monitoring capability
US20100246588 *Feb 8, 2010Sep 30, 2010Foundry Networks, Inc.System architecture for very fast ethernet blade
US20110002340 *Jan 6, 2011Foundry Networks, Inc.Pipeline method and system for switching packets
Classifications
U.S. Classification370/392
International ClassificationH04L12/56
Cooperative ClassificationH04L47/125, H04L45/24, H04L45/7453, H04L47/2408, H04L45/00
European ClassificationH04L47/24A, H04L45/00, H04L47/12B, H04L45/24, H04L45/7453