Realtek Semiconductor Inc.

Mediatek Corporation

Ralink Technology Corporation

Industrial Technology Research Institute

Nephos (hefei) Co. Ltd.

Mediatek Co.

Kuo-Cheng Lu

Yung-Chang Lin

Yu-Mei Pan

Kuang-Yu Yen

Hong-Ching Chen

Chun-Ming Liu

Chun-Yuan Chu

Min-Chang Wei

Mao-Lin Huang

Shi-Ming Zhao

Kuo-Hua Yuan

Xiaorong Qu

Yu-Hsiu Lin

Chun-Da Wu

Yuan-Cheng Chuang

Chang-Due Young

Kuo-Yen Fan

Chiao-yi Lin

Hung-Kuang Chen

The present invention discloses a mesh network system having data flow transmission sorting mechanism that includes station devices, mesh network devices and a portal network apparatus. The portal network device is configured to manage the station devices to perform communication with an external network through the mesh network devices and the portal network device, to detect outward data flows and inward data flows related to the station devices, to perform priority ranking on the outward data flows and the inward data flows according to device priority information and relative flow amount information to generate outward priority ranking information and inward priority ranking information, and to transmit the outward priority ranking information and inward priority ranking information to the mesh network devices such that the mesh network system transmits the outward data flows and the inward data flows respectively according to the outward priority ranking information and inward priority ranking information.

Mesh network system and communication method of the same having data flow transmission sorting mechanism

A switch and a scheduling method for packet forwarding of the same are provided. The switch includes a plurality of absorb queues, a plurality of egress ports, and an absorb scheduler. Each of the egress ports includes a plurality of egress queues that are respectively connected to one of the absorb queues that are different from one another. The scheduling method includes: generating a priority state for each of the egress queues of each of the egress ports; a packet forwarding priority state of each of the absorb queues is determined according to the priority state of each of the egress queues connected thereto; and the absorb scheduler selecting one of the absorb queues to send a packet stored therein to a target egress queue of a target egress port to be sent to, according to the priority state of each of the egress queues.

Switch and scheduling method for packet forwarding of the same

A device for packet processing acceleration includes a CPU, a tightly coupled memory (TCM), a buffer descriptor (BD) prefetch circuit, and a BD write back circuit. The BD prefetch circuit reads reception-end (RX) BDs from an RX BD ring of a memory to write them into an RX ring of the TCM, and reads RX header data from a buffer of the memory to write them into the RX ring. The CPU accesses the RX ring to process the RX BDs and RX header data, and generates transmission-end (TX) BDs and TX header data; afterwards, the CPU writes the TX BDs and TX header data into a TX ring of the TCM. The BD write back circuit reads the TX BDs and TX header data from the TX ring, writes the TX BDs into a TX BD ring of the memory, and writes the TX header data into the buffer.

Device for packet processing acceleration

A communication device which is configured to receive a data flow includes a monitor port and a packet processor. The monitor port is configured to receive a packet of the data flow. The packet processor is coupled to the monitor port, and the packet processor is configured to compute a digest value of the packet and compute an identification code of the packet according to the digest value of the packet, and the packet processor searches a status value associated with the identification code in a lookup table so as to determine whether a dropping event of the data flow is recorded.

Communication device and network management method

A time-division multiplexing (TDM) scheduler determines a service order for serving N packet transmission requesters. The TDM scheduler includes: N current count value generators configured to serve the N packet transmission requesters respectively, and generate N current count values according to parameters of the N packet transmission requesters, a previous scheduling result generated by the EDD scheduler previously, and a predetermined counting rule; and an earliest due date (EDD) scheduler configured to generate a current scheduling result for determining the service order according to the N current count values and a predetermined urgency decision rule, wherein an extremum of the N current count values relates to one of the N packet transmission requesters, and the EDD scheduler selects this requester as the one to be served preferentially.

Time-division multiplexing scheduler and scheduling device

A method and a system for processing a data flow with an incomplete comparison process are provided. The method is implemented by a network device that includes a flow table and a flow filter in a memory thereof. A flow analyzing module is provided for analyzing and classifying packets of an input flow, and identifying an application category to which the input flow belongs. The flow table is queried according to a result of resolving the input flow for determining whether the input flow matches any flow entry of the flow table. The flow filter is queried if the input flow fails to match any flow entry of the flow table for determining whether features of the input flow match conditions of the flow filter. The input flow is processed accordingly, without needing to copy all flows that do not match the flow entries to the flow table.

Method and system for processing data flow with incomplete comparison process

Disclosed is a data flow classification device including a forwarding circuit and a configuring circuit. The forwarding circuit looks the classification of an input flow up in a lookup table according to the information of the input flow, tags the packets of the input flow with the classification, and outputs the packets to a buffer circuit. The configuring circuit receives and stores the identification and traffic information of multiple flows, and accordingly calculates the traffic of the multiple flows, wherein the multiple flows include the input flow. The configuring circuit further determines an elephant flow threshold according to a queue length of the buffer circuit and a target length, determines the classifications of the multiple flows according to the comparison between the traffic of the multiple flows and the elephant flow threshold, and stores these classifications in the lookup table.

