-
1
-
-
0028317867
-
Efficient routing and scheduling algorithms for optical networks
-
A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan, Efficient routing and scheduling algorithms for optical networks, in: Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'94), 1994, pp. 412-423.
-
(1994)
Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'94)
, pp. 412-423
-
-
Aggarwal, A.1
Bar-Noy, A.2
Coppersmith, D.3
Ramaswami, R.4
Schieber, B.5
Sudan, M.6
-
2
-
-
0027681690
-
Topologies for wavelength-routing for All-Optical networks
-
M. Ajmone Marsan, A. Bianco, E. Leonardi, F. Neri, Topologies for wavelength-routing for All-Optical networks, IEEE/ACM Trans. Networking 1 (5) (1993) 534-546.
-
(1993)
IEEE/ACM Trans. Networking
, vol.1
, Issue.5
, pp. 534-546
-
-
Ajmone Marsan, M.1
Bianco, A.2
Leonardi, E.3
Neri, F.4
-
5
-
-
0028375404
-
On the number of wavelengths and switches in all-Optical Networks
-
R.A. Barry, P.A. Humblet, On the number of wavelengths and switches in all-Optical Networks, IEEE Trans. Comm. Part I (1994) pp. 523-591.
-
(1994)
IEEE Trans. Comm.
, Issue.1 PART
, pp. 523-591
-
-
Barry, R.A.1
Humblet, P.A.2
-
6
-
-
0029354352
-
Routing in linear lightwave networks
-
K. Bala, T.E. Stern, D. Simchi-Levi, K. Bala, routing in linear lightwave networks, IEEE/ACM Trans. Networking 3 (1995) 459-469.
-
(1995)
IEEE/ACM Trans. Networking
, vol.3
, pp. 459-469
-
-
Bala, K.1
Stern, T.E.2
Simchi-Levi, D.3
Bala, K.4
-
7
-
-
0347312343
-
Graph problems arising from wavelength-routing in All-Optical Networks
-
Geneve, Switzerland, April
-
B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, U. Vaccaro, Graph problems arising from wavelength-routing in All-Optical Networks, 2nd Workshop on Optics and Computer Science (WOCS), Geneve, Switzerland, April 1997.
-
(1997)
2nd Workshop on Optics and Computer Science (WOCS)
-
-
Beauquier, B.1
Bermond, J.-C.2
Gargano, L.3
Hell, P.4
Perennes, S.5
Vaccaro, U.6
-
8
-
-
0004225467
-
-
North-Holland, Amsterdam
-
C. Berge, Graphs, North-Holland, Amsterdam.
-
Graphs
-
-
Berge, C.1
-
10
-
-
0003636164
-
-
Prentice-Hall, Englewood Cliffs, NJ
-
D.P. Bertsekas, J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1989.
-
(1989)
Parallel and Distributed Computation: Numerical Methods
-
-
Bertsekas, D.P.1
Tsitsiklis, J.N.2
-
11
-
-
0025476167
-
Acousto-optic tunable filters in narrowband WDM networks
-
K.W. Cheng, Acousto-optic tunable filters in narrowband WDM networks, IEEE J. Selected Areas Comm. 8 (1990) 1015-1025.
-
(1990)
IEEE J. Selected Areas Comm.
, vol.8
, pp. 1015-1025
-
-
Cheng, K.W.1
-
13
-
-
0024861455
-
Purely optical network for terabit communication
-
I. Chlamtac, A. Ganz, G. Karmi, Purely optical network for terabit communication, Proc. IEEE Infocom '89, 1989, pp. 887-896.
-
(1989)
Proc. IEEE Infocom '89
, pp. 887-896
-
-
Chlamtac, I.1
Ganz, A.2
Karmi, G.3
-
15
-
-
0029324485
-
Software libraries for linear algebra computation on high performances computers
-
J.J. Dongarra, D.W. Walker, Software libraries for linear algebra computation on high performances computers, SIAM Rev. 37 (1995) 151-180.
-
(1995)
SIAM Rev.
, vol.37
, pp. 151-180
-
-
Dongarra, J.J.1
Walker, D.W.2
-
17
-
-
0018998813
-
Minimum-time line broadcast networks
-
A.M. Farley, Minimum-time line broadcast networks, NETWORKS, 10 (1980) 59-70.
-
(1980)
NETWORKS
, vol.10
, pp. 59-70
-
-
Farley, A.M.1
-
18
-
-
0012486481
-
Optimal algorithms for dissemination of information in generalised communication modes
-
Proc. Parallel Architectures and Languages Europe (PARLE '92), Springer, Berlin
-
R. Feldmann, J. Hromkovic, S. Madhavapeddy, B. Monien, P. Mysliwietz, Optimal algorithms for dissemination of information in generalised communication modes, in: Proc. Parallel Architectures and Languages Europe (PARLE '92), Lecture Notes in Computer Science, vol. 605, Springer, Berlin, 1992, pp. 115-130.
-
(1992)
Lecture Notes in Computer Science
, vol.605
, pp. 115-130
-
-
Feldmann, R.1
Hromkovic, J.2
Madhavapeddy, S.3
Monien, B.4
Mysliwietz, P.5
-
19
-
-
0003506603
-
-
Prentice Hall, Englewood Cliffs, NJ
-
G. Fox, M. Johnsson, G. Lyzenga, S. Otto, J. Salmon, D. Walker, Solving Problems on Concurrent Processors, vol. I, Prentice Hall, Englewood Cliffs, NJ, 1988.
-
(1988)
Solving Problems on Concurrent Processors
, vol.1
-
-
Fox, G.1
Johnsson, M.2
Lyzenga, G.3
Otto, S.4
Salmon, J.5
Walker, D.6
-
20
-
-
0002675271
-
Methods and problems of communication in usual networks
-
P. Fraignaud, E. Lazard, Methods and problems of communication in usual networks, Discrete Appl. Math. 53 (1994) 79-134.
-
(1994)
Discrete Appl. Math.
, vol.53
, pp. 79-134
-
-
Fraignaud, P.1
Lazard, E.2
-
23
-
-
84986959281
-
A survey of gossiping and broadcasting in communication networks
-
S.M. Hedetniemi, S.T. Hedetniemi, A. Liestman, A survey of gossiping and broadcasting in communication networks, NETWORKS 18 (1988) 129-134.
-
(1988)
NETWORKS
, vol.18
, pp. 129-134
-
-
Hedetniemi, S.M.1
Hedetniemi, S.T.2
Liestman, A.3
-
25
-
-
0029254267
-
Optimal broadcast in all-port wormhole-routed hypercubes
-
C.-T. Ho, M.-Y. Kao, Optimal broadcast in all-port wormhole-routed hypercubes. IEEE Trans. Parallel Distributed Systems 6 (2) (1995) 200-204.
-
(1995)
IEEE Trans. Parallel Distributed Systems
, vol.6
, Issue.2
, pp. 200-204
-
-
Ho, C.-T.1
Kao, M.-Y.2
-
26
-
-
0001330646
-
Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping)
-
Ding-Zhu Du, D. Frank Hsu (Eds.), Kluwer Academic Publishers, Desdrecht
-
J. Hromkovič, R. Klasing, B. Monien, R. Peine, Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping), in: Ding-Zhu Du, D. Frank Hsu (Eds.), Combinatorial Network Theory, Kluwer Academic Publishers, Desdrecht, 1995, pp. 125-212.
-
(1995)
Combinatorial Network Theory
, pp. 125-212
-
-
Hromkovič, J.1
Klasing, R.2
Monien, B.3
Peine, R.4
-
27
-
-
84959254888
-
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
-
Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT'94), Springer, Berlin
-
J. Hromkovič, R. Klasing, W. Unger, H. Wagener, Optimal algorithms for broadcast and gossip in the edge-disjoint path modes, in: Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT'94), Lecture Notes in Computer Science, vol. 824, Springer, Berlin, 1994, pp. 219-230.
-
(1994)
Lecture Notes in Computer Science
, vol.824
, pp. 219-230
-
-
Hromkovič, J.1
Klasing, R.2
Unger, W.3
Wagener, H.4
-
28
-
-
84937432064
-
Efficient wavelength routing in directed fiber trees
-
Diaz and Serna (Eds.) Proc. Ann. European Symp. on Algorithms, Springer, Berlin
-
K. Kaklamanis, G. Persiano, Efficient wavelength routing in directed fiber trees, in: Diaz and Serna (Eds.) Proc. Ann. European Symp. on Algorithms, Lecture Notes in Computer Science, Springer, Berlin, 1996, pp. 460-470.
-
(1996)
Lecture Notes in Computer Science
, pp. 460-470
-
-
Kaklamanis, K.1
Persiano, G.2
-
29
-
-
84947791225
-
The relationship between gossiping in vertex-disjoint paths mode and bisection width
-
proc. 19th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS'94), Springer, Berlin, 841
-
R. Klasing, The relationship between gossiping in vertex-disjoint paths mode and bisection width, proc. 19th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS'94), Lecture Notes in Computer Science, vol. 841, Springer, Berlin, 841, 1994, pp. 473-483.
-
(1994)
Lecture Notes in Computer Science
, vol.841
, pp. 473-483
-
-
Klasing, R.1
-
31
-
-
0024135198
-
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
-
F.T. Leighton, S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in: Proc. 29th Ann. IEEE Symp. on Foundations of Computer Science (FOCS'88), 1988, pp. 422-431.
-
(1988)
Proc. 29th Ann. IEEE Symp. on Foundations of Computer Science (FOCS'88)
, pp. 422-431
-
-
Leighton, F.T.1
Rao, S.2
-
34
-
-
0002601802
-
Minimale n-fach Kantenzusammenhangende Graphen
-
W. Mader, Minimale n-fach Kantenzusammenhangende Graphen, Math. Ann. 191 (1971) 21-28.
-
(1971)
Math. Ann.
, vol.191
, pp. 21-28
-
-
Mader, W.1
-
36
-
-
0029547691
-
Efficient access to optical bandwidth
-
M. Mihail, K. Kaklamanis, S. Rao, Efficient access to optical bandwidth, in: Proc. 36th Ann. IEEE Symp. on Foundations of Computer Science (FOCS'95), 1995, pp. 548-557.
-
(1995)
Proc. 36th Ann. IEEE Symp. on Foundations of Computer Science (FOCS'95)
, pp. 548-557
-
-
Mihail, M.1
Kaklamanis, K.2
Rao, S.3
-
37
-
-
0026868480
-
WDM-based local lightwave networks, Part I: Single-hop systems
-
B. Mukherjee, WDM-based local lightwave networks, Part I: single-hop systems, IEEE Networks 6 (1992) 12-27.
-
(1992)
IEEE Networks
, vol.6
, pp. 12-27
-
-
Mukherjee, B.1
-
38
-
-
84945715099
-
WDM-based local lightwave networks, Part II: Multihop systems
-
B. Mukherjee, WDM-based local lightwave networks, Part II: multihop systems, IEEE Networks 6 (1992) 20-32.
-
(1992)
IEEE Networks
, vol.6
, pp. 20-32
-
-
Mukherjee, B.1
-
39
-
-
0003809453
-
-
Ph.D. Thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, MA
-
R.K. Pankaj, Architectures for linear lightwave networks, Ph.D. Thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 1992.
-
(1992)
Architectures for Linear Lightwave Networks
-
-
Pankaj, R.K.1
-
40
-
-
0012614841
-
Fault tolerant broadcasting and gossiping in communication networks
-
A. Pelc, Fault tolerant broadcasting and gossiping in communication networks, NETWORKS 28 (1996) 143-156.
-
(1996)
NETWORKS
, vol.28
, pp. 143-156
-
-
Pelc, A.1
-
41
-
-
0020732662
-
Review of fundamentals of optical fiber systems
-
S. Personick, Review of fundamentals of optical fiber systems, IEEE J. Selected Areas Comm. 3 (1983) 373-380.
-
(1983)
IEEE J. Selected Areas Comm.
, vol.3
, pp. 373-380
-
-
Personick, S.1
-
44
-
-
84944291613
-
Multi-wavelength lightwave networks for computer communication
-
R. Ramaswami, Multi-wavelength lightwave networks for computer communication, IEEE Comm. Mag. 31 (1993) 78-88.
-
(1993)
IEEE Comm. Mag.
, vol.31
, pp. 78-88
-
-
Ramaswami, R.1
-
45
-
-
0029386683
-
Routing and wavelength assignement in all-optical networks
-
R. Ramaswami, K. Sivarajan, Routing and wavelength assignement in all-optical networks, IEEE/ACM Trans. Networking 3 (1995) 489-500.
-
(1995)
IEEE/ACM Trans. Networking
, vol.3
, pp. 489-500
-
-
Ramaswami, R.1
Sivarajan, K.2
-
47
-
-
0002441782
-
Expanding and forwarding
-
P. Sole, Expanding and forwarding, Discrete Appl. Math. 58 (1995) 67-78.
-
(1995)
Discrete Appl. Math.
, vol.58
, pp. 67-78
-
-
Sole, P.1
-
48
-
-
0041011197
-
Distributed computing with high-speed optical networks
-
R.J. Vetter, D.H.C. Du, Distributed computing with high-speed optical networks, IEEE Comput. 26, (1993) 8-18.
-
(1993)
IEEE Comput.
, vol.26
, pp. 8-18
-
-
Vetter, R.J.1
Du, D.H.C.2
-
49
-
-
0026169571
-
The communication complexity of atomic commitment and gossiping
-
O. Wolfson, A. Segall, The communication complexity of atomic commitment and gossiping, SIAM J. Comput. 20 (1991) 423-450.
-
(1991)
SIAM J. Comput.
, vol.20
, pp. 423-450
-
-
Wolfson, O.1
Segall, A.2
|