Elimination of All-Optical Cycles in Wavelength-Routed Optical Networks

A transparent (wide-area) wavelength-routed optical network may be constructed by using wavelength cross-connect switches connected together by fiber to form an arbitrary mesh structure. The network is accessed through electronic stations that are attached to some of these cross-connects. These wavelength cross-connect switches have the property that they may configure themselves into unspecified states. Each input port of a switch is always connected to some output port of the switch whether or not such a connection is required for the purpose of information transfer. Due to the presence of these unspecified states, there exists the possibility of setting up unintended alloptical cycles in the network (viz., a loop with no terminating electronics in it). If such a cycle contains amplifiers [e.g., Erbium- Doped Fiber Amplifiers (EDFA’s)], there exists the possibility that the net loop gain is greater than the net loop loss. The amplified spontaneous emission (ASE) noise from amplifiers can build up in such a feedback loop to saturate the amplifiers and result in oscillations of the ASE noise in the loop. Such all-optical cycles as defined above (and hereafter referred to as “white” cycles) must be eliminated from an optical network in order for the network to perform any useful operation. Furthermore, for the realistic case in which the wavelength cross-connects result in signal crosstalk, there is a possibility of having closed cycles with oscillating crosstalk signals. We examine algorithms that set up new transparent optical connections upon request while avoiding the creation of such cycles in the network. These algorithms attempt to find a route for a connection and then (in a post-processing fashion) configure switches such that white cycles that might get created would automatically get eliminated. In addition, our call-set-up algorithms can avoid the possibility of crosstalk cycles.

Routing and Wavelength Assignment (RWA) with Power Considerations In All- Optical Wavelength-Routed Networks

Routing and wavelength assignment (RWA) is an important problem that arises in wavelength division multiplexed (WDM) optical networks. Previous studies have solved many variations of this problem under the assumption of perfect conditions regarding the power of a signal. In this paper, we investigate this problem while allowing for degradation of routed signals by components such as taps, multiplexers, and fiber links. We assume that optical amplifiers are preplaced. We investigate the problem of routing the maximum number of connections while maintaining proper power levels. The problem is formulated as a mixed-integer nonlinear program and two-phase hybrid solution approaches employing two different heuristics are developed

Routing Algorithms for All-Optical Networks with Power Considerations: The Unicast Case

In this paper, we investigate the problem of routing connections in all-optical networks while allowing for degradation of routed signals by different optical components. To overcome the complexity of the problem, we divide it into two parts. First, we solve the pure RWA problem using fixed routes for every connection. Second, power assignment is accomplished by either using the smallest-gain first (SGF) heuristic or using a genetic algorithm. Numerical examples on a wide variety of networks show that (a) the number of connections established without considering the signal attenuation was most of the time greater than that achievable considering attenuation and (b) the genetic solution quality was much better than that of SGF, especially when the conflict graph of the connections generated by the linear solver is denser.

School of Natural Resource Sciences

Good afternoon. Thank you for asking me to be with you today; I welcome this opportunity to talk with you, to hear what you're thinking, and to participate with you in an exchange of ideas. I've been asked to make some prepared remarks this afternoon, and when those are ended I welcome your ideas, your questions, and your comments. I look forward to more discussions with you at other times, as well. I do have open hours Friday afternoons, and encourage faculty and staff to stop by to visit, to share an idea, to ask a question, or to just visit. Sometimes duties call me away, as they will for the next few Fridays, but I try to be available as many Friday afternoons as possible for drop-in visitors. I hope you'll be among them. As a big believer in the land grant university, with our mission of teaching, research, and extension education, I also am a big believer that it takes all of us, working together, to fulfill that mission.

Bovine Tb Eradication Project – Recognizing Hot Button Issues

The Michigan Departments of Agriculture, Community Health, and Natural Resources, US Department of Agriculture (USDA) and Michigan State University work cooperatively together as the bovine TB eradication project partners. The interagency group combines expertise in epidemiology, veterinary and human medicine, pathology, wildlife biology, animal husbandry, regulatory law and policy and risk communications. The stakeholders, those impacted by the disease, include agriculture and tourism industry representatives, “Mom-and-Pop” businesses, hunters, wildlife enthusiasts, farmers, Local Health Departments and legislators. The regulatory agencies are the above mentioned project partners, excluding MSU and USDA Wildlife Services, both of which offer services to agencies and stakeholders. Eradicating bovine TB would not be difficult if there were no social issues surrounding it. The economy, hunting traditions, animal management, tourism and human health are all impacted by regulatory response to the disease. Often the social issues play a large role in decision making, therefore it is important to understand your clientele and anticipate public reaction to policy changes and requirements.

Selection of Switching Sites in All-Optical Nework Topology Design

In this paper, we consider the problem of topology design for optical networks. We investigate the problem of selecting switching sites to minimize total cost of the optical network. The cost of an optical network can be expressed as a sum of three main factors: the site cost, the link cost, and the switch cost. To the best of our knowledge, this problem has not been studied in its general form as investigated in this paper. We present a mixed integer quadratic programming (MIQP) formulation of the problem to find the optimal value of the total network cost. We also present an efficient heuristic to approximate the solution in polynomial time. The experimental results show good performance of the heuristic. The value of the total network cost computed by the heuristic varies within 2% to 21% of its optimal value in the experiments with 10 nodes. The total network cost computed by the heuristic for 51% of the experiments with 10 node network topologies varies within 8% of its optimal value. We also discuss the insight gained from our experiments.

SAMPLING OF CORN TO ASSESS BIRD DAMAGE: A Preliminary Review of a Comprehensive Study

"How large a sample is needed to survey the bird damage to corn in a county in Ohio or New Jersey or South Dakota?" Like those in the Bureau of Sport Fisheries and Wildlife and the U.S.D.A. who have been faced with a question of this sort we found only meager information on which to base an answer, whether the problem related to a county in Ohio or to one in New Jersey, or elsewhere. Many sampling methods and rates of sampling did yield reliable estimates but the judgment was often intuitive or based on the reasonableness of the resulting data. Later, when planning the next study or survey, little additional information was available on whether 40 samples of 5 ears each or 5 samples of 200 ears should be examined, i.e., examination of a large number of small samples or a small number of large samples. What information is needed to make a reliable decision? Those of us involved with the Agricultural Experiment Station regional project concerned with the problems of bird damage to crops, known as NE-49, thought we might supply an ans¬wer if we had a corn field in which all the damage was measured. If all the damage were known, we could then sample this field in various ways and see how the estimates from these samplings compared to the actual damage and pin-point the best and most accurate sampling procedure. Eventually the investigators in four states became involved in this work1 and instead of one field we were able to broaden the geographical base by examining all the corn ears in 2 half-acre sections of fields in each state, 8 sections in all. When the corn had matured well past the dough stage, damage on each corn ear was assessed, without removing the ear from the stalk, by visually estimating the percent of the kernel surface which had been destroyed and rating it in one of 5 damage categories. Measurements (by row-centimeters) of the rows of kernels pecked by birds also were made on selected ears representing all categories and all parts of each field section. These measurements provided conversion factors that, when fed into a computer, were applied to the more than 72,000 visually assessed ears. The machine now had in its memory and could supply on demand a map showing each ear, its location and the intensity of the damage.