Optimal Segment Size for Fixed-sized Segment Protection in Wavelength-routed Optical Networks

Protecting a network against link failures is a major challenge faced by network operators. The protection scheme has to address two important objectives - fast recovery and minimizing the amount of backup resources needed. Every protection algorithm is a tradeoff between these two objectives. In this paper, we study the problem of segment protection. In particular, we investigate what is the optimal segment size that obtains the best tradeoff between the time taken for recovery and minimizing the bandwidth used by the backup segments. We focus on the uniform fixed-length segment protection method, where each primary path is divided into fixed-length segments, with the exception of the last segment in the path. We observe that the optimal segment size for a given network depends on several factors such as the topology and the ratio of the costs involved.

Managing Large Data Sets Using Support Vector Machines

Hundreds of Terabytes of CMS (Compact Muon Solenoid) data are being accumulated for storage day by day at the University of Nebraska-Lincoln, which is one of the eight US CMS Tier-2 sites. Managing this data includes retaining useful CMS data sets and clearing storage space for newly arriving data by deleting less useful data sets. This is an important task that is currently being done manually and it requires a large amount of time. The overall objective of this study was to develop a methodology to help identify the data sets to be deleted when there is a requirement for storage space. CMS data is stored using HDFS (Hadoop Distributed File System). HDFS logs give information regarding file access operations. Hadoop MapReduce was used to feed information in these logs to Support Vector Machines (SVMs), a machine learning algorithm applicable to classification and regression which is used in this Thesis to develop a classifier. Time elapsed in data set classification by this method is dependent on the size of the input HDFS log file since the algorithmic complexities of Hadoop MapReduce algorithms here are O(n). The SVM methodology produces a list of data sets for deletion along with their respective sizes. This methodology was also compared with a heuristic called Retention Cost which was calculated using size of the data set and the time since its last access to help decide how useful a data set is. Accuracies of both were compared by calculating the percentage of data sets predicted for deletion which were accessed at a later instance of time. Our methodology using SVMs proved to be more accurate than using the Retention Cost heuristic. This methodology could be used to solve similar problems involving other large data sets.

RP97-75 Fixed and Flexible Cash Rental Arrangements for Your Farm

The kind of rental arrangements for cropland vary widely in each locality and from one geographic area to another. What is desirable for one particular landlord/tenant relationship is not acceptable for others. The purpose of this publication is to help tenants and landlords develop fair cash-rent arrangements and assist them in making sound decisions based on a fair evaluation of resources. The first section addresses whether a fixed cash-rent lease arrangement should be used. Part II discusses how to develop a fair fixed cash rental rate, while Part III provides information on setting rent for other cropland, pasture, and buildings. Part IV outlines the advantages and disadvantages of flexible cash-leasing arrangements. Part V discusses the importance of developing a written lease agreement. A sample lease form also is included.

A Fixed Netting System as a Means of Excluding Birds From a Domestic Waste Landfill

Many bird species are attracted to landfills which take domestic or putrescible waste. These sites provide a reliable, rich source of food which can attract large concentrations of birds. The birds may cause conflicts with human interest with respect to noise, birds carrying litter off site, possible transmission of pathogens in bird droppings and the potential for birdstrikes. In the UK there is an 8 mile safeguarding radius around an airfield, within which any planning applications must pass scrutiny from regulatory bodies to show they will not attract birds into the area and increase the birdstrike risk. Peckfield Landfill site near Leeds, West Yorkshire was chosen for a trial of a netting system designed to exclude birds from domestic waste landfills. The site was assessed for bird numbers before the trial, during the netting trial and after the net had been removed. A ScanCord net was installed for 6 weeks, during which time all household waste was tipped inside the net. Gull numbers decreased on the site from a mean of 1074 per hourly count to 29 per hourly count after two days. The gull numbers increased again after the net had been removed. Bird concentrations in the surroundings were also monitored to assess the effect of the net. Bird numbers in the immediate vicinity of the landfill site were higher than those further away. When the net was installed, the bird concentrations adjacent to the landfill site decreased. Corvids were not affected by the net as they fed on covered waste which was available outside the net throughout the trial. This shows that bird problems on a landfill site are complex, requiring a comprehensive policy of bird control. A supporting bird scaring system and clear operating policy for sites near to airports would be required.