Search | arXiv e-print repository

<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"/> <meta name="viewport" content="width=device-width, initial-scale=1"/>  <link rel="apple-touch-icon" sizes="180x180" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-16x16.png"> <link rel="manifest" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/site.webmanifest"> <link rel="mask-icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/safari-pinned-tab.svg" color="#b31b1b"> <link rel="shortcut icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon.ico"> <meta name="msapplication-TileColor" content="#b31b1b"> <meta name="msapplication-config" content="images/icons/browserconfig.xml"> <meta name="theme-color" content="#b31b1b">  <title>Search | arXiv e-print repository</title> <script defer src="https://static.arxiv.org/static/base/1.0.0a5/fontawesome-free-5.11.2-web/js/all.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/base/1.0.0a5/css/arxivstyle.css" /> <script type="text/x-mathjax-config"> MathJax.Hub.Config({ messageStyle: "none", extensions: ["tex2jax.js"], jax: ["input/TeX", "output/HTML-CSS"], tex2jax: { inlineMath: [ ['$','$'], ["\$","\$"] ], displayMath: [ ['$$','$$'], ["\\[","\\]"] ], processEscapes: true, ignoreClass: '.*', processClass: 'mathjax.*' }, TeX: { extensions: ["AMSmath.js", "AMSsymbols.js", "noErrors.js"], noErrors: { inlineDelimiters: ["$","$"], multiLine: false, style: { "font-size": "normal", "border": "" } } }, "HTML-CSS": { availableFonts: ["TeX"] } }); </script> <script src='//static.arxiv.org/MathJax-2.7.3/MathJax.js'></script> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/notification.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/bulma-tooltip.min.css" /> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/search.css" /> <script src="https://code.jquery.com/jquery-3.2.1.slim.min.js" integrity="sha256-k2WSCIexGzOj3Euiig+TlR8gA0EmPjuc79OEeY5L45g=" crossorigin="anonymous"></script> <script src="https://static.arxiv.org/static/search/0.5.6/js/fieldset.js"></script> <style> radio#cf-customfield_11400 { display: none; } </style> </head> <body> <header><a href="#main-container" class="is-sr-only">Skip to main content</a>  <div class="attribution level is-marginless" role="banner"> <div class="level-left"> <a class="level-item" href="https://cornell.edu/"><img src="https://static.arxiv.org/static/base/1.0.0a5/images/cornell-reduced-white-SMALL.svg" alt="Cornell University" width="200" aria-label="logo" /></a> </div> <div class="level-right is-marginless"><p class="sponsors level-item is-marginless"><span id="support-ack-url">We gratefully acknowledge support from<br /> the Simons Foundation, <a href="https://info.arxiv.org/about/ourmembers.html">member institutions</a>, and all contributors. <a href="https://info.arxiv.org/about/donate.html">Donate</a></span></p></div> </div>  <div class="identity level is-marginless"> <div class="level-left"> <div class="level-item"> <a class="arxiv" href="https://arxiv.org/" aria-label="arxiv-logo"> <img src="https://static.arxiv.org/static/base/1.0.0a5/images/arxiv-logo-one-color-white.svg" aria-label="logo" alt="arxiv logo" width="85" style="width:85px;"/> </a> </div> </div> <div class="search-block level-right"> <form class="level-item mini-search" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <div class="control"> <input class="input is-small" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <p class="help"><a href="https://info.arxiv.org/help">Help</a> | <a href="https://arxiv.org/search/advanced">Advanced Search</a></p> </div> <div class="control"> <div class="select is-small"> <select name="searchtype" aria-label="Field to search"> <option value="all" selected="selected">All fields</option> <option value="title">Title</option> <option value="author">Author</option> <option value="abstract">Abstract</option> <option value="comments">Comments</option> <option value="journal_ref">Journal reference</option> <option value="acm_class">ACM classification</option> <option value="msc_class">MSC classification</option> <option value="report_num">Report number</option> <option value="paper_id">arXiv identifier</option> <option value="doi">DOI</option> <option value="orcid">ORCID</option> <option value="author_id">arXiv author ID</option> <option value="help">Help pages</option> <option value="full_text">Full text</option> </select> </div> </div> <input type="hidden" name="source" value="header"> <button class="button is-small is-cul-darker">Search</button> </div> </form> </div> </div>  <div class="container"> <div class="user-tools is-size-7 has-text-right has-text-weight-bold" role="navigation" aria-label="User menu"> <a href="https://arxiv.org/login">Login</a> </div> </div> </header> <main class="container" id="main-container"> <div class="level is-marginless"> <div class="level-left"> <h1 class="title is-clearfix"> Showing 1–29 of 29 results for author: <span class="mathjax">Fitzek, F H</span> </h1> </div> <div class="level-right is-hidden-mobile">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> <div class="content"> <form method="GET" action="/search/cs" aria-role="search"> Searching in archive <strong>cs</strong>. <a href="/search/?searchtype=author&query=Fitzek%2C+F+H">Search in all archives.</a> <div class="field has-addons-tablet"> <div class="control is-expanded"> <label for="query" class="hidden-label">Search term or terms</label> <input class="input is-medium" id="query" name="query" placeholder="Search term..." type="text" value="Fitzek, F H"> </div> <div class="select control is-medium"> <label class="is-hidden" for="searchtype">Field</label> <select class="is-medium" id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> </div> <div class="control"> <button class="button is-link is-medium">Search</button> </div> </div> <div class="field"> <div class="control is-size-7"> <label class="radio"> <input checked id="abstracts-0" name="abstracts" type="radio" value="show"> Show abstracts </label> <label class="radio"> <input id="abstracts-1" name="abstracts" type="radio" value="hide"> Hide abstracts </label> </div> </div> <div class="is-clearfix" style="height: 2.5em"> <div class="is-pulled-right"> <a href="/search/advanced?terms-0-term=Fitzek%2C+F+H&terms-0-field=author&size=50&order=-announced_date_first">Advanced Search</a> </div> </div> <input type="hidden" name="order" value="-announced_date_first"> <input type="hidden" name="size" value="50"> </form> <div class="level breathe-horizontal"> <div class="level-left"> <form method="GET" action="/search/"> <div style="display: none;"> <select id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> <input id="query" name="query" type="text" value="Fitzek, F H"> <ul id="abstracts"><li><input checked id="abstracts-0" name="abstracts" type="radio" value="show"> <label for="abstracts-0">Show abstracts</label></li><li><input id="abstracts-1" name="abstracts" type="radio" value="hide"> <label for="abstracts-1">Hide abstracts</label></li></ul> </div> <div class="box field is-grouped is-grouped-multiline level-item"> <div class="control"> <span class="select is-small"> <select id="size" name="size"><option value="25">25</option><option selected value="50">50</option><option value="100">100</option><option value="200">200</option></select> </span> <label for="size">results per page</label>. </div> <div class="control"> <label for="order">Sort results by</label> <span class="select is-small"> <select id="order" name="order"><option selected value="-announced_date_first">Announcement date (newest first)</option><option value="announced_date_first">Announcement date (oldest first)</option><option value="-submitted_date">Submission date (newest first)</option><option value="submitted_date">Submission date (oldest first)</option><option value="">Relevance</option></select> </span> </div> <div class="control"> <button class="button is-small is-link">Go</button> </div> </div> </form> </div> </div> <ol class="breathe-horizontal" start="1"> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.04006">arXiv:2412.04006</a> <span> [<a href="https://arxiv.org/pdf/2412.04006">pdf</a>, <a href="https://arxiv.org/format/2412.04006">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Social and Information Networks">cs.SI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Enabling Sustainable Urban Mobility: The Role of 5G Communication in the Mobilities for EU Project </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Wang%2C+S">Shangqing Wang</a>, <a href="/search/cs?searchtype=author&query=Lehmann%2C+C">Christopher Lehmann</a>, <a href="/search/cs?searchtype=author&query=Radeke%2C+R">Rico Radeke</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.04006v1-abstract-short" style="display: inline;"> This paper examines the role of 5G communication in the Mobilities for EU project, a collaborative initiative involving 29 partners and 11 pilots aimed at revolutionizing urban mobility through electrification, automation, and connectivity. Focusing on Dresden as a Lead City, we explore the integration of 27 innovative solutions, including autonomous freight transport, eBuses, and charging robots,… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.04006v1-abstract-full').style.display = 'inline'; document.getElementById('2412.04006v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.04006v1-abstract-full" style="display: none;"> This paper examines the role of 5G communication in the Mobilities for EU project, a collaborative initiative involving 29 partners and 11 pilots aimed at revolutionizing urban mobility through electrification, automation, and connectivity. Focusing on Dresden as a Lead City, we explore the integration of 27 innovative solutions, including autonomous freight transport, eBuses, and charging robots, using a 5G communication network as the central framework. We analyze how 5G enables seamless connectivity and real-time data processing across diverse technologies, fostering interdependencies and synergies. This approach not only provides a cohesive understanding of the project's scope but also demonstrates 5G's critical role in smart city infrastructure. We evaluate the anticipated impact on sustainability metrics such as air quality, noise levels, CO2 emissions, and traffic congestion. The paper concludes by discussing challenges and strategies in leveraging 5G for comprehensive urban mobility solutions and its potential impact on future smart city developments. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.04006v1-abstract-full').style.display = 'none'; document.getElementById('2412.04006v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 5 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">6 pages</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.13241">arXiv:2411.13241</a> <span> [<a href="https://arxiv.org/pdf/2411.13241">pdf</a>, <a href="https://arxiv.org/format/2411.13241">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Emerging Technologies">cs.ET</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Medical Physics">physics.med-ph</span> </div> </div> <p class="title is-5 mathjax"> Advanced Plaque Modeling for Atherosclerosis Detection Using Molecular Communication </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Wietfeld%2C+A">Alexander Wietfeld</a>, <a href="/search/cs?searchtype=author&query=Hofmann%2C+P">Pit Hofmann</a>, <a href="/search/cs?searchtype=author&query=Fuchtmann%2C+J">Jonas Fuchtmann</a>, <a href="/search/cs?searchtype=author&query=Zhou%2C+P">Pengjie Zhou</a>, <a href="/search/cs?searchtype=author&query=Zheng%2C+R">Ruifeng Zheng</a>, <a href="/search/cs?searchtype=author&query=Cabrera%2C+J+A">Juan A. Cabrera</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a>, <a href="/search/cs?searchtype=author&query=Kellerer%2C+W">Wolfgang Kellerer</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.13241v1-abstract-short" style="display: inline;"> As one of the most prevalent diseases worldwide, plaque formation in human arteries, known as atherosclerosis, is the focus of many research efforts. Previously, molecular communication (MC) models have been proposed to capture and analyze the natural processes inside the human body and to support the development of diagnosis and treatment methods. In the future, synthetic MC networks are envision… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.13241v1-abstract-full').style.display = 'inline'; document.getElementById('2411.13241v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.13241v1-abstract-full" style="display: none;"> As one of the most prevalent diseases worldwide, plaque formation in human arteries, known as atherosclerosis, is the focus of many research efforts. Previously, molecular communication (MC) models have been proposed to capture and analyze the natural processes inside the human body and to support the development of diagnosis and treatment methods. In the future, synthetic MC networks are envisioned to span the human body as part of the Internet of Bio-Nano Things (IoBNT), turning blood vessels into physical communication channels. By observing and characterizing changes in these channels, MC networks could play an active role in detecting diseases like atherosclerosis. In this paper, building on previous preliminary work for simulating an MC scenario in a plaque-obstructed blood vessel, we evaluate different analytical models for non-Newtonian flow and derive associated channel impulse responses (CIRs). Additionally, we add the crucial factor of flow pulsatility to our simulation model and investigate the effect of the systole-diastole cycle on the received particles across the plaque channel. We observe a significant influence of the plaque on the channel in terms of the flow profile and CIR across different emission times in the cycle. These metrics could act as crucial indicators for early non-invasive plaque detection in advanced future MC methods. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.13241v1-abstract-full').style.display = 'none'; document.getElementById('2411.13241v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">6 pages, 6 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.07160">arXiv:2411.07160</a> <span> [<a href="https://arxiv.org/pdf/2411.07160">pdf</a>, <a href="https://arxiv.org/format/2411.07160">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> An Efficient Error Estimation Method in Quantum Key Distribution </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Wang%2C+Y">Yingjian Wang</a>, <a href="/search/cs?searchtype=author&query=Hai%2C+Y">Yilun Hai</a>, <a href="/search/cs?searchtype=author&query=Njoku%2C+B">Buniechukwu Njoku</a>, <a href="/search/cs?searchtype=author&query=Kondepu%2C+K">Koteswararao Kondepu</a>, <a href="/search/cs?searchtype=author&query=Bassoli%2C+R">Riccardo Bassoli</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.07160v1-abstract-short" style="display: inline;"> Error estimation is an important step for error correction in quantum key distribution. Traditional error estimation methods require sacrificing a part of the sifted key, forcing a trade-off between the accuracy of error estimation and the size of the partial sifted key to be used and discarded. In this paper, we propose a hybrid approach that aims to preserve the entire sifted key after error est… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.07160v1-abstract-full').style.display = 'inline'; document.getElementById('2411.07160v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.07160v1-abstract-full" style="display: none;"> Error estimation is an important step for error correction in quantum key distribution. Traditional error estimation methods require sacrificing a part of the sifted key, forcing a trade-off between the accuracy of error estimation and the size of the partial sifted key to be used and discarded. In this paper, we propose a hybrid approach that aims to preserve the entire sifted key after error estimation while preventing Eve from gaining any advantage. The entire sifted key, modified and extended by our proposed method, is sent for error estimation in a public channel. Although accessible to an eavesdropper, the modified and extended sifted key ensures that the number of attempts to crack it remains the same as when no information is leaked. The entire sifted key is preserved for subsequent procedures, indicating the efficient utilization of quantum resources. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.07160v1-abstract-full').style.display = 'none'; document.getElementById('2411.07160v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2408.06115">arXiv:2408.06115</a> <span> [<a href="https://arxiv.org/pdf/2408.06115">pdf</a>, <a href="https://arxiv.org/format/2408.06115">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Measurement Study of Programmable Network Coding in Cloud-native 5G and Beyond Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Lhamo%2C+O">Osel Lhamo</a>, <a href="/search/cs?searchtype=author&query=Doan%2C+T+V">Tung V. Doan</a>, <a href="/search/cs?searchtype=author&query=Tasdemir%2C+E">Elif Tasdemir</a>, <a href="/search/cs?searchtype=author&query=Attawna%2C+M">Mahdi Attawna</a>, <a href="/search/cs?searchtype=author&query=Nguyen%2C+G+T">Giang T. Nguyen</a>, <a href="/search/cs?searchtype=author&query=Seeling%2C+P">Patrick Seeling</a>, <a href="/search/cs?searchtype=author&query=Reisslein%2C+M">Martin Reisslein</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2408.06115v1-abstract-short" style="display: inline;"> Emerging 5G/6G use cases span various industries, necessitating flexible solutions that leverage emerging technologies to meet diverse and stringent application requirements under changing network conditions. The standard 5G RAN solution, retransmission, reduces packet loss but can increase transmission delay in the process. Random Linear Network Coding (RLNC) offers an alternative by proactively… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2408.06115v1-abstract-full').style.display = 'inline'; document.getElementById('2408.06115v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2408.06115v1-abstract-full" style="display: none;"> Emerging 5G/6G use cases span various industries, necessitating flexible solutions that leverage emerging technologies to meet diverse and stringent application requirements under changing network conditions. The standard 5G RAN solution, retransmission, reduces packet loss but can increase transmission delay in the process. Random Linear Network Coding (RLNC) offers an alternative by proactively sending combinations of original packets, thus reducing both delay and packet loss. Current research often only simulates the integration of RLNC in 5G while we implement and evaluate our approach on real commercially available hardware in a real-world deployment. We introduce Flexible Network Coding (FlexNC), which enables the flexible fusion of several RLNC protocols by incorporating a forwarder with multiple RLNC nodes. Network operators can configure FlexNC based on network conditions and application requirements. To further boost network programmability, our Recoder in the Network (RecNet) leverages intermediate network nodes to join the coding process. Both the proposed algorithms have been implemented on OpenAirInterface and extensively tested with traffic from different applications in a real network. While FlexNC adapts to various application needs of latency and packet loss, RecNet significantly minimizes packet loss for a remote user with minimal increase in delay compared to pure RLNC. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2408.06115v1-abstract-full').style.display = 'none'; document.getElementById('2408.06115v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 12 August, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2309.09881">arXiv:2309.09881</a> <span> [<a href="https://arxiv.org/pdf/2309.09881">pdf</a>, <a href="https://arxiv.org/format/2309.09881">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> </div> <p class="title is-5 mathjax"> Deep Reinforcement Learning for the Joint Control of Traffic Light Signaling and Vehicle Speed Advice </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Busch%2C+J+V+S">Johannes V. S. Busch</a>, <a href="/search/cs?searchtype=author&query=Voelckner%2C+R">Robert Voelckner</a>, <a href="/search/cs?searchtype=author&query=Sossalla%2C+P">Peter Sossalla</a>, <a href="/search/cs?searchtype=author&query=Vielhaus%2C+C+L">Christian L. Vielhaus</a>, <a href="/search/cs?searchtype=author&query=Calandra%2C+R">Roberto Calandra</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2309.09881v1-abstract-short" style="display: inline;"> Traffic congestion in dense urban centers presents an economical and environmental burden. In recent years, the availability of vehicle-to-anything communication allows for the transmission of detailed vehicle states to the infrastructure that can be used for intelligent traffic light control. The other way around, the infrastructure can provide vehicles with advice on driving behavior, such as ap… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2309.09881v1-abstract-full').style.display = 'inline'; document.getElementById('2309.09881v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2309.09881v1-abstract-full" style="display: none;"> Traffic congestion in dense urban centers presents an economical and environmental burden. In recent years, the availability of vehicle-to-anything communication allows for the transmission of detailed vehicle states to the infrastructure that can be used for intelligent traffic light control. The other way around, the infrastructure can provide vehicles with advice on driving behavior, such as appropriate velocities, which can improve the efficacy of the traffic system. Several research works applied deep reinforcement learning to either traffic light control or vehicle speed advice. In this work, we propose a first attempt to jointly learn the control of both. We show this to improve the efficacy of traffic systems. In our experiments, the joint control approach reduces average vehicle trip delays, w.r.t. controlling only traffic lights, in eight out of eleven benchmark scenarios. Analyzing the qualitative behavior of the vehicle speed advice policy, we observe that this is achieved by smoothing out the velocity profile of vehicles nearby a traffic light. Learning joint control of traffic signaling and speed advice in the real world could help to reduce congestion and mitigate the economical and environmental repercussions of today's traffic systems. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2309.09881v1-abstract-full').style.display = 'none'; document.getElementById('2309.09881v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 18 September, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">6 pages, 2 figures, accepted for publication at IEEE ICMLA 2023</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2302.11966">arXiv:2302.11966</a> <span> [<a href="https://arxiv.org/pdf/2302.11966">pdf</a>, <a href="https://arxiv.org/format/2302.11966">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/ACCESS.2023.3303528">10.1109/ACCESS.2023.3303528 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Machine Learning for QoS Prediction in Vehicular Communication: Challenges and Solution Approaches </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Palaios%2C+A">Alexandros Palaios</a>, <a href="/search/cs?searchtype=author&query=Vielhaus%2C+C+L">Christian L. Vielhaus</a>, <a href="/search/cs?searchtype=author&query=K%C3%BClzer%2C+D+F">Daniel F. K眉lzer</a>, <a href="/search/cs?searchtype=author&query=Watermann%2C+C">Cara Watermann</a>, <a href="/search/cs?searchtype=author&query=Hernangomez%2C+R">Rodrigo Hernangomez</a>, <a href="/search/cs?searchtype=author&query=Partani%2C+S">Sanket Partani</a>, <a href="/search/cs?searchtype=author&query=Geuer%2C+P">Philipp Geuer</a>, <a href="/search/cs?searchtype=author&query=Krause%2C+A">Anton Krause</a>, <a href="/search/cs?searchtype=author&query=Sattiraju%2C+R">Raja Sattiraju</a>, <a href="/search/cs?searchtype=author&query=Kasparick%2C+M">Martin Kasparick</a>, <a href="/search/cs?searchtype=author&query=Fettweis%2C+G">Gerhard Fettweis</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a>, <a href="/search/cs?searchtype=author&query=Schotten%2C+H+D">Hans D. Schotten</a>, <a href="/search/cs?searchtype=author&query=Stanczak%2C+S">Slawomir Stanczak</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2302.11966v2-abstract-short" style="display: inline;"> As cellular networks evolve towards the 6th generation, machine learning is seen as a key enabling technology to improve the capabilities of the network. Machine learning provides a methodology for predictive systems, which can make networks become proactive. This proactive behavior of the network can be leveraged to sustain, for example, a specific quality of service requirement. With predictive… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2302.11966v2-abstract-full').style.display = 'inline'; document.getElementById('2302.11966v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2302.11966v2-abstract-full" style="display: none;"> As cellular networks evolve towards the 6th generation, machine learning is seen as a key enabling technology to improve the capabilities of the network. Machine learning provides a methodology for predictive systems, which can make networks become proactive. This proactive behavior of the network can be leveraged to sustain, for example, a specific quality of service requirement. With predictive quality of service, a wide variety of new use cases, both safety- and entertainment-related, are emerging, especially in the automotive sector. Therefore, in this work, we consider maximum throughput prediction enhancing, for example, streaming or high-definition mapping applications. We discuss the entire machine learning workflow highlighting less regarded aspects such as the detailed sampling procedures, the in-depth analysis of the dataset characteristics, the effects of splits in the provided results, and the data availability. Reliable machine learning models need to face a lot of challenges during their lifecycle. We highlight how confidence can be built on machine learning technologies by better understanding the underlying characteristics of the collected data. We discuss feature engineering and the effects of different splits for the training processes, showcasing that random splits might overestimate performance by more than twofold. Moreover, we investigate diverse sets of input features, where network information proved to be most effective, cutting the error by half. Part of our contribution is the validation of multiple machine learning models within diverse scenarios. We also use explainable AI to show that machine learning can learn underlying principles of wireless networks without being explicitly programmed. Our data is collected from a deployed network that was under full control of the measurement team and covered different vehicular scenarios and radio environments. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2302.11966v2-abstract-full').style.display = 'none'; document.getElementById('2302.11966v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 22 August, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 23 February, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">18 pages, 12 Figures. Accepted on IEEE Access</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2212.10343">arXiv:2212.10343</a> <span> [<a href="https://arxiv.org/pdf/2212.10343">pdf</a>, <a href="https://arxiv.org/format/2212.10343">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/VTC2023-Spring57618.2023.10200750">10.1109/VTC2023-Spring57618.2023.10200750 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Berlin V2X: A Machine Learning Dataset from Multiple Vehicles and Radio Access Technologies </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Hernang%C3%B3mez%2C+R">Rodrigo Hernang贸mez</a>, <a href="/search/cs?searchtype=author&query=Geuer%2C+P">Philipp Geuer</a>, <a href="/search/cs?searchtype=author&query=Palaios%2C+A">Alexandros Palaios</a>, <a href="/search/cs?searchtype=author&query=Sch%C3%A4ufele%2C+D">Daniel Sch盲ufele</a>, <a href="/search/cs?searchtype=author&query=Watermann%2C+C">Cara Watermann</a>, <a href="/search/cs?searchtype=author&query=Taleb-Bouhemadi%2C+K">Khawla Taleb-Bouhemadi</a>, <a href="/search/cs?searchtype=author&query=Parvini%2C+M">Mohammad Parvini</a>, <a href="/search/cs?searchtype=author&query=Krause%2C+A">Anton Krause</a>, <a href="/search/cs?searchtype=author&query=Partani%2C+S">Sanket Partani</a>, <a href="/search/cs?searchtype=author&query=Vielhaus%2C+C">Christian Vielhaus</a>, <a href="/search/cs?searchtype=author&query=Kasparick%2C+M">Martin Kasparick</a>, <a href="/search/cs?searchtype=author&query=K%C3%BClzer%2C+D+F">Daniel F. K眉lzer</a>, <a href="/search/cs?searchtype=author&query=Burmeister%2C+F">Friedrich Burmeister</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a>, <a href="/search/cs?searchtype=author&query=Schotten%2C+H+D">Hans D. Schotten</a>, <a href="/search/cs?searchtype=author&query=Fettweis%2C+G">Gerhard Fettweis</a>, <a href="/search/cs?searchtype=author&query=Sta%C5%84czak%2C+S">S艂awomir Sta艅czak</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2212.10343v3-abstract-short" style="display: inline;"> The evolution of wireless communications into 6G and beyond is expected to rely on new machine learning (ML)-based capabilities. These can enable proactive decisions and actions from wireless-network components to sustain quality-of-service (QoS) and user experience. Moreover, new use cases in the area of vehicular and industrial communications will emerge. Specifically in the area of vehicle comm… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2212.10343v3-abstract-full').style.display = 'inline'; document.getElementById('2212.10343v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2212.10343v3-abstract-full" style="display: none;"> The evolution of wireless communications into 6G and beyond is expected to rely on new machine learning (ML)-based capabilities. These can enable proactive decisions and actions from wireless-network components to sustain quality-of-service (QoS) and user experience. Moreover, new use cases in the area of vehicular and industrial communications will emerge. Specifically in the area of vehicle communication, vehicle-to-everything (V2X) schemes will benefit strongly from such advances. With this in mind, we have conducted a detailed measurement campaign that paves the way to a plethora of diverse ML-based studies. The resulting datasets offer GPS-located wireless measurements across diverse urban environments for both cellular (with two different operators) and sidelink radio access technologies, thus enabling a variety of different studies towards V2X. The datasets are labeled and sampled with a high time resolution. Furthermore, we make the data publicly available with all the necessary information to support the onboarding of new researchers. We provide an initial analysis of the data showing some of the challenges that ML needs to overcome and the features that ML can leverage, as well as some hints at potential research studies. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2212.10343v3-abstract-full').style.display = 'none'; document.getElementById('2212.10343v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 14 April, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 20 December, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">5 pages, 6 figures. Accepted for presentation at IEEE conference VTC2023-Spring. Available dataset at https://ieee-dataport.org/open-access/berlin-v2x</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2211.10413">arXiv:2211.10413</a> <span> [<a href="https://arxiv.org/pdf/2211.10413">pdf</a>, <a href="https://arxiv.org/format/2211.10413">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/TNSM.2023.3327108">10.1109/TNSM.2023.3327108 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> TSN-FlexTest: Flexible TSN Measurement Testbed (Extended Version) </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Ulbricht%2C+M">Marian Ulbricht</a>, <a href="/search/cs?searchtype=author&query=Senk%2C+S">Stefan Senk</a>, <a href="/search/cs?searchtype=author&query=Nazari%2C+H+K">Hosein K. Nazari</a>, <a href="/search/cs?searchtype=author&query=Liu%2C+H">How-Hang Liu</a>, <a href="/search/cs?searchtype=author&query=Reisslein%2C+M">Martin Reisslein</a>, <a href="/search/cs?searchtype=author&query=Nguyen%2C+G+T">Giang T. Nguyen</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2211.10413v5-abstract-short" style="display: inline;"> Robust, reliable, and deterministic networks are essential for a variety of applications. In order to provide guaranteed communication network services, Time-Sensitive Networking (TSN) unites a set of standards for time-synchronization, flow control, enhanced reliability, and management. We design the TSN-FlexTest testbed with generic commodity hardware and open-source software components to enabl… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2211.10413v5-abstract-full').style.display = 'inline'; document.getElementById('2211.10413v5-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2211.10413v5-abstract-full" style="display: none;"> Robust, reliable, and deterministic networks are essential for a variety of applications. In order to provide guaranteed communication network services, Time-Sensitive Networking (TSN) unites a set of standards for time-synchronization, flow control, enhanced reliability, and management. We design the TSN-FlexTest testbed with generic commodity hardware and open-source software components to enable flexible TSN measurements. We have conducted extensive measurements to validate the TSN-FlexTest testbed and to examine TSN characteristics. The measurements provide insights into the effects of TSN configurations, such as increasing the number of synchronization messages for the Precision Time Protocol, indicating that a measurement accuracy of 15 ns can be achieved. The TSN measurements included extensive evaluations of the Time-aware Shaper (TAS) for sets of Tactile Internet (TI) packet traffic streams. The measurements elucidate the effects of different scheduling and shaping approaches, while revealing the need for pervasive network control that synchronizes the sending nodes with the network switches. We present the first measurements of distributed TAS with synchronized senders on a commodity hardware testbed, demonstrating the same Quality-of-Service as with dedicated wires for high-priority TI streams despite a 200% over-saturation cross traffic load. The testbed is provided as an open-source project to facilitate future TSN research. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2211.10413v5-abstract-full').style.display = 'none'; document.getElementById('2211.10413v5-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 27 November, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 18 November, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">30 pages, 18 figures, 6 tables, IEEE TNSM, in print, 2024. Shorter version in print in IEEE Trans. on Network and Service Management (see related DOI below)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2211.07630">arXiv:2211.07630</a> <span> [<a href="https://arxiv.org/pdf/2211.07630">pdf</a>, <a href="https://arxiv.org/format/2211.07630">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/MWC.003.2200060">10.1109/MWC.003.2200060 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Functional Split of In-Network Deep Learning for 6G: A Feasibility Study </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=He%2C+J">Jia He</a>, <a href="/search/cs?searchtype=author&query=Wu%2C+H">Huanzhuo Wu</a>, <a href="/search/cs?searchtype=author&query=Xiao%2C+X">Xun Xiao</a>, <a href="/search/cs?searchtype=author&query=Bassoli%2C+R">Riccardo Bassoli</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2211.07630v1-abstract-short" style="display: inline;"> In existing mobile network systems, the data plane (DP) is mainly considered a pipeline consisting of network elements end-to-end forwarding user data traffics. With the rapid maturity of programmable network devices, however, mobile network infrastructure mutates towards a programmable computing platform. Therefore, such a programmable DP can provide in-network computing capability for many appli… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2211.07630v1-abstract-full').style.display = 'inline'; document.getElementById('2211.07630v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2211.07630v1-abstract-full" style="display: none;"> In existing mobile network systems, the data plane (DP) is mainly considered a pipeline consisting of network elements end-to-end forwarding user data traffics. With the rapid maturity of programmable network devices, however, mobile network infrastructure mutates towards a programmable computing platform. Therefore, such a programmable DP can provide in-network computing capability for many application services. In this paper, we target to enhance the data plane with in-network deep learning (DL) capability. However, in-network intelligence can be a significant load for network devices. Then, the paradigm of the functional split is applied so that the deep neural network (DNN) is decomposed into sub-elements of the data plane for making machine learning inference jobs more efficient. As a proof-of-concept, we take a Blind Source Separation (BSS) problem as an example to exhibit the benefits of such an approach. We implement the proposed enhancement in a full-stack emulator and we provide a quantitative evaluation with professional datasets. As an initial trial, our study provides insightful guidelines for the design of the future mobile network system, employing in-network intelligence (e.g., 6G). <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2211.07630v1-abstract-full').style.display = 'none'; document.getElementById('2211.07630v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 14 November, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2022. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2211.01924">arXiv:2211.01924</a> <span> [<a href="https://arxiv.org/pdf/2211.01924">pdf</a>, <a href="https://arxiv.org/format/2211.01924">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/MCOMSTD.0001.2100053">10.1109/MCOMSTD.0001.2100053 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> A New Agent-Based Intelligent Network Architecture </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Arzo%2C+S+T">Sisay Tadesse Arzo</a>, <a href="/search/cs?searchtype=author&query=Scotece%2C+D">Domenico Scotece</a>, <a href="/search/cs?searchtype=author&query=Bassoli%2C+R">Riccardo Bassoli</a>, <a href="/search/cs?searchtype=author&query=Granelli%2C+F">Fabrizio Granelli</a>, <a href="/search/cs?searchtype=author&query=Foschini%2C+L">Luca Foschini</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2211.01924v1-abstract-short" style="display: inline;"> The advent of 5G and the design of its architecture has become possible because of the previous individual scientific works and standardization efforts on cloud computing and network softwarization. Software-defined Networking and Network Function Virtualization started separately to find their convolution into 5G network architecture. Then, the ongoing design of the future beyond 5G (B5G) and 6G… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2211.01924v1-abstract-full').style.display = 'inline'; document.getElementById('2211.01924v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2211.01924v1-abstract-full" style="display: none;"> The advent of 5G and the design of its architecture has become possible because of the previous individual scientific works and standardization efforts on cloud computing and network softwarization. Software-defined Networking and Network Function Virtualization started separately to find their convolution into 5G network architecture. Then, the ongoing design of the future beyond 5G (B5G) and 6G network architecture cannot overlook the pivotal inputs of different independent standardization efforts about autonomic networking, service-based communication systems, and multi-access edge computing. This article provides the design and the characteristics of an agent-based, softwarized, and intelligent architecture, which coherently condenses and merges the independent proposed architectural works by different standardization working groups and bodies. This novel work is a helpful means for the design and standardization process of the futureB5G and 6G network architecture. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2211.01924v1-abstract-full').style.display = 'none'; document.getElementById('2211.01924v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 3 November, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">7 pages, 6 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2211.00755">arXiv:2211.00755</a> <span> [<a href="https://arxiv.org/pdf/2211.00755">pdf</a>, <a href="https://arxiv.org/ps/2211.00755">ps</a>, <a href="https://arxiv.org/format/2211.00755">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Neuromorphic Twins for Networked Control and Decision-Making </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Boche%2C+H">Holger Boche</a>, <a href="/search/cs?searchtype=author&query=B%C3%B6ck%2C+Y+N">Yannik N. B枚ck</a>, <a href="/search/cs?searchtype=author&query=Deppe%2C+C">Christian Deppe</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2211.00755v1-abstract-short" style="display: inline;"> We consider the problem of remotely tracking the state of and unstable linear time-invariant plant by means of data transmitted through a noisy communication channel from an algorithmic point of view. Assuming the dynamics of the plant are known, does there exist an algorithm that accepts a description of the channel's characteristics as input, and returns 'Yes' if the transmission capabilities pe… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2211.00755v1-abstract-full').style.display = 'inline'; document.getElementById('2211.00755v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2211.00755v1-abstract-full" style="display: none;"> We consider the problem of remotely tracking the state of and unstable linear time-invariant plant by means of data transmitted through a noisy communication channel from an algorithmic point of view. Assuming the dynamics of the plant are known, does there exist an algorithm that accepts a description of the channel's characteristics as input, and returns 'Yes' if the transmission capabilities permit the remote tracking of the plant's state, 'No' otherwise? Does there exist an algorithm that, in case of a positive answer, computes a suitable encoder/decoder-pair for the channel? Questions of this kind are becoming increasingly important with regards to future communication technologies that aim to solve control engineering tasks in a distributed manner. In particular, they play an essential role in digital twinning, an emerging information processing approach originally considered in the context of Industry 4.0. Yet, the abovementioned questions have been answered in the negative with respect to algorithms that can be implemented on idealized digital hardware, i.e., Turing machines. In this article, we investigate the remote state estimation problem in view of the Blum-Shub-Smale computability framework. In the broadest sense, the latter can be interpreted as a model for idealized analog computation. Especially in the context of neuromorphic computing, analog hardware has experienced a revival in the past view years. Hence, the contribution of this work may serve as a motivation for a theory of neuromorphic twins as a counterpart to digital twins for analog hardware. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2211.00755v1-abstract-full').style.display = 'none'; document.getElementById('2211.00755v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 1 November, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2022. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2210.16690">arXiv:2210.16690</a> <span> [<a href="https://arxiv.org/pdf/2210.16690">pdf</a>, <a href="https://arxiv.org/format/2210.16690">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> On the Need of Neuromorphic Twins to Detect Denial-of-Service Attacks on Communication Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Boche%2C+H">Holger Boche</a>, <a href="/search/cs?searchtype=author&query=Schaefer%2C+R+F">Rafael F. Schaefer</a>, <a href="/search/cs?searchtype=author&query=Poor%2C+H+V">H. Vincent Poor</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2210.16690v1-abstract-short" style="display: inline;"> As we are more and more dependent on the communication technologies, resilience against any attacks on communication networks is important to guarantee the digital sovereignty of our society. New developments of communication networks tackle the problem of resilience by in-network computing approaches for higher protocol layers, while the physical layer remains an open problem. This is particularl… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2210.16690v1-abstract-full').style.display = 'inline'; document.getElementById('2210.16690v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2210.16690v1-abstract-full" style="display: none;"> As we are more and more dependent on the communication technologies, resilience against any attacks on communication networks is important to guarantee the digital sovereignty of our society. New developments of communication networks tackle the problem of resilience by in-network computing approaches for higher protocol layers, while the physical layer remains an open problem. This is particularly true for wireless communication systems which are inherently vulnerable to adversarial attacks due to the open nature of the wireless medium. In denial-of-service (DoS) attacks, an active adversary is able to completely disrupt the communication and it has been shown that Turing machines are incapable of detecting such attacks. As Turing machines provide the fundamental limits of digital information processing and therewith of digital twins, this implies that even the most powerful digital twins that preserve all information of the physical network error-free are not capable of detecting such attacks. This stimulates the question of how powerful the information processing hardware must be to enable the detection of DoS attacks. Therefore, in the paper the need of neuromorphic twins is advocated and by the use of Blum-Shub-Smale machines a first implementation that enables the detection of DoS attacks is shown. This result holds for both cases of with and without constraints on the input and jamming sequences of the adversary. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2210.16690v1-abstract-full').style.display = 'none'; document.getElementById('2210.16690v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 29 October, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">submitted for publication</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2210.14819">arXiv:2210.14819</a> <span> [<a href="https://arxiv.org/pdf/2210.14819">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Network Functional Compression for Control Applications </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Rezwan%2C+S">Sifat Rezwan</a>, <a href="/search/cs?searchtype=author&query=Cabrera%2C+J+A">Juan A. Cabrera</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2210.14819v1-abstract-short" style="display: inline;"> The trend of future communication systems is to aim for the steering and control of cyber physical systems. These systems can quickly become congested in environments like those presented in Industry 4.0. In these scenarios, a plethora of sensor data is transmitted wirelessly to multiple in network controllers that compute the control functions of the cyber physical systems. In this paper, we show… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2210.14819v1-abstract-full').style.display = 'inline'; document.getElementById('2210.14819v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2210.14819v1-abstract-full" style="display: none;"> The trend of future communication systems is to aim for the steering and control of cyber physical systems. These systems can quickly become congested in environments like those presented in Industry 4.0. In these scenarios, a plethora of sensor data is transmitted wirelessly to multiple in network controllers that compute the control functions of the cyber physical systems. In this paper, we show an implementation of network Functional Compression (FC) as a proof of concept to drastically reduce the data traffic in these scenarios. FC is a form of goal-oriented communication scheme in which the objective of the sender receiver pair is to transmit the minimum amount of information to compute a function at the receiver end. In our scenario, the senders transmit an encoded and compressed version of the sensor data to a destination, an in-network controller interested in computing as its target function, a PID controller. We show that it is possible to achieve compression rates of over 50% in some cases by employing FC. We also show that using FC in a distributed cascade fashion can achieve more significant compression rates while reducing computational costs. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2210.14819v1-abstract-full').style.display = 'none'; document.getElementById('2210.14819v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 26 October, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2022. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2210.04313">arXiv:2210.04313</a> <span> [<a href="https://arxiv.org/pdf/2210.04313">pdf</a>, <a href="https://arxiv.org/format/2210.04313">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> On the Need of Analog Signals and Systems for Digital-Twin Representations </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Boche%2C+H">Holger Boche</a>, <a href="/search/cs?searchtype=author&query=M%C3%B6nich%2C+U+J">Ullrich J. M枚nich</a>, <a href="/search/cs?searchtype=author&query=B%C3%B6ck%2C+Y+N">Yannik N. B枚ck</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2210.04313v1-abstract-short" style="display: inline;"> We consider the task of converting different digital descriptions of analog bandlimited signals and systems into each other, with a rigorous application of mathematical computability theory. Albeit very fundamental, the problem appears in the scope of digital twinning, an emerging concept in the field of digital processing of analog information that is regularly mentioned as one of the key enabler… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2210.04313v1-abstract-full').style.display = 'inline'; document.getElementById('2210.04313v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2210.04313v1-abstract-full" style="display: none;"> We consider the task of converting different digital descriptions of analog bandlimited signals and systems into each other, with a rigorous application of mathematical computability theory. Albeit very fundamental, the problem appears in the scope of digital twinning, an emerging concept in the field of digital processing of analog information that is regularly mentioned as one of the key enablers for next-generation cyber-physical systems and their areas of application. In this context, we prove that essential quantities such as the peak-to-average power ratio and the bounded-input/bounded-output norm, which determine the behavior of the real-world analog system, cannot generally be determined from the system's digital twin, depending on which of the above-mentioned descriptions is chosen. As a main result, we characterize the algorithmic strength of Shannon's sampling type representation as digital twin implementation and also introduce a new digital twin implementation of analog signals and systems. We show there exist two digital descriptions, both of which uniquely characterize a certain analog system, such that one description can be algorithmically converted into the other, but not vice versa. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2210.04313v1-abstract-full').style.display = 'none'; document.getElementById('2210.04313v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 9 October, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2022. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2207.00153">arXiv:2207.00153</a> <span> [<a href="https://arxiv.org/pdf/2207.00153">pdf</a>, <a href="https://arxiv.org/format/2207.00153">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> An Analytical Study on Functional Split in Martian 3D Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Bonafini%2C+S">Stefano Bonafini</a>, <a href="/search/cs?searchtype=author&query=Sacchi%2C+C">Claudio Sacchi</a>, <a href="/search/cs?searchtype=author&query=Bassoli%2C+R">Riccardo Bassoli</a>, <a href="/search/cs?searchtype=author&query=Granelli%2C+F">Fabrizio Granelli</a>, <a href="/search/cs?searchtype=author&query=Kondepu%2C+K">Koteswararao Kondepu</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2207.00153v1-abstract-short" style="display: inline;"> As space agencies are planning manned missions to reach Mars, researchers need to pave the way for supporting astronauts during their sojourn. This will also be achieved by providing broadband and low-latency connectivity through wireless network infrastructures. In such a framework, we propose a Martian deployment of a 3-Dimensional (3D) network acting as Cloud Radio Access Network (C-RAN). The s… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2207.00153v1-abstract-full').style.display = 'inline'; document.getElementById('2207.00153v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2207.00153v1-abstract-full" style="display: none;"> As space agencies are planning manned missions to reach Mars, researchers need to pave the way for supporting astronauts during their sojourn. This will also be achieved by providing broadband and low-latency connectivity through wireless network infrastructures. In such a framework, we propose a Martian deployment of a 3-Dimensional (3D) network acting as Cloud Radio Access Network (C-RAN). The scenario consists, mostly, of unmanned aerial vehicles (UAVs) and nanosatellites. Thanks to the thin Martian atmosphere, CubeSats can stably orbit at very-low-altitude. This allows to meet strict delay requirements to split functions of the baseband processing between drones and CubeSats. The detailed analytical study, presented in this paper, confirmed the viability of the proposed 3D architecture, under some constraints and trade-off concerning the involved Space communication infrastructures, that are discussed in detail. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2207.00153v1-abstract-full').style.display = 'none'; document.getElementById('2207.00153v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 June, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Initial version submitted to IEEE Transactions on Aerospace and Electronic Systems</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2204.00581">arXiv:2204.00581</a> <span> [<a href="https://arxiv.org/pdf/2204.00581">pdf</a>, <a href="https://arxiv.org/format/2204.00581">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Reference Network and Localization Architecture for Smart Manufacturing based on 5G </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Ludwig%2C+S">Stephan Ludwig</a>, <a href="/search/cs?searchtype=author&query=Aschenbrenner%2C+D">Doris Aschenbrenner</a>, <a href="/search/cs?searchtype=author&query=Scharle%2C+M">Marvin Scharle</a>, <a href="/search/cs?searchtype=author&query=Klessig%2C+H">Henrik Klessig</a>, <a href="/search/cs?searchtype=author&query=Karrenbauer%2C+M">Michael Karrenbauer</a>, <a href="/search/cs?searchtype=author&query=Wu%2C+H">Huanzhuo Wu</a>, <a href="/search/cs?searchtype=author&query=Taghouti%2C+M">Maroua Taghouti</a>, <a href="/search/cs?searchtype=author&query=Lozano%2C+P">Pedro Lozano</a>, <a href="/search/cs?searchtype=author&query=Schotten%2C+H+D">Hans D. Schotten</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2204.00581v2-abstract-short" style="display: inline;"> 5G promises to shift Industry 4.0 to the next level by allowing flexible production. However, many communication standards are used throughout a production site, which will stay so in the foreseeable future. Furthermore, localization of assets will be equally valuable in order to get to a higher level of automation. This paper proposes a reference architecture for a convergent localization and com… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2204.00581v2-abstract-full').style.display = 'inline'; document.getElementById('2204.00581v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2204.00581v2-abstract-full" style="display: none;"> 5G promises to shift Industry 4.0 to the next level by allowing flexible production. However, many communication standards are used throughout a production site, which will stay so in the foreseeable future. Furthermore, localization of assets will be equally valuable in order to get to a higher level of automation. This paper proposes a reference architecture for a convergent localization and communication network for smart manufacturing that combines 5G with other existing technologies and focuses on high-mix low-volume application, in particular at small and medium-sized enterprises. The architecture is derived from a set of functional requirements, and we describe different views on this architecture to show how the requirements can be fulfilled. It connects private and public mobile networks with local networking technologies to achieve a flexible setup addressing many industrial use cases. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2204.00581v2-abstract-full').style.display = 'none'; document.getElementById('2204.00581v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 4 April, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 1 April, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">10 pages; submitted to 6th International Conference on System-Integrated Intelligence. Intelligent, flexible and connected systems in products and production, 7-9 September Genova, Italy</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2112.03683">arXiv:2112.03683</a> <span> [<a href="https://arxiv.org/pdf/2112.03683">pdf</a>, <a href="https://arxiv.org/ps/2112.03683">ps</a>, <a href="https://arxiv.org/format/2112.03683">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> In-Network Processing for Low-Latency Industrial Anomaly Detection in Softwarized Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Wu%2C+H">Huanzhuo Wu</a>, <a href="/search/cs?searchtype=author&query=He%2C+J">Jia He</a>, <a href="/search/cs?searchtype=author&query=T%C3%B6m%C3%B6sk%C3%B6zi%2C+M">M谩t茅 T枚m枚sk枚zi</a>, <a href="/search/cs?searchtype=author&query=Xiang%2C+Z">Zuo Xiang</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2112.03683v1-abstract-short" style="display: inline;"> Modern manufacturers are currently undertaking the integration of novel digital technologies - such as 5G-based wireless networks, the Internet of Things (IoT), and cloud computing - to elevate their production process to a brand new level, the level of smart factories. In the setting of a modern smart factory, time-critical applications are increasingly important to facilitate efficient and safe… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2112.03683v1-abstract-full').style.display = 'inline'; document.getElementById('2112.03683v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2112.03683v1-abstract-full" style="display: none;"> Modern manufacturers are currently undertaking the integration of novel digital technologies - such as 5G-based wireless networks, the Internet of Things (IoT), and cloud computing - to elevate their production process to a brand new level, the level of smart factories. In the setting of a modern smart factory, time-critical applications are increasingly important to facilitate efficient and safe production. However, these applications suffer from delays in data transmission and processing due to the high density of wireless sensors and the large volumes of data that they generate. As the advent of next-generation networks has made network nodes intelligent and capable of handling multiple network functions, the increased computational power of the nodes makes it possible to offload some of the computational overhead. In this paper, we show for the first time our IA-Net-Lite industrial anomaly detection system with the novel capability of in-network data processing. IA-Net-Lite utilizes intelligent network devices to combine data transmission and processing, as well as to progressively filter redundant data in order to optimize service latency. By testing in a practical network emulator, we showed that the proposed approach can reduce the service latency by up to 40%. Moreover, the benefits of our approach could potentially be exploited in other large-volume and artificial intelligence applications. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2112.03683v1-abstract-full').style.display = 'none'; document.getElementById('2112.03683v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 7 December, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2021. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2110.01381">arXiv:2110.01381</a> <span> [<a href="https://arxiv.org/pdf/2110.01381">pdf</a>, <a href="https://arxiv.org/format/2110.01381">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> In-Network Processing Acoustic Data for Anomaly Detection in Smart Factory </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Wu%2C+H">Huanzhuo Wu</a>, <a href="/search/cs?searchtype=author&query=Shen%2C+Y">Yunbin Shen</a>, <a href="/search/cs?searchtype=author&query=Xiao%2C+X">Xun Xiao</a>, <a href="/search/cs?searchtype=author&query=Hecker%2C+A">Artur Hecker</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2110.01381v1-abstract-short" style="display: inline;"> Modern manufacturing is now deeply integrating new technologies such as 5G, Internet-of-things (IoT), and cloud/edge computing to shape manufacturing to a new level -- Smart Factory. Autonomic anomaly detection (e.g., malfunctioning machines and hazard situations) in a factory hall is on the list and expects to be realized with massive IoT sensor deployments. In this paper, we consider acoustic da… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2110.01381v1-abstract-full').style.display = 'inline'; document.getElementById('2110.01381v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2110.01381v1-abstract-full" style="display: none;"> Modern manufacturing is now deeply integrating new technologies such as 5G, Internet-of-things (IoT), and cloud/edge computing to shape manufacturing to a new level -- Smart Factory. Autonomic anomaly detection (e.g., malfunctioning machines and hazard situations) in a factory hall is on the list and expects to be realized with massive IoT sensor deployments. In this paper, we consider acoustic data-based anomaly detection, which is widely used in factories because sound information reflects richer internal states while videos cannot; besides, the capital investment of an audio system is more economically friendly. However, a unique challenge of using audio data is that sounds are mixed when collecting thus source data separation is inevitable. A traditional way transfers audio data all to a centralized point for separation. Nevertheless, such a centralized manner (i.e., data transferring and then analyzing) may delay prompt reactions to critical anomalies. We demonstrate that this job can be transformed into an in-network processing scheme and thus further accelerated. Specifically, we propose a progressive processing scheme where data separation jobs are distributed as microservices on intermediate nodes in parallel with data forwarding. Therefore, collected audio data can be separated 43.75% faster with even less total computing resources. This solution is comprehensively evaluated with numerical simulations, compared with benchmark solutions, and results justify its advantages. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2110.01381v1-abstract-full').style.display = 'none'; document.getElementById('2110.01381v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 4 October, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2021. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2106.10063">arXiv:2106.10063</a> <span> [<a href="https://arxiv.org/pdf/2106.10063">pdf</a>, <a href="https://arxiv.org/format/2106.10063">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/MNET.001.2100491">10.1109/MNET.001.2100491 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> V-Edge: Virtual Edge Computing as an Enabler for Novel Microservices and Cooperative Computing </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Dressler%2C+F">Falko Dressler</a>, <a href="/search/cs?searchtype=author&query=Chiasserini%2C+C+F">Carla Fabiana Chiasserini</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a>, <a href="/search/cs?searchtype=author&query=Karl%2C+H">Holger Karl</a>, <a href="/search/cs?searchtype=author&query=Cigno%2C+R+L">Renato Lo Cigno</a>, <a href="/search/cs?searchtype=author&query=Capone%2C+A">Antonio Capone</a>, <a href="/search/cs?searchtype=author&query=Casetti%2C+C">Claudio Casetti</a>, <a href="/search/cs?searchtype=author&query=Malandrino%2C+F">Francesco Malandrino</a>, <a href="/search/cs?searchtype=author&query=Mancuso%2C+V">Vincenzo Mancuso</a>, <a href="/search/cs?searchtype=author&query=Klingler%2C+F">Florian Klingler</a>, <a href="/search/cs?searchtype=author&query=Rizzo%2C+G">Gianluca Rizzo</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2106.10063v1-abstract-short" style="display: inline;"> As we move from 5G to 6G, edge computing is one of the concepts that needs revisiting. Its core idea is still intriguing: instead of sending all data and tasks from an end user's device to the cloud, possibly covering thousands of kilometers and introducing delays that are just owed to limited propagation speed, edge servers deployed in close proximity to the user, e.g., at some 5G gNB, serve as p… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2106.10063v1-abstract-full').style.display = 'inline'; document.getElementById('2106.10063v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2106.10063v1-abstract-full" style="display: none;"> As we move from 5G to 6G, edge computing is one of the concepts that needs revisiting. Its core idea is still intriguing: instead of sending all data and tasks from an end user's device to the cloud, possibly covering thousands of kilometers and introducing delays that are just owed to limited propagation speed, edge servers deployed in close proximity to the user, e.g., at some 5G gNB, serve as proxy for the cloud. Yet this promising idea is hampered by the limited availability of such edge servers. In this paper, we discuss a way forward, namely the virtual edge computing (V-Edge) concept. V-Edge bridges the gap between cloud, edge, and fog by virtualizing all available resources including the end users' devices and making these resources widely available using well-defined interfaces. V-Edge also acts as an enabler for novel microservices as well as cooperative computing solutions. We introduce the general V-Edge architecture and we characterize some of the key research challenges to overcome, in order to enable wide-spread and even more powerful edge services. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2106.10063v1-abstract-full').style.display = 'none'; document.getElementById('2106.10063v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 18 June, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2021. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2106.03360">arXiv:2106.03360</a> <span> [<a href="https://arxiv.org/pdf/2106.03360">pdf</a>, <a href="https://arxiv.org/format/2106.03360">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/MCOM.011.2000863">10.1109/MCOM.011.2000863 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> The Computational and Latency Advantage of Quantum Communication Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Ferrara%2C+R">Roberto Ferrara</a>, <a href="/search/cs?searchtype=author&query=Bassoli%2C+R">Riccardo Bassoli</a>, <a href="/search/cs?searchtype=author&query=Deppe%2C+C">Christian Deppe</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a>, <a href="/search/cs?searchtype=author&query=Boche%2C+H">Holger Boche</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2106.03360v1-abstract-short" style="display: inline;"> This article summarises the current status of classical communication networks and identifies some critical open research challenges that can only be solved by leveraging quantum technologies. By now, the main goal of quantum communication networks has been security. However, quantum networks can do more than just exchange secure keys or serve the needs of quantum computers. In fact, the scientifi… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2106.03360v1-abstract-full').style.display = 'inline'; document.getElementById('2106.03360v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2106.03360v1-abstract-full" style="display: none;"> This article summarises the current status of classical communication networks and identifies some critical open research challenges that can only be solved by leveraging quantum technologies. By now, the main goal of quantum communication networks has been security. However, quantum networks can do more than just exchange secure keys or serve the needs of quantum computers. In fact, the scientific community is still investigating on the possible use cases/benefits that quantum communication networks can bring. Thus, this article aims at pointing out and clearly describing how quantum communication networks can enhance in-network distributed computing and reduce the overall end-to-end latency, beyond the intrinsic limits of classical technologies. Furthermore, we also explain how entanglement can reduce the communication complexity (overhead) that future classical virtualised networks will experience. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2106.03360v1-abstract-full').style.display = 'none'; document.getElementById('2106.03360v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 7 June, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">7 pages, 4 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2105.01373">arXiv:2105.01373</a> <span> [<a href="https://arxiv.org/pdf/2105.01373">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/MCOMSTD.001.2000019">10.1109/MCOMSTD.001.2000019 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Secure Virtual Mobile Small Cells: A Stepping Stone Towards 6G </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Rodriguez%2C+J">J. Rodriguez</a>, <a href="/search/cs?searchtype=author&query=Koudouridis%2C+G+P">G. P. Koudouridis</a>, <a href="/search/cs?searchtype=author&query=Gelabert%2C+X">X. Gelabert</a>, <a href="/search/cs?searchtype=author&query=Tayyab%2C+M">M. Tayyab</a>, <a href="/search/cs?searchtype=author&query=Bassoli%2C+R">R. Bassoli</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">F. H. P. Fitzek</a>, <a href="/search/cs?searchtype=author&query=Torre%2C+R">R. Torre</a>, <a href="/search/cs?searchtype=author&query=Abd-Alhameed%2C+R">R. Abd-Alhameed</a>, <a href="/search/cs?searchtype=author&query=Sajedin%2C+M">M. Sajedin</a>, <a href="/search/cs?searchtype=author&query=Elfergani%2C+I">I. Elfergani</a>, <a href="/search/cs?searchtype=author&query=Irum%2C+S">S. Irum</a>, <a href="/search/cs?searchtype=author&query=Schulte%2C+G">G. Schulte</a>, <a href="/search/cs?searchtype=author&query=Diogo%2C+P">P. Diogo</a>, <a href="/search/cs?searchtype=author&query=Marzouk%2C+F">F. Marzouk</a>, <a href="/search/cs?searchtype=author&query=de+Ree%2C+M">M. de Ree</a>, <a href="/search/cs?searchtype=author&query=Mantas%2C+G">G. Mantas</a>, <a href="/search/cs?searchtype=author&query=Politis%2C+I">I. Politis</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2105.01373v1-abstract-short" style="display: inline;"> As 5th Generation research reaches the twilight, the research community must go beyond 5G and look towards the 2030 connectivity landscape, namely 6G. In this context, this work takes a step towards the 6G vision by proposing a next generation communication platform, which aims to extend the rigid coverage area of fixed deployment networks by considering virtual mobile small cells (MSC) that are c… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2105.01373v1-abstract-full').style.display = 'inline'; document.getElementById('2105.01373v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2105.01373v1-abstract-full" style="display: none;"> As 5th Generation research reaches the twilight, the research community must go beyond 5G and look towards the 2030 connectivity landscape, namely 6G. In this context, this work takes a step towards the 6G vision by proposing a next generation communication platform, which aims to extend the rigid coverage area of fixed deployment networks by considering virtual mobile small cells (MSC) that are created on demand. Relying on emerging computing paradigms such as NFV (Network Function Virtualization) and SDN (Software Defined Networking), these cells can harness radio and networking capability locally reducing protocol signaling latency and overhead. These MSCs constitute an intelligent pool of networking resources that can collaborate to form a wireless network of MSCs providing a communication platform for localized, ubiquitous and reliable connectivity. The technology enablers for implementing the MSC concept are also addressed in terms of virtualization, lightweight wireless security, and energy efficient RF. The benefits of the MSC architecture towards reliable and efficient cell offloading are demonstrated as a use-case. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2105.01373v1-abstract-full').style.display = 'none'; document.getElementById('2105.01373v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 4 May, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">9 pages, 5 figures. IEEE Communications Standards Magazine, 2021</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2003.02079">arXiv:2003.02079</a> <span> [<a href="https://arxiv.org/pdf/2003.02079">pdf</a>, <a href="https://arxiv.org/format/2003.02079">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Why We Should NOT Talk about 6G </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a>, <a href="/search/cs?searchtype=author&query=Seeling%2C+P">Patrick Seeling</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2003.02079v1-abstract-short" style="display: inline;"> While 5G mobile communication systems are currently in deployment, researchers around the world have already started to discuss 6G technology and funding agencies started their first programs with a 6G label. Although it may seem like a good idea from a historical point of view with returning generations every decade, this contribution will show that there is a great risk of introducing 6G labels… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2003.02079v1-abstract-full').style.display = 'inline'; document.getElementById('2003.02079v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2003.02079v1-abstract-full" style="display: none;"> While 5G mobile communication systems are currently in deployment, researchers around the world have already started to discuss 6G technology and funding agencies started their first programs with a 6G label. Although it may seem like a good idea from a historical point of view with returning generations every decade, this contribution will show that there is a great risk of introducing 6G labels at this time. While the reasons to not talk about 6G yet are manifold, some of the more dominant ones are i.) there exists a lack of real technology advancements introduced by a potential 6G system; ii.) the flexibility of the 5G communication system introduced by softwarization concepts, such as in the Internet community, allows for daily updates; and iii.) introducing widespread 6G discussions can have a negative impact on the deployment and evolution of 5G with completely new business cases and customer ecosystems compared to its predecessors. Finally, as we do not believe that 5G is the end of our journey, we will provide an outlook on the future of mobile communication systems, independent of the current mainstream discussion. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2003.02079v1-abstract-full').style.display = 'none'; document.getElementById('2003.02079v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 4 March, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2020. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1902.10645">arXiv:1902.10645</a> <span> [<a href="https://arxiv.org/pdf/1902.10645">pdf</a>, <a href="https://arxiv.org/format/1902.10645">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/WD.2019.8734223">10.1109/WD.2019.8734223 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> S-PRAC: Fast Partial Packet Recovery with Network Coding in Very Noisy Wireless Channels </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Irianto%2C+K+D">Kurniawan D. Irianto</a>, <a href="/search/cs?searchtype=author&query=Cabrera%2C+J+A">Juan A. Cabrera</a>, <a href="/search/cs?searchtype=author&query=Nguyen%2C+G+T">Giang T. Nguyen</a>, <a href="/search/cs?searchtype=author&query=Salah%2C+H">Hani Salah</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1902.10645v1-abstract-short" style="display: inline;"> Well-known error detection and correction solutions in wireless communications are slow or incur high transmission overhead. Recently, notable solutions like PRAC and DAPRAC, implementing partial packet recovery with network coding, could address these problems. However, they perform slowly when there are many errors. We propose S-PRAC, a fast scheme for partial packet recovery, particularly desig… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1902.10645v1-abstract-full').style.display = 'inline'; document.getElementById('1902.10645v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1902.10645v1-abstract-full" style="display: none;"> Well-known error detection and correction solutions in wireless communications are slow or incur high transmission overhead. Recently, notable solutions like PRAC and DAPRAC, implementing partial packet recovery with network coding, could address these problems. However, they perform slowly when there are many errors. We propose S-PRAC, a fast scheme for partial packet recovery, particularly designed for very noisy wireless channels. S-PRAC improves on DAPRAC. It divides each packet into segments consisting of a fixed number of small RLNC encoded symbols and then attaches a CRC code to each segment and one to each coded packet. Extensive simulations show that S-PRAC can detect and correct errors quickly. It also outperforms DAPRAC significantly when the number of errors is high. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1902.10645v1-abstract-full').style.display = 'none'; document.getElementById('1902.10645v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 27 February, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2019. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1805.09251">arXiv:1805.09251</a> <span> [<a href="https://arxiv.org/pdf/1805.09251">pdf</a>, <a href="https://arxiv.org/format/1805.09251">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> APMEC: An Automated Provisioning Framework for Multi-access Edge Computing </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Doan%2C+T+V">Tung V. Doan</a>, <a href="/search/cs?searchtype=author&query=Nguyen%2C+G+T">Giang T. Nguyen</a>, <a href="/search/cs?searchtype=author&query=Kropp%2C+A">Alexander Kropp</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1805.09251v2-abstract-short" style="display: inline;"> Novel use cases and verticals such as connected cars and human-robot cooperation in the areas of 5G and Tactile Internet can significantly benefit from the flexibility and reduced latency provided by Network Function Virtualization (NFV) and Multi-Access Edge Computing (MEC). Existing frameworks managing and orchestrating MEC and NFV are either tightly coupled or completely separated. The former d… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1805.09251v2-abstract-full').style.display = 'inline'; document.getElementById('1805.09251v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1805.09251v2-abstract-full" style="display: none;"> Novel use cases and verticals such as connected cars and human-robot cooperation in the areas of 5G and Tactile Internet can significantly benefit from the flexibility and reduced latency provided by Network Function Virtualization (NFV) and Multi-Access Edge Computing (MEC). Existing frameworks managing and orchestrating MEC and NFV are either tightly coupled or completely separated. The former design is inflexible and increases the complexity of one framework. Whereas, the latter leads to inefficient use of computation resources because information are not shared. We introduce APMEC, a dedicated framework for MEC while enabling the collaboration with the management and orchestration (MANO) frameworks for NFV. The new design allows to reuse allocated network services, thus maximizing resource utilization. Measurement results have shown that APMEC can allocate up to 60% more number of network services. Being developed on top of OpenStack, APMEC is an open source project, available for collaboration and facilitating further research activities. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1805.09251v2-abstract-full').style.display = 'none'; document.getElementById('1805.09251v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 9 May, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 9 May, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2018. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1802.00521">arXiv:1802.00521</a> <span> [<a href="https://arxiv.org/pdf/1802.00521">pdf</a>, <a href="https://arxiv.org/format/1802.00521">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Multipath Communication with Finite Sliding Window Network Coding for Ultra-Reliability and Low Latency </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Gabriel%2C+F">Frank Gabriel</a>, <a href="/search/cs?searchtype=author&query=Chorppath%2C+A+K">Anil Kumar Chorppath</a>, <a href="/search/cs?searchtype=author&query=Tsokalo%2C+I">Ievgenii Tsokalo</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1802.00521v1-abstract-short" style="display: inline;"> 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 i… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1802.00521v1-abstract-full').style.display = 'inline'; document.getElementById('1802.00521v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1802.00521v1-abstract-full" style="display: none;"> 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. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1802.00521v1-abstract-full').style.display = 'none'; document.getElementById('1802.00521v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 1 February, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2018. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1711.03385">arXiv:1711.03385</a> <span> [<a href="https://arxiv.org/pdf/1711.03385">pdf</a>, <a href="https://arxiv.org/format/1711.03385">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Match Made in Heaven: Practical Compressed Sensing and Network Coding for Intelligent Distributed Communication Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Taghouti%2C+M">Maroua Taghouti</a>, <a href="/search/cs?searchtype=author&query=Chorppath%2C+A+K">Anil Kumar Chorppath</a>, <a href="/search/cs?searchtype=author&query=Waurick%2C+T">Tobias Waurick</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1711.03385v1-abstract-short" style="display: inline;"> Based on the impressive features that network coding and compressed sensing paradigms have separately brought, the idea of bringing them together in practice will result in major improvements and influence in the upcoming 5G networks. In this context, this paper aims to evaluate the effectiveness of these key techniques in a cluster-based wireless sensor network, in the presence of temporal and sp… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1711.03385v1-abstract-full').style.display = 'inline'; document.getElementById('1711.03385v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1711.03385v1-abstract-full" style="display: none;"> Based on the impressive features that network coding and compressed sensing paradigms have separately brought, the idea of bringing them together in practice will result in major improvements and influence in the upcoming 5G networks. In this context, this paper aims to evaluate the effectiveness of these key techniques in a cluster-based wireless sensor network, in the presence of temporal and spatial correlations. Our goal is to achieve better compression gains by scaling down the total payload carried by applying temporal compression as well as reducing the total number of transmissions in the network using real field network coding. In order to further reduce the number of transmissions, the cluster-heads perform a low complexity spatial pre-coding consisting of sending the packets with a certain probability. Furthermore, we compare our approach with benchmark schemes. As expected, our numerical results run on NS3 simulator show that on overall our scheme dramatically drops the number of transmitted packets in the considered cluster topology with a very high reconstruction SNR. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1711.03385v1-abstract-full').style.display = 'none'; document.getElementById('1711.03385v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 9 November, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2017. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Submitted to VTC Spring 2018</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1601.03201">arXiv:1601.03201</a> <span> [<a href="https://arxiv.org/pdf/1601.03201">pdf</a>, <a href="https://arxiv.org/format/1601.03201">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Performance">cs.PF</span> </div> </div> <p class="title is-5 mathjax"> Network Coding as a Service </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Szab%C3%B3%2C+D">D谩vid Szab贸</a>, <a href="/search/cs?searchtype=author&query=Csoma%2C+A">Attila Csoma</a>, <a href="/search/cs?searchtype=author&query=Megyesi%2C+P">P茅ter Megyesi</a>, <a href="/search/cs?searchtype=author&query=Guly%C3%A1s%2C+A">Andr谩s Guly谩s</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1601.03201v1-abstract-short" style="display: inline;"> Network Coding (NC) shows great potential in various communication scenarios through changing the packet forwarding principles of current networks. It can improve not only throughput, latency, reliability and security but also alleviates the need of coordination in many cases. However, it is still controversial due to widespread misunderstandings on how to exploit the advantages of it. The aim of… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1601.03201v1-abstract-full').style.display = 'inline'; document.getElementById('1601.03201v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1601.03201v1-abstract-full" style="display: none;"> Network Coding (NC) shows great potential in various communication scenarios through changing the packet forwarding principles of current networks. It can improve not only throughput, latency, reliability and security but also alleviates the need of coordination in many cases. However, it is still controversial due to widespread misunderstandings on how to exploit the advantages of it. The aim of the paper is to facilitate the usage of NC by $(i)$ explaining how it can improve the performance of the network (regardless the existence of any butterfly in the network), $(ii)$ showing how Software Defined Networking (SDN) can resolve the crucial problems of deployment and orchestration of NC elements, and $(iii)$ providing a prototype architecture with measurement results on the performance of our network coding capable software router implementation compared by fountain codes. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1601.03201v1-abstract-full').style.display = 'none'; document.getElementById('1601.03201v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 January, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2016. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1509.04492">arXiv:1509.04492</a> <span> [<a href="https://arxiv.org/pdf/1509.04492">pdf</a>, <a href="https://arxiv.org/ps/1509.04492">ps</a>, <a href="https://arxiv.org/format/1509.04492">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Perpetual Codes for Network Coding </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Heide%2C+J">Janus Heide</a>, <a href="/search/cs?searchtype=author&query=Pedersen%2C+M+V">Morten V. Pedersen</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a>, <a href="/search/cs?searchtype=author&query=edard%2C+M+M">Muriel M edard</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1509.04492v1-abstract-short" style="display: inline;"> Random Linear Network Coding (RLNC) provides a theoretically efficient method for coding. Some of its practical drawbacks are the complexity of decoding and the overhead due to the coding vectors. For computationally weak and battery-driven platforms, these challenges are particular important. In this work, we consider the coding variant Perpetual codes which are sparse, non-uniform and the coding… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1509.04492v1-abstract-full').style.display = 'inline'; document.getElementById('1509.04492v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1509.04492v1-abstract-full" style="display: none;"> Random Linear Network Coding (RLNC) provides a theoretically efficient method for coding. Some of its practical drawbacks are the complexity of decoding and the overhead due to the coding vectors. For computationally weak and battery-driven platforms, these challenges are particular important. In this work, we consider the coding variant Perpetual codes which are sparse, non-uniform and the coding vectors have a compact representation. The sparsity allows for fast encoding and decoding, and the non-uniform protection of symbols enables recoding where the produced symbols are indistinguishable from those encoded at the source. The presented results show that the approach can provide a coding overhead arbitrarily close to that of RLNC, but at reduced computational load. The achieved gain over RLNC grows with the generation size, and both encoding and decoding throughput is approximately one order of magnitude higher compared to RLNC at a generation size of 2048. Additionally, the approach allows for easy adjustment between coding throughput and code overhead, which makes it suitable for a broad range of platforms and applications. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1509.04492v1-abstract-full').style.display = 'none'; document.getElementById('1509.04492v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 15 September, 2015; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2015. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">13 pages, 9 figures, original draft from 2012 included in this phd thesis: http://vbn.aau.dk/files/123241894/Thesis_Low_computational_complexity_network_coding_for_mobile_networks_.pdf</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1404.6620">arXiv:1404.6620</a> <span> [<a href="https://arxiv.org/pdf/1404.6620">pdf</a>, <a href="https://arxiv.org/format/1404.6620">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Fulcrum Network Codes: A Code for Fluid Allocation of Complexity </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Lucani%2C+D+E">Daniel E. Lucani</a>, <a href="/search/cs?searchtype=author&query=Pedersen%2C+M+V">Morten V. Pedersen</a>, <a href="/search/cs?searchtype=author&query=Ruano%2C+D">Diego Ruano</a>, <a href="/search/cs?searchtype=author&query=S%C3%B8rensen%2C+C+W">Chres W. S酶rensen</a>, <a href="/search/cs?searchtype=author&query=Fitzek%2C+F+H+P">Frank H. P. Fitzek</a>, <a href="/search/cs?searchtype=author&query=Heide%2C+J">Janus Heide</a>, <a href="/search/cs?searchtype=author&query=Geil%2C+O">Olav Geil</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1404.6620v2-abstract-short" style="display: inline;"> This paper proposes Fulcrum network codes, a network coding framework that achieves three seemingly conflicting objectives: (i) to reduce the coding coefficient overhead to almost n bits per packet in a generation of n packets; (ii) to operate the network using only GF(2) operations at intermediate nodes if necessary, dramatically reducing complexity in the network; (iii) to deliver an end-to-end… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1404.6620v2-abstract-full').style.display = 'inline'; document.getElementById('1404.6620v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1404.6620v2-abstract-full" style="display: none;"> This paper proposes Fulcrum network codes, a network coding framework that achieves three seemingly conflicting objectives: (i) to reduce the coding coefficient overhead to almost n bits per packet in a generation of n packets; (ii) to operate the network using only GF(2) operations at intermediate nodes if necessary, dramatically reducing complexity in the network; (iii) to deliver an end-to-end performance that is close to that of a high-field network coding system for high-end receivers while simultaneously catering to low-end receivers that decode in GF(2). As a consequence of (ii) and (iii), Fulcrum codes have a unique trait missing so far in the network coding literature: they provide the network with the flexibility to spread computational complexity over different devices depending on their current load, network conditions, or even energy targets in a decentralized way. At the core of our framework lies the idea of precoding at the sources using an expansion field GF(2h) to increase the number of dimensions seen by the network using a linear mapping. Fulcrum codes can use any high-field linear code for precoding, e.g., Reed-Solomon, with the structure of the precode determining some of the key features of the resulting code. For example, a systematic structure provides the ability to manage heterogeneous receivers while using the same data stream. Our analysis shows that the number of additional dimensions created during precoding controls the trade-off between delay, overhead, and complexity. Our implementation and measurements show that Fulcrum achieves similar decoding probability as high field Random Linear Network Coding (RLNC) approaches but with encoders/decoders that are an order of magnitude faster. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1404.6620v2-abstract-full').style.display = 'none'; document.getElementById('1404.6620v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 18 November, 2015; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 26 April, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2014. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">30 pages, 12 figures, Submitted to the IEEE Transactions on Communications</span> </p> </li> </ol> <div class="is-hidden-tablet">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> </main> <footer> <div class="columns is-desktop" role="navigation" aria-label="Secondary">  <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/about">About</a></li> <li><a href="https://info.arxiv.org/help">Help</a></li> </ul> </div> <div class="column"> <ul class="nav-spaced"> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>contact arXiv</title><desc>Click here to contact arXiv</desc><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg> <a href="https://info.arxiv.org/help/contact.html"> Contact</a> </li> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>subscribe to arXiv mailings</title><desc>Click here to subscribe</desc><path d="M476 3.2L12.5 270.6c-18.1 10.4-15.8 35.6 2.2 43.2L121 358.4l287.3-253.2c5.5-4.9 13.3 2.6 8.6 8.3L176 407v80.5c0 23.6 28.5 32.9 42.5 15.8L282 426l124.6 52.2c14.2 6 30.4-2.9 33-18.2l72-432C515 7.8 493.3-6.8 476 3.2z"/></svg> <a href="https://info.arxiv.org/help/subscribe"> Subscribe</a> </li> </ul> </div> </div> </div>   <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/license/index.html">Copyright</a></li> <li><a href="https://info.arxiv.org/help/policies/privacy_policy.html">Privacy Policy</a></li> </ul> </div> <div class="column sorry-app-links"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/web_accessibility.html">Web Accessibility Assistance</a></li> <li> <p class="help"> <a class="a11y-main-link" href="https://status.arxiv.org" target="_blank">arXiv Operational Status <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 256 512" class="icon filter-dark_grey" role="presentation"><path d="M224.3 273l-136 136c-9.4 9.4-24.6 9.4-33.9 0l-22.6-22.6c-9.4-9.4-9.4-24.6 0-33.9l96.4-96.4-96.4-96.4c-9.4-9.4-9.4-24.6 0-33.9L54.3 103c9.4-9.4 24.6-9.4 33.9 0l136 136c9.5 9.4 9.5 24.6.1 34z"/></svg></a><br> Get status notifications via <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/email/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg>email</a> or <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/slack/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-black" role="presentation"><path d="M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.84c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.98c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.96 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.98 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.88c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.84c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"/></svg>slack</a> </p> </li> </ul> </div> </div> </div>  </div> </footer> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/member_acknowledgement.js"></script> </body> </html>

CINXE.COM

Search | arXiv e-print repository