Routing optimization for network coding

2012 ◽  
Author(s):  
Michel Bourdelles ◽  
Nicolas Menegale
Keyword(s):  
Network Coding ◽  
Routing Optimization

Prototype Hardware for TDD Two-Way Multi-Hop Relay Network Using MIMO Network Coding

2012 ◽  
Vol E95.B (5) ◽  
pp. 1738-1750 ◽  
Author(s):  
Keiichi MIZUTANI ◽  
Takehiro MIYAMOTO ◽  
Kei SAKAGUCHI ◽  
Kiyomichi ARAKI
Keyword(s):  
Network Coding ◽  
Relay Network

A Loss-Recovery Scheme for Mixed Unicast and Multicast Traffic Using Network Coding

2013 ◽  
Vol E96.B (12) ◽  
pp. 3116-3123
Author(s):  
Zhiheng ZHOU ◽  
Liang ZHOU ◽  
Shengqiang LI
Keyword(s):  
Network Coding ◽  
Loss Recovery ◽  
Multicast Traffic ◽  
Recovery Scheme

A New Technique for File Sharing Mechanism Ad hoc Networks

2018 ◽  
Vol 8 (3) ◽  
pp. 1
Author(s):  
N. Lavanya ◽  
M. Balakrishna
Keyword(s):  
Ad Hoc Networks ◽  
Network Coding ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
File Sharing ◽  
New Technique ◽  
Peer To Peer Systems ◽  
A New Technique ◽  
Hoc Networks ◽  
Outgoing Channel

Network coding is a data transmission technique which allows intermediate nodes in a network to re-code data in transit. In contrast to traditional network communication where a node repeats incoming data to its outgoing channel without modifying the payload, a node implementing network coding not only repeats but also alters data. Network coding has been demonstrated to increase network throughput compared to the traditional forwarding transmission. It has potentially broad applications in many areas, including traditional computer networks, wireless ad-hoc networks, and peer to peer systems. This paper process a new technique for file sharing in P2P.

Routing Optimization with Efficient Second Order Distributed Approach Using Congestion Control Rules

2017 ◽  
Vol 7 (7) ◽  
pp. 363
Author(s):  
Jaya Pratha Sebastiyar ◽  
Martin Sahayaraj Joseph
Keyword(s):  
Congestion Control ◽  
Second Order ◽  
Back Pressure ◽  
Order Method ◽  
Delay Performance ◽  
Routing Optimization ◽  
Distributed Approach ◽  
Control Rules ◽  
Primal Dual ◽  
Queue Stability

Distributed joint congestion control and routing optimization has received a significant amount of attention recently. To date, however, most of the existing schemes follow a key idea called the back-pressure algorithm. Despite having many salient features, the first-order sub gradient nature of the back-pressure based schemes results in slow convergence and poor delay performance. To overcome these limitations, the present study was made as first attempt at developing a second-order joint congestion control and routing optimization framework that offers utility-optimality, queue-stability, fast convergence, and low delay.  Contributions in this project are three-fold. The present study propose a new second-order joint congestion control and routing framework based on a primal-dual interior-point approach and established utility-optimality and queue-stability of the proposed second-order method. The results of present study showed that how to implement the proposed second-order method in a distributed fashion.

Sign in / Sign up

Export Citation Format

Share Document