Thesis (M.A. in City and Regional Planning)--University of California, Berkeley, Fall 2005. / Title from PDF title page (viewed Dec. 13, 2007). "Fall 2005." Includes bibliographical references (p. 81-87).

MPLS, the next-generation backbone architecture, can speed up packet forwarding via label switching. However, if the traversed LSPs (Label Switching Paths) are in congestion, traffic may encounter serious throughput degradation due to packet loss. This performance degradation may become worse and worse unless another forwarding LSP for these traffic flows are allocated. Moreover, in this Thesis, we propose a preemption mechanism for higher-priority flows to obtain necessary resources (the bandwidth of a LSP) by preempting low-priority traffic flows. In the multiple-flow preemption mechanism, several LSPs between Ingress router and Egress router are established to forward traffic flows. Some of these traffic flows are higher priority with stringent QoS requirements. If no satisfactory throughput can be met, Egress router would have to feedback average throughput values to Ingress router, which in turn decides how many lower-priority traffic flows should be preempted and moved to another LSP. Consequently, Ingress router has to send bandwidth reservation messages to reserve bandwidth just released by those lower-priority flows. After that, every core router can process these MPLS packets with specified traffic class to meet their QoS requirements. Finally, for the purpose of demonstration, we embed multiple flow preemption modules into MNS simulator and use it to run some experiments. Since in our scheme, it is not necessary to reserve bandwidth for higher-priority traffic flows in advance, the overall bandwidth utilization can be increased. Furthermore, the higher-priority flows can meet their QoS requirements by preempting the lower-priority flows whenever it is needed.

The rapid growth of wireless and cellular technologies in recent years has brought in various applications in our daily life. Thus, the integration between WLAN and cellular networks has attracted more and more attention to researchers. In this Thesis, we proposed a preemptive channel allocation mechanism for WLAN-embedded cellular networks. In such integrated networking environments, frequent handoffs may result in dramatic performance degradation. In our model, a mobile node first utilizes the cellular network for supporting high mobility. However, the capacity of a BS is easily saturated. To minimize session blocking, a mobile node outside the WLAN coverage can preempt the channel(s) occupied by a mobile node inside the WLAN coverage. The preempted mobile node can still get access to the Internet through the AP of WLAN. For the purpose of performance evaluation, we build a three-dimension Markov Chain to analyze the proposed mechanism. We derive the residence time inside the WLAN coverage and outside the WLAN coverage, respectively. Finally, we evaluate the overall network performance in terms of the number of active sessions over WLAN, the channel utilization of a BS, the probability of session blocking, the preemption probability, and the preempted probability. From the evaluation, we observe the relative performance improvements of our proposed channel preemption mechanisms.

In this Thesis, we propose a Negotiable RSVP with Multiple Preemption for supporting dynamic bandwidth reservation. With the properties of negotiation and preemption, we can re-allocate bandwidth to effectively increase the probability of successful reservations of flows with higher priority. Different from RSVP, negotiable RSVP uses a priority mechanism with many parameters, such as upper-bound bandwidth and upper-bound priority. Negotiable RSVP transmits these parameters by sending Resv Messages such that every RSVP flow possesses individual priority levels. When the available bandwidth is not enough, the arriving new flows can negotiate with the existing reserved flows that have lower priorities. We then estimate the sum of the available bandwidth and the preemptive bandwidth from the reserved flows. If the sum satisfies the lower-bound bandwidth of the arriving new flow, the reservation is successful. At the best case, if the sum can meet its high-bound bandwidth, the system can reserve the high-bound bandwidth for the flow. However, if the sum is lower than its low-bound bandwidth, it will be rejected. To demonstrate the efficiency and feasibility of negotiable RSVP, we build two simulation models, RSVP and Negotiable RSVP, respectively, and compare their simulation results. We have shown that negotiable RSVP can perform better than RSVP in many ways. For example, the probability of successful reservation and the number of reserved flows are significantly increased. We also implement the negotiable RSVP on FreeBSD platform, and measure the percentages of improvements through various experiments.

Thesis (M. S.)--Civil and Environmental Engineering, Georgia Institute of Technology, 2008. / Committee Member: Garrow, Laurie; Committee Member: Hunter, Michael; Committee Member: Meyer, Michael.

Preferential treatments are employed to provide preemption for emergency vehicles (EV) and conditional priority for transit vehicles at signalized intersections. EV preemption employs technologies and signal control strategies seeking to reduce emergency vehicle crash potential and response times. Transit priority employs the same technologies with signal control strategies seeking to reduce travel time and travel time variability. Where both preemption and transit technologies are deployed, operational strategies deconflict simultaneous requests. Thus far, researchers have developed separate evaluation frameworks for preemption and priority. This research addresses the issue of preemption and priority signal control strategies in breadth and depth. In breadth, this research introduces a framework that reveals planning interdependence and operational interaction between preemption and priority from the controlling strategy down to roadway hardware operation under the inclusive title: preferential treatment. This fulfills a current gap in evaluation. In depth, this research focuses on evaluation of EV preemption. There are two major analytical contributions resulting from this research. The first is a method to evaluate the safety benefits of preemption based on conflict analysis. The second is an algorithm, suitable for use in future traffic simulation models, that incorporates the impact of auto driver behavior into the determination of travel time savings for emergency vehicles operating on signalized arterial roadways. These two analytical methods are a foundation for future research that seeks to overcome the principal weakness of current EV preemption evaluation. Current methods, which rely on modeling and simulation tools, do not consider the unique auto driver behaviors observed when emergency vehicles are present. This research capitalizes on data collected during a field operational test in Northern Virginia, which included field observations of emergency vehicles traversing signalized intersections under a wide variety of geometric, traffic flow, and signal operating conditions. The methods provide a means to quantify the role of EV preemption in reducing the number and severity of conflict points and the delay experienced at signalized intersections. This forms a critical basis for developing deployment and operational guidelines, and eventually, warrants. / Ph. D.

