US20060248375A1 - Packet processing switch and methods of operation thereof - Google Patents

Packet processing switch and methods of operation thereof Download PDF

Info

Publication number
US20060248375A1
US20060248375A1 US11/394,886 US39488606A US2006248375A1 US 20060248375 A1 US20060248375 A1 US 20060248375A1 US 39488606 A US39488606 A US 39488606A US 2006248375 A1 US2006248375 A1 US 2006248375A1
Authority
US
United States
Prior art keywords
packet
packets
packet processing
scenarios
scenario
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US11/394,886
Inventor
Bertan Tezcan
William Beane
Scott Darnell
A. David MacAdam
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Renesas Electronics America Inc
Original Assignee
Integrated Device Technology Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Integrated Device Technology Inc filed Critical Integrated Device Technology Inc
Priority to US11/394,886 priority Critical patent/US20060248375A1/en
Assigned to INTEGRATED DEVICE TECHNOLOGY, INC. reassignment INTEGRATED DEVICE TECHNOLOGY, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: DARNELL, SCOTT, MACADAM, A. DAVID S., BEANE, WILLIAM TERRY, TEZCAN, BERTAN
Priority to US11/279,288 priority patent/US20060248374A1/en
Priority to PCT/US2006/013767 priority patent/WO2006113302A1/en
Priority to CN2006800219116A priority patent/CN101199170B/en
Priority to JP2008507723A priority patent/JP2008539613A/en
Priority to DE602006019706T priority patent/DE602006019706D1/en
Priority to EP06740915A priority patent/EP1875688B1/en
Assigned to INTEGRATED DEVICE TECHNOLOGY, INC. reassignment INTEGRATED DEVICE TECHNOLOGY, INC. OUR ERROR, PLEASE CORRECT INVENTOR 1 BERTAN TEZCAN'S EXECUTION DATE TO MARCH 27, 2006 AT R/F 017756/0253 Assignors: DARNELL, SCOTT, MACADAM, A. DAVID S., BEANE, WILLIAM TERRY, TEZCAN, BERTAN
Publication of US20060248375A1 publication Critical patent/US20060248375A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/30Peripheral units, e.g. input or output ports
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/52Multiprotocol routers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/10Packet switching elements characterised by the switching fabric construction
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/10Packet switching elements characterised by the switching fabric construction
    • H04L49/109Integrated on microchip, e.g. switch-on-chip
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/10Packet switching elements characterised by the switching fabric construction
    • H04L49/111Switch interfaces, e.g. port details
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/10Packet switching elements characterised by the switching fabric construction
    • H04L49/113Arrangements for redundant switching, e.g. using parallel planes
    • H04L49/118Address processing within a device, e.g. using internal ID or tags for routing within a switch
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/25Routing or path finding in a switch fabric
    • H04L49/251Cut-through or wormhole routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/25Routing or path finding in a switch fabric
    • H04L49/253Routing or path finding in a switch fabric using establishment or release of connections between ports
    • H04L49/254Centralised controller, i.e. arbitration or scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/30Peripheral units, e.g. input or output ports
    • H04L49/3018Input queuing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/35Switches specially adapted for specific applications
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/15Interconnection of switching modules
    • H04L49/1515Non-blocking multistage, e.g. Clos
    • H04L49/1546Non-blocking multistage, e.g. Clos using pipelined operation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/30Peripheral units, e.g. input or output ports
    • H04L49/3027Output queuing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/30Peripheral units, e.g. input or output ports
    • H04L49/3063Pipelined operation

Definitions

  • the packet processor is configurable to extract data from payloads of the received packets and to process the extracted data to produce the new packets with payloads having formats compatible with data structures of the external recipients.
  • the packet processor may be configurable to perform bit extension, bit truncation, bit reordering and/or bit arithmetic operations on the received packets.
  • a packet processing switch IC chip 200 may be user-configurable to provide various port configurations, packet processing scenarios, and/or switching functions defined in, for example, configuration registers 250 .
  • the configuration registers 250 may, for example, store parameters for packet processing scenarios 232 implemented by a packet processor 230 , parameters for operations of a switching fabric 240 and/or parameters for configuration of input and output ports 210 , 220 .
  • the configuration registers 250 may be configured via one of the input ports 210 and/or via an inter-integrated circuit (I 2 C) bus interface 260 .
  • I 2 C inter-integrated circuit
  • Links 4 - 7 are set to be 1x ports 1 - 4 operating at 1.25 Gb/s, and the remaining links are assigned to 4x, 1.25 Gb/s ports.
  • the sample processing 810 may include reordering operations, such as rearranging the order of subsamples and/or the order of bits within samples. For example, assuming a sample is 4 bits 1 and 4-bits Q, the sample processing 810 may including flipping the I and Q subsamples individually as follows: Input: I 0 I 1 I 2 I 3 Q 0 Q 1 Q 2 Q 3 Output: I 3 I 2 I 1 I 0 Q 3 Q 2 Q 1 Q 0
  • FIG. 18 A second example of packet processing according to further embodiments of the present invention is illustrated in FIG. 18 .
  • Multiple synthesized packets are generated from the queues 0 - 7 illustrated in FIG. 16 , with each synthesized packet including 4 samples from each queue. All of the synthesized packets are sent to output ports 20 , 22 , and 23 , and each is addressed to a respective memory address of a target device.

Abstract

A packet processing integrated circuit chip includes a plurality of input ports configured to receive packets from respective external sources and a plurality of output ports configured to transmit packets to respective external recipients. The chip further includes a packet processor configured to process the received packets to generate new packets with new payloads according to selected ones of a plurality of packet processing scenarios based on destination addresses in the received packets. The plurality of packet processing scenarios may include individual packet processing scenarios and group packet processing scenarios that invoke parallel processing of a packet by selected ones of the individual packet processing scenarios. The chip may further include a packet switching fabric configured to route selected packets from the input ports to selected ones of the output ports without payload modification.

Description

    CROSS-REFERENCE TO RELATED APPLICATION
  • The present application claims the benefit of U.S. Provisional Application Ser. No. 60/672,349, filed Apr. 18, 2005, the disclosure of which is hereby incorporated by reference herein in its entirety.
  • BACKGROUND OF THE INVENTION
  • This invention relates to packet communications devices and methods and, more particularly, to packet switching devices and methods.
  • Increasing demand for communications services have generally increased bandwidth requirements for network components. For example, the increased volume of wireless communications has been generally accompanied by an increase in the bandwidth requirements between wireless terminals and base stations. Users demanding more information and more services from their cell phones and other wireless devices can overwhelm available bandwidth. Wireless service providers are migrating to 2.5G and 3G technologies to mitigate this problem. These technologies generally enable more data per broadcast band than 2G technologies, which can be used to give more bandwidth to individual users or to serve more users in the same cell area.
  • An important aspect of 3G wireless communications systems is closed loop power control. For example, in wideband code division multiple access (WCDMA) systems, it is typically desirable that a base station be capable of telling a mobile terminal to adjust its transmission power within 5 milliseconds after receiving a packet from the terminal. This can be the most constraining limitation on total delay in the base station, as it includes the round-trip delay of received radio signal sample going from an RF card, to a baseband card, and on to a control card, and back to the baseband card, RF card, and antenna. Each base station may have several RF and baseband cards, and signal samples may be transferred between any given RF card and any given baseband card. Reducing latency in transferring data between these cards tends to be important.
  • Different architectures may be used to convey data between such cards. In a full-mesh architecture, each RF card is connected to each baseband card. A switched architecture provides a multiple-input multiple-output switch between the RF and baseband cards. The switched architecture can provide improved scalability and flexibility, but may add more latency than the full-mesh solution. Also, for smaller systems, a full-mesh architecture may be less expensive than a switched architecture.
  • Integrated circuits (ICs) have been developed that can support communications between base station components, such as RF cards and baseband cards. For example, Spectrum Signal Processing Inc. offers the ASIC-based Solano™ chip that can be used to interface processors, such as digital signal processors (DSPs), RISC processors, and FPGAs, and sources of data, such as RF cards. The chip includes eight high-speed FIFOs, with associated control logic, that are paired to form four full-duplex channels. Tundra Semiconductor Corporation offers Serial RapidIO® chips that include a switching fabric that can be used to provide a switched architecture between RF and baseband cards.
  • SUMMARY OF THE INVENTION
  • According to some embodiments of the present invention, a packet processing integrated circuit chip includes a plurality of input ports configured to receive packets from respective external sources and a plurality of output ports configured to transmit packets to respective external recipients. The chip further includes a packet processor configured to process the received packets to generate new packets with new payloads according to selected ones of a plurality of packet processing scenarios based on destination addresses in the received packets. The plurality of packet processing scenarios may include individual packet processing scenarios and group packet processing scenarios that invoke parallel processing of a packet by selected ones of the individual packet processing scenarios. The chip may further include a packet switching fabric configured to route selected packets from the input ports to selected ones of the output ports without payload modification.
  • In further embodiments, the packet processor is configurable to extract data from payloads of the received packets and to process the extracted data to produce the new packets with payloads having formats compatible with data structures of the external recipients. For example, the packet processor may be configurable to perform bit extension, bit truncation, bit reordering and/or bit arithmetic operations on the received packets.
  • According to additional embodiments of the present invention, timing of each packet processing scenario is controlled responsive to received packet accumulation for the packet processing scenario. The packet processor may be configured to initiate packet accumulation for a packet processing scenario responsive to an initialization signal.
  • In some embodiments of the present invention, an interface circuit for conveying data between a first plurality of circuit cards and a second plurality of circuit cards includes a plurality of input ports configured to receive packets from respective ones of the first plurality of circuit cards and a plurality of output ports configured to transmit packets to respective ones of the second plurality of circuit cards. The interface circuit further includes a packet processor configured to process the received packets to generate new packets with new payloads according to selected ones of a plurality of packet processing scenarios based on destination addresses in the received packets. The interface circuit may further include a packet switching fabric configured to route selected packets from the input ports to selected ones of the output ports without payload modification. In some wireless communications embodiments, the plurality of input ports are configured to receive packets from respective ones of a plurality of RF cards and the plurality of output ports are configured to transmit packets to respective ones of a plurality of baseband cards.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a schematic diagram illustrating a packet processing switch integrated circuit chip according to some embodiments of the present invention.
  • FIG. 2 is a schematic diagram illustrating a packet processing switch integrated circuit chip according to further embodiments of the present invention.
  • FIGS. 3 and 4 illustrate exemplary port configurations for a packet processing switch according to some embodiments of the present invention.
  • FIG. 5 illustrates an exemplary packet flow architecture for a packet processing switch according to some embodiments of the present invention.
  • FIGS. 6 and 7 illustrate using packet destination addresses to route packets in a packet processing switch according to further embodiments of the present invention.
  • FIG. 8 illustrates an exemplary packet processing scenario structure according to some embodiments of the present invention.
  • FIGS. 9 and 10 illustrate exemplary packet payload formats that may be used with some embodiments of the present invention.
  • FIG. 11 illustrates exemplary channel queues of a packet processor according to further embodiments of the present invention.
  • FIGS. 12 and 13 illustrate exemplary summing operations of a packet processor according to some embodiments of the present invention.
  • FIG. 14 illustrates an exemplary packet processing switch interface circuit application according to further embodiments of the present invention.
  • FIG. 15 illustrates exemplary packet structures for source cards of the application illustrated in FIG. 14.
  • FIG. 16 illustrates exemplary sample queues formed from the packets illustrated in FIG. 15.
  • FIGS. 17-20 illustrate exemplary output packets produced from the packets of FIG. 15 by various packet processing scenarios according to various embodiments of the present invention.
  • FIG. 21 illustrates exemplary operations of a packet processor according to some embodiments of the present invention.
  • FIGS. 22 and 23 illustrate exemplary packet processing initialization operations according to further embodiments of the present invention.
  • FIGS. 24-27 illustrate exemplary timing relationships for packet processing scenarios according to some embodiments of the present invention.
  • FIGS. 28 and 29 illustrate packet processors and exemplary operations thereof according to further embodiments of the present invention.
  • DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS
  • Specific exemplary embodiments of the invention now will be described with reference to the accompanying drawings. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. In the drawings, like numbers refer to like elements. It will be understood that when an element is referred to as being “connected” or “coupled” to another element, it can be directly connected or coupled to the other element or intervening elements may be present. Furthermore, “connected” or “coupled” as used herein may include wirelessly connected or coupled. As used herein the term “and/or” includes any and all combinations of one or more of the associated listed items.
  • The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless expressly stated otherwise. It will be further understood that the terms “includes,” “comprises,” “including” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
  • Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
  • FIG. 1 illustrates a packet-processing switch integrated circuit (IC) chip 100 according to some embodiments of the present invention. The chip 100 includes input ports 110 that are configured to receive data packets. Packets received at the input ports 110 are selectively routed to a packet processor 130 or a switching fabric 140. The switching fabric 140 provides for routing of the received packets to output ports 120 of the chip 100 without payload modification.
  • The packet processor 130 synthesizes new packets with new payloads from selected packets received at the input ports 110 according to selected packet processing scenarios (PPScs) 132, with the synthesized packets being transmitted to external recipient devices via the output ports 120. As explained in detail below, the packet processing scenarios 132 may include various payload manipulations, such as bit extension, bit truncation, bit reordering (e.g., interleaving and/or flipping), and combining (e.g., summing or other arithmetic operations) of payloads from multiple received packets. Thus, for example, when used in a signal sample processing application such as in a wireless base station, the chip 100 can relieve the external recipient, e.g., a digital signal processor (DSP) or chip rate processor (CRP), of the burden of reformatting a received signal sample stream for downstream operations, such as baseband processing. In addition, the packet processing scenarios 132 may be user-configurable, allowing the chip to be used for a variety of different communications protocols and/or messaging formats.
  • In various embodiments of the present described herein, a packet processing chip, such as the chip 100 illustrated in FIG. 1, may be configured to provide packet communications compliant with the RapidIO™ interconnect architecture, which includes physical and logical communications specifications for inter-device communications, as generally described at www.rapidio.org. It will be appreciated however, that although the exemplary embodiments described herein relate to RapidIO™-compliant packet processing switch chips and operations thereof, the present invention may use other packet communication architectures.
  • As shown in FIG. 2, a packet processing switch IC chip 200 according to further embodiments of the present invention may be user-configurable to provide various port configurations, packet processing scenarios, and/or switching functions defined in, for example, configuration registers 250. The configuration registers 250 may, for example, store parameters for packet processing scenarios 232 implemented by a packet processor 230, parameters for operations of a switching fabric 240 and/or parameters for configuration of input and output ports 210, 220. As shown, the configuration registers 250 may be configured via one of the input ports 210 and/or via an inter-integrated circuit (I2C) bus interface 260.
  • An example of an input/output port configurability scheme is illustrated in FIG. 3. In the illustrated example, 40 input/output links (lanes) may be programmable into 4x or 1x ports. Each link may, for example, be configured to handle long and short haul serial transmission as defined, for example, by the RapidIO™ serial specifications. Links 0-3 are programmable into one 4x or one 1x port, Links 4-7 are programmable into one 4x or four 1x ports, and Links 20-23 can be programmed as one 4x port. In the illustrated example, each link is a part of four-link group that is configured together, i.e., Link 3 is not configured with Links 4,5,6, and 7. The ports are numbered from Link 0 to Link 40 in ordered fashion. For example, if Links 0-3 are configured as a 4x port, they are assigned to be port 0; if links 4-7 are configured as individual 1x ports, they are assigned to port numbers 1 to 4. Table 1 illustrates some exemplary configurations:
    TABLE 1
    Number Total
    of 4x Max number Total Links ports =
    Configuration ports (A) of 1x ports (B) Used = 4A + B A + B
    1 10  40 10
    2 9  4 40 13
    3 8  8 40 16
    4 7 12 40 19
    5 6 16 40 22
    6 5 16 36 21
    7 4 20 36 24
    8 3 20 32 23
    9 2 20 28 22
    10  1 23 24 21
    11  24 24 24
  • Referring again to FIG. 2, the configuration registers 250 may include registers to define port configuration, speed and/or timing (long run/short run), and other port characteristics. These registers can be programmed, for example, through the I2 C bus interface 260 during an initialization procedure. In some embodiments, the I2C interface 260 may not be employed, and packets received via the input ports 210 may be used instead for device configuration. In such implementations, the input ports 210 may have a default (e.g., power-on) configuration to enable communication with the configuration source. This initial configuration does not have to be the end-desired configuration, but can allow communications to begin with the chip such that a desired configuration can be programmed. An exemplary power-on configuration is shown in FIG. 4, where Link 0 is set to be a 1x port 0 operating at 1.25 Gb/s, Links 4-7 are set to be 1x ports 1-4 operating at 1.25 Gb/s, and the remaining links are assigned to 4x, 1.25 Gb/s ports.
  • FIG. 5 illustrates an exemplary packet flow architecture for a packet processing switch IC chip 500 according to further embodiments of the present invention. The chip 500 includes input ports 510 including input FIFOs 512 that receive packets from an external source. The received packets are transferred from the input FIFOs 512 to either a packet processor 530 or a switching fabric 540, for example, using destination addresses therein, as described in further detail below. The packet processor 530 and the switching fabric 540 respectively route synthesized packets or payload-unmodified packets to output ports 520, shown as including output FIFOs 524 and associated muxes 522.
  • Assuming, for purposes of the illustrated embodiments, that the received packets are RapidIO™ packets that include priority fields therein, the received packets intended for the switching fabric 540 may be stored in input buffers 542 based on the priority information in the received packets, and provided to a packet switch 544 according to the priority structure of the input buffers 542. Respective groups of the input buffers 542 are associated with respective ones of the input ports 510. The priority structure of each group of input buffers 542 may be user-configurable. For example, certain buffers may be assigned (e.g., using configuration registers) to receive packets having different ones of RapidIO™ priority levels 0-3. The switch 544 routes the packets from the input buffers 542 to various ones of a plurality of priority-structured groups of output buffers 546, with respective ones of the groups of output buffers 546 being associated with respective ones of the output ports 520.
  • In the packet processor 530, received packets to be processed in packet processing scenarios 534 are stored in input buffers 532. The packet processing scenarios 534 synthesize packets from the stored received packets. The synthesized packets are stored in output buffers 536, respective groups of which are associated with respective ones of the output ports 520. The synthesized packets may include priority information recovered from the received packets. The packets stored in the output buffers 536, 546 may be routed to the output ports 520 using, for example, round robin scheduling algorithms.
  • According to certain embodiments of the present invention illustrated in FIG. 6, routing of a received packet 600 to a packet processor 610 or a switching fabric 620 may be controlled based on a destination address 601 included in the received packet. In particular, respective destination addresses may be reserved for respective packet processing scenarios 612 supported by the packet processor 610, while other addresses are mapped to the switching fabric 620. Such an approach may be advantageous because it may be desirable that manipulation by the packet processor 610 be transparent to the sending and/or receiving device.
  • As shown in FIG. 7, packet processing scenarios implemented by a packet processor may include individual packet processing scenarios 710 and group packet processing scenarios 720. The individual packet processing scenarios 710 may be assigned to certain destination addresses 701 of input packets 700. The individual packet processing scenarios may be user configurable using, for example, configuration registers (e.g., the registers 250 of FIG. 2). Such configuration registers may, for example, define payload formats and operations performed on packet payloads for the particular packet processing scenarios. The group packet processing scenario addresses 720 may have other destination addresses 710 assigned thereto. As illustrated, the group packet processing scenarios 720 may be used to cause received packets to be multicast to groups of the individual packet processing scenarios 710 for parallel processing. Such groupings of individual packet processing scenarios may be configurable using, for example, configuration registers.
  • FIG. 8 illustrates an exemplary packet processing scenario 800 according to some embodiments of the present invention. The scenario 800 includes sample processing block 810, which may include, depending on the configuration of the scenario 800, initial sample and sub-sample level operations, such as increasing (padding) or decreasing the number of bits in a sample and/or flipping the order of bits and/or subsamples before queuing samples associated with separate channels (e.g., antennas) in separate queues in a queuing block 820. The queued samples may be further processed in the sample processing block 810 before transmission to a packet construction block 830, which creates new synthesized packets from the processed samples.
  • A packet processing scenario may receive, for example, packets corresponding to M channels, with N signal samples per channel and R repetitions of this structure in each packet. After termination of the packet overhead, packet payloads stored in the packet processor input buffers may look as illustrated in FIG. 9, where the payloads include reserved user fields (i.e., fields that are not processes) and signal samples A111, . . . , ARMN; B111, . . . , BRMN; . . . ; X111, . . . , XRMN. As shown in FIG. 10, each of the samples A111, . . . , ARMN, B111, . . . , BRMN, . . . X111, . . . , XRMN may, in turn, include multiple sub-samples, for example, I and Q channel subsamples I0, . . . , IB-1, Q0, . . . , QB-1. The sample format recognized by each packet processing scenario and/or the operations performed in each scenario may be register-configurable.
  • Beyond bit extension/truncation operations, the sample processing 810 may include reordering operations, such as rearranging the order of subsamples and/or the order of bits within samples. For example, assuming a sample is 4 bits 1 and 4-bits Q, the sample processing 810 may including flipping the I and Q subsamples individually as follows:
    Input: I0 I1 I2 I3 Q0 Q1 Q2 Q3
    Output: I3 I2 I1 I0 Q3 Q2 Q1 Q0
  • The sample processing 810 may also rearrange the order of subsamples in a sample as follows:
    Input: I0 I1 I2 I3 Q0 Q1 Q2 Q3
    Output: Q0 Q1 Q2 Q3 I0 I1 I2 I3
  • The sample processing 810 may also interleave I and Q bits as follows:
    Input: I0 I1 . . . IB−1 Q0 Q1 . . . QB−1
    Output: I0 Q0I1 Q1 . . . IB−1 QB−1
  • These and other operations in the sample processing 810 may need to be performed in a particular order to maintain sample integrity. For example, assuming that input samples have an IQ format, are IQ interleaved, and each I and Q subsample has 6 bits, to produce an interleaved, IQ-flipped, sign-extended output, operations may need to be performed as follows:
    Input: I0 Q0 I1 Q1 I2 Q2 I3 Q3 I4 Q4 I5 Q5;
    Deinterleave I and Q: I0 I1 I2 I3 I4 I5 Q0 Q1 Q2 Q3 Q4 Q5;
    Sign extend from LSB I0 I1 I2 I3 I4 I5 I5 I5 Q0 Q1 Q2 Q3 Q4 Q5 Q5 Q5;
    to 8 bits:
    Flip: I5 I5 I5 I4 I3 I2 I1 I0 Q5 Q5 Q5 Q4 Q3 Q2 Q1 Q0;
    Change IQ order: Q5 Q5 Q5 Q4 Q3 Q2 Q1 Q0 I5 I5 I5 I4 I3 I2 I1 I0; and
    IQ Output Interleave: Q5 I5 Q5 I5 Q5 I5 Q4 I4 Q3 I3 Q2 I2 Q1 I1 Q0 I0.

    As shown in FIG. 9, after initial processing, samples corresponding to respective ones of the M channels are placed in respective queues.
  • A given packet processing scenario also may be set up to provide for summing or other arithmetic operations on payloads from multiple packets, as illustrated in FIG. 12. In particular, as shown in FIG. 13, a new set of queues 1320 may be established to hold summation results from summing samples from multiple ports that are stored in other queues 1310. If summing is included in a particular scenario, certain bit manipulation operations of the sample processing, such as deinterleaving and bit extension or deletion, may have to be performed before summation, while other operations, such as flipping, I-Q ordering and interleaving, may need to be performed after summation.
  • Exemplary use of a packet processing switch chip in a wireless base station environment according to some embodiments of the present invention will now be described with reference to FIGS. 14-20. It will be appreciated that these examples are offered for purposes of illustration, and that the present invention is not limited to the specific operations and architectures illustrated or, more generally, to application in wireless applications.
  • A typical wireless base station architecture is shown in FIG. 14, where four RF cards 1410 a, 1410 b, 1410 c, 1410 d provide packets containing radio signal samples to respective input ports 1421 of a packet processing switch (PPS) chip 1420. The chip 1420 processes payloads of the received packets, producing packets that are transmitted to respective digital signal processors/chip rate processors (DSPs/CRPs) 1430 a, 1430 b, 1430 c via respective output ports 1422. It will be appreciated that the DSPs/ CRPs 1430 a, 1430 b, 1430 c may, for example, be configured to perform certain baseband processing functions, such as demodulation and decoding, on the signal samples produced by the RF cards 1410 a, 1410 b, 1410 c, 1410 d. For purposes of the following examples shown in FIGS. 15-20, each RF card 1410 a, 1410 b, 1410 c, 1410 d has 2 antenna channels, designated as Ant A and Ant B, per card. Each I and Q component is assumed to be 8 bits (1 byte), with no bit interleaving. The number of adjacent samples in a serial packet from the same antenna is 2, and the repetition is 2. Each packet from each RF card will contain 8 samples, including 4 samples from antenna A and 4 samples from antenna B. The incoming packets to the PPS chip 1420 on the respective input ports 1421 may look as illustrated in FIG. 15. Some preprocessing, such as bit extension/deletion operations, will not be illustrated. FIG. 16 illustrates queues 0-7 formed for the respective channels after preprocessing.
  • A first example of packet processing according to some embodiments of the present invention is illustrated in FIG. 17. A single packet is synthesized from all of the queues 1-7, with no summing of the samples. The synthesized packet is sent to output ports 20, 22, and 23, addressed to a specific memory address in a target device.
  • A second example of packet processing according to further embodiments of the present invention is illustrated in FIG. 18. Multiple synthesized packets are generated from the queues 0-7 illustrated in FIG. 16, with each synthesized packet including 4 samples from each queue. All of the synthesized packets are sent to output ports 20, 22, and 23, and each is addressed to a respective memory address of a target device.
  • In some applications, a user may want to send different packets to different destination groups. To do this, the user may send the packet to a group packet processing scenario address using an addressing scheme along the lines described above with reference to FIG. 7. This results in parallel operation of multiple packet processing scenarios, with each input packet being received by each of the multiple scenarios. The scenarios can independently process the packets, and generate different packets and send them to different ports.
  • An example of such multiple-packet to multiple-destination packet processing according to further embodiments of the present invention is illustrated in FIG. 19. The user sends a packet destined to a group packet processing scenario, which maps to two individual packet processing scenarios. The first scenario takes inputs from queues 0, 2, 4 and 6. The packet produced by the first scenario is sent to output ports 20, 22. The second scenario takes inputs from queues 1, 3, 5, and 7. The packet produced by the second scenario is sent to output port 23.
  • FIG. 20 shows an example wherein summing is enabled. When summing is enabled, respective channels are summed and new queues are formed. The resulting synthesized packet is sent to output ports 20, 22 and 23.
  • Referring again to FIG. 1, packets that are received at any of the input ports 110 of a packet processing switch IC chip 100 may be packets (e.g., signal sample packets) that require processing in the packet processor 120 or packets that are to be forwarded by the switching fabric 130 without payload modification. In addition, packets for different packet processing scenarios 132 may be multiplexed at any of the input ports. It is generally desired that operations of the packet processor 130 be synchronized to maintain desired data rates and to meet other timing criteria. Exemplary operations for synchronizing packet processing operations will now be described with reference to FIGS. 21-26.
  • According to some embodiments of the present invention, a packet processor operates using a dynamic packet accumulation approach. Once all incoming packets needed to complete a particular scenario have been accumulated at the device, they are processed to form one or more output packets associated with the scenario. The output packet(s) is then transmitted out of the output port(s) associated with the scenario. In some embodiments, each packet processing scenario processes one input packet per port per processing interval, with all input packets being used by a particular scenario running at substantially the same data rate and having the same size and format.
  • In some embodiments, dynamic packet accumulation may be implemented using a state machine that transitions responsive to accumulation and processing events. Each scenario may be configured (e.g., via configuration registers, such as the configuration registers 250 in FIG. 2) with knowledge of the input ports that will be providing packets. Referring to FIG. 21, after initialization of the state machine (block 2105), packets for a scenario begin accumulating (block 2110). In the illustrated embodiments, it is required that all packets destined for the scenario start accumulating within the accumulation time for a first arriving packet; the payload for any packet arriving after the first packet has completed accumulation is replaced with a default payload ( blocks 2115, 2120, 2125). After all packets that meet the requirement to start accumulation in the accumulation window defined by the accumulation time of the first-arriving packet have completed accumulation, the packets (i.e., the accumulated packet and, in some cases, any replacement packets) are processed to generate one or more output packets (blocks 2130, 2135), which are then transmitted (block 2140). A new accumulation period (block 2110) may commence after processing of the previously received packets begins.
  • A packet processing scenario may be initialized, for example, by a write to an initialization register or some other initialization signal. A succeeding received packet associated with the packet processing scenario (e.g., a packet addressed to the scenario's address) may then be considered as the first packet into the scenario.
  • FIG. 22 illustrates Scenarios 0-4, which can be synchronized independent of one another by sending respective initiation signals Init1-Init4. If an initialization signal is sent to a group packet processing scenario along the lines described above with reference to FIG. 7, all related individual packet processing scenarios may be initialized. If an input port is used for more than one scenario, the initialization signals for the multiple scenarios may be received on the same port or on separate ports. After receipt of its initialization signal, a packet processing scenario begins accumulating packets (as shown in the shaded areas), followed by processing of the accumulated packets to synthesize new packets. As shown in FIG. 22, accumulation of packets for any given scenario begins with the start of accumulation of a first-arriving packet for the scenario. Generally, scenarios do not have to start at the same time. In further embodiments, a “global” initialization may be achieved, for example, by writing to a global initialization register and/or by simultaneously providing initialization signals to all packet processing scenarios, as shown in FIG. 23. A global initialization signal may come via any port.
  • Different scenarios may have different latencies associated with the size and packet processing needed. Generally, processing time is dependant on the amount of data sent to a scenario (size of packet and number of incoming ports), and the type of calculation (sample manipulation, addition, etc.).
  • FIG. 24 shows an example in which 5 scenarios 0-4 are in operation. Scenario 0 has space between the arrival of first and second packets on ports 0 and 2, illustrating that processing time may dictate how often a packet can be sent to a given scenario from a given port. In particular, processing 2410 for a first iteration of Scenario 0 may occur concurrent with accumulation of packets for a succeeding second iteration 2420 of Scenario 0. Scenario 2 is similar to Scenario 0, except that Scenario 2 has a smaller packet size and a longer processing time, which means that packets for Scenario 2 are sent at lower rate than for Scenario 0. Port 1 and port 4 receive packets destined for multiple Scenarios 1, 3 and 4, illustrating that a port may be more efficiently used by “hiding” the processing time for a particular scenario by sending a packet for a different scenario during the processing interval. By multiplexing packets for multiple scenarios on Port 1 and Port 4, throughput may be increased.
  • The dynamic packet accumulation described above can provide significant flexibility in system synchronization. According to some embodiments of the present invention, packet processing scenarios wait for the first packet to arrive to begin the accumulation phase on a per scenario basis. This allows for initialization of the packet processor before bringing up the transmitters connected to the device, because each scenario begins operating after it begins receiving packets.
  • If a “standard” packet that is not intended for payload processing (e.g., a packet that is to be routed by a switching fabric, such as the switching fabric 130 of FIG. 1) is sent to a port that is also receiving packets that require payload processing, the standard packet may be received during idle time (e.g., processing time) of the port. This is illustrated in FIG. 25, where standard packets are multiplexed with packets intended for packet processing scenarios PPSc1-3. If no ports have sufficient idle time to “fit” a standard packet, then the user could dedicate ports for packets to be payload-processed and separate ports for standard packets.
  • Accumulation of packets may be limited to an accumulation window defined by arrival of a first packet. This requirement can tie the valid arrival window for packets going to the same scenario to the data rate of the links, as illustrated in FIG. 26. As shown, a packet of a group PPSc 0 Group 0 on Port 2 arrives first and dictates the valid arrival window for all other packets destined for the same scenario PPSc0. As shown, a packet from the same group on Port 5 is late, arriving after the packet on Port 2 has accumulated. The packet on Port 5 may be ignored, e.g., a value of all zeros (or some other value) may be used in its place during processing. A next accumulation window is started with the arrival of a first packet of a group PPSc 0 Group 1 after all previous valid Group 0 packets have finished processing. As described above, the arrival time of the next group of packets into the packet processor may be dictated by the processing time of the previous group.
  • In further embodiments of the present invention, a time-division multiplexed (TDM) mode of operation may be achieved by sending packets at times dictated by the longest processing time of all the operative scenarios in the packet processor. Referring to FIG. 27, arrival times of all packets for packet processing scenarios PPSc 0-3 can be controlled such that the windows 2710 shown in FIG. 27 are wide enough to support the longest processing time of all the scenarios. The packet processor may be configured to control transmission of outgoing packets from the scenarios PPSc 0-3 to make the device appear to be operating in a TDM mode. In particular, the device may initiate transmission of outgoing packets with the start of accumulation of a next incoming group of packets after processing of the outgoing packets has completed.
  • FIG. 28 illustrates an alternative configuration for a packet processor 2800 (e.g., a packet processor for use in a packet processing switch, such as the packet processing switch 100 of FIG. 1) according to further embodiments of the present invention. The packet processor 2800 includes an input packet buffer 2810 configured to store incoming packets. A FIFO Read Controller (FRC) 2820 reads data (e.g., signal samples from payloads of received messages) from the input packet buffer 2810 as specified by a pointer table 2830. The pointer table 2830 relates input data locations in the input packet buffer 2810 to output data locations in an output packet buffer 2850. A processor 2840 performs sample manipulation as specified by information stored in packet processing scenario (PPSc) configuration registers 2860. Processed data output by the processor 2840 is written into the output packet buffer 2850, which contructs output packets therefrom.
  • FIG. 29 illustrates an exemplary configuration for a packet processor along the lines described above with reference to FIG. 28 according to further embodiments of the present invention. A packet processor 2900 includes input buffers 2905 that are configured to receive packets from a plurality of ports (not shown). A synchronization monitor module 2910 monitors the timing of the incoming packets and extracts header information therefrom via FRCs 2920 that access packets stored in the input buffers 2905. The extracted header information is provided to a packet framer 2965 for use in constructing output packets including payload information generated by processing payload information in the input packets received by the input buffers 2905.
  • The FRCs 2920 access packets stored in the input buffers 2905 responsive to control signals generated by a sample counter and FRC control unit 2915. The sample counter and FRC control unit 2915 generates the control signals responsive to error and control information generated by the synchronization monitor module 2910, address information from a pointer table 2950, and packet processing scenario control information from configuration registers of an input/output sample configuration memory 2970. The FRCs 2920 transfer payload data from the input buffers 2905 to a set of first bit manipulators 2925, which perform de-interleaving, sign extension and/or bit deletion operations as specified by packet processing scenario control information stored in the input/output sample configuration memory 2970.
  • A data mux and summing unit 2930 performs summation operations as specified by packet processing scenario control information stored in the input/output sample configuration memory 2970, and may further perform dynamic/saturation ranging of the summation outputs. The output of the data mux and summing unit 2930 is provided to a bit manipulator 2935, which performs flipping (e.g., MSB/LSB), IQ ordering and/or IQ interleaving operations as specified by packet processing scenario control information stored in the input/output sample configuration memory 2970. The bit manipulator 2935 provides the processed data, along with an address and mask, to an output packet memory 2940. Data is transferred from the output packet memory 2940 to the packet framer 2965, which constructs new packets using header information from the sample counter and FRC control unit 2915 and an output packet destination memory 2960.
  • It will be appreciated that the packet processing switch architectures describe above are illustrative examples, and that other packet processing switch architectures fall within the scope of the present invention. More generally, in the drawings and specification, there have been disclosed exemplary embodiments of the invention. Although specific terms are employed, they are used in a generic and descriptive sense only and not for purposes of limitation, the scope of the invention being defined by the following claims.

Claims (19)

1. A packet processing integrated circuit chip, comprising:
a plurality of input ports configured to receive packets from respective external sources;
a plurality of output ports configured to transmit packets to respective external recipients; and
a packet processor configured to process the received packets to generate new packets with new payloads according to selected ones of a plurality of packet processing scenarios based on destination addresses in the received packets.
2. A chip according to claim 1, wherein the plurality of packet processing scenarios comprises individual packet processing scenarios and group packet processing scenarios that invoke parallel processing of a packet by selected ones of the individual packet processing scenarios.
3. A chip according to claim 1, wherein the packet processor is configurable to extract data from payloads of the received packets and to process the extracted data to produce the new packets with payloads having formats compatible with data structures of the external recipients.
4. A chip according to claim 1, wherein the packet processor is configurable to perform bit extension, bit truncation, bit reordering and/or bit arithmetic operations on the received packets.
5. A chip according to claim 1, wherein timing of each packet processing scenario is controlled responsive to received packet accumulation for the packet processing scenario.
6. A chip according to claim 5, wherein the packet processor is configured to initiate packet accumulation for a packet processing scenario responsive to an initialization signal.
7. A chip according to claim 1, wherein the packet processing scenarios are user-configurable.
8. A chip according to claim 1, wherein the packet processor, the input ports and/or the output ports are configurable via at least one of the input ports.
9. A chip according to claim 1, further comprising an inter-integrated circuit (I2C) bus interface, and wherein the packet processor, the input ports and/or the output ports are configurable via the I2C bus interface.
10. A chip according to claim 1, wherein the received packets and the new packets are RapidIO™ (RIO)-compliant packets.
11. A chip according to claim 1, further comprising a packet switching fabric configured to route selected packets from the input ports to selected ones of the output ports without payload modification.
12. An interface circuit for conveying data between a first plurality of circuit cards and a second plurality of circuit cards, the interface circuit comprising:
a plurality of input ports configured to receive packets from respective ones of the first plurality of circuit cards;
a plurality of output ports configured to transmit packets to respective ones of the second plurality of circuit cards; and
a packet processor configured to process the received packets to generate new packets with new payloads according to selected ones of a plurality of packet processing scenarios based on destination addresses in the received packets.
13. An interface circuit according to claim 12, wherein the plurality of packet processing scenarios comprises individual packet processing scenarios and group packet processing scenarios that invoke parallel processing of a packet by selected ones of the individual packet processing scenarios.
14. An interface circuit according to claim 12, wherein the packet processor is configurable to extract data from payloads of the received packets and to process the extracted data to produce the new packets with payloads having formats compatible with data structures of processors on the second plurality of circuit cards.
15. An interface circuit according to claim 12, wherein the packet processor is configurable to perform bit extension, bit truncation, bit reordering and/or bit arithmetic operations on the received packets.
16. An interface circuit according to claim 12, wherein timing of each packet processing scenario is controlled responsive to received packet accumulation for the packet processing scenario.
17. An interface circuit according to claim 12, wherein the packet processing scenarios are user-configurable.
18. An interface circuit according to claim 12, further comprising a packet switching fabric configured to route selected packets from the input ports to selected ones of the output ports without payload modification.
19. An interface circuit according to claim 12:
wherein the plurality of input ports are configured to receive packets from respective ones of a plurality of RF cards; and
wherein the plurality of output ports are configured to transmit packets to respective ones of a plurality of baseband cards.
US11/394,886 2005-04-18 2006-03-31 Packet processing switch and methods of operation thereof Abandoned US20060248375A1 (en)

Priority Applications (7)

Application Number Priority Date Filing Date Title
US11/394,886 US20060248375A1 (en) 2005-04-18 2006-03-31 Packet processing switch and methods of operation thereof
US11/279,288 US20060248374A1 (en) 2005-04-18 2006-04-11 Packet Processing Switch and Methods of Operation Thereof
PCT/US2006/013767 WO2006113302A1 (en) 2005-04-18 2006-04-13 Packet processing switch and methods of operation thereof
CN2006800219116A CN101199170B (en) 2005-04-18 2006-04-13 Packet processing switch and methods of operation thereof
JP2008507723A JP2008539613A (en) 2005-04-18 2006-04-13 Packet processing switch and method of operating the same
DE602006019706T DE602006019706D1 (en) 2005-04-18 2006-04-13 PACKET PROCESSING COMPUTATION AND OPERATING METHOD THEREFOR
EP06740915A EP1875688B1 (en) 2005-04-18 2006-04-13 Packet processing switch and methods of operation thereof

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US67234905P 2005-04-18 2005-04-18
US11/394,886 US20060248375A1 (en) 2005-04-18 2006-03-31 Packet processing switch and methods of operation thereof

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US11/279,288 Continuation-In-Part US20060248374A1 (en) 2005-04-18 2006-04-11 Packet Processing Switch and Methods of Operation Thereof

Publications (1)

Publication Number Publication Date
US20060248375A1 true US20060248375A1 (en) 2006-11-02

Family

ID=39548417

Family Applications (4)

Application Number Title Priority Date Filing Date
US11/394,886 Abandoned US20060248375A1 (en) 2005-04-18 2006-03-31 Packet processing switch and methods of operation thereof
US11/395,575 Active 2028-01-02 US7882280B2 (en) 2005-04-18 2006-03-31 Packet processing switch and methods of operation thereof
US11/395,570 Active 2027-10-22 US7739424B2 (en) 2005-04-18 2006-03-31 Packet processing switch and methods of operation thereof
US11/407,321 Active 2028-12-21 US7684431B1 (en) 2005-04-18 2006-04-18 System and method for arbitration in a packet switch

Family Applications After (3)

Application Number Title Priority Date Filing Date
US11/395,575 Active 2028-01-02 US7882280B2 (en) 2005-04-18 2006-03-31 Packet processing switch and methods of operation thereof
US11/395,570 Active 2027-10-22 US7739424B2 (en) 2005-04-18 2006-03-31 Packet processing switch and methods of operation thereof
US11/407,321 Active 2028-12-21 US7684431B1 (en) 2005-04-18 2006-04-18 System and method for arbitration in a packet switch

Country Status (2)

Country Link
US (4) US20060248375A1 (en)
CN (1) CN101199170B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107018094A (en) * 2017-05-23 2017-08-04 信联安宝(北京)科技有限公司 The discrete radio management interchanger of power supply
CN107104842A (en) * 2017-05-23 2017-08-29 信联安宝(北京)科技有限公司 The discrete integrated wireless management interchanger of power supply
CN107426008A (en) * 2017-05-23 2017-12-01 信联安宝(北京)科技有限公司 Integrated wireless manages interchanger
CN115484219A (en) * 2022-08-23 2022-12-16 中国电子科技集团公司第十研究所 Method, equipment and medium for avoiding port association of domestic SRIO (serial-to-input/output) switching chip

Families Citing this family (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060248375A1 (en) * 2005-04-18 2006-11-02 Bertan Tezcan Packet processing switch and methods of operation thereof
US7747904B1 (en) 2006-05-12 2010-06-29 Integrated Device Technology, Inc. Error management system and method for a packet switch
US7817652B1 (en) 2006-05-12 2010-10-19 Integrated Device Technology, Inc. System and method of constructing data packets in a packet switch
US7706387B1 (en) 2006-05-31 2010-04-27 Integrated Device Technology, Inc. System and method for round robin arbitration
US7870313B2 (en) * 2007-02-27 2011-01-11 Integrated Device Technology, Inc. Method and structure to support system resource access of a serial device implementating a lite-weight protocol
US8094677B2 (en) * 2007-02-27 2012-01-10 Integrated Device Technology, Inc. Multi-bus structure for optimizing system performance of a serial buffer
US7693040B1 (en) * 2007-05-01 2010-04-06 Integrated Device Technology, Inc. Processing switch for orthogonal frequency division multiplexing
TWI527409B (en) * 2008-05-30 2016-03-21 馬維爾國際股份有限公司 A network processor unit and a method for a network processor unit
US8327181B2 (en) * 2009-06-22 2012-12-04 Citrix Systems, Inc. Systems and methods for failover between multi-core appliances
WO2011067406A1 (en) * 2009-12-04 2011-06-09 Napatech A/S An apparatus, an assembly and a method of operating a plurality of analyzing means reading and ordering data packets
US8397195B2 (en) * 2010-01-22 2013-03-12 Synopsys, Inc. Method and system for packet switch based logic replication
US8638792B2 (en) * 2010-01-22 2014-01-28 Synopsys, Inc. Packet switch based logic replication
US9069919B1 (en) * 2012-10-17 2015-06-30 Qlogic, Corporation Method and system for arbitration verification
FR2998748B1 (en) * 2012-11-23 2015-04-10 Commissariat Energie Atomique DEVICE AND METHOD FOR RETRANSMITTING DATA IN A NETWORK SWITCH
US20140376549A1 (en) * 2013-06-20 2014-12-25 Mediatek Inc. Packet processing apparatus and method for processing input packet according to packet processing list created based on forwarding decision made for input packet
US20150063217A1 (en) * 2013-08-28 2015-03-05 Lsi Corporation Mapping between variable width samples and a frame
GB2546603B (en) * 2015-01-16 2019-05-08 Imagination Tech Ltd Arbiter verification
EP3690576A1 (en) * 2019-01-30 2020-08-05 Schneider Electric Industries SAS Control device and method for controlling a redundant connection in a flat network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6389479B1 (en) * 1997-10-14 2002-05-14 Alacritech, Inc. Intelligent network interface device and system for accelerated communication
US20030110206A1 (en) * 2000-11-28 2003-06-12 Serguei Osokine Flow control method for distributed broadcast-route networks
US20030147394A1 (en) * 2002-02-07 2003-08-07 Kevin Jennings Network switch with parallel working of look-up engine and network processor
US20040184466A1 (en) * 2003-03-18 2004-09-23 Ju-Nan Chang Mobile server for internetworking wpan, wlan, and wwan

Family Cites Families (73)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4473880A (en) * 1982-01-26 1984-09-25 Intel Corporation Arbitration means for controlling access to a bus shared by a number of modules
US4932028A (en) 1988-06-21 1990-06-05 Unisys Corporation Error log system for self-testing in very large scale integrated circuit (VLSI) units
US4987529A (en) 1988-08-11 1991-01-22 Ast Research, Inc. Shared memory bus system for arbitrating access control among contending memory refresh circuits, peripheral controllers, and bus masters
US4991171A (en) 1989-09-26 1991-02-05 At&T Bell Laboratories Broadcast packet switch network
US5072363A (en) 1989-12-22 1991-12-10 Harris Corporation Multimode resource arbiter providing round robin arbitration or a modified priority arbitration
US5229991A (en) 1991-01-30 1993-07-20 Washington University Packet switch with broadcasting capability for atm networks
US5276684A (en) * 1991-07-22 1994-01-04 International Business Machines Corporation High performance I/O processor
US5287346A (en) 1991-10-16 1994-02-15 Carnegie Mellon University Packet switch
US5305311A (en) 1992-05-20 1994-04-19 Xerox Corporation Copy network providing multicast capabilities in a broadband ISDN fast packet switch suitable for use in a local area network
SE515274C2 (en) * 1992-11-09 2001-07-09 Ericsson Telefon Ab L M Package selector for telecommunication system
US5710549A (en) 1994-09-30 1998-01-20 Tandem Computers Incorporated Routing arbitration for shared resources
US6044085A (en) 1995-06-05 2000-03-28 Thomson Consumer Electronics Method for arbitrating for access to a control channel in a data bus system
US5764927A (en) 1995-09-29 1998-06-09 Allen Bradley Company, Inc. Backplane data transfer technique for industrial automation controllers
AU7681596A (en) 1995-12-11 1997-07-03 Airnet Communications Corporation Multichannel broadband transceiver system making use of a distributed control architecture for digital signal processor array
IL116986A (en) 1996-01-31 2000-01-31 Galileo Technology Ltd Switching ethernet controller providing packet routing
US6098110A (en) 1996-12-30 2000-08-01 Compaq Computer Corporation Network switch with a multiple bus structure and a bridge interface for transferring network data between different buses
US7020069B1 (en) * 1998-02-06 2006-03-28 Cisco Technology, Inc. Medium access control protocol for OFDM wireless networks
JPH11317748A (en) 1998-05-07 1999-11-16 Pioneer Electron Corp Transmission interface device for transmission system
JP4043125B2 (en) 1999-01-20 2008-02-06 富士通株式会社 Cell processing apparatus, ATM exchange, and cell disposal method
US6377782B1 (en) 1999-03-01 2002-04-23 Mediacell, Inc. Method and apparatus for communicating between a client device and a linear broadband network
US6625121B1 (en) * 1999-04-28 2003-09-23 Cisco Technology, Inc. Dynamically delisting and relisting multicast destinations in a network switching node
US6661788B2 (en) 1999-05-14 2003-12-09 Nortel Networks Limited Multicast scheduling for a network device
US6804237B1 (en) 1999-06-23 2004-10-12 Nortel Networks Limited Method, devices and signals for multiplexing payload data for transport in a data network
US6675325B1 (en) 1999-10-12 2004-01-06 Lucent Technologies Inc. Method and apparatus for fault analysis in a communication network
US6963572B1 (en) * 1999-10-22 2005-11-08 Alcatel Canada Inc. Method and apparatus for segmentation and reassembly of data packets in a communication switch
US6678279B1 (en) 1999-12-13 2004-01-13 Nortel Networks Limited System and method to implement a packet switch buffer for unicast and multicast data
US6662339B1 (en) 1999-12-15 2003-12-09 Agere Systems Inc. Error screening based on code and control information consistency in a communication system
US7106742B1 (en) 2000-01-13 2006-09-12 Mercury Computer Systems, Inc. Method and system for link fabric error detection and message flow control
JP3730471B2 (en) 2000-02-14 2006-01-05 富士通株式会社 Packet transfer device
US6977930B1 (en) 2000-02-14 2005-12-20 Cisco Technology, Inc. Pipelined packet switching and queuing architecture
ATE362684T1 (en) 2000-03-02 2007-06-15 Alcatel Lucent DESIGNED PRIORITY QUEUE SCHEDULER
JP2001251349A (en) * 2000-03-06 2001-09-14 Fujitsu Ltd Packet processor
US7006501B1 (en) 2000-03-31 2006-02-28 Sun Microsystems, Inc. Distributed least choice first arbiter
US7020161B1 (en) 2000-03-31 2006-03-28 Sun Microsystems, Inc. Prescheduling arbitrated resources
US6882649B1 (en) 2000-03-31 2005-04-19 Sun Microsystems, Inc. Least choice first arbiter
US6598179B1 (en) 2000-03-31 2003-07-22 International Business Machines Corporation Table-based error log analysis
JP4318389B2 (en) * 2000-04-03 2009-08-19 三洋電機株式会社 Adaptive array device, wireless base station, mobile phone
DE60129316D1 (en) 2000-05-18 2007-08-23 Xyratex Tech Ltd DEVICE AND METHOD FOR FUNCTIONALIZATION OF THE AGENT
US7075926B2 (en) * 2000-05-24 2006-07-11 Alcatel Internetworking, Inc. (Pe) Programmable packet processor with flow resolution logic
US6963576B1 (en) 2000-09-28 2005-11-08 Force10 Networks, Inc. Scheduling and arbitration scheme for network processing device
US7224671B2 (en) 2000-09-28 2007-05-29 Force10 Networks, Inc. Method and apparatus for load balancing in network processing device
US7274705B2 (en) 2000-10-03 2007-09-25 Broadcom Corporation Method and apparatus for reducing clock speed and power consumption
US6988177B2 (en) 2000-10-03 2006-01-17 Broadcom Corporation Switch memory management using a linked list structure
US6647449B1 (en) 2000-10-05 2003-11-11 Hewlett-Packard Development Company, L.P. System, method and circuit for performing round robin arbitration
AU2002232481A1 (en) * 2000-11-07 2002-05-21 Fast-Chip, Inc. Switch-based network processor
US6954463B1 (en) * 2000-12-11 2005-10-11 Cisco Technology, Inc. Distributed packet processing architecture for network access servers
US20020085550A1 (en) * 2000-12-28 2002-07-04 Steven Rhodes Scalable switch
US7023840B2 (en) 2001-02-17 2006-04-04 Alcatel Multiserver scheduling system and method for a fast switching element
US6757795B2 (en) 2001-04-03 2004-06-29 International Business Machines Corporation Apparatus and method for efficiently sharing memory bandwidth in a network processor
US7027443B2 (en) 2001-08-23 2006-04-11 Pmc-Sierra Ltd. Reassembly engines for multilink applications
US7394823B2 (en) 2001-11-20 2008-07-01 Broadcom Corporation System having configurable interfaces for flexible system configurations
US7307986B2 (en) 2002-02-04 2007-12-11 Intel Corporation State record processing
US6954812B2 (en) 2002-03-05 2005-10-11 Hewlett-Packard Development Company, L.P. Two-stage round robin arbitration system
US6954811B2 (en) 2002-07-19 2005-10-11 Calix Networks, Inc. Arbiter for an input buffered communication switch
US7213179B2 (en) * 2002-07-30 2007-05-01 Cisco Technology, Inc. Automated and embedded software reliability measurement and classification in network elements
US7346701B2 (en) 2002-08-30 2008-03-18 Broadcom Corporation System and method for TCP offload
US20040124554A1 (en) * 2002-09-23 2004-07-01 Toray Plastics (America), Inc. Polyolefin isolation membrane
KR100454681B1 (en) * 2002-11-07 2004-11-03 한국전자통신연구원 An Ethernet switching Apparatus and Method using Frame Multiplexing and Demultiplexing
US7715392B2 (en) 2002-12-12 2010-05-11 Stmicroelectronics, Inc. System and method for path compression optimization in a pipelined hardware bitmapped multi-bit trie algorithmic network search engine
US7426518B2 (en) 2003-03-28 2008-09-16 Netlogic Microsystems, Inc. System and method for efficiently searching a forwarding database that is split into a bounded number of sub-databases having a bounded size
US7236499B2 (en) 2003-06-23 2007-06-26 Intel Corporation Resource arbitration in accordance with a masked request vector
US7545804B2 (en) * 2003-09-11 2009-06-09 Nortel Networks Limited High throughput rotator switch having excess tandem buffers
US7672318B2 (en) * 2003-11-06 2010-03-02 Telefonaktiebolaget L M Ericsson (Publ) Adaptable network bridge
US7231479B2 (en) 2003-12-17 2007-06-12 International Business Machines Corporation Round robin selection logic improves area efficiency and circuit speed
GB2412038B (en) 2004-03-10 2006-04-19 Toshiba Res Europ Ltd Packet format
US7437174B2 (en) * 2004-04-15 2008-10-14 Spyder Navigations L.L.C. Received signal quality determination
US7546512B2 (en) 2004-09-23 2009-06-09 Intel Corporation Techniques to perform error detection
US20060248375A1 (en) * 2005-04-18 2006-11-02 Bertan Tezcan Packet processing switch and methods of operation thereof
EP1911173B1 (en) * 2005-07-27 2018-09-12 BlackBerry Limited Pilots for frequency division multiple access communications
JP4528236B2 (en) * 2005-09-29 2010-08-18 株式会社日立製作所 Radio base station apparatus and communication method
US20070124554A1 (en) * 2005-10-28 2007-05-31 Honeywell International Inc. Global memory for a rapidio network
KR100718592B1 (en) * 2005-12-31 2007-05-17 포스데이타 주식회사 Apparatus and method for estimating channel in communication system supporting ofdm/ofdma
US7675983B2 (en) * 2006-04-14 2010-03-09 Freescale Semiconductor, Inc. Mitigation of DC distortion in OFDM receivers

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6389479B1 (en) * 1997-10-14 2002-05-14 Alacritech, Inc. Intelligent network interface device and system for accelerated communication
US20030110206A1 (en) * 2000-11-28 2003-06-12 Serguei Osokine Flow control method for distributed broadcast-route networks
US20030147394A1 (en) * 2002-02-07 2003-08-07 Kevin Jennings Network switch with parallel working of look-up engine and network processor
US20040184466A1 (en) * 2003-03-18 2004-09-23 Ju-Nan Chang Mobile server for internetworking wpan, wlan, and wwan

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107018094A (en) * 2017-05-23 2017-08-04 信联安宝(北京)科技有限公司 The discrete radio management interchanger of power supply
CN107104842A (en) * 2017-05-23 2017-08-29 信联安宝(北京)科技有限公司 The discrete integrated wireless management interchanger of power supply
CN107426008A (en) * 2017-05-23 2017-12-01 信联安宝(北京)科技有限公司 Integrated wireless manages interchanger
CN115484219A (en) * 2022-08-23 2022-12-16 中国电子科技集团公司第十研究所 Method, equipment and medium for avoiding port association of domestic SRIO (serial-to-input/output) switching chip

Also Published As

Publication number Publication date
US20060248377A1 (en) 2006-11-02
US7684431B1 (en) 2010-03-23
US20060248376A1 (en) 2006-11-02
US7739424B2 (en) 2010-06-15
CN101199170B (en) 2012-10-03
CN101199170A (en) 2008-06-11
US7882280B2 (en) 2011-02-01

Similar Documents

Publication Publication Date Title
US7739424B2 (en) Packet processing switch and methods of operation thereof
US7596142B1 (en) Packet processing in a packet switch with improved output data distribution
EP1384354B1 (en) High speed network processor
US7817652B1 (en) System and method of constructing data packets in a packet switch
US7342942B1 (en) Multi-service segmentation and reassembly device that maintains only one reassembly context per active output port
US7298756B1 (en) System and method for programming cell packet headers
US7327760B1 (en) Multi-service segmentation and reassembly device operable with either a cell-based or a packet-based switch fabric
US7113505B2 (en) Mesh architecture for synchronous cross-connects
US6754222B1 (en) Packet switching apparatus and method in data network
KR100750880B1 (en) Switching system and its mechanism which enables data-switching of variable-length packets and heterogeneous network packets
US20110125936A1 (en) Transmission of Data Bursts on a Constant Data Rate Channel
US5926475A (en) Method and apparatus for ensuring ATM cell order in multiple cell transmission lane switching system
US6934471B1 (en) Photonic switch using time-slot interchange
EP1875688B1 (en) Packet processing switch and methods of operation thereof
US6985503B1 (en) Inverse multiplexer
JP2008066901A (en) Switch device and switching method used for it
US7747904B1 (en) Error management system and method for a packet switch
US20050117571A1 (en) Distribution of time division multiplexed data through packet connections
US6956851B1 (en) Crossbar subsystem and method
US7730276B1 (en) Striping of data into memory of a network data switch to prevent read and write collisions
KR100378372B1 (en) Apparatus and method for packet switching in data network
CN112631985B (en) Network-on-chip for link sharing
KR950005643B1 (en) Packet switching system
US6625148B1 (en) Self routing interconnect cross-switch
WO2023078955A1 (en) Fair arbitration between multiple sources targeting a destination

Legal Events

Date Code Title Description
AS Assignment

Owner name: INTEGRATED DEVICE TECHNOLOGY, INC., CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:TEZCAN, BERTAN;BEANE, WILLIAM TERRY;DARNELL, SCOTT;AND OTHERS;REEL/FRAME:017756/0253;SIGNING DATES FROM 20060328 TO 20060331

AS Assignment

Owner name: INTEGRATED DEVICE TECHNOLOGY, INC., CALIFORNIA

Free format text: OUR ERROR, PLEASE CORRECT INVENTOR 1 BERTAN TEZCAN'S EXECUTION DATE TO MARCH 27, 2006 AT R/F 017756/0253;ASSIGNORS:TEZCAN, BERTAN;BEANE, WILLIAM TERRY;DARNELL, SCOTT;AND OTHERS;REEL/FRAME:018023/0348;SIGNING DATES FROM 20060327 TO 20060331

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION