Optimization of Two-Way Network Coded HARQ With Overhead

Zhu, Hongyi; Smida, Besma; Love, David J.

doi:10.1109/tcomm.2020.2982625

Cited by 2 publications

(3 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, the authors of Ref. [39] optimized the technique of hybrid automatic repeat requests for packet control overhead. However, these works ignore the possibility of controlling packet header length for control overhead.…”

Section: Control Overhead Optimizationmentioning

confidence: 99%

Intelligent Segment Routing: Toward Load Balancing with Limited Control Overheads

Yang

Chen

Cui

et al. 2023

Big Data Min. Anal.

View full text Add to dashboard Cite

Segment routing has been a novel architecture for traffic engineering in recent years. However, segment routing brings control overheads, i.e., additional packets headers should be inserted. The overheads can greatly reduce the forwarding efficiency for a large network, when segment headers become too long. To achieve the best of two targets, we propose the intelligent routing scheme for traffic engineering (IRTE), which can achieve load balancing with limited control overheads. To achieve optimal performance, we first formulate the problem as a mapping problem that maps different flows to key diversion points. Second, we prove the problem is nondeterministic polynomial (NP)-hard by reducing it to a k-dense subgraph problem. To solve this problem, we develop an ant colony optimization algorithm as improved ant colony optimization (IACO), which is widely used in network optimization problems. We also design the load balancing algorithm with diversion routing (LBA-DR), and analyze its theoretical performance. Finally, we evaluate the IRTE in different real-world topologies, and the results show that the IRTE outperforms traditional algorithms, e.g., the maximum bandwidth is 24.6% lower than that of traditional algorithms when evaluating on BellCanada topology.

show abstract

Section: Control Overhead Optimizationmentioning

confidence: 99%

Intelligent Segment Routing: Toward Load Balancing with Limited Control Overheads

Yang

Chen

Cui

et al. 2023

Big Data Min. Anal.

View full text Add to dashboard Cite

show abstract

“…Furthermore, we assume that users can report the specific codewords that they succeeded in decoding. In this case, the BS can leverage that information and use network coding schemes to optimize the IR [35,36,50,51]. Since not all users are interested in all codewords, extension IR bits for any given codeword would only benefit a subset of the users, possibly a single one.…”

Section: Decision Engine For Multi-user Systemsmentioning

confidence: 99%

“…This idea, commonly known as network coded (H)ARQ, dates back to the 1980s [33], but it has recently experienced a renewed interest from the research community due to its potential uses in the Internet of Things (IoT). Its maximal achievable throughput under idealized conditions was characterized in [34], and [35] extended that work with a deeper study of the practical overheads associated with various implementations. It showed that using general linear codes requires significantly more overhead than binary codes, since the transmitter not only needs to specify which packets are included in each linear combination, but also their coefficients.…”

Section: Introductionmentioning

confidence: 99%

Optimizing HARQ and Relay Strategies in Limited Feedback Communication Systems

2020

View full text Add to dashboard Cite

One of the key challenges for future communication systems is to deal with fast changing channels due to the mobility of users. Having a robust protocol capable of handling transmission failures in unfavorable channel conditions is crucial, but the feedback capacity may be greatly limited due to strict latency requirements. This paper studies the hybrid automatic repeat request (HARQ) techniques involved in re-transmissions when decoding failures occur at the receiver and proposes a scheme that relies on codeword bundling and adaptive incremental redundancy (IR) to maximize the overall throughput in a limited feedback system. In addition to the traditional codeword extension IR bits, this paper introduces a new type of IR, bundle parity bits, obtained from an erasure code across all the codewords in a bundle. The type and number of IR bits to be sent as a response to a decoding failure is optimized through a Markov Decision Process. In addition to the single link analysis, the paper studies how the same techniques generalize to relay and multi-user broadcast systems. Simulation results show that the proposed schemes can provide a significant increase in throughput over traditional HARQ techniques.

show abstract

Optimization of Two-Way Network Coded HARQ With Overhead

Cited by 2 publications

References 24 publications

Intelligent Segment Routing: Toward Load Balancing with Limited Control Overheads

Intelligent Segment Routing: Toward Load Balancing with Limited Control Overheads

Optimizing HARQ and Relay Strategies in Limited Feedback Communication Systems

Contact Info

Product

Resources

About