scholarly journals Multicast With Network Coding in Application-Layer Overlay Networks

2004 ◽  
Vol 22 (1) ◽  
pp. 107-120 ◽  
Author(s):  
Y. Zhu ◽  
B. Li ◽  
J. Guo
Keyword(s):  
Network Coding ◽  
Overlay Networks ◽  
Application Layer

One-Hop Path Routing Based on Heuristic-K Method Using ACO

2012 ◽  
Vol 601 ◽  
pp. 312-317
Author(s):  
Zheng He ◽  
Fan Wei ◽  
Xiao Hong Huang ◽  
Yan Ma
Keyword(s):  
Traffic Engineering ◽  
Network Architecture ◽  
Loss Rate ◽  
Overlay Networks ◽  
Routing Algorithm ◽  
Overlay Network ◽  
Content Delivery ◽  
Route Selection ◽  
Application Layer ◽  
Overlay Routing

Overlay networks have emerged as a promising paradigm for providing customizable and reliable services at the application layer, such as fault-resilient routing, multicast, and content delivery. Among the overlay network architecture, overlay routing is an important aspect of the overlay network design. In this paper, we develop a one-hop source routing, called heuristic-K algorithm using Ant Colony Optimization, to allow individual nodes to optimize route selection based on specific metrics like delay, loss rate, or throughput. Moreover, due to the selfish operating manner of overlay routing, we also take the traffic engineering element into consideration in the design process of our proposal. The experimental results demonstrate the effectiveness of the routing algorithm.

scholarly journals Network-coded internet-friendly transport protocol

2017 ◽  
Vol 11 (3) ◽  
pp. 201-216 ◽  
Author(s):  
Justin Ridgewell ◽  
Hala ElAarag
Keyword(s):  
Network Coding ◽  
Transport Protocol ◽  
Application Layer ◽  
Performance Measurements ◽  
Wired Networks ◽  
Additive Increase ◽  
Lossy Links ◽  
Congestion Control Mechanism ◽  
To Receive ◽  
Better Than

This paper presents the design of network-coded TCP (NCTCP). NCTCP is a reliable TCP-like transport protocol that uses network coding to dramatically improve the overall performance in networks with lossy links. By sending datagrams that represent a linear combination of packets, we are able to receive data in an orderless fashion and still push data in byte-correct order to the receiver.s application layer. To eliminate roundoff errors, we generate consecutive-ones linear combinations of packets that form totally unimodular matrices. We then decode these datagrams using an efficient technique. In addition, NCTCP has an additive increase multiplicative decrease (AIMD) congestion control mechanism that uses round-trip times to increase the performance on wireless networks without hurting the performance on wired networks. Unlike TCP.s AIMD mechanism, NCTCP does not use a congestion window. Furthermore, NCTCP can be implemented in user space and hence does not need any changes to the kernel. We test our protocol using ns-2 simulator using several performance measurements, namely, throughput, goodput, efficiency and receiver efficiency. Our simulations show that NCTCP performs better than standard TCP implementations and previously proposed network coding protocols; TCP/NC and CTCP. We also demonstrate that NCTCP is TCP-friendly and maintains the fairness property essential for the health of the internet.

Sign in / Sign up

Export Citation Format

Share Document