TRAFFIC IMPACT ANALYSIS OF SEVERAL DYNAMIC LANE MANAGEMENT STRATEGIES FOR CONGESTION MITIGATION BASED ON DTA MODEL

Persistent daily congestion has been increasing in recent years, particularly along major corridors during selected periods in the mornings and evenings. On certain segments, these roadways are often at or near capacity. However, a conventional Predefined control strategy did not fit the demands that changed over time, making it necessary to implement the various dynamical lane management strategies discussed in this thesis. Those strategies include hard shoulder running, reversible HOV lanes, dynamic tolls and variable speed limit. A mesoscopic agent-based DTA model is used to simulate different strategies and scenarios. From the analyses, all strategies aim to mitigate congestion in terms of the average speed and average density. The largest improvement can be found in hard shoulder running and reversible HOV lanes while the other two provide more stable traffic. In terms of average speed and travel time, hard shoulder running is the most congested strategy for I-270 to help relieve the traffic pressure.

Summer Sprite for Orchestra

Summer Sprite for Orchestra was completed in December, 2004. The piece originated from a singular encounter with little angels at Chang-Kyung Palace, which is the oldest and the most beautiful palace in Korea, and where the kings of the Chosun Dynasty (1393-1897) lived. This encounter was in the summer of 2002. I certainly could not prove that those angels I met were real. Possibly they were the reflection of drops of water after a sudden shower on that summer day. However, I definitely remember that short, unforgettable, and mysterious moment and the angels' beautiful dance-like celebration. Summer Sprite is based on these special memories and the encounter with the little angels that summer. Summer Sprite consists of 3 movements: "Greeting," "Encounter," and "Celebration." These follow the course of my encounter with the little angels. In Summer Sprite, I wished to describe the image of the angels as well as the progression of greeting, encounter, and celebration with them. The moods that follow in Summer Sprite are by turns lyrical, poetic, fantastic, mysterious, and dream-like. In each movement, I describe the meeting of angels and composer through the use of the soloists -- violin (sometimes viola) and cello. As suggested by the subtitle of the first movement, "Greeting" portrays the moment when a surprised I met the angels. It begins with tam-tam, marimba, harp, and piano and sets a mysterious and dark mood. The second movement, "Encounter," is shorter than the first movement. This movement provides a more tranquil mood as well as more unique timbres resulting from the use of mutes and special instruments (English horn, harp, crotales, suspended cymbal, and celesta). The delicate expression of the percussion is particularly important in establishing the static mood of this movement . The last movement, °?Celebration,°± is bright and energetic. It is also the longest. Here, I require the most delicate changes of dynamics and tempo, the most vigorous harmonies, and the fastest rhythmic figures, as well as the most independent, lyrical, and poetic melodies. For bright orchestral tone color, I used various kinds of percussion such as timpani, xylophone, marimba, vibraphone, cymbals, side drum, tambourine, triangle, and bass drum. This last movement is divided rondo-like into five sections: The first (mm.1-3), second (mm.4 - rehearsal number 1), third (rehearsal numbers 2-4), fourth (rehearsal numbers 5-7), and fifth, (rehearsal numbers 8 -18). To sum up, Summer Sprite describes an unforgettable and mysterious moment in a my life. My intention was to portray this through a concerto-like framework. A model for this would be Brahms°Ø °?Double Concerto°± in A minor, op.102, in which the solo cello stands for my angel and the solo violin (sometimes solo viola) for me.

Design Optimization and Security For Communication Networks

In this work we introduce a new mathematical tool for optimization of routes, topology design, and energy efficiency in wireless sensor networks. We introduce a vector field formulation that models communication in the network, and routing is performed in the direction of this vector field at every location of the network. The magnitude of the vector field at every location represents the density of amount of data that is being transited through that location. We define the total communication cost in the network as the integral of a quadratic form of the vector field over the network area. With the above formulation, we introduce a mathematical machinery based on partial differential equations very similar to the Maxwell's equations in electrostatic theory. We show that in order to minimize the cost, the routes should be found based on the solution of these partial differential equations. In our formulation, the sensors are sources of information, and they are similar to the positive charges in electrostatics, the destinations are sinks of information and they are similar to negative charges, and the network is similar to a non-homogeneous dielectric media with variable dielectric constant (or permittivity coefficient). In one of the applications of our mathematical model based on the vector fields, we offer a scheme for energy efficient routing. Our routing scheme is based on changing the permittivity coefficient to a higher value in the places of the network where nodes have high residual energy, and setting it to a low value in the places of the network where the nodes do not have much energy left. Our simulations show that our method gives a significant increase in the network life compared to the shortest path and weighted shortest path schemes. Our initial focus is on the case where there is only one destination in the network, and later we extend our approach to the case where there are multiple destinations in the network. In the case of having multiple destinations, we need to partition the network into several areas known as regions of attraction of the destinations. Each destination is responsible for collecting all messages being generated in its region of attraction. The complexity of the optimization problem in this case is how to define regions of attraction for the destinations and how much communication load to assign to each destination to optimize the performance of the network. We use our vector field model to solve the optimization problem for this case. We define a vector field, which is conservative, and hence it can be written as the gradient of a scalar field (also known as a potential field). Then we show that in the optimal assignment of the communication load of the network to the destinations, the value of that potential field should be equal at the locations of all the destinations. Another application of our vector field model is to find the optimal locations of the destinations in the network. We show that the vector field gives the gradient of the cost function with respect to the locations of the destinations. Based on this fact, we suggest an algorithm to be applied during the design phase of a network to relocate the destinations for reducing the communication cost function. The performance of our proposed schemes is confirmed by several examples and simulation experiments. In another part of this work we focus on the notions of responsiveness and conformance of TCP traffic in communication networks. We introduce the notion of responsiveness for TCP aggregates and define it as the degree to which a TCP aggregate reduces its sending rate to the network as a response to packet drops. We define metrics that describe the responsiveness of TCP aggregates, and suggest two methods for determining the values of these quantities. The first method is based on a test in which we drop a few packets from the aggregate intentionally and measure the resulting rate decrease of that aggregate. This kind of test is not robust to multiple simultaneous tests performed at different routers. We make the test robust to multiple simultaneous tests by using ideas from the CDMA approach to multiple access channels in communication theory. Based on this approach, we introduce tests of responsiveness for aggregates, and call it CDMA based Aggregate Perturbation Method (CAPM). We use CAPM to perform congestion control. A distinguishing feature of our congestion control scheme is that it maintains a degree of fairness among different aggregates. In the next step we modify CAPM to offer methods for estimating the proportion of an aggregate of TCP traffic that does not conform to protocol specifications, and hence may belong to a DDoS attack. Our methods work by intentionally perturbing the aggregate by dropping a very small number of packets from it and observing the response of the aggregate. We offer two methods for conformance testing. In the first method, we apply the perturbation tests to SYN packets being sent at the start of the TCP 3-way handshake, and we use the fact that the rate of ACK packets being exchanged in the handshake should follow the rate of perturbations. In the second method, we apply the perturbation tests to the TCP data packets and use the fact that the rate of retransmitted data packets should follow the rate of perturbations. In both methods, we use signature based perturbations, which means packet drops are performed with a rate given by a function of time. We use analogy of our problem with multiple access communication to find signatures. Specifically, we assign orthogonal CDMA based signatures to different routers in a distributed implementation of our methods. As a result of orthogonality, the performance does not degrade because of cross interference made by simultaneously testing routers. We have shown efficacy of our methods through mathematical analysis and extensive simulation experiments.