|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Alok Aggarwal , Amotz Bar-Noy , Don Coppersmith , Rajiv Ramaswami , Baruch Schieber , Madhu Sudan, Efficient routing and scheduling algorithms for optical networks, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.412-423, January 23-25, 1994, Arlington, Virginia, United States
|
| |
2
|
|
 |
3
|
James Aspnes , Yossi Azar , Amos Fiat , Serge Plotkin , Orli Waarts, On-line load balancing with applications to machine scheduling and virtual circuit routing, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.623-631, May 16-18, 1993, San Diego, California, United States
[doi> 10.1145/167088.167248]
|
| |
4
|
B. Awerbuch, Y. Azar, and S. Plotkin. Throughput competitive on-line routing. In Prec. 3# th IEEE Annual Symposium on Foundations of Computer Science, November 1993. To appear.
|
| |
5
|
Baruch Awerbuch , Yossi Azar , Serge Plotkin , Orli Waarts, Competitive routing of virtual circuits with unknown duration, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.321-327, January 23-25, 1994, Arlington, Virginia, United States
|
| |
6
|
|
| |
7
|
K. Bala, T.E. Stern, and K. Bala. Algorithms for routing in a linear lightwave network. In Proc. INFOCOM, pages 1-9. IEEE, 1991.
|
| |
8
|
R. A. Barry and P. A. Humblet. On the number of wavelengths and switches in all-optical networks. To appear in IEEE Trans. Comm., 1993.
|
| |
9
|
R. A. Barry and P. A. Humblet. Bounds on the number of wavelengths needed in WDM networks. In LEOS'92 Summer Topical Mtg. Dzgest, pages 114-127, 1992.
|
 |
10
|
S. Ben-David , A. Borodin , R. Karp , G. Tardos , A. Wigderson, On the power of randomization in online algorithms, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.379-386, May 13-17, 1990, Baltimore, Maryland, United States
[doi> 10.1145/100216.100268]
|
| |
11
|
C. Berge. The Theory of Graphs and its Applications. John Wiley, 1962.
|
| |
12
|
C. Brackett. Dense wavelength division multiplexing networks: Principles and applications. IEEE J. Selected Areas in Comm., 8:373-380, August 1990.
|
 |
13
|
Andrei Z. Broder , Alan M. Frieze , Eli Upfal, Existence and construction of edge disjoint paths on expander graphs, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.140-149, May 04-06, 1992, Victoria, British Columbia, Canada
[doi> 10.1145/129712.129727]
|
| |
14
|
K-W. Cheng. Accousto-optic tunable filters in narrowband WDM networks. IEEE JSA C, 8:1015-1025, 1990.
|
| |
15
|
N.K. Cheung, K. Nosu, and G. Winzer. IEEE JSAC: special issue on dense WDM networks. IEEE JSAC: Speczal Issue on Dense WDM Networks, 8, 1990.
|
| |
16
|
P.E. Green. Fzber-Optic Communication Networks. Prentice Hall, 1992.
|
| |
17
|
H.S. Hinton. Architectural considerations for photonic switching networks. IEEE J. Selected Areas in Comm., 6:1209-1226, August 1988.
|
| |
18
|
|
| |
19
|
|
| |
20
|
Tom Leighton , Fillia Makedon , Serge Plotkin , Clifford Stein , Éva Tardos , Spyros Tragoudas, Fast approximation algorithms for multicommodity flow problems, Journal of Computer and System Sciences, v.50 n.2, p.228-243, April 1995
|
| |
21
|
|
| |
22
|
|
| |
23
|
S. Personick. Review of fundamentals of optical fiber systems. IEEE j. Selected Areas in Comm., 3:373-380, April 1983.
|
| |
24
|
|
| |
25
|
G. R. Pieris and G. H. Sasaki. Scheduling transmissions in broadcast and select networks. Unpublished manuscript, 1993.
|
| |
26
|
|
| |
27
|
R. Ramaswami. Multi-wavelength hghtwave networks for computer communication. I:EEE Communications Magazine, 31:78-88, 1993.
|
| |
28
|
M. Settembre and F. Maters. All optical implementations of high capacity TDMA networks. Fiber and Integrated Optics, 12:173- 186, 1993.
|
| |
29
|
|
| |
30
|
|
CITED BY 48
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Micah Adler , Ramesh K. Sitaraman , Arnold L. Rosenberg , Walter Unger, Scheduling time-constrained communication in linear networks, Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, p.269-278, June 28-July 02, 1998, Puerto Vallarta, Mexico
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Michele Flammini , Christian Scheideler, Simple, efficient routing schemes for all-optical networks, Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, p.170-179, June 23-25, 1997, Newport, Rhode Island, United States
|
|
|
|
|
|
|
|
|
|
|
|
X.-H. Jia , D.-Z. Du , X.-D. Hu , H.-J. Huang , D.-Y. Li, Optimal placement of wavelength converters in WDM networks for parallel and distributed computing systems, Optical networks: recent advances, Kluwer Academic Publishers, Norwell, MA, 2001
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Alok Aggarwal , Jon Kleinberg , David P. Williamson, Node-disjoint paths on the mesh and a new trade-off in VLSI layout, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.585-594, May 22-24, 1996, Philadelphia, Pennsylvania, United States
|
|
|
|
|
|
Yair Bartal , Amos Fiat , Stefano Leonardi, Lower bounds for on-line graph problems with application to on-line circuit and optical routing, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.531-540, May 22-24, 1996, Philadelphia, Pennsylvania, United States
|
|
|
|
|
|
Eric Bach , Joan Boyar , Leah Epstein , Lene M. Favrholdt , Tao Jiang , Kim S. Larsen , Guo-Hui Lin , Rob Van Stee, Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem, Journal of Scheduling, v.6 n.2, p.131-147, March/April 2003
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|