Oblivious Routing is a routing algorithm that belongs to the class of forwarding strategies in network communication, distinguished by its independence from real-time or global traffic conditions, as it predefines paths based solely on source and destination pairs without adapting to dynamic network state.
129
Publications
6.6K
Citations
248
Authors
113
Institutions
Publications per year
2017–2026
11
Parents
Publications
129
Optimal hierarchical decompositions for congestion minimization in networks
Harald Räcke · 2008 · 293 citations
Minimizing congestion in general networks
Harald Räcke · 2003 · 259 citations
1–5 of 129
Authors
248
- HR
14
h-index
- WJ
10
h-index
- BT
8
h-index
- TV
7
h-index
- MK
7
h-index
1–5 of 248
Institutions
113
Massachusetts Institute of Technology
Cambridge, United States
14 h-index
57 publications
2.3K citations
Stanford University
Stanford, United States
12 h-index
33 publications
1.3K citations
Carnegie Mellon University
Pittsburgh, United States
11 h-index
16 publications
684 citations
Cornell University
Ithaca, United States
8 h-index
12 publications
438 citations
Paderborn University
Paderborn, Germany
6 h-index
10 publications
847 citations
Microsoft (United States)
Redmond, United States
6 h-index
6 publications
293 citations
University of Warwick
Coventry, United Kingdom
4 h-index
5 publications
372 citations
Harvard University
Cambridge, United States
4 h-index
6 publications
331 citations
1–8 of 113
Venues
- IEEE Transactions on Computers
7 publications · 176 citations
7
h-index
- IEEE/ACM Transactions on Networking
TON · 5 publications · 287 citations
5
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 4 publications · 86 citations
4
h-index
- ACM SIGARCH Computer Architecture News
3 publications · 234 citations
3
h-index
- IEEE Computer Architecture Letters
3 publications · 129 citations
3
h-index
1–5