Various theories have been proposed to describe vehicular traffic flow in cities on an aggregate level. This dissertation work shows that a number of MFDs exist in an urban network. The number of MFDs basically indicate the existence of different levels of service on different network routes. It also demonstrate that the modification of control strategy can optimize the signal timing plan for the links with high congestion and spillbacks. With the proposed control strategy, the location of points are shifted from lower MFDs to upper MFDs which means the congestion are reduced and the overall network traffic flow operation is improved. In this thesis, the emergency vehicle preemption (EVP) operation is also evaluated by using the MFDs. The concept of MFD can help to illustrate the effect on various types of roads due to EVP operation. The results show that the volume of links along the emergency route is increased and the volume of other links closed to the emergency route is decreased due to preemption. The researchers and practitioners can apply the proposed approach to identify the affected links and minimize the total network delay during EVP. / Master of Science

During the past decades of research in Real-Time systems, non-preemptive scheduling and fully preemptive scheduling have been extensively investigated, as well as compared with each other. However, it has been shown that none of the two scheduling paradigms dominates over the other in terms of schedulability. In this context, Limited Preemptive Scheduling (LPS) has emerged as an attractive alternative with respect to, e.g., increasing the overall system schedu- lability, efficiently reducing the blocking by lower priority tasks (compared to non-preemptive scheduling) as well as efficiently controlling the number of preemptions, thus controlling the overall preemption-related delay (compared to fully-preemptive scheduling). Several approaches within LPS enable the above mentioned advantages. In our work, we consider the Fixed Preemption Point Scheduling (LP-FPP) as it has been proved to effectively reduce the preemption-related delay compared to other LPS approaches. In particular, LP-FPP facilitates more precise estimation of the preemption-related delays, since the preemption points of a task in LP-FPP are explicitly selected during the design phase, unlike the other LPS approaches where the preemption points are determined at runtime. The main goal of the proposed work is to improve the schedulability of real-time systems under the LP-FPP approach. We investigate its use in different domains, such as: single core hard real-time systems, partitioned multi-core systems and real-time systems which can occasionally tolerate deadline misses. We enrich the state of the art for the single core hard real-time systems by proposing a novel cache-related preemption delay analysis, towards reducing the pessimism of the previously proposed methods. In the context of partitioned multi-core scheduling we propose a novel partitioning criterion for the Worst-Fit Decreasing based partitioning, and we also contribute with the comparison of existing partitioning strategies for LP-FPP scheduling. Finally, in the context of real-time systems which can occasionally tolerate deadline misses, we contribute with a probabilistic response time analysis for LP-FPP scheduling and a preemption point selection method for reducing the deadline-misses of the tasks.

Approved for public release; distribution is unlimited / This thesis strives to shed light on the genuine significance of the current transformation of the U.S. foreign and strategic policy. In essence, this thesis concludes that the Bush doctrine of preemption is inconsistent with the American strategic culture and view of the use of force displayed throughout the American foreign policy ever since the Truman administration. Although not a revolution per se in the American goals, the new foreign policy represents a radical change in the manner to pursue them. While promoting a unilateralist foreign policy and revived "warfighting" strategies, the current administration takes old rationales a step further. By elevating preemption from the tactical to strategic level, the doctrine transforms a last resort policy option into a primary offensive strategy with destabilizing consequences for international relations. The analysis concludes that the increased authority of the hard-line approach in the American foreign and security policy is circumstantial, and the likelihood of its endurance is unrealistic. The international system comprises built-in constraints that raise the cost of isolationist and unilateralist impulses to unbearable levels in the long term. These constraints are the end result of the American national values' projection at international level. / Civilian, Romania Ministry of Foreign Affairs

Exclusive bus lanes and the Transit Signal Priority are often not effective in saturated peak-traffic conditions. An alternative way of providing priority for transit can be queue jumpers, which allows buses to bypass and then cut out in front of waiting queue by getting an early green signal. Utah Transit authority deployed Bus Rapid Transit system at Salt Lake County, Utah along W 3500 S. This research evaluates the impacts of queue jumpers with TSP on Bus Rapid Transit (BRT) and private vehicular traffic. Four VISSIM models were developed for analysis : Basic scenario, no TSP with queue jumpers, TSP with no queue jumbers, and TSP with queue jumpers. In TQ scenario travel time was reduced between 13.2-19.82% with respect to basic scenario. At the same time, travel time of private traffic increased very little 0.38-3.28%. Two TSP strategies : green extension and red truncation are implemented in this research work. / by R.M. Zahid Reza. / Thesis (M.S.C.S.)--Florida Atlantic University, 2012. / Includes bibliography. / Mode of access: World Wide Web. / System requirements: Adobe Reader.