Galen H. Sasaki

Learn More
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 ecluipment EM well(More)
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)
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)
In this paper we consider a broadcast-and-select, wavelength division multiplexed (WDM), optical communication network that is packet switched and time slotted. The amount of time it takes transmitters and receivers to tune from one wavelength to another is assumed to be T slots. We consider all-to-all transmission schedules, which are defined to be ones(More)
effort protection of the optical layer. This framework allows to bridge the gap between two known protection grades of fully protected connections vis-a-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(More)
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)
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)
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)