@inproceedings{vu2018adaptivedecoding,

title = {Adaptive Decoding for Fulcrum Codes},

author = {Vu {Nguyen} and Juan A. {Cabrera} and Giang T. {Nguyen} and Frank {Gabriel} and Christopher {Lehmann} and Stanislav {Mudriievskyi} and Frank H. P. {Fitzek}},

year  = {2018},

date = {2018-11-01},

urldate = {2018-11-01},

booktitle = {IEEE IEMCON},

address = {Vancouver, Canada},

howpublished = {accepted},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Gabr1810:Latency,

title = {Latency Measurement of Service Function Chaining on OpenStack Platform},

author = {Zuo {Xiang} and Frank {Gabriel} and Giang T. {Nguyen} and Frank H. P. {Fitzek}},

year  = {2018},

date = {2018-10-04},

booktitle = {2018 IEEE 43rd Conference on Local Computer Networks (LCN) (LCN 2018)},

address = {Chicago, USA},

abstract = {Service Function Chaining allows the flexible and efficient deployment of 

network functions for different applications. With Network Function 

Virtualization the elements of the chain can be provisioned in virtual 

environments on any COTS hardware. This introduces the question of where to 

position the individual network functions within the virtualization 

environment. This problem of network function placement has been studied in 

theory as an optimization problem on a graph. However it is challenging to 

apply theoretical work on practical deployments. In this paper, we perform 

a measurement campaign to study the delay introduced by Service Function 

Chaining. We propose placement heuristics and evaluate the performance on 

OpenStack. With the proposed heuristics, the service delay can be reduced 

by more than 20%. We measured the overhead introduced by a network 

function implemented in user space. The processing delay in user space can 

be twice as much as the same function in kernel space. More interestingly, 

we identified a service interruption of more than 1 second after activation 

of the chain.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{vu2018sparsefulcrum,

title = {Integrating sparsity into Fulcrum codes: Investigating throughput, complexity and overhead},

author = {Vu {Nguyen} and Giang T. {Nguyen} and Frank {Gabriel} and Daniel E. {Lucani R\"{o}tter} and Frank H. P. {Fitzek}},

year  = {2018},

date = {2018-05-20},

booktitle = {IEEE ICC},

address = {Kansas City, US},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{gabriel2018multipath,

title = {Multipath Communication with Finite Sliding Window Network Coding for Ultra-Reliability and Low Latency},

author = {Frank {Gabriel} and Anil K. {Chorppath} and Ievgenii A. {Tsokalo} and Frank H. P. {Fitzek}},

doi = {10.1109/ICCW.2018.8403489},

isbn = {2474-9133},

year  = {2018},

date = {2018-05-19},

booktitle = {2018 IEEE International Conference on Communications Workshops (ICC Workshops)},

pages = {1-6},

address = {Kansas City, US},

abstract = {We use random linear network coding (RLNC) based scheme for multipath communication in the presence of lossy links with different delay characteristics to obtain ultra-reliability and low latency. A sliding window version of RLNC is proposed where the coded packets are generated using packets in a window size and are inserted among systematic packets in different paths. The packets are scheduled in the paths in a round robin fashion proportional to the data rates. We use finite encoding and decoding window size and do not rely on feedback for closing the sliding window, unlike the previous work. Our implementation of two paths with LTE and WiFi characteristics shows that the proposed sliding window scheme achieves better latency compared to the block RLNC code. It is also shown that the proposed scheme achieves low latency communication through multiple paths compared to the individual paths for bursty traffic by translating the throughput on both the paths into latency gain.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Tsokalo2018,

title = {Reliable Feedback Mechanisms for Routing Protocols with Network Coding},

author = {Ievgenii A. {Tsokalo} and Frank {Gabriel} and Sreekrishna {Pandi} and Frank H. P. {Fitzek} and Ralf {Lehnert}},

doi = {10.1109/ISPLC.2018.8360234},

isbn = {978-1-5386-1913-1},

year  = {2018},

date = {2018-04-11},

booktitle = {Proceedings of 2018 IEEE International Symposium on Power Line Communications and its Applications (ISPLC)},

volume = {1},

number = {1},

pages = {7},

publisher = {IEEE},

address = {Manchester, UK},

organization = {Technische Universit\"{a}t Dresden},

series = {1},

abstract = {PLC has the broadcast channel that enables overhearing and allows to use cooperative routing strategies. Opportunistic Routing (OpR) is a modern cooperative routing paradigm in broadcast channel networks such as PLC and wireless networks. In combination with Random Linear Network Coding (RLNC), it has been proven to increase the achievable data rate and reliability significantly. The reliability is supported by Automatic Repeat reQuest (ARQ) mechanisms. Traditional ARQs as Stop-And-Wait, Go-Back-N and Selective-Repeat are outperformed by the hybrid ARQs (HARQs). We analyze and compare six HARQs designed especially for protocols with Network Coding (NC). For this purpose, we propose a novel minimalistic evaluation setup. It reveals the disadvantages of each feedback (ARQ) mechanisms allowing an effective and fair comparison. We define performance metrics that indicate the reliability and efficiency and conduct the experiments using different NC parameters and the feedback frequency. We notice that some HARQs allow high reliability 

(packet loss \< 10 \^{O}\^{e}\AE4 ), while others have just a few percent protocol overhead. For such results, only one feedback per the code block is normally sufficient.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Gabriel-2017,

title = {Practical deployment of network coding for real-time applications in 5G networks},

author = {Frank {Gabriel} and Giang T. {Nguyen} and Robert-Steve {Schmoll} and Juan A. {Cabrera} and Maciej {M\"{u}hleisen} and Frank H. P. {Fitzek}},

year  = {2018},

date = {2018-01-12},

urldate = {2018-01-12},

booktitle = {CCNC},

address = {Las Vegas},

abstract = {The 5G communication system will provide flexible and programmable networks by leveraging softwarization technologies such as NFV and SDN. That advanced feature of 5G networks will be demonstrated in the context of real-time video surveillance for public safety. Specifically, we demonstrate for the first time a practical deployment of Random Linear Network Coding (RLNC) with NFV and SDN technologies to improve video quality against packet loss due to congestion at the core network and signal impairment of lossy channels at network edges. The demonstration implements NFV and SDN applications on COTS devices to prove its flexibility and portability.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Wunderlich2017b,

title = {We don't need no generation \textendash a practical approach to sliding window RLNC},

author = {Simon {Wunderlich} and Frank {Gabriel} and Sreekrishna {Pandi} and Frank H. P. {Fitzek}},

url = {http://ieeexplore.ieee.org/document/7918148/},

year  = {2017},

date = {2017-03-29},

booktitle = {Wireless Days 2017},

address = {Porto, Portugal},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}