DiffServer: Application Level Differentiated Services for Web Servers

Web content hosting, in which a Web server stores and provides Web access to documents for different customers, is becoming increasingly common. For example, a web server can host webpages for several different companies and individuals. Traditionally, Web Service Providers (WSPs) provide all customers with the same level of performance (best-effort service). Most service differentiation has been in the pricing structure (individual vs. business rates) or the connectivity type (dial-up access vs. leased line, etc.). This report presents DiffServer, a program that implements two simple, server-side, application-level mechanisms (server-centric and client-centric) to provide different levels of web service. The results of the experiments show that there is not much overhead due to the addition of this additional layer of abstraction between the client and the Apache web server under light load conditions. Also, the average waiting time for high priority requests decreases significantly after they are assigned priorities as compared to a FIFO approach.

Group Rekeying Schemes for Secure Group Communication in Wireless Sensor Networks

Wireless sensor networks are promising solutions for many applications. However, wireless sensor nodes suffer from many constraints such as low computation capability, small memory, limited energy resources, and so on. Grouping is an important technique to localize computation and reduce communication overhead in wireless sensor networks. In this paper, we use grouping to refer to the process of combining a set of sensor nodes with similar properties. We propose two centralized group rekeying (CGK) schemes for secure group communication in sensor networks. The lifetime of a group is divided into three phases, i.e., group formation, group maintenance, and group dissolution. We demonstrate how to set up the group and establish the group key in each phase. Our analysis shows that the proposed two schemes are computationally efficient and secure.

The Performance of Elliptic Curve Based Group Diffie-Hellman Protocols for Secure Group Communication over Ad Hoc Networks

The security of the two party Diffie-Hellman key exchange protocol is currently based on the discrete logarithm problem (DLP). However, it can also be built upon the elliptic curve discrete logarithm problem (ECDLP). Most proposed secure group communication schemes employ the DLP-based Diffie-Hellman protocol. This paper proposes the ECDLP-based Diffie-Hellman protocols for secure group communication and evaluates their performance on wireless ad hoc networks. The proposed schemes are compared at the same security level with DLP-based group protocols under different channel conditions. Our experiments and analysis show that the Tree-based Group Elliptic Curve Diffie-Hellman (TGECDH) protocol is the best in overall performance for secure group communication among the four schemes discussed in the paper. Low communication overhead, relatively low computation load and short packets are the main reasons for the good performance of the TGECDH protocol.

JVM-based Techniques for Improving Java Observability

Observability measures the support of computer systems to accurately capture, analyze, and present (collectively observe) the internal information about the systems. Observability frameworks play important roles for program understanding, troubleshooting, performance diagnosis, and optimizations. However, traditional solutions are either expensive or coarse-grained, consequently compromising their utility in accommodating today’s increasingly complex software systems. New solutions are emerging for VM-based languages due to the full control language VMs have over program executions. Existing such solutions, nonetheless, still lack flexibility, have high overhead, or provide limited context information for developing powerful dynamic analyses. In this thesis, we present a VM-based infrastructure, called marker tracing framework (MTF), to address the deficiencies in the existing solutions for providing better observability for VM-based languages. MTF serves as a solid foundation for implementing fine-grained low-overhead program instrumentation. Specifically, MTF allows analysis clients to: 1) define custom events with rich semantics ; 2) specify precisely the program locations where the events should trigger; and 3) adaptively enable/disable the instrumentation at runtime. In addition, MTF-based analysis clients are more powerful by having access to all information available to the VM. To demonstrate the utility and effectiveness of MTF, we present two analysis clients: 1) dynamic typestate analysis with adaptive online program analysis (AOPA); and 2) selective probabilistic calling context analysis (SPCC). In addition, we evaluate the runtime performance of MTF and the typestate client with the DaCapo benchmarks. The results show that: 1) MTF has acceptable runtime overhead when tracing moderate numbers of marker events; and 2) AOPA is highly effective in reducing the event frequency for the dynamic typestate analysis; and 3) language VMs can be exploited to offer greater observability.

HAWAIIAN SUGAR CANE RAT CONTROL METHODS AND PROBLEMS

The problem of rats in our Hawaiian sugar cane fields has been with us for a long time. Early records tell of heavy damage at various times on all the islands where sugar cane is grown. Many methods were tried to control these rats. Trapping was once used as a control measure, a bounty was used for a time, gangs of dogs were trained to catch the rats as the cane was harvested. Many kinds of baits and poisons were used. All of these methods were of some value as long as labor was cheap. Our present day problem started when the labor costs started up and the sugar industry shifted to long cropping. Until World War II cane was an annual crop. After the war it was shifted to a two year crop, three years in some places. Depending on variety, location, and soil we raise 90 to 130 tons of sugar cane per acre, which produces 7 to 15 tons of sugar per acre for a two year crop. This sugar brings about $135 dollars per ton. This tonnage of cane is a thick tangle of vegetation. The cane grows erect for almost a year, as it continues to grow it bends over at the base. This allows the stalk to rest on the ground or on other stalks of cane as it continues to grow. These stalks form a tangled mat of stalks and dead leaves that may be two feet thick at the time of harvest. At the same time the leafy growing portion of the stalk will be sticking up out of the mat of cane ten feet in the air. Some of these individual stalks may be 30 feet long and still growing at the time of harvest. All this makes it very hard to get through a cane field as it is one long, prolonged stumble over and through the cane. It is in this mat of cane that our three species of rats live. Two species are familiar to most people in the pest control field. Rattus norvegicus and Rattus rattus. In the latter species we include both the black rat and the alexandrine rats, their habits seem to be the same in Hawaii. Our third rat is the Polynesian rat, Rattus exlans, locally called the Hawaiian rat. This is a small rat, the average length head to tip of tail is nine inches and the average body weight is 65 grams. It has dark brownish fur like the alexandrine rats, and a grey belly. It is found in Indonesia, on most of the islands of Oceania and in New Zealand. All three rats live in our cane fields and the brushy and forested portions of our islands. The norway and alexandrine rats are found in and around the villages and farms, the Polynesian rat is only found in the fields and waste areas. The actual amount of damage done by rats is small, but destruction they cause is large. The rats gnaw through the rind of the cane stalk and eat the soft juicy and sweet tissues inside. They will hollow out one to several nodes per stalk attacked. The effect to the cane stalk is like ringing a tree. After this attack the stalk above the chewed portion usually dies, and sometimes the lower portion too. If the rat does not eat through the stalk the cane stalk could go on living and producing sugar at a reduced rate. Generally an injured stalk does not last long. Disease and souring organisms get in the injury and kill the stalk. And if this isn't enough, some insects are attracted to the injured stalk and will sometimes bore in and kill it. An injured stalk of cane doesn't have much of a chance. A rat may only gnaw out six inches of a 30 foot stalk and the whole stalk will die. If the rat only destroyed what he ate we could ignore them but they cause the death of too much cane. This dead, dying, and souring cane cause several direct and indirect tosses. First we lose the sugar that the cane would have produced. We harvest all of our cane mechanically so we haul the dead and souring cane to the mill where we have to grind it with our good cane and the bad cane reduces the purity of the sugar juices we squeeze from the cane. Rats reduce our income and run up our overhead.