AbstractWe investigate an oblivious routing scheme, amenable to distributed computation and resilient to graph changes, based on electrical flow. Our main technical contribution is a new rounding method which we use to obtain a bound on the ℓ1→ℓ1 operator norm of the inverse graph Laplacian. We show how this norm reflects both latency and congestion of electric routing
The analysis of network routing games typically assumes, right at the onset, precise and detailed in...
Oblivious routing is an attractive paradigm for large distributed systems in which centralized contr...
Summary. Traditionally, network routing was optimized with respect to an expected traffic matrix, wh...
AbstractWe investigate an oblivious routing scheme, amenable to distributed computation and resilien...
We investigate an oblivious routing scheme, amenable to distributed computation and resilient to gra...
AbstractA recent seminal result of Räcke is that for any undirected network there is an oblivious ro...
International audienceNetwork routing considers the problem of finding one or multiple paths to tran...
Oblivious routing algorithms for general undirected networks were introduced by Räcke, and this wor...
We introduce a new approach to the maximum flow problem in undirected, capacitated graphs using α-co...
Oblivious routing algorithms for general undirected networks were introduced by Räcke, and this work...
Today\u27s interconnected world requires an inexpensive, fast, and reliable way of transferring info...
Gupta et al. [13] introduced a very general multicommodity flow problem in which the cost of a given...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
In telecommunication networks, a common measure is the maximum congestion (i.e., utilization) on edg...
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of ...
The analysis of network routing games typically assumes, right at the onset, precise and detailed in...
Oblivious routing is an attractive paradigm for large distributed systems in which centralized contr...
Summary. Traditionally, network routing was optimized with respect to an expected traffic matrix, wh...
AbstractWe investigate an oblivious routing scheme, amenable to distributed computation and resilien...
We investigate an oblivious routing scheme, amenable to distributed computation and resilient to gra...
AbstractA recent seminal result of Räcke is that for any undirected network there is an oblivious ro...
International audienceNetwork routing considers the problem of finding one or multiple paths to tran...
Oblivious routing algorithms for general undirected networks were introduced by Räcke, and this wor...
We introduce a new approach to the maximum flow problem in undirected, capacitated graphs using α-co...
Oblivious routing algorithms for general undirected networks were introduced by Räcke, and this work...
Today\u27s interconnected world requires an inexpensive, fast, and reliable way of transferring info...
Gupta et al. [13] introduced a very general multicommodity flow problem in which the cost of a given...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
In telecommunication networks, a common measure is the maximum congestion (i.e., utilization) on edg...
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of ...
The analysis of network routing games typically assumes, right at the onset, precise and detailed in...
Oblivious routing is an attractive paradigm for large distributed systems in which centralized contr...
Summary. Traditionally, network routing was optimized with respect to an expected traffic matrix, wh...
DOI
Add to ORKG