#### Filter Results:

- Full text PDF available (28)

#### Publication Year

1967

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Bruce E. Hajek, Galen H. Sasaki
- IEEE Trans. Information Theory
- 1988

- Ori Gerstel, Philip Lin, Galen H. Sasaki
- INFOCOM
- 1998

This work deals with wavelength assignment for lightpaths. We restrict our attention to the near term, in which WDM networks will be in the form of rings and higher level networks will be SONET/SDH self-healing rings. This view changes the goal of wavelength assignment (WLA) vs. previous work on the subject in a number of aspects. First, a pair of SONET… (More)

- Ori Gerstel, Philip Lin, Galen H. Sasaki
- INFOCOM
- 1999

This paper considers grooming of low speed traf-c into high speed lightpaths in a WDM based optical ring with a primary goal of reducing the cost of the entire system, which is dominated by the cost of the SONET transmission equipment connected to the optical ring. The paper attempts to enumerate the architectural options provided by SONET to arrive at a… (More)

- Ori Gerstel, Rajiv Ramaswami, Galen H. Sasaki
- IEEE/ACM Trans. Netw.
- 1998

We provide network designs for optical wavelength division multiptezed (OWDM) rings that minimize overall network cost, rather than just the number of wavelengths needed. The network cost includes the cost of the transceivers required at the nodes as well as the number of wavelengths. The transceiver cost includes the cost of terminating ecluip-ment EM well… (More)

- Rajiv Ramaswami, Galen H. Sasaki
- INFOCOM
- 1997

This paper proposes optical wavelength division multiplexed (WDM) networks with limited wavelength conversion that can eeciently support lightpaths (connections) between nodes. Each lightpath follows a route in the network and must be assigned a channel along each link in its route. The load max of a set of lightpath requests is the maximum over all links… (More)

- Ori Gerstel, Galen Sasaki
- 2001

bridge the gap between two known protection grades of fully protected connections visa -vis unprotected protection. The framework allows to specify the probability with which the connection will be protected, providing the customer with a full range of protection guarantees at possibly different prices. Since connections may be partially protected, the… (More)

- Gerard R. Pieris, Galen H. Sasaki
- IEEE/ACM Trans. Netw.
- 1994

- Qi Deng, Galen Sasaki, Ching-Fong Su
- 2002

The problem of laying out a survivable IP network over a WDM network is considered. The links of the IP network are realized by unprotected lightpaths of the WDM network, and the lightpaths must be routed so that the IP network remains connected after any fault. Crochat and Le Boudec [2] introduced the problem for the case of single fiber-link failures, and… (More)

- Galen H. Sasaki, Bruce E. Hajek
- J. ACM
- 1988

The random, heuristic search algorithm called simulated annealing is considered for the problem of finding the maximum cardinality matching in a graph. It is shown that neither a basic form of the algorithm, nor any other algorithm in a fairly large related class of algorithms, can find maximum cardinality matchings such that the average time required grows… (More)

- Edoardo S. Biagioni, Galen H. Sasaki
- HICSS
- 2003

Sensors can be paired with radio units and deployed to form a wireless ad-hoc sensor network. Actual deployments must consider the coverage that can be achieved with a given number of sensors: this coverage varies with the range of the radios and the maximum allowable distance between any point in the area and the nearest sensor. Deployments must also… (More)