Related papers: Worst-case Delay Bounds in Time-Sensitive Networks…
Deep neural networks (DNNs) have substantial computational and memory requirements, and the compilation of its computational graphs has a great impact on the performance of resource-constrained (e.g., computation, I/O, and memory-bound)…
We present a new unified framework for minimizing congestion-dependent network cost in information-centric networks by jointly optimizing forwarding and caching strategies. As caching variables are integer-constrained, the resulting…
Recent interest in networked control systems (NCS) has instigated research in both communication networks and control. Analysis of NCSs has usually been performed from either the network or the control point of view, but not many papers…
In the electric system, extreme weather events can cause trips or physical damage to transmission lines, leading to large-scale load shedding. To mitigate power shedding, we propose a framework that pre-positions the commitment of…
Cognitive radio transceiver can opportunistically access the underutilized spectrum resource of primary systems for new wireless services. With interweave cognitive implementation, the secondary transmission may be interrupted by the…
Tightening performance bounds of ring networks with cyclic dependencies is still an open problem in the literature. In this paper, we tackle such a challenging issue based on Network Calculus. First, we review the conventional timing…
In this paper, we dynamically select the transmission rate and design wireless network coding to improve the quality of services such as delay for time critical applications. With low transmission rate, and hence longer transmission range,…
Consider a multihop wireless network serving multiple flows in which wireless link interference constraints are described by a link interference graph. For such a network, we design routing-scheduling policies that maximize the end-to-end…
This article studies disruption tolerant networks (DTNs) where each node knows the probabilistic distribution of contacts with other nodes. It proposes a framework that allows one to formalize the behaviour of such a network. It generalizes…
Network modeling is a key enabler to achieve efficient network operation in future self-driving Software-Defined Networks. However, we still lack functional network models able to produce accurate predictions of Key Performance Indicators…
In this paper, we consider the issue of throughput and packet drop rate (PDR) optimization as two performance metrics for delay sensitive applications in network coded time division duplex (TDD) satellite systems with large round trip times…
Delay tolerant network (DTN) is opportunistic network where each node searches best opportunity to deliver the message called bundle to the destination. DTN implements a store and forward message switching system by simply introducing…
We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees, defined by instantaneous throughput and hard packet deadlines. Using a network slicing model to decouple the queueing dynamics between flows,…
Time-Sensitive Networking (TSN) extends IEEE 802.1 Ethernet for safety-critical and real-time applications in several areas, e.g., automotive, aerospace or industrial automation. However, many of these systems also have stringent security…
The efficient deployment of large language models (LLMs) in online settings requires optimizing inference performance under stringent latency constraints, particularly the time-to-first-token (TTFT) and time-per-output-token (TPOT). This…
Radio frequency (RF) energy harvesting is key in attaining perpetual lifetime for time-critical wireless powered communication networks due to full control on energy transfer, far field region, small and low-cost circuitry. In this paper,…
Recent works proposed the relaying at the MAC layer in cognitive radio networks whereby the primary packets are forwarded by the secondary node maintaining an extra queue devoted to the relaying function. However, relaying of primary…
Network Utility Maximization (NUM) studies the problems of allocating traffic rates to network users in order to maximize the users' total utility subject to network resource constraints. In this paper, we propose a new NUM framework,…
Backpressure-based adaptive routing algorithms where each packet is routed along a possibly different path have been extensively studied in the literature. However, such algorithms typically result in poor delay performance and involve high…
Most Internet traffic is carried by capacity-seeking protocols such as TCP and QUIC. Capacity-seeking protocols probe to find the maximum available throughput from sender to receiver, and, once they converge, attempt to keep sending traffic…