Data flow classification device

A replication list table structure for multicast packet replication is provided. The replication list table structure includes a plurality of entries. Each one of the plurality of entries includes a first field, a second field, a third field and a fourth field. For each one of the plurality of entries, the first field is used to declare whether the entry is an end of a program execution, the second field is used to declare the fourth field as a first type field for indicating a switch how to modify a header of a multicast packet, or as a second type field for indicating the switch, while reading the list, to jump to another one of the plurality entries, and the third field is preset to the first type field for indicating the switch how to modify the header of the multicast packet.

Multicast packet replication method

A data flow classification device includes a forwarding circuit and a configuring circuit. The forwarding circuit looks the classification of an input flow up in a lookup table according to the information of the input flow, tags the packets of the input flow with the classification, and outputs the packets to a buffer circuit; but if the classification is not found in the lookup table, the forwarding circuit tags the packets with a predetermined classification, outputs the packets to the buffer circuit, and adds the information of the input flow to the lookup table. The configuring circuit determines a flow threshold according to a queue length of the buffer circuit and a target length, learns the traffic of multiple flows from the lookup table, determines the classifications of the multiple flows according to the comparison between the traffic and the flow threshold, and stores these classifications in the lookup table.

Disclosed is a time-division multiplexing (TDM) scheduler capable of determining a service order for serving N packet transmission requesters. The TDM scheduler includes: N current count value generators configured to serve the N packet transmission requesters respectively, and generate N current count values according to parameters of the N packet transmission requesters, a previous scheduling result generated by the EDD scheduler previously, and a predetermined counting rule; and an earliest due date (EDD) scheduler configured to generate a current scheduling result for determining the service order according to the N current count values and a predetermined urgency decision rule, wherein an extremum of the N current count values relates to one of the N packet transmission requesters, and the EDD scheduler selects this requester as the one to be served preferentially.

The present invention provides a circuit within a switch, wherein the circuit includes a memory and a control circuit. The memory includes at least a first area and a second area, the first area is used to provide a minimum guaranteed storage space for each of a plurality of egress queues, the second area is used to provide a shared space of the plurality of egress queues. The control circuit is coupled to the memory, and when an input port of the switch receives an input packet and stores the input packet into the memory, the control circuit dynamically determines a size of the second area according to a number of the egress queues that the input packet is forwarded to.

Circuit within switch and method for managing memory within switch

Examples of methods of synchronized mode of flow table and apparatus using the same are described. A method may involve receiving a first key associated with a first flow engine through a first port and a second key associated with a second flow engine through a second port. The method may also involve utilizing a match key in one or more flow entries in a flow table to obtain a first instruction for the first flow engine and a second instruction for the second flow engine.

Methods of synchronization mode of flow table and apparatus using the same

Disclosed is a function-expandable wired network device using an external circuit to execute an operation an Ethernet device can't execute. The wired network device includes an Ethernet switch and a Field-Programmable Gate Array (FPGA). The switch includes Ethernet ports including a designated port and a first port, and receives a first packet from the first port; and if the first packet carries information meeting the information prestored in the switch, the switch amends the first packet to output a second packet to the designated port. The FPGA receives the second packet from the designated port and processes the second packet according to the switch's amendment to the second packet so as to output a third packet to the designated port. The switch then processes the third packet according to the FPGA's amendment to the third packet to output a fourth packet to one of the Ethernet ports.

Function-expandable wired network device

Examples of efficient MAC address storage are described, including methods and an apparatus. A method may involve obtaining a plurality of identifications associated with one or more applications executed on a computing apparatus, with each identification of the plurality of identifications different from one another. The method may also involve storing an identification entry representative of the plurality of identifications associated with the one or more applications. The identification entry may require an amount of memory space for storage less than an amount of memory space required to store the plurality of identifications associated with the one or more applications. The plurality of identifications may be a plurality of MAC addresses. The one or more applications may be one or more virtual machines.

Efficient MAC address storage for virtual machine applications

Methods and apparatuses regarding shared buffer arbitration for packet-based switching are described. A data packet may be received by a packet buffer including a first plurality of banks of memory units and a second plurality of banks of memory units. Each memory unit may store one cell of data and accommodate one access operation in one clock cycle. In an event that the data packet includes at least two cells of data, the at least two cells of the data packet may be alternately written into at least one memory unit in the first plurality of banks of memory units and at least one memory unit in the second plurality of banks of memory units. Cells of data packets may be read from the first plurality of banks of memory units and the second plurality of banks of memory units according to a time-division multiplexing (TDM) scheme.

Growing community of inventors

Hsinchu, Taiwan

Kuo-Cheng Lu