Related papers: Shortest Path versus Multi-Hub Routing in Networks…
This paper studies a fundamental algorithmic problem related to the design of demand-aware networks: networks whose topologies adjust toward the traffic patterns they serve, in an online manner. The goal is to strike a tradeoff between the…
We propose a unifying framework based on configuration linear programs and randomized rounding, for different energy optimization problems in the dynamic speed-scaling setting. We apply our framework to various scheduling and routing…
Understanding the structural complexity and predictability of complex networks is a central challenge in network science. Although recent studies have revealed a relationship between compression-based entropy and link prediction…
The application of learning based methods to vehicle routing problems has emerged as a pivotal area of research in combinatorial optimization. These problems are characterized by vast solution spaces and intricate constraints, making…
The network structure of an urban transportation system has a significant impact on its traffic performance. This study uses network indicators along with several traffic performance measures including speed, trip length, travel time, and…
Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage routing on different layers, leading to a suboptimal use of the network resources and…
We consider the problem of routing packets across a multi-hop network consisting of multiple sources of traffic and wireless links while ensuring bounded expected delay. Each packet transmission can be overheard by a random subset of…
Modern route planners such as Google Maps and Apple Maps serve millions of users worldwide, optmizing routes in large-scale road networks where fast responses are required under diverse cost metrics including travel time, fuel consumption,…
The high-level contribution of this paper is to establish benchmarks for the minimum hop count per source-receiver path and the minimum number of edges per tree for multicast routing in mobile ad hoc networks (MANETs) under different…
We consider network design problems for information networks where routers can replicate data but cannot alter it. This functionality allows the network to eliminate data-redundancy in traffic, thereby saving on routing costs. We consider…
The advancement of mobile technologies and the proliferation of map-based applications have enabled a user to access a wide variety of services that range from information queries to navigation systems. Due to the popularity of map-based…
We consider a network design and expansion problem, where we need to make a capacity investment now, such that uncertain future demand can be satisfied as closely as possible. To use a robust optimization approach, we need to construct an…
We study a cache network in which intermediate nodes equipped with caches can serve requests. We model the problem of jointly optimizing caching and routing decisions with link capacity constraints over an arbitrary network topology. This…
In the context of an efficient network traffic engineering process where the network continuously measures a new traffic matrix and updates the set of paths in the network, an automated process is required to quickly and efficiently…
This paper addresses the transmission network expansion planning problem under uncertain demand and generation capacity. A two-stage adaptive robust optimization framework is adopted whereby the worst-case operating cost is accounted for…
Vehicular Ad Hoc Networks (VANETs) are characterized by intermittent connectivity, which leads to failures of end-to-end paths between nodes. Named Data Networking (NDN) is a network paradigm that deals with such problems, since information…
In this paper, we consider a distributionally robust resource planning model inspired by a real-world service industry problem. In this problem, there is a mixture of known demand and uncertain future demand. Prior to having full knowledge…
We consider two variational models for transport networks, an urban planning and a branched transport model, in which the degree of network complexity and ramification is governed by a small parameter $\varepsilon>0$. Smaller $\varepsilon$…
This study focuses on relay transport carriers (RTCs) that contract with hub providers to lease hub capacity and employ relay transportation via hubs. It enables long-haul freight shipments to be transported by multiple short-haul drivers…
Due to the importance of robustness in many real-world optimization problems, the field of robust optimization has gained a lot of attention over the past decade. We concentrate on maximum flow problems and introduce a novel robust…