Pub Date : 2024-08-01DOI: 10.23919/JCN.2024.000029
Ming Hui;Xuewan Zhang;Jingjing Guo
To fulfill the connectivity demands in massive machine-type communications (mMTC), this paper investigates a generalized multi-user sparse superposition transmission (GMUSST) technology based on position index modulation. Due to the high computation complexity of maximum likelihood (ML) multi-user detection, a low complexity multi-path successive interference cancellation (MSIC) multi-user detector is introduced to achieve near-ML detector's block error ratio (BLER) performance. Furthermore, considering that each user is only concerned with their own transmitted signal in the downlink GMUSST system, we propose a minimum mean square error-based SIC (MMSE-SIC) detector, which can directly extract the user's transmission signal from the received superimposed signal of multiple users and is verified compared with MSIC detector. Simulation results show that the GMUSST can achieve better transmission reliability than the existing polar coded sparse code multiple access (PC-SCMA) in the short packet communication scenarios. Especially with the hybrid automatic repeat request mechanism, GMUSST requires fewer retransmissions to achieve the same BLER performance compared to PC-SCMA.
{"title":"Generalized multi-user sparse superposition transmission for massive machine-type communications","authors":"Ming Hui;Xuewan Zhang;Jingjing Guo","doi":"10.23919/JCN.2024.000029","DOIUrl":"https://doi.org/10.23919/JCN.2024.000029","url":null,"abstract":"To fulfill the connectivity demands in massive machine-type communications (mMTC), this paper investigates a generalized multi-user sparse superposition transmission (GMUSST) technology based on position index modulation. Due to the high computation complexity of maximum likelihood (ML) multi-user detection, a low complexity multi-path successive interference cancellation (MSIC) multi-user detector is introduced to achieve near-ML detector's block error ratio (BLER) performance. Furthermore, considering that each user is only concerned with their own transmitted signal in the downlink GMUSST system, we propose a minimum mean square error-based SIC (MMSE-SIC) detector, which can directly extract the user's transmission signal from the received superimposed signal of multiple users and is verified compared with MSIC detector. Simulation results show that the GMUSST can achieve better transmission reliability than the existing polar coded sparse code multiple access (PC-SCMA) in the short packet communication scenarios. Especially with the hybrid automatic repeat request mechanism, GMUSST requires fewer retransmissions to achieve the same BLER performance compared to PC-SCMA.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 4","pages":"433-444"},"PeriodicalIF":2.9,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666071","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-01DOI: 10.23919/JCN.2024.000043
{"title":"Information for authors","authors":"","doi":"10.23919/JCN.2024.000043","DOIUrl":"https://doi.org/10.23919/JCN.2024.000043","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 4","pages":"462-466"},"PeriodicalIF":2.9,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666066","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-01DOI: 10.23919/JCN.2024.000038
Hao Feng;Meng Ma;Yuping Zhao
Full-duplex technology can improve bandwidth and energy efficiency but has serious self-interference. In this paper, we introduce a novel full-duplex communication scheme that leverages the Doppler effect. By rotating the circular antenna array, the Doppler frequency shift is introduced into the received uplink (UL) signal, and the UL signal can be separated from the downlink (DL) signal in the frequency domain, thus eliminating self-interference. In order to maximize the interference-free bandwidth, an antenna switching criterion to maximum frequency offset interval is proposed for antenna switching control. Moreover, an antenna switching module based on the above criterion and a Doppler frequency shift compensation module are designed. Simulation results show that the proposed scheme can effectively avoid interference between UL and DL signals and achieves a substantial capacity improvement compared to conventional systems.
全双工技术可以提高带宽和能效，但存在严重的自干扰问题。本文介绍了一种利用多普勒效应的新型全双工通信方案。通过旋转圆形天线阵列，在接收到的上行链路（UL）信号中引入多普勒频移，UL 信号与下行链路（DL）信号就能在频域上分离，从而消除自干扰。为了最大限度地提高抗干扰带宽，提出了天线切换控制的最大频率偏移间隔准则。此外，还设计了基于上述准则的天线切换模块和多普勒频移补偿模块。仿真结果表明，与传统系统相比，所提出的方案能有效避免 UL 和 DL 信号之间的干扰，并大幅提高了容量。
{"title":"A full-duplex technology based on the Doppler effect","authors":"Hao Feng;Meng Ma;Yuping Zhao","doi":"10.23919/JCN.2024.000038","DOIUrl":"https://doi.org/10.23919/JCN.2024.000038","url":null,"abstract":"Full-duplex technology can improve bandwidth and energy efficiency but has serious self-interference. In this paper, we introduce a novel full-duplex communication scheme that leverages the Doppler effect. By rotating the circular antenna array, the Doppler frequency shift is introduced into the received uplink (UL) signal, and the UL signal can be separated from the downlink (DL) signal in the frequency domain, thus eliminating self-interference. In order to maximize the interference-free bandwidth, an antenna switching criterion to maximum frequency offset interval is proposed for antenna switching control. Moreover, an antenna switching module based on the above criterion and a Doppler frequency shift compensation module are designed. Simulation results show that the proposed scheme can effectively avoid interference between UL and DL signals and achieves a substantial capacity improvement compared to conventional systems.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 4","pages":"424-432"},"PeriodicalIF":2.9,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666062","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137603","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-01DOI: 10.23919/JCN.2024.000030
Hsiao-Wen Yu;Cheng-En Lee;Ruhui Zhang;Cheng-Shang Chang;Duan-Shin Lee
Most existing work on analyzing the performance of a random ensemble of low-density parity-check (LDPC) codes assumes that the degree distributions of the two ends of a randomly selected edge are independent. In this paper, we go one step further by considering ensembles of LDPC codes with degree-degree correlations. We propose two methods to construct such an ensemble of degree-degree correlated LDPC codes and derive a system of density evolution equations for these codes over a binary erasure channel (BEC). By conducting extensive numerical experiments, we demonstrate how the degree-degree correlation affects the performance of LDPC codes. Our numerical results suggest that LDPC codes with negative degree-degree correlation could enhance the maximum tolerable erasure probability. Moreover, increasing the negative degree-degree correlation could facilitate better unequal error protection (UEP) design. In the final part of our extension efforts, we extend degree-degree correlated LDPC codes to multi-edge type LDPC codes and leverage these to construct convolutional LDPC codes.
{"title":"Degree-degree correlated low-density parity-check codes and their extensions","authors":"Hsiao-Wen Yu;Cheng-En Lee;Ruhui Zhang;Cheng-Shang Chang;Duan-Shin Lee","doi":"10.23919/JCN.2024.000030","DOIUrl":"https://doi.org/10.23919/JCN.2024.000030","url":null,"abstract":"Most existing work on analyzing the performance of a random ensemble of low-density parity-check (LDPC) codes assumes that the degree distributions of the two ends of a randomly selected edge are independent. In this paper, we go one step further by considering ensembles of LDPC codes with degree-degree correlations. We propose two methods to construct such an ensemble of degree-degree correlated LDPC codes and derive a system of density evolution equations for these codes over a binary erasure channel (BEC). By conducting extensive numerical experiments, we demonstrate how the degree-degree correlation affects the performance of LDPC codes. Our numerical results suggest that LDPC codes with negative degree-degree correlation could enhance the maximum tolerable erasure probability. Moreover, increasing the negative degree-degree correlation could facilitate better unequal error protection (UEP) design. In the final part of our extension efforts, we extend degree-degree correlated LDPC codes to multi-edge type LDPC codes and leverage these to construct convolutional LDPC codes.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 4","pages":"1-15"},"PeriodicalIF":2.9,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666064","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-01DOI: 10.23919/JCN.2024.000031
Karl-Ludwig Besser;Eduard A. Jorswieck;Justin P. Coon
We consider a two-ray ground reflection scenario with unknown distance between transmitter and receiver. By utilizing two frequencies in parallel, we can mitigate possible destructive interference and ensure ultra-reliability with only very limited knowledge at the transmitter. In order to achieve this ultra-reliability, we optimize the frequency spacing such that the worst-case receive power is maximized. Additionally, we provide an algorithm to calculate the optimal frequency spacing. Besides the receive power, we also analyze the achievable rate and outage probability. It is shown that the frequency diversity scheme achieves a significant improvement in terms of reliability over using a single frequency. In particular, we demonstrate the effectiveness of the proposed approach by a numerical simulation of an unmanned aerial vehicle (UAV) flying above flat terrain.
{"title":"An efficient frequency diversity scheme for ultra-reliable communications in two-path fading channels","authors":"Karl-Ludwig Besser;Eduard A. Jorswieck;Justin P. Coon","doi":"10.23919/JCN.2024.000031","DOIUrl":"https://doi.org/10.23919/JCN.2024.000031","url":null,"abstract":"We consider a two-ray ground reflection scenario with unknown distance between transmitter and receiver. By utilizing two frequencies in parallel, we can mitigate possible destructive interference and ensure ultra-reliability with only very limited knowledge at the transmitter. In order to achieve this ultra-reliability, we optimize the frequency spacing such that the worst-case receive power is maximized. Additionally, we provide an algorithm to calculate the optimal frequency spacing. Besides the receive power, we also analyze the achievable rate and outage probability. It is shown that the frequency diversity scheme achieves a significant improvement in terms of reliability over using a single frequency. In particular, we demonstrate the effectiveness of the proposed approach by a numerical simulation of an unmanned aerial vehicle (UAV) flying above flat terrain.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 4","pages":"409-423"},"PeriodicalIF":2.9,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666065","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137472","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-01DOI: 10.23919/JCN.2024.000044
{"title":"Open access publishing agreement","authors":"","doi":"10.23919/JCN.2024.000044","DOIUrl":"https://doi.org/10.23919/JCN.2024.000044","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 4","pages":"467-469"},"PeriodicalIF":2.9,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666069","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sixth generation (6G) networks must adopt spectral-efficient communication techniques to ensure massive connectivity for coexisting humans and machines. However, the impact of various practical issues must be analyzed and addressed, including imperfect channel state information (CSI), stemming by the channel estimation error (CEE) and feedback delay (F-D) with time-variant channels. This paper focuses on these issues in the context of uplink networks, relying on power-domain nonorthogonal multiple access (NOMA). Moreover, the degrading effect of imperfect successive interference cancellation (SIC), when randomly deployed multiple mobile terminals communicate with a single base station (BS) is considered. The system performance is measured by means of outage probability, error probability, ergodic rate, throughput, energy efficiency, and spectral efficiency. Analytical, asymptotic, and computer simulation results demonstrate that CEE causes system coding gain losses for low signal-to-noise ratio (SNR) while the disruptive effects of CEE become negligible in the high SNR. Results also show that F-D does not degrade the system performance in the low SNR but it causes system coding gain losses for high SNR. Also, imperfect SIC does not have any detrimental effect on the system performance for low SNR but results in reduced coding gain for high SNR.
第六代（6G）网络必须采用具有频谱效率的通信技术，以确保人机共存的大规模连接。然而，必须分析和解决各种实际问题的影响，包括不完善的信道状态信息（CSI）、信道估计误差（CEE）和时变信道反馈延迟（F-D）。本文以上行链路网络为背景，依靠功率域非正交多址接入（NOMA），重点讨论了这些问题。此外，本文还考虑了当随机部署的多个移动终端与单个基站（BS）通信时，不完善的连续干扰消除（SIC）所带来的衰减效应。系统性能通过中断概率、错误概率、遍历率、吞吐量、能效和频谱效率来衡量。分析、渐近和计算机仿真结果表明，CEE 在低信噪比 (SNR) 时会造成系统编码增益损失，而在高信噪比时，CEE 的破坏性影响可以忽略不计。结果还显示，F-D 在低信噪比时不会降低系统性能，但在高信噪比时会造成系统编码增益损失。此外，不完善的 SIC 在低信噪比时不会对系统性能产生任何不利影响，但在高信噪比时会导致编码增益降低。
{"title":"On the performance of uplink power-domain NOMA with imperfect CSI and SIC in 6G networks","authors":"Volkan Özduran;Mohammadali Mohammadi;Nikolaos Nomikos;Imran Shafique Ansari;Panagiotis Trakadas","doi":"10.23919/JCN.2024.000039","DOIUrl":"https://doi.org/10.23919/JCN.2024.000039","url":null,"abstract":"Sixth generation (6G) networks must adopt spectral-efficient communication techniques to ensure massive connectivity for coexisting humans and machines. However, the impact of various practical issues must be analyzed and addressed, including imperfect channel state information (CSI), stemming by the channel estimation error (CEE) and feedback delay (F-D) with time-variant channels. This paper focuses on these issues in the context of uplink networks, relying on power-domain nonorthogonal multiple access (NOMA). Moreover, the degrading effect of imperfect successive interference cancellation (SIC), when randomly deployed multiple mobile terminals communicate with a single base station (BS) is considered. The system performance is measured by means of outage probability, error probability, ergodic rate, throughput, energy efficiency, and spectral efficiency. Analytical, asymptotic, and computer simulation results demonstrate that CEE causes system coding gain losses for low signal-to-noise ratio (SNR) while the disruptive effects of CEE become negligible in the high SNR. Results also show that F-D does not degrade the system performance in the low SNR but it causes system coding gain losses for high SNR. Also, imperfect SIC does not have any detrimental effect on the system performance for low SNR but results in reduced coding gain for high SNR.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 4","pages":"445-460"},"PeriodicalIF":2.9,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666068","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-06DOI: 10.23919/JCN.2021.000039
Saad Kriouile;Mohamad Assaad;Maialen Larranaga
In this paper, we investigate a delay-aware channel allocation problem where the number of channels is less than that of users. Due to the proliferation of delay sensitive applications, the objective of our problem is chosen to be the minimization of the total average queuing delay of the network in question. First, we show that our problem falls in the framework of restless bandit problems (RBP), for which obtaining the optimal solution is known to be out of reach. To circumvent this difficulty, we tackle the problem by adopting a Whittle index approach. To that extent, we employ a Lagrangian relaxation for the original problem and prove it to be decomposable into multiple one-dimensional independent subproblems. Afterwards, we provide structural results on the optimal policy of each of the subproblems. More specifically, we prove that a threshold policy is able to achieve the optimal operating point of the considered subproblem. Armed with that, we show the indexability of the subproblems and characterize the Whittle's indices which are the basis of our proposed heuristic. We then provide a rigorous mathematical proof that our policy is optimal in the infinitely many users regime. Finally, we provide numerical results that showcase the remarkable good performance of our proposed policy and that corroborate the theoretical findings.
{"title":"Asymptotically optimal delay-aware scheduling in queueing systems","authors":"Saad Kriouile;Mohamad Assaad;Maialen Larranaga","doi":"10.23919/JCN.2021.000039","DOIUrl":"https://doi.org/10.23919/JCN.2021.000039","url":null,"abstract":"In this paper, we investigate a delay-aware channel allocation problem where the number of channels is less than that of users. Due to the proliferation of delay sensitive applications, the objective of our problem is chosen to be the minimization of the total average queuing delay of the network in question. First, we show that our problem falls in the framework of restless bandit problems (RBP), for which obtaining the optimal solution is known to be out of reach. To circumvent this difficulty, we tackle the problem by adopting a Whittle index approach. To that extent, we employ a Lagrangian relaxation for the original problem and prove it to be decomposable into multiple one-dimensional independent subproblems. Afterwards, we provide structural results on the optimal policy of each of the subproblems. More specifically, we prove that a threshold policy is able to achieve the optimal operating point of the considered subproblem. Armed with that, we show the indexability of the subproblems and characterize the Whittle's indices which are the basis of our proposed heuristic. We then provide a rigorous mathematical proof that our policy is optimal in the infinitely many users regime. Finally, we provide numerical results that showcase the remarkable good performance of our proposed policy and that corroborate the theoretical findings.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 3","pages":"321-343"},"PeriodicalIF":2.9,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10551315","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-01DOI: 10.23919/JCN.2024.000034
{"title":"Open access publishing agreement","authors":"","doi":"10.23919/JCN.2024.000034","DOIUrl":"https://doi.org/10.23919/JCN.2024.000034","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 3","pages":"389-391"},"PeriodicalIF":2.9,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10579725","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-01DOI: 10.23919/JCN.2024.000026
Ahmet Soran;Murat Yuksel;Mehmet Hadi Gunes
Recent trends led to higher data volumes to be transferred and processed over the network. Legacy routing protocols, e.g., OSPF for intra-domain routing, send data from a source to destination on one of the shortest paths. We propose a novel approach to parallelize data transfers by leveraging the multi-core CPUs in the routers. We describe an end-to- end method to optimize data flows on multiple paths. Multicore parallel routing (MCPR) generates new virtual topology substrates from the underlying router topology and performs the shortest path routing on each substrate. Even though calculating the shortest paths could be done with well-known techniques such as OSPF's Dijkstra implementation, finding optimal substrates and setting their link weights to maximize the network throughput over multiple end-to-end paths is still an NP-hard problem. In MCPR, we focus on designing heuristics for substrate generation from a given router topology. Each substrate is a subgraph of the router topology and each link on each substrate is to be assigned a weight to steer the shortest-path routing for maximal network throughput. Heuristics' interim goal is to generate substrates in such a way that the shortest path between a source-destination pair on each substrate minimally overlaps with the shortest paths calculated by the other substrates. Once these substrates are determined, we assign each substrate to a core in the router and employ a multi-path transport protocol, similar to MPTCP, to perform end-to-end data transfers. We designed heuristics that utilize node centrality, edge centrality, or flow patterns. We evaluated the MCPR heuristics on router-level ISP topologies and compared the network throughput against single shortest-path routing under extensive simulation scenarios including heterogeneous core count across the routers and network failures. The evaluations showed that MCPR heuristics can attain network throughput speedups reaching 2.6 while incurring only polynomial control overhead.
{"title":"MCPR: Routing using parallel shortest paths","authors":"Ahmet Soran;Murat Yuksel;Mehmet Hadi Gunes","doi":"10.23919/JCN.2024.000026","DOIUrl":"https://doi.org/10.23919/JCN.2024.000026","url":null,"abstract":"Recent trends led to higher data volumes to be transferred and processed over the network. Legacy routing protocols, e.g., OSPF for intra-domain routing, send data from a source to destination on one of the shortest paths. We propose a novel approach to parallelize data transfers by leveraging the multi-core CPUs in the routers. We describe an end-to- end method to optimize data flows on multiple paths. Multicore parallel routing (MCPR) generates new virtual topology substrates from the underlying router topology and performs the shortest path routing on each substrate. Even though calculating the shortest paths could be done with well-known techniques such as OSPF's Dijkstra implementation, finding optimal substrates and setting their link weights to maximize the network throughput over multiple end-to-end paths is still an NP-hard problem. In MCPR, we focus on designing heuristics for substrate generation from a given router topology. Each substrate is a subgraph of the router topology and each link on each substrate is to be assigned a weight to steer the shortest-path routing for maximal network throughput. Heuristics' interim goal is to generate substrates in such a way that the shortest path between a source-destination pair on each substrate minimally overlaps with the shortest paths calculated by the other substrates. Once these substrates are determined, we assign each substrate to a core in the router and employ a multi-path transport protocol, similar to MPTCP, to perform end-to-end data transfers. We designed heuristics that utilize node centrality, edge centrality, or flow patterns. We evaluated the MCPR heuristics on router-level ISP topologies and compared the network throughput against single shortest-path routing under extensive simulation scenarios including heterogeneous core count across the routers and network failures. The evaluations showed that MCPR heuristics can attain network throughput speedups reaching 2.6 while incurring only polynomial control overhead.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 3","pages":"366-382"},"PeriodicalIF":2.9,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10579713","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：