Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(5)
Internet Routing
Network Topology
Oblivious Routing
Optical Fiber
Valiant Load Balancing
Subscribe
Academic
Publications
Traffic-Oblivious Routing in the Hose Model
Traffic-Oblivious Routing in the Hose Model,10.1109/TNET.2010.2099666,IEEE/ACM Transactions on Networking,Murali Kodialam,T. V. Lakshman,Sudipta Sengu
Edit
Traffic-Oblivious Routing in the Hose Model
BibTex
|
RIS
|
RefWorks
Download
Murali Kodialam
,
T. V. Lakshman
,
Sudipta Sengupta
Journal:
IEEE/ACM Transactions on Networking - TON
, vol. 19, no. 3, pp. 774-787, 2011
DOI:
10.1109/TNET.2010.2099666
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
dl.acm.org
)
(
ieeexplore.ieee.org
)
(
ieeexplore.ieee.org
)
References
(19)
Network flows - theory, algorithms and applications
(
Citations: 3041
)
Ravindra K. Ahuja
,
Thomas L. Magnanti
,
James B. Orlin
Published in 1993.
Optimal oblivious routing in polynomial time
(
Citations: 102
)
Yossi Azar
,
Edith Cohen
,
Amos Fiat
,
Haim Kaplan
,
Harald Racke
Conference:
ACM Symposium on Theory of Computing - STOC
, pp. 383-388, 2003
Optimal Bandwidth Reservation in Hose-Model VPNs with MultiPath Routing
(
Citations: 52
)
Thomas Erlebach
,
Maurice Riiegg
Conference:
IEEE INFOCOM - INFOCOM
, vol. 4, pp. 2275-2282 vol.4, 2004
Designing Least-Cost Nonblocking Broadband Networks
(
Citations: 69
)
J. Andrew Fingerhut
,
Subhash Suri
,
Jonathan S. Turner
Journal:
Journal of Algorithms - JAL
, vol. 24, no. 2, pp. 287-309, 1997
Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems
(
Citations: 11
)
Naveen Garg
,
Rohit Khandekar
Conference:
IEEE Symposium on Foundations of Computer Science - FOCS
, pp. 500-509, 2002