An Area-Efficient DAMQ Buffer with Congestion Control Support

2016 ◽  
Vol 25 (10) ◽  
pp. 1650125 ◽  
Author(s):  
Heying Zhang ◽  
Kefei Wang ◽  
Zhengbin Pang ◽  
Liquan Xiao ◽  
Qiang Dou ◽  
...  
Keyword(s):  
Congestion Control ◽  
Control Mechanism ◽  
Interconnection Network ◽  
Buffer Management ◽  
Buffer Size ◽  
Low Latency ◽  
Chip Area ◽  
Management Algorithm ◽  
Simulation Results ◽  
Area Efficient

As the port count of routers in an interconnection network increases rapidly, the amount of buffers within the router chip also increases greatly. To improve the buffer utilization and to reduce the buffer size, the dynamically allocated multi-queue (DAMQ) algorithm is commonly used. However, traditional DAMQ buffer management suffers from high write latency and read latency, and one virtual channel (VC) monopolizes the entire buffer. To address these issues, we propose a fast and area-efficient DAMQ buffer-management algorithm and a novel flow-control mechanism based on credit with congestion-control support. The simulation results show that the new DAMQ algorithm can achieve low latency and prevent one VC from occupying the entire buffer during periods of congestion. Additionally, it can achieve high throughput with a shallow buffer, which leads to a reduced chip area.

scholarly journals A Multi-Parameter Comprehensive Optimized Algorithm for MPTCP Networks

Electronics ◽  
2021 ◽  
Vol 10 (16) ◽  
pp. 1942
Author(s):  
Min Chen ◽  
Muhammad Waleed Raza ◽  
Xing Zhou ◽  
Thomas Dreibholz ◽  
Yuyin Tan
Keyword(s):  
Congestion Control ◽  
High Throughput ◽  
Transmission Control Protocol ◽  
Buffer Size ◽  
Transmission Performance ◽  
Transmission Control ◽  
Holistic View ◽  
Management Algorithm ◽  
Future Work

The transmission performance of a multi-path transmission control protocol (MPTCP) is affected by many parameters, such as path management, congestion control, buffer size, and subflow bandwidth. Most of the previous studies have focused almost exclusively on the improvement of a single parameter, without a holistic view. In this paper, a multi-parameter comprehensive optimized algorithm (MPCOA) is proposed to comprehensively optimize the above parameters. The MPCOA algorithm can find a smaller buffer size and select an appropriate congestion control and path management algorithm on the premise of ensuring better throughput. Experiments in three scenarios show that MPCOA can save buffer space and subflow resources, and achieve a high throughput. Meanwhile, a set of quantitative improvement results given by MPCOA is convenient for us to evaluate the quality of the MPTCP network and provide reference for our ongoing future work.

AREA-EFFICIENT DIGIT SERIAL–SERIAL TWO'S COMPLEMENT MULTIPLIER

2014 ◽  
Vol 23 (07) ◽  
pp. 1450099 ◽  
Author(s):  
ESSAM ELSAYED ◽  
HATEM EL-BOGHDADI
Keyword(s):  
Critical Path ◽  
The Other ◽  
Chip Area ◽  
Pipeline Stage ◽  
Other Hand ◽  
Cycle Count ◽  
Simulation Results ◽  
Number Of Cycles ◽  
Area Efficient

Although parallel multipliers are optimal for speed, they occupy considerable chip area. For applications with lengthy operands as cryptography, the required area grows further. On the other hand, digit multipliers reduce chip area at the expense of the number of cycles required to complete the multiplication. In such multipliers, one-or-both inputs are received serially one digit per cycle. Digit multiplier designs are flexible with respect to the digit width enabling designers to select the most suitable compromise between area and cycle count for the application under consideration. This paper proposes a new digit serial–serial multiplier that is more area efficient compared to other functionally-similar multipliers. First, we propose a new unsigned digit serial–serial multiplier that is area efficient. The multiplier has the ability to handle unequal-width operands. That is, one operand can be of dynamic width (unlimited digit count) and the other operand is of fixed width. Moreover, with a small modification, the multiplier can operate on two's complement operands. Then, the design is extended to support bit-level pipelining: the critical path of the multiplier pipeline stage is independent of the operand width and the digit width. Simulation results show that the proposed multiplier reduces the area over similar multipliers by up to 28% and reduces power by up to 31%.

Improved Jitter Buffer Management for WebRTC

2021 ◽  
Vol 17 (1) ◽  
pp. 1-20
Author(s):  
Yusuf Cinar ◽  
Peter Pocta ◽  
Desmond Chambers ◽  
Hugh Melvin
Keyword(s):  
Voice Quality ◽  
Buffer Management ◽  
Voice Over Ip ◽  
The Core ◽  
Management Algorithm ◽  
Core Concepts ◽  
Novel Strategy

This work studies the jitter buffer management algorithm for Voice over IP in WebRTC. In particular, it details the core concepts of WebRTC’s jitter buffer management. Furthermore, it investigates how jitter buffer management algorithm behaves under network conditions with packet bursts. It also proposes an approach, different from the default WebRTC algorithm, to avoid distortions that occur under such network conditions. Under packet bursts, when the packet buffer becomes full, the WebRTC jitter buffer algorithm may discard all the packets in the buffer to make room for incoming packets. The proposed approach offers a novel strategy to minimize the number of packets discarded in the presence of packet bursts. Therefore, voice quality as perceived by the user is improved. ITU-T Rec. P.863, which also confirms the improvement, is employed to objectively evaluate the listening quality.

An Improved Congestion Control Mechanism Based on Mobile Agent for Wireless Sensor Networks

2014 ◽  
Vol 519-520 ◽  
pp. 1239-1242
Author(s):  
Xiao Hu Yu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Congestion Control ◽  
Mobile Agent ◽  
Mobile Agents ◽  
Control Mechanism ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Routing Table ◽  
Congestion Control Mechanism

An improved congestion control mechanism based on mobile agent for wireless sensor networks is proposed, which includes node-level congestion and link-level congestion control. The formers congestion information is collected and distributed by mobile agents (MA). When mobile agent travels through the networks, it can select a less-loaded neighbor node as its next hop and update the routing table according to the nodes congestion status. Minimum package of node outgoing traffic was preferentially transmitted in the link-level congestion. Simulation result shows that proposed mechanism attains high delivery ratio and throughput with reduced delay when compared with the existing technique.

Sign in / Sign up

Export Citation Format

Share Document