We consider a yield-management approach to determine whether a restaurant should accept or reject a pending reservation request. This approach was examined by Bossert (2009), where the decision for each request is evaluated by an approximate dynamic program (ADP) that bases its decision on a realization of future demand. This model only considers assigning requests to their desired time slot. We expand Bossert's ADP model to incorporate an element of flexibility that allows requests to be assigned to a time slot that differs from the customer's initially requested time. To estimate the future seat utilization given a particular decision, a new heuristic is presented which evaluates time-slot/table assignments based on the expected number of unused seats likely to result from a given assignment. When compared against naive seating models, the proposed model produced average gains in seat utilization of 25%.

<p>Our main objective of this thesis is to measure the conflict risk and then on the basis of this risk allocate the slots for future communication.</p>

The Lamprey Eel Decline project conducted by the Confederated Tribes of Siletz Indians (CTSI) combined traditional ecological knowledge, scientific research and geographic information science. CTSI wanted to learn why the Pacific lamprey (Lampetra tridentata), a culturally and ecologically important species, was declining in the streams within their native land area. The project included interviewing native elders, characterizing stream habitat, monitoring water quality, creating a geographic information system (GIS) and educating tribal members on the cultural and ecological importance of the Pacific lamprey. Dynamic segmentation, a GIS data structure, was used to link standard stream survey data on the river unit scale to a base stream coverage (1:24,000). Dynamic segmentation efficiently associates georeferenced data to a linear feature, thus allowing the data to be readily assessable on desktop computer systems. To be more useful to the tribal and local resource managers, it is recommended that these GIS coverages of aquatic habitat should be used in conjunction with additional data coverages and basic regional models for watershed analysis and better management of aquatic ecosystems. / Graduation date: 2001

Our main objective of this thesis is to measure the conflict risk and then on the basis of this risk allocate the slots for future communication.

Since the tourism industry is thriving and robust recently in Taiwan, it encourages the demand of domestic tourism a lot. Moreover, the internet surfers and e-commerce is keeping increasing, so that we do the study regarding the On-Line Accommodation Reservation as our case study. In order to obtain the data and samples for this study, we choose the EasyTravel as our casey, and do the individual survey via qualitative interview. EasyTravel established in 1988 and the major business is offering the On-Line Accommodation Reservation service. They started doing the Internet Marketing planning and designing as they understand the acceptance level of Hotel industry for the Online-Promotion is the highest one. For now, owing to keep ploughing and weeding the On-Line Marketing, EasyTravel always occupies on the first page of search result when doing the searching. We hope we could obtain the influence of Internet activity and communicating for the On-Line Accommodation Reservation through understanding its history, the key factors of EasyTravel, and it will be the topic of this study. We found if we long for to build efficiency Internet Marketing activity for On-Line Accommodation Reservation and then prompt the business, we must consider four factors as below: (1).Multiple Integrated Marketing¡GTo run the On-Line Accommodation Reservation more efficiency and increasing the sales, setting the SEO (Search Engine Optimization), implement topical or diversified long term Internet promotion, Blogs Marketing, Community-based social management, and Mobile Service are five main schemes for achieving the goal. (2).Community marketing¡GAs the community-orientated network is being well developed, if we could utilize community tools and its influence effectively, it would be reached yield twice the result with half the effort. (3).To Customize and develop innovative service¡GBefore establishing the innovative service, industry characteristics, customer needs, main stream, and ICT tool should be all considered. Hence, it will not only create the uniqueness and the non-substitutable capabilities but also high up the barriers to entry level for other rivals. (4).Concentrating on core business with a continuous investment.¡GEasyTravel starts earning the profit since 2008, nevertheless they still ought to input more resource in original sales continuously. It is much more vital than step into new business at a profit.

In Wideband DS-CDMA system, increasing the utilization of Orthogonal Variable Spreading Factor (OVSF) code tree can serve more users. As Dynamic Code Assignment (DCA) does, the allocated codes will be reassigned when a new call can¡¦t be served even if the capacity is enough. However, reassigning occupied codes is expensive. In this thesis, we have proposed a state classification code assignment principle and a proportional reservation policy. In the proposed algorithm, the OVSF code tree is classified into four states. Then, the system will decide whether to reassign codes or not by checking the current state of the tree. In other words, the occupied codes will be reallocated in an appropriate occasion. Besides, we reserve vacant and available codes corresponding to the probability of requests for each supported rate when reassignment occurs. Therefore, the reassignment is reduced. It is also proved on the basis of the property of Markov Chain. Taking advantage of the proposed states classification code assignment and the policy of proportional code reservation, the call blocking rate and the number of reassignment can be reduced.

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.

Because of the advancement of wireless networks, it is important to provide quality-of-service (QoS) guarantees as they are expected to support multimedia applications. In this paper we propose a new bandwidth reservation scheme based on the characteristic of the cell equipped with sector antenna. According to this information, the proposed scheme can predict the next location of each connection and precisely reserve bandwidth in appropriate neighboring cells, not all of its neighboring cells. Besides, the proposed scheme uses bandwidth borrowing mechanism to be our call admission control strategy. The combination of bandwidth reservation and bandwidth borrowing provides network users with QoS in terms of guaranteed bandwidth, call blocking and call dropping probabilities.

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 (Ph. D.)--Oregon State University, 2009. / Printout. Includes bibliographical references. Also available on the World Wide Web.