Integrated Access and Backhaul (IAB) represents a fast and cost-efficient network deployment technology that enhances the coverage of millimeter-wave (mmWave) 5G networks. In addition to the conventional challenges of wireless multi-hop relaying such as, e.g., increased interference and packet delays, traffic asymmetry can lead to significant delay degradation. While centralized coordination can mitigate these challenges, it may also lead to unnecessary overheads. In this paper, we propose an effective delay-aware distributed solution for joint access and backhaul link scheduling and route selection designed to function with limited information, which relies only on the knowledge collected from immediate neighbors. We formulate the joint upstream and downstream routing and scheduling problem, which is solved in a distributed manner for the IAB system with diverse delay requirements. To effectively tackle this problem, we employ deep reinforcement learning (DRL) algorithms. Our numerical results demonstrate that the proposed distributed solution provides improved scalability as compared to the centralized approach without a significant performance loss.

Age of Information (AoI) has gained significant attention from the research community because of its applications to Internet of Things (IoT) monitoring and control. In this work, we treat multihop connections over queuing networks with tributary flows and non-preemptive service: packets cannot be discarded because they are utilized for other system objectives, such as data analytics. Without preemption, the key tool for optimizing AoI is then the scheduling policy between the different data flows at each intermediate node. This is the subject of our analysis, along with the impact of packet erasure on the age. We derive upper and lower bounds for the average AoI considering several queuing policies in arbitrary network topologies, and present the results in different scenarios. Network topology, tributary traffic load, and link characteristics such as packet erasure generate complex trade-offs, which affect the optimal operation point and the age performance. The scheduling strategy at each node can also affect performance and fairness among users, particularly at critical bottleneck links, which have a significant impact on the overall performance of the whole network.

Age of Information (AoI) is a critical metric for several Internet of Things (IoT) applications, where sensors keep track of the environment by sending updates that need to be as fresh as possible. The development of edge computing solutions has moved the monitoring process closer to the sensor, reducing the communication delays, but the processing time of the edge node needs to be taken into account. Furthermore, a reliable system design in terms of freshness requires the knowledge of the full distribution of the Peak AoI (PAoI), from which the probability of occurrence of rare, but extremely damaging events can be obtained. In this work, we model the communication and computation delay of such a system as two First Come First Serve (FCFS) queues in tandem, analytically deriving the full distribution of the PAoI for the M/M/1 - M/D/1 and the M/M/1 - M/M/1 tandems, which can represent a wide variety of realistic scenarios.

Age of Information is a new metric used in real-time status update tracking applications. It measures at the destination the time elapsed since the generation of the last received packet. In this paper, we consider the co-existence of critical and noncritical status updates in a two-hop system, for which the network assigns different scheduling priorities. Specifically, the high priority is reserved to the packets that traverse the two nodes, as they experience worse latency performance. We obtain the distribution of the age and its natural upper bound termed peak age. We provide tight upper and lower bounds for priority updates and the exact expressions for the non-critical flow of packets with a general service distribution. The results give fundamental insights for the design of age-sensitive multi-hop systems.

The coexistence of human type communications (HTC) with an ever-increasing number of machine type communications (MTC) is a challenge that the forthcoming Fifth Generation (5G) network is claimed to tackle. Ultra-Reliable and Low Latency Communications (URLLC) are among the most demanding services that 5G network will support. Also referred to as mission-critical services, URLLC often requires group communications. The evolved Multimedia Broadcast and Multicast Services (eMBMS) architecture, currently specified by 3GPP to support group-based services in cellular networks, needs a revision to deliver future mission-critical services. In this paper, we analyze the performance of different machine-type multicast service (MtMS) scenarios and we compare three subgroup based approaches for multicast data delivery to MTC devices with limited channel bandwidth. Achieved simulation results provide useful guidelines for the design of multicasting schemes able to support delay-sensitive applications in 5G networks.