National Yang Ming Chiao Tung University

Institute for Information Industry

Estinet Technologies Inc.

Shie-Yuan Wang

Yi-Bing Lin

Jun-Yi Li

Frank Chee-Da Tsai

Chia-Cheng Wu

Ku-Han Fan

Teng-Wei Hsu

Chia-Ming Wu

Hsien-Wen Hu

Ruei-Syun Lai

Yo-Ru Chen

Hsu-Heng Weng

Hsien-Chueh Hsieh

Chih-Che Lin

A method includes: sending a pause frame followed by a migrate frame when a value of one of per-flow buffer usage (FBU) counters (referred to as a counter value) exceeds a pause threshold; stopping dequeuing one of pause egress queues (PEQs) when receiving a pause frame; enqueuing a packet into one of the PEQs when receiving a migrate frame; sending a resume frame followed by a migrate-back frame when a previous counter value exceeds the pause threshold and a current counter value is smaller than a resume threshold; when receiving a resume frame, resuming dequeuing one of the PEQs until empty, and then dequeuing a default egress queue (DEQ); and enqueuing a packet into the DEQ when receiving a migrate-back frame.

Flow control method

A method for regulating traffic of a Transmission Control Protocol (TCP) flow includes: deciding, based on a ratio of current bucket level to bucket size, a value of an Explicit Congestion Notification (ECN) bit of a packet; setting a field of a meter tag of the packet based on a packet length of the packet, the value of the ECN bit, and a current bucket level; updating the current bucket level based on the field of the meter tag; calculating an actual transmission rate; and determining an adjustment value based on a difference between the actual transmission rate and a target rate, and adjusting a rate of change of bucket level based on the adjustment value.

Method for regulating traffic of TCP flow

The present disclosure provides packet aggregation and disaggregation methods. In the packet aggregation methods, the protocol-independent packet processor (P) switch stores plural message headers of plural packets in the ring buffer. When the plural message headers stored in the ring buffer reach a pre-defined amount of data, the Pswitch replaces the first flag header in the current packet with a second flag header so as to form a work packet. The egress pipeline of the Pswitch recirculates the work packet repeatedly, whenever it receives a work packet, a message header is extracted from a plurality of message headers in the ring buffer and added to the working packet for packet aggregation.

Packet aggregation and disaggregation method

A high-speed data-plane packet aggregation and disaggregation method is disclosed. The method includes following steps: receiving a plurality of packets by the P4 switch; parsing each of the plurality of packets by using a parse graph; determining the type of the packets by using a match-action table; conducting packet aggregation and disaggregation process at the pipeline of the P4 switch; and transmitting the aggregated packet or the original data packet to a deparser of the P4 switch and outputting the aggregated packet or the original data packet by the P4 switch.

High-speed data-plane packet aggregation and disaggregation method

The disclosure is related to a method for constructing hybrid network spanning trees, a method of redundancy, and a control system thereof. The method and system are adapted to a hybrid network system including at least one software-defined network (SDN) and at least one non-SDN network. In the method, a controller of the SDN is employed to collect network packets over the hybrid network. After analyzing the information carried in the network packets, the information relating to the topology can be obtained. Therefore, all the possible spanning trees can be constituted according to the topology. As well, the path delay and path bandwidth respectively for the SDN and non-SDN can also be obtained. The information allows the system to render utility function for every spanning tree. The most suitable spanning tree over the hybrid network system is applied. A mechanism of redundancy is also provided.

Method for constituting hybrid network spanning trees, method of redundancy, and control system thereof

An apparatus, method, and computer readable medium thereof for simultaneously establishing links with a plurality of nodes in a wireless network are provided. A processing module determines whether a mesh network configuration message of the apparatus has space to packet an information element and determines whether to transmit a Neighbor Link Establishment information element to one of the nodes. If the mesh network configuration message has space to packet an information element and the Neighbor Link Establishment information element needs to be transmitted to one of the nodes, the Neighbor Link Establishment information element will be packeted into the mesh network configuration message. Finally, a transmission module transmits the mesh network configuration message to the nodes in order to solve the problem of increasing time during link establishment and avoid deadlock among the nodes when the apparatus of the prior art establishes links with the nodes simultaneously.

Apparatus, method, and computer readable medium thereof for simultaneously establishing links with a plurality of nodes

A wireless communication system, a method for enhancing network efficiency, and a computer program product therefor are provided. The wireless communication system includes a transmitting apparatus and a receiving apparatus. The method and the computer program product therefor perform the following steps. The transmitting apparatus transmits a request-to-send packet to the receiving apparatus. After receiving the request-to-send packet, the receiving apparatus measures a request-to-send power of the received request-to-send packet to calculate a clear-to-send power. The receiving apparatus then uses the clear-to-send power to broadcast a clear-to-send packet. All neighboring transmitting apparatuses that can hear this clear-to-send packet should prohibit themselves from sending packets during the period specified in the clear-to-send packet to avoid colliding with a data packet that will soon be sent from the transmitting apparatus to the receiving apparatus.

Growing community of inventors

Hsinchu, Taiwan

Shie-Yuan Wang