Cost vs. Quality: Tradeoffs in Communication Networks

Cost vs. Quality: Tradeoffs in Communication Networks (2000)

Cached

Download Links

[www.cs.technion.ac.il]

by Tamar Eilam

BibTeX

@MISC{Eilam00costvs.,
    author = {Tamar Eilam},
    title = {Cost vs. Quality: Tradeoffs in Communication Networks},
    year = {2000}
}

Bookmark

OpenURL

Abstract

Citations

312	Graph Algorithms - Even - 1979
271	Optical Networks: A Practi-cal Perspective - Ramaswami, Sivarajan - 1998
217	On the ratio of optimal integral and fractional covers - Lovasz - 1975
123	Sparse partitions - Awerbuch, Peleg - 1990
106	An o( \|V \|\|E\|) algorithm for finding maximum matching in general graphs - Micali, Vazirani - 1980
70	Interval routing - Leeuwen, Tan - 1987
66	Designing networks with compact routing tables - Frederickson, Janardan - 1988
64	G.: Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings - Gerstel, Lin, et al. - 1998
63	Compact distributed data structures for adaptive routing - Awerbuch, Bar-Noy, et al. - 1989
60	Improved routing strategies with succinct tables - Awerbuch, Bar-Noy, et al. - 1990
56	Graph minors \| a survey - Robertson, Seymour - 1985
55	The compactness of interval routing - Gavoille, Peleg - 1999
53	Compact routing schemes with low stretch factor - Eilam, Gavoille, et al. - 1998
53	Space-efficiency for routing schemes of stretch factor three - Gavoille, Gengler
37	On multi-label linear interval routing schemes - Kranakis, Krizanc, et al. - 1996
37	A tradeoff between size and efficiency for routing tables - Peleg, Upfal - 1989
33	Constrained bipartite edge coloring with applications to wavelength routing - Kaklamanis, Persiano, et al. - 1997
31	Memory requirement for routing in distributed networks - Gavoille, Perennes - 1996
29	Provisioning algorithms for WDM optical networks - Alanyali, Ayanoglu - 1998
28	Leeuwen (editor), Handbook of Theoretical Computer Science, volume - van - 1990
24	Distributed Network Control for Optical Networks - Ramaswami, Segall - 1997
22	Interval routing schemes - Flammini, Gambosi, et al. - 1996
21	Worst case bounds for shortest path interval routing - Gavoille, Guevremont - 1998
18	Separator-based strategies for efficient message routing - Frederickson, Janardan - 1986
18	The Virtual Path Layout Problem in Fast Networks - Gerstel, Zaks - 1994
18	Routing with compact routing tables - Leeuwen, Tan - 1983
17	The complexity of characterization of networks supporting shortest-path interval routing - Eilam, Moran, et al. - 1997
17	On the e ciency of interval routing algorithms, in - Ruzicka - 1988
16	On interval routing schemes and treewidth - Bodlaender, Tan, et al. - 1995
14	Dynamic wavelength allocation in WDM ring networks with little or no wavelength conversion”, The 34 th Allerton conf - Gerstel, Sasaki, et al. - 1996
14	Fault tolerant multiwavelength optical rings with limited wavelength conversion,” presented at the Infocom’97 - Gerstel, Ramaswami, et al. - 1997
13	Le Boudec, “Design of a survivable WDM photonic network - Armitage, Crochat, et al. - 1997
13	Optimal layouts on a chain ATM network - Gerstel, Wool, et al. - 1998
13	O.: Wavelength assignment in WDM rings to minimize SONET ADMs - Liu, Li, et al. - 2000
12	A scalable approach to routing in ATM networks - Cidon, Gerstel, et al. - 1994
11	B.: Multidimensional Interval Routing Schemes - Flammini, G--Nanni, et al. - 1998
11	Characterization of networks supporting shortest path interval routing schemes - Narayanan, Shende - 1995
11	An optimal lower bound for interval routing in general networks - Tse, Lau - 1997
10	A survey on interval routing scheme - Gavoille - 2000
10	Note on the k-diameter of k-regular k-connected graphs - Hsu, Luczak - 1994
9	Bandwidth allocation algorithms on tree-shaped all-optical networks with wavelength converters - Auletta, Caragiannis, et al. - 1997
9	A complete characterization of the path layout construction problem for ATM networks with given hop count and load - Eilam, Flammini, et al. - 1998
9	On the hardness of devising interval routing schemes - Flammini - 1997
8	A lower bound for linear interval routing - Eilam, Moran, et al. - 1996
8	The complexity of coloring circular arc graphs and chords - Garey, Johnson, et al. - 1980
7	Approximation algorithms for survivable optical networks - Eilam, Moran, et al. - 2000
7	The T9000 Transputer Products Overview Manual - Inmos - 1991
7	Labeling and implicit routing in networks. The computer - Santoro, Khatib - 1985
6	Randomly traceable graphs - Chartrand, Kronk - 1968
4	Number of wavelengths required for optical networks with failure restoration - Hamazumi, Nagatsu, et al. - 1994