## Efficient routing in alloptical networks (1994)

Venue: | in Proc. 26 th ACM Symp. Theory of Computing |

Citations: | 122 - 0 self |

### BibTeX

@INPROCEEDINGS{Raghavan94efficientrouting,

author = {Prabhakar Raghavan and Eli Upfalt},

title = {Efficient routing in alloptical networks},

booktitle = {in Proc. 26 th ACM Symp. Theory of Computing},

year = {1994},

pages = {134--143}

}

### Years of Citing Articles

### OpenURL

### Abstract

Communication in all-optical networks requires novel routing paradigms. The high bandwidth of the optic fiber is utilized through wavelengthdivision multiplexing: a single physical optical link can carry several logical signals, provided that they are transmitted on different wavelengths. We study the problem of routing a set of requests (each of which is a pair of nodes to be connected by a path) on sparse networks using a limited number of wavelengths, ensuring that different paths using the same wavelength never use the same physical link. The constraints on the selection of paths and wavelengths depend on the type of photonic switches used in the network. We present eflicient routing techniques for the two types of photonic switches that dominate current research in all-optical networks. Our results es-

### Citations

329 | Eigenvalues and expanders
- Alon
- 1986
(Show Context)
Citation Context ...formance of the algorithm to the lower bound in Theorem 1, we use the relation between the edge-expansion fi of a bounded degree graph and the value of its second largest eigenvalue in absolute values=-=[2, 29]-=-: 1 \Gamma O(fi \Gamma1 )s1 \Gamma O(fi \Gamma2 ): Applying this relation, for graphs for which the left hand side is equality kL 2 =T = (k=T )(log n) 2 (log ) 2s(k=T fi 2 )(log n) 2 ; so that the num... |

256 |
Approximate counting, uniform generation and rapidly mixing Markov chains
- Sinclair, Jerrum
- 1989
(Show Context)
Citation Context ...formance of the algorithm to the lower bound in Theorem 1, we use the relation between the edge-expansion fi of a bounded degree graph and the value of its second largest eigenvalue in absolute values=-=[2, 29]-=-: 1 \Gamma O(fi \Gamma1 )s1 \Gamma O(fi \Gamma2 ): Applying this relation, for graphs for which the left hand side is equality kL 2 =T = (k=T )(log n) 2 (log ) 2s(k=T fi 2 )(log n) 2 ; so that the num... |

238 | Fast approximation algorithms for fractional packing and covering problems
- Plotkin, Shmoys, et al.
- 1995
(Show Context)
Citation Context ...elengths available. In addition, they proved results on routing in non-blocking permutation networks using generalized switches. Other related work includes algorithms for integer multicommodity flow =-=[18, 20, 26]-=- and online call assignment [3, 4, 5, 6]. However, there is substantial evidence (see Theorem 17 of [1], for instance) that our problem is considerably harder than integer multicommodity flow, due to ... |

216 | Throughputcompetitive on-line routing
- Awerbuch, Azar, et al.
- 1993
(Show Context)
Citation Context ...oved results on routing in non-blocking permutation networks using generalized switches. Other related work includes algorithms for integer multicommodity flow [18, 20, 26] and online call assignment =-=[3, 4, 5, 6]-=-. However, there is substantial evidence (see Theorem 17 of [1], for instance) that our problem is considerably harder than integer multicommodity flow, due to the severe additional restrictions impos... |

195 |
Dense wavelength division multiplexing network: Principles and applications
- Brackett
- 1990
(Show Context)
Citation Context ...rk and the number of wavelengths required for routing on it. 1. Introduction The subject of this paper is the design of algorithms for an emerging generation of networks known as all-optical networks =-=[12, 15, 16, 17, 23, 27]-=-. These networks promise data transmission rates several orders of magnitudes higher than current networks. The key to high speeds in these networks is to maintain the signal in optical form, thereby ... |

175 | Fast approximation algorithms for multicommodity flow problems
- Leighton, Makedon, et al.
- 1995
(Show Context)
Citation Context ...elengths available. In addition, they proved results on routing in non-blocking permutation networks using generalized switches. Other related work includes algorithms for integer multicommodity flow =-=[18, 20, 26]-=- and online call assignment [3, 4, 5, 6]. However, there is substantial evidence (see Theorem 17 of [1], for instance) that our problem is considerably harder than integer multicommodity flow, due to ... |

144 | On the power of randomization in on-line algorithms
- Ben-David, Borodin, et al.
- 1994
(Show Context)
Citation Context ...id for each step regardless of the adversary's choices; summing probabilities, we can tolerate this for a request sequence of length polynomial in n. All we require is that the adversary be obliviouss=-=[10]-=-: the sequence is prescribed without knowledge of the actual random choices made by the algorithm. We omit a detailed proof of the following theorem. Theorem 8: Let S be a sequence of request insertio... |

84 | Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
- Klein, Plotkin, et al.
- 1994
(Show Context)
Citation Context ...elengths available. In addition, they proved results on routing in non-blocking permutation networks using generalized switches. Other related work includes algorithms for integer multicommodity flow =-=[18, 20, 26]-=- and online call assignment [3, 4, 5, 6]. However, there is substantial evidence (see Theorem 17 of [1], for instance) that our problem is considerably harder than integer multicommodity flow, due to ... |

81 |
Multi-wavelength lightwave networks
- Ramaswami
- 1993
(Show Context)
Citation Context ...rk and the number of wavelengths required for routing on it. 1. Introduction The subject of this paper is the design of algorithms for an emerging generation of networks known as all-optical networks =-=[12, 15, 16, 17, 23, 27]-=-. These networks promise data transmission rates several orders of magnitudes higher than current networks. The key to high speeds in these networks is to maintain the signal in optical form, thereby ... |

79 | Efficient routing and scheduling algorithms for optical networks
- Aggarwal, Bar-Noy, et al.
- 1994
(Show Context)
Citation Context ...path between the pair of nodes in each request, and that no edge will carry two different signals on the same wavelength. For our algorithmic purposes, a wavelength will be an integer in the interval =-=[1; w]-=- for some positive integer w. Generally, we wish to minimize the quantity w, since the cost of switching and amplification devices depends on the number of wavelengths they handle. We will also consid... |

71 |
Theory of Graphs and its Applications
- Berge
- 1958
(Show Context)
Citation Context ...ning wavelengths to the requests corresponds to edge-coloring a multigraph, each node of which corresponds to a spoke in the star. This can be done with at most 3d=2 colors (and no better in general) =-=[11]-=-, where d is the maximum node degree in the multigraph. Finally, it turns out that in the reduction to multigraph edge-coloring, d remains a lower bound on w opt . 2 For rings, we invoke slightly diff... |

58 | Competitive Routing of Virtual Circuits with Unknown Duration
- Awerbuch, Azar, et al.
- 1994
(Show Context)
Citation Context ...oved results on routing in non-blocking permutation networks using generalized switches. Other related work includes algorithms for integer multicommodity flow [18, 20, 26] and online call assignment =-=[3, 4, 5, 6]-=-. However, there is substantial evidence (see Theorem 17 of [1], for instance) that our problem is considerably harder than integer multicommodity flow, due to the severe additional restrictions impos... |

57 | On-line load balancing of temporary tasks
- Azar, Kalyanasundaram, et al.
- 1997
(Show Context)
Citation Context ...oved results on routing in non-blocking permutation networks using generalized switches. Other related work includes algorithms for integer multicommodity flow [18, 20, 26] and online call assignment =-=[3, 4, 5, 6]-=-. However, there is substantial evidence (see Theorem 17 of [1], for instance) that our problem is considerably harder than integer multicommodity flow, due to the severe additional restrictions impos... |

39 |
Algorithms for routing in a linear lightwave network
- Bala, Stern
- 1991
(Show Context)
Citation Context ... constraint on the solution is that no two paths sharing any edge have the same wavelength. The elementary switch cannot direct different frequencies coming into a node along different outgoing edges =-=[7, 19]-=- 1 . It is considerably easier (than the generalized switch) to build, is faster to switch, and it can currently carry a larger number of different wavelengths. It is simplest to think of each node as... |

34 |
Architectures for Linear Lightwave Networks
- Pankaj
- 1992
(Show Context)
Citation Context ...ega\Gamma n) wavelengths using elementary switches, but O(1) wavelengths suffice using generalized switches. 1.2. Related Previous Work Barry and Humblet [9, 8], Pieris and Sasaki [24, 25] and Pankaj =-=[22]-=- have given lower bounds on the number of wavelengths required for permutation routing in any network, independent of topology, with a given number of generalized switches. Pankaj [22] went on to cons... |

33 |
Online machine scheduling with applications to load balancing and virtual circuit routing
- Aspnes, Azar, et al.
- 1993
(Show Context)
Citation Context |

30 |
Optical Computer Architectures
- MCAULAY
- 1991
(Show Context)
Citation Context ...uch networks are in video conferencing, scientific visualization and real-time medical imaging, highspeed supercomputing and distributed computing [16, 27, 30]. The books by Green [27] and by McAulay =-=[21]-=- give a comprehensive overview of the physical theory and applications of this technology. What are the algorithmic issues concerning routing in such networks? The answer depends on the exact physical... |

29 | On the number of wavelengths and switches in all-optical networks
- Barry, Humblet
- 1993
(Show Context)
Citation Context ...nce (in fact, a permutation) that requires \Omega\Gamma n) wavelengths using elementary switches, but O(1) wavelengths suffice using generalized switches. 1.2. Related Previous Work Barry and Humblet =-=[9, 8]-=-, Pieris and Sasaki [24, 25] and Pankaj [22] have given lower bounds on the number of wavelengths required for permutation routing in any network, independent of topology, with a given number of gener... |

29 |
Fiber–Optic Communication Networks
- Green
- 1993
(Show Context)
Citation Context ...rk and the number of wavelengths required for routing on it. 1. Introduction The subject of this paper is the design of algorithms for an emerging generation of networks known as all-optical networks =-=[12, 15, 16, 17, 23, 27]-=-. These networks promise data transmission rates several orders of magnitudes higher than current networks. The key to high speeds in these networks is to maintain the signal in optical form, thereby ... |

21 |
Distributed computing with high-speed optical networks
- Vitter, Du
- 1993
(Show Context)
Citation Context ..., wavelengths) of light. The major applications for such networks are in video conferencing, scientific visualization and real-time medical imaging, highspeed supercomputing and distributed computing =-=[16, 27, 30]-=-. The books by Green [27] and by McAulay [21] give a comprehensive overview of the physical theory and applications of this technology. What are the algorithmic issues concerning routing in such netwo... |

17 |
Bounds on the number of wavelengths needed in wdm networks
- Barry, Humblet
- 1992
(Show Context)
Citation Context ...nce (in fact, a permutation) that requires \Omega\Gamma n) wavelengths using elementary switches, but O(1) wavelengths suffice using generalized switches. 1.2. Related Previous Work Barry and Humblet =-=[9, 8]-=-, Pieris and Sasaki [24, 25] and Pankaj [22] have given lower bounds on the number of wavelengths required for permutation routing in any network, independent of topology, with a given number of gener... |

17 |
A Linear Lightwave Benes Network
- Pieris, Sasaki
- 1993
(Show Context)
Citation Context ...n) that requires \Omega\Gamma n) wavelengths using elementary switches, but O(1) wavelengths suffice using generalized switches. 1.2. Related Previous Work Barry and Humblet [9, 8], Pieris and Sasaki =-=[24, 25]-=- and Pankaj [22] have given lower bounds on the number of wavelengths required for permutation routing in any network, independent of topology, with a given number of generalized switches. Pankaj [22]... |

13 |
Existence and construction of edge disjoint paths on expander graphs
- Broder, Frieze, et al.
- 1994
(Show Context)
Citation Context ... of the proof: Let Q (��) v;w denote the probability that a random walk is at vertex w at step �� given that it started at v. It is known that Q (��) v;w = ��(w) + O( �� p ��(w=-=)=��(v)): (1) Following [13]-=-, our analysis of the algorithm relies heavily on the fact that the trajectories W 0 i (resp. W 00 i ) have the same distribution (up to negligible factors) as independent random random walks of lengt... |

12 |
Architectural considerations for photonic switching
- Hinton
- 1988
(Show Context)
Citation Context |

7 |
All Optical Implementations of High Capacity TDMA Networks,” Fiber and Integrated Optics, 140 Kyungsik Lee et al
- Settembre, Matera
- 2002
(Show Context)
Citation Context ...o switch signals along routes, and to restore signal strength. Signals can be modulated electronically at a maximum bit rate of the order of 10 Gbps, while the optical fiber bandwidth is about 10 THz =-=[28]-=-). The high bandwidth of the optic fiber is utilized through wavelength-division multiplexing: two signals connecting different source-destination pairs may share a link, provided they are transmitted... |

5 |
Review of fundamentals of optical fiber systems
- Personick
- 1983
(Show Context)
Citation Context |

4 |
Accousto-optic tunable filters in narrowband WDM networks
- CHENG
- 1990
(Show Context)
Citation Context ... the study of novel routing techniques that can be implemented with less powerful but feasible switches. The first type of switch we consider is the generalized switch based on accousto-optic filters =-=[14]-=-. Here, signals for different requests may travel on an edge into a node v (on different wavelengths, of course) and then exit v along different edges. Thus, the photonic switch can differentiate betw... |

3 |
Scheduling transmissions in broadcast and select networks. Unpublished manuscript
- Pieris, Sasaki
- 1993
(Show Context)
Citation Context ...n) that requires \Omega\Gamma n) wavelengths using elementary switches, but O(1) wavelengths suffice using generalized switches. 1.2. Related Previous Work Barry and Humblet [9, 8], Pieris and Sasaki =-=[24, 25]-=- and Pankaj [22] have given lower bounds on the number of wavelengths required for permutation routing in any network, independent of topology, with a given number of generalized switches. Pankaj [22]... |

2 | Rooted routing in a linear lightwave networks
- Kovacevic, Gerla
- 1992
(Show Context)
Citation Context ... constraint on the solution is that no two paths sharing any edge have the same wavelength. The elementary switch cannot direct different frequencies coming into a node along different outgoing edges =-=[7, 19]-=- 1 . It is considerably easier (than the generalized switch) to build, is faster to switch, and it can currently carry a larger number of different wavelengths. It is simplest to think of each node as... |

1 | Dense wavelength division multiplexing networks: Principles and applications - Wiley |

1 | Efficient routing and scheduling algorithms [13 - IEEE - 1990 |

1 | Accousto-optic tunable falters [2] Noga Alon. Eigenvslues and expanders. Comin narrowband WDM networks - SODA - 1994 |

1 | possum on Theory of Computing - Awerbuch, Azar, et al. - 1993 |

1 | Accepted for Publication. [6] [7 - Azar, Kalyanasundaram, et al. - 1992 |

1 | Arclntecturesfor hnear lightwave networks - Pankaj - 1992 |