On Edge Pruning of Communication Networks under an Age-of-Information Framework
Effective non-repetitive routing among nodes in a network is an essential function in communication networks. To achieve that, pruning the links of the network is helpful with the trade-off of making the network less robust in transmitting messages while reducing redundancy to increase flow with lim...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-06-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/15/7/228 |
| _version_ | 1797407910262734848 |
|---|---|
| author | Abdalaziz Sawwan Jie Wu |
| author_facet | Abdalaziz Sawwan Jie Wu |
| author_sort | Abdalaziz Sawwan |
| collection | DOAJ |
| description | Effective non-repetitive routing among nodes in a network is an essential function in communication networks. To achieve that, pruning the links of the network is helpful with the trade-off of making the network less robust in transmitting messages while reducing redundancy to increase flow with limited network bandwidth, so we enhance the quality of service (QoS). In our paper, we study the case that if a link removal has either no effect or an insignificant effect on the Age of Information (AoI) of the messages delivered in the communication network. The pruning of such links can be applied to the <i>k</i> least significant links in terms of their impact on the AoI of the messages transmitted in the system. The objective of our work is to study the effect of pruning a number of links in a network on the AoI, in order to reduce the redundancy of the messages that may be received at the destination many times while transmitted only once. In our context, the objective of the communication system would be to maintain the information from the source as fresh as possible when it arrives at the destination while reducing the redundancy of messages. In this work, we introduce an efficient reduction method designed for series-parallel networks with links of exponentially distributed wait times. In addition, we consider the deterministic case and present the pruning technique when link removal would not affect the AoI. Lastly, we present a comprehensive simulation to study the effect of pruning the links on the AoI of the network and the redundancy of messages received by the destination. |
| first_indexed | 2024-03-09T03:49:36Z |
| format | Article |
| id | doaj.art-89a1eb98a0d44fbabe2b004abdfd5238 |
| institution | Directory Open Access Journal |
| issn | 1999-4893 |
| language | English |
| last_indexed | 2024-03-09T03:49:36Z |
| publishDate | 2022-06-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Algorithms |
| spelling | doaj.art-89a1eb98a0d44fbabe2b004abdfd52382023-12-03T14:30:02ZengMDPI AGAlgorithms1999-48932022-06-0115722810.3390/a15070228On Edge Pruning of Communication Networks under an Age-of-Information FrameworkAbdalaziz Sawwan0Jie Wu1Department of Computer and Information Sciences, Temple University, Philadelphia, PA 19122, USADepartment of Computer and Information Sciences, Temple University, Philadelphia, PA 19122, USAEffective non-repetitive routing among nodes in a network is an essential function in communication networks. To achieve that, pruning the links of the network is helpful with the trade-off of making the network less robust in transmitting messages while reducing redundancy to increase flow with limited network bandwidth, so we enhance the quality of service (QoS). In our paper, we study the case that if a link removal has either no effect or an insignificant effect on the Age of Information (AoI) of the messages delivered in the communication network. The pruning of such links can be applied to the <i>k</i> least significant links in terms of their impact on the AoI of the messages transmitted in the system. The objective of our work is to study the effect of pruning a number of links in a network on the AoI, in order to reduce the redundancy of the messages that may be received at the destination many times while transmitted only once. In our context, the objective of the communication system would be to maintain the information from the source as fresh as possible when it arrives at the destination while reducing the redundancy of messages. In this work, we introduce an efficient reduction method designed for series-parallel networks with links of exponentially distributed wait times. In addition, we consider the deterministic case and present the pruning technique when link removal would not affect the AoI. Lastly, we present a comprehensive simulation to study the effect of pruning the links on the AoI of the network and the redundancy of messages received by the destination.https://www.mdpi.com/1999-4893/15/7/228age of information (AoI)link pruningmulti-hop networksphase-type distributionquality of service (QoS) |
| spellingShingle | Abdalaziz Sawwan Jie Wu On Edge Pruning of Communication Networks under an Age-of-Information Framework Algorithms age of information (AoI) link pruning multi-hop networks phase-type distribution quality of service (QoS) |
| title | On Edge Pruning of Communication Networks under an Age-of-Information Framework |
| title_full | On Edge Pruning of Communication Networks under an Age-of-Information Framework |
| title_fullStr | On Edge Pruning of Communication Networks under an Age-of-Information Framework |
| title_full_unstemmed | On Edge Pruning of Communication Networks under an Age-of-Information Framework |
| title_short | On Edge Pruning of Communication Networks under an Age-of-Information Framework |
| title_sort | on edge pruning of communication networks under an age of information framework |
| topic | age of information (AoI) link pruning multi-hop networks phase-type distribution quality of service (QoS) |
| url | https://www.mdpi.com/1999-4893/15/7/228 |
| work_keys_str_mv | AT abdalazizsawwan onedgepruningofcommunicationnetworksunderanageofinformationframework AT jiewu onedgepruningofcommunicationnetworksunderanageofinformationframework |