A practical algorithm for constructing oblivious routing schemes

Marcin Bieńkowski; Mirosław Korzeniowski; Harald Räcke

A practical algorithm for constructing oblivious routing schemes

Marcin Bieńkowski
, Mirosław Korzeniowski
, Harald Räcke

Informatics 14 - Associate Professorship of Theoretical Computer Science

Research output: Contribution to conference › Paper › peer-review

34 Scopus citations

Abstract

A practical algorithm for constructing Oblivious routing schemes was studied. Algorithms for specific networks and nonpolynomial algorithm for general networks were also discussed. An optimal algorithm that deals with optimal competitive ratio for oblivious algorithm and which is based on linear programming and the Ellipsoid algorithm with a separation oracle was studied. Hierarchical decomposition and hierarchical routing scheme were studied.

Original language	English
Pages	1-13
Number of pages	13
State	Published - 2003
Event	4th ACM Federated Computing Research Conference, FCRC 2003 - San Diego, CA, United States Duration: 7 Jun 2003 → 9 Jun 2003

Conference

Conference	4th ACM Federated Computing Research Conference, FCRC 2003
Country/Territory	United States
City	San Diego, CA
Period	7/06/03 → 9/06/03

Cite this

@conference{c507978cd7994bef9532fce39f33179d,

title = "A practical algorithm for constructing oblivious routing schemes",

abstract = "A practical algorithm for constructing Oblivious routing schemes was studied. Algorithms for specific networks and nonpolynomial algorithm for general networks were also discussed. An optimal algorithm that deals with optimal competitive ratio for oblivious algorithm and which is based on linear programming and the Ellipsoid algorithm with a separation oracle was studied. Hierarchical decomposition and hierarchical routing scheme were studied.",

author = "Marcin Bie{\'n}kowski and Miros{\l}aw Korzeniowski and Harald R{\"a}cke",

year = "2003",

language = "English",

pages = "1--13",

note = "4th ACM Federated Computing Research Conference, FCRC 2003 ; Conference date: 07-06-2003 Through 09-06-2003",

}

TY - CONF

T1 - A practical algorithm for constructing oblivious routing schemes

AU - Bieńkowski, Marcin

AU - Korzeniowski, Mirosław

AU - Räcke, Harald

PY - 2003

Y1 - 2003

N2 - A practical algorithm for constructing Oblivious routing schemes was studied. Algorithms for specific networks and nonpolynomial algorithm for general networks were also discussed. An optimal algorithm that deals with optimal competitive ratio for oblivious algorithm and which is based on linear programming and the Ellipsoid algorithm with a separation oracle was studied. Hierarchical decomposition and hierarchical routing scheme were studied.

AB - A practical algorithm for constructing Oblivious routing schemes was studied. Algorithms for specific networks and nonpolynomial algorithm for general networks were also discussed. An optimal algorithm that deals with optimal competitive ratio for oblivious algorithm and which is based on linear programming and the Ellipsoid algorithm with a separation oracle was studied. Hierarchical decomposition and hierarchical routing scheme were studied.

UR - https://www.scopus.com/pages/publications/22244477789

M3 - Paper

AN - SCOPUS:22244477789

SP - 1

EP - 13

T2 - 4th ACM Federated Computing Research Conference, FCRC 2003

Y2 - 7 June 2003 through 9 June 2003

ER -

A practical algorithm for constructing oblivious routing schemes

Abstract

Conference

Other files and links

Fingerprint

Cite this