Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

61 results about "Head-of-line blocking" patented technology

Head-of-line blocking (HOL blocking) in computer networking is a performance-limiting phenomenon that occurs when a line of packets is held up by the first packet. Examples include input buffered network switches, out-of-order delivery and multiple requests in HTTP pipelining.

Hierarchical output-queued packet-buffering system and method

The packet-buffering system and method of the present invention enables communication devices incorporating a full-mesh architecture to achieve bandwidth aggregation levels ordinarily associated with partial-mesh architectures. The packet-buffering invention uses a hierarchical memory structure having first and second packet-buffers to buffer packets between the input and output ports of the communication device. The received packets are organized by output port and priority level in the first packet buffer, which operates at the aggregate network rate of the communication device. The packets are then funneled to second packet buffers, having corresponding priority and output port assignments, at less than the aggregate network rate and which exhibit buffer depths that exceed that of the first packet buffer. The resulting hierarchical output-queued, packet-buffering system enables a communication system that exhibits a high degree of differentiated services with bandwidth guarantees and at high aggregation levels without experiencing head-of-line blocking.
Owner:EXTREME NETWORKS INC

All-node virtual-channel network-on-chip ring topology data exchange method and system

The invention discloses an all-node virtual-channel network-on-chip ring topology data exchange method. N switching nodes form a ring topology structure, N-1 virtual channels stored and arranged in parallel in each switching node correspond to the data of N-1 addresses of a previous node respectively, the virtual channels, corresponding to a certain target address node, of all the nodes form a virtual ring and all the data which are sent to the target node are sent by the virtual ring; and when an input FIFO module and the virtual channels send the data to the next node simultaneously, one path of the data is selected to be sent to a physical channel according to priority configuration and another path is fed back as a block signal, the next node feeds a signal back to the previous node when receiving the data and the virtual channel having the data are selected for transmission through switching-over when the feedback signal which represents the blockage is received. The invention also provides a ring topology data exchange system. The method and the system can effectively solve the problem of head-of-line blocking formed by all the nodes together and improve the communication efficiency.
Owner:ZHEJIANG UNIV

Network node and buffer device, and scheduling method

The invention discloses a buffering device which comprises at least one internal conversion unit and at least one basic buffering device. The internal conversion unit at least comprises two input ends and two output ends. The internal conversion unit is connected with the basic buffering device in close way at intervals through one input end of the two input ends and one output end of the two output ends. The other input end of the internal conversion unit receives light waves; the internal conversion unit outputs the light waves according to a first control signal and the basic buffering device is used for buffering the light waves from the internal conversion unit. Meanwhile, the invention further provides a network node and a regulating method. By employing the technical proposal of the invention, the scale of the network node is small, thus being easy for practice, reducing loss rate of data packets as well as avoiding blocking of head of line at the same time.
Owner:HUAWEI TECH CO LTD +1

Packet scheduling method based on probability retransmission in wireless network

The invention discloses a packet scheduling method based on probability retransmission in a wireless network. By the packet scheduling method, two factors comprising a link status and a queue jamming condition are considered when the scheduling right is set; the link status is determined by setting estimation factors on queues; on the aspect of probability retransmission, the specific queue jamming condition is considered; and a probability retransmission mechanism is proposed in a whole scheduling process, so that the problem of queue head jamming is solved. Moreover, by a scheduling algorithm, the queues which are failed to be sent previously are subjected to packet compensation, so that fairness is guaranteed. Queue data packets to be transmitted can be scheduled preferentially under the condition that the probability retransmission mechanism is used; because scheduling is performed under the condition that the queues of a base station are considered, data packet accumulation pressure at a bottleneck junction is relieved. By the packet scheduling method, research on a wireless network scheduling method has a wide application prospect.
Owner:广州晞诺科技有限公司 +1
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products