Related papers: Speed-Aware Network Design: A Parametric Optimizat…
Network reliability is an important metric to evaluate the connectivity among given vertices in uncertain graphs. Since the network reliability problem is known as #P-complete, existing studies have used approximation techniques. In this…
Exact queueing analysis of erasure networks with network coding in a finite buffer regime is an extremely hard problem due to the large number of states in the network. In such networks, packets are lost due to either link erasures or due…
Network service providers and customers are often concerned with aggregate performance measures that span multiple network paths. Unfortunately, forming such network-wide measures can be difficult, due to the issues of scale involved. In…
Coded caching is used to reduce network congestion during peak hours. A single server is connected to a set of users through a bottleneck link, which generally is assumed to be error-free. During non-peak hours, all the users have full…
We study the problem of computing isochrones in road networks, where the objective is to identify the region that is reachable from a given source within a certain amount of time. While there is a wide range of practical applications for…
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…
The vehicle routing problem has great importance and application in transportation and supply chain management. In this case, there are several supply requests in a transportation network. The main goal is to allocate customers to available…
Erasure coding techniques are getting integrated in networked distributed storage systems as a way to provide fault-tolerance at the cost of less storage overhead than traditional replication. Redundancy is maintained over time through…
Edge bundling reduces the visual clutter in a drawing of a graph by uniting the edges into bundles. We propose a method of edge bundling drawing each edge of a bundle separately as in metro-maps and call our method ordered bundles. To…
Urban traffic congestion is a chronic problem faced by many cities in the US and worldwide. It results in inefficient infrastructure use as well as increased vehicle fuel consumption and emission levels. Congestion is intertwined with…
This paper studies the problem of congestion control and scheduling in ad hoc wireless networks that have to support a mixture of best-effort and real-time traffic. Optimization and stochastic network theory have been successful in…
Energy saving is becoming an important issue in the design and use of computer networks. In this work we propose a problem that considers the use of rate adaptation as the energy saving strategy in networks. The problem is modeled as an…
The rapid proliferation of food delivery platforms has reshaped urban mobility but has also contributed significantly to environmental degradation through increased greenhouse gas emissions. Existing optimization mechanisms produce…
Line planning in public transport is the strategic problem of selecting lines and their operating frequencies. This problem is important as it defines the passenger service, based on available connections and expected travel times, and…
We investigate the problem of optimal request routing and content caching in a heterogeneous network supporting in-network content caching with the goal of minimizing average content access delay. Here, content can either be accessed…
We consider the following node-capacitated network design problem. The input is an undirected graph, set of demands, uniform node capacity and arbitrary node costs. The goal is to find a minimum node-cost subgraph that supports all demands…
Same-day delivery for e-commerce has become a popular service. Companies usually offer several time delivery options with the earliest one being next hour delivery. Due to tight delivery deadlines and thin margins, companies often find it…
Traditionally, networks such as datacenter interconnects are designed to optimize worst-case performance under arbitrary traffic patterns. Such network designs can however be far from optimal when considering the actual workloads and…
Given two independent point processes and a certain rule for matching points between them, what is the fraction of matched points over infinitely long streams? In many application contexts, e.g., secure networking, a meaningful matching…
It is accepted wisdom that changes in the traffic matrix entail capacity over-provisioning, but there is no simple measure of just how much over-provisioning can buy. In this Thesis, we aim to provide the network designer with a simple view…