相关论文: On Minimizing the Completion Times of Long Flows o…

Traffic load balancing and resource allocation is set to play a crucial role in leveraging the dense and increasingly heterogeneous deployment of multi-radio wireless networks. Traffic aggregation across different access points (APs)/radio…

One of the most popular approaches to multi-target tracking is tracking-by-detection. Current min-cost flow algorithms which solve the data association problem optimally have three main drawbacks: they are computationally expensive, they…

Several high-throughput distributed data-processing applications require multi-hop processing of streams of data. These applications include continual processing on data streams originating from a network of sensors, composing a multimedia…

Fault-tolerant routing allows the selection of alternative routes to the destination after the route being used fails. Fast Reroute (FRR) is a proactive strategy through which the protocol pre-configures backup routes that are activated…

Towards the development of 6G mobile networks, it is promising to integrate a large number of devices from multi-dimensional platforms, and it is crucial to have a solid understanding of the theoretical limits of large-scale networks. We…

Fractures form the main pathways for flow in the subsurface within low-permeability rock. For this reason, accurately predicting flow and transport in fractured systems is vital for improving the performance of subsurface applications.…

Two fundamental problems in unsupervised learning are efficient inference for latent-variable models and robust density estimation based on large amounts of unlabeled data. Algorithms for the two tasks, such as normalizing flows and…

This paper addresses the challenging scheduling problem of coflows with release times, with the objective of minimizing the total weighted completion time. Previous literature has predominantly concentrated on establishing the scheduling…

Residual radio resources are abundant in wireless networks due to dynamic traffic load, which can be exploited to support high throughput for serving non-real-time (NRT) traffic. In this paper, we investigate how to achieve this by resource…

Many emerging distributed applications, including big data analytics, generate a number of flows that concurrently transport data across data center networks. To improve their performance, it is required to account for the behavior of a…

We study the scheduling of flows on a switch with the goal of optimizing metrics related to the response time of the flows. The input to the problem is a sequence of flow requests on a switch, where the switch is represented by a bipartite…

Accurate real-time traffic flow prediction can be leveraged to relieve traffic congestion and associated negative impacts. The existing centralized deep learning methodologies have demonstrated high prediction accuracy, but suffer from…

In the past decade, increasingly network scheduling techniques have been proposed to boost the distributed application performance. Flow-level metrics, such as flow completion time (FCT), are based on the abstraction of flows yet they…

Despite the rich literature on scheduling algorithms for wireless networks, algorithms that can provide deadline guarantees on packet delivery for general traffic and interference models are very limited. In this paper, we study the problem…

We consider multi--hop wireless networks carrying unicast flows for multiple users. Each flow has a specified delay deadline, and the lossy wireless links are modelled as binary symmetric channels (BSCs). Since transmission time, also…

Efficient and exact algorithms are important for performing fast and accurate traffic network simulations with macroscopic traffic models. In this paper, we extend the semi-analytical Lax-Hopf algorithm in order to compute link inflows and…

A many-server heavy-traffic FCLT is proved for the $G_t/M/s_t+\mathit {GI}$ queueing model, having time-varying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment…

With the rapid advancement of technology, parallel computing applications have become increasingly popular and are commonly executed in large data centers. These applications involve two phases: computation and communication, which are…

Temporal interaction networks capture the history of activities between entities along a timeline. At each interaction, some quantity of data (money, information, kbytes, etc.) flows from one vertex of the network to another. Flow-based…

In multi-hop wireless networks, flow demands mean that some nodes have routing demands of transmitting their data to other nodes with a certain level of transmission rate. When a set of nodes have been deployed with flow demands, it is…