No / Localized Quality of Service (QoS) routing has recently been proposed as a viable alternative approach to traditional QoS routing algorithms that use global state information. In this approach, problems associated with maintaining global state information and the staleness of such information are avoided by having the source nodes to infer the network QoS state based on flow blocking statistics collected locally, and perform flow routing using this localized view of the network QoS state . In this paper we introduce a credit based routing algorithm (cbr) which is a simple yet effective localized QoS routing algorithm. We compare its performance against the localized proportional sticky routing (psr) algorithm same time complexity. using different types of network topologies, QoS requirements and traffic patterns and under a wide range of traffic loads. Extensive simulations show that our algorithm outperforms the psr algorithm with the same time complexity.

We develop and analyze a class of CAC algorithms for resource management in wireless networks with the goal not only to satisfy QoS constraints, but also to maximize a value or reward objective function specified by the system. We demonstrate through analytical modeling and simulation validation that the CAC algorithms developed in this research for resource management can greatly improve the system reward obtainable with QoS guarantees, when compared with existing CAC algorithms designed for QoS satisfaction only. We design hybrid partitioning-threshold, spillover and elastic CAC algorithms based on the design techniques of partitioning, setting thresholds and probabilistic call acceptance to use channel resources for servicing distinct QoS classes. For each CAC algorithm developed, we identify optimal resource management policies in terms of partitioning or threshold settings to use channel resources. By comparing these CAC algorithms head-to-head under identical conditions, we determine the best algorithm to be used at runtime to maximize system reward with QoS guarantees for servicing multiple service classes in wireless networks. We study solution correctness, solution optimality and solution efficiency of the class of CAC algorithms developed. We ensure solution optimality by comparing optimal solutions achieved with those obtained by ideal CAC algorithms via exhaustive search. We study solution efficiency properties by performing complexity analyses and ensure solution correctness by simulation validation based on real human mobility data. Further, we analyze the tradeoff between solution optimality vs. solution efficiency and suggest the best CAC algorithm used to best tradeoff solution optimality for solution efficiency, or vice versa, to satisfy the system's solution requirements. Moreover, we develop design principles that remain applicable despite rapidly evolving wireless network technologies since they can be generalized to deal with management of 'resources' (e.g., wireless channel bandwidth), 'cells' (e.g., cellular networks), "connections" (e.g., service calls with QoS constraints), and "reward optimization" (e.g., revenue optimization in optimal pricing determination) for future wireless service networks. To apply the CAC algorithms developed, we propose an application framework consisting of three stages: workload characterization, call admission control, and application deployment. We demonstrate the applicability with the optimal pricing determination application and the intelligent switch routing application. / Ph. D.

Managing mobile ad hoc networks (MANETs) presents new challenges due to the need for a distributed management mechanism that can efficiently adapt to the dynamic nature of these networks. In particular, provisioning and management of Quality of Service (QoS) in such networks remains a challenging task. Previous works in this field have focused largely on the monitoring and data collection aspects of network management; literature on the provisioning of devices and protocol support for MANET configuration is scarce. One approach for QoS provisioning and management in the Internet that has met with considerable interest in the networking community is that of Policy-Based Network Management (PBNM). However, its application has been so far limited mainly to fixed high-bandwidth networks. In this research, we apply the PBNM concept, for the first time, for managing QoS in ad hoc networks. We formulate a framework to understand the various crucial components that should comprise an ad hoc network management system. We propose a taxonomy of policy architectures to classify the various feasible architectures into distinct categories. Based on our assessment using the taxonomy, we identify architectures that seem promising for managing ad hoc networks. We propose a solution suite to address the different challenges in deploying policy-based management in MANETs. These solutions include k-hop clustering, Dynamic Service Redundancy (DynaSeR), inter-domain policy negotiation, and automated service discovery. We propose extensions to the standard Common Open Policy Service (COPS) protocol and suggest methods for cross-layer interaction to implement our solutions. Our methodology focuses on both a prototype implementation and experimental analysis using wired and wireless testbed networks, and modeling and performance evaluation using simulation. The whole exercise of conducting experiments provided valuable insight into the challenges of operating in an actual ad hoc network environment; implementation and testing facilitated assessment of the feasibility of our proposed schemes. Simulation allowed us to evaluate our solutions for different cluster sizes, network densities, and node mobility. The scalability of our solutions was tested with networks of up to 100 nodes. In general, average service availability for the PBNM system improved as the cluster size increased, with decreased COPS connection overhead (the tradeoff is increased unpredictability, longer response time, and resource requirements at intermediate nodes to support larger clusters). We were also able to determine that, for a given cluster size, our proposed delegation scheme resulted in a 10 to 25% improvement in service availability. Using our proposed time-based heuristic, savings on the order of 50 to 400% were obtained in the service discovery overhead for larger cluster sizes. We also validated some of the simulation results against proof-of-concept experiments conducted using the testbed. We presented a working illustration of our PBNM system prototype by demonstrating its application for managing QoS for multimedia and real-time mission critical applications in a multi-domain ad hoc network. The policy-based approach is a promising one for the management of MANETs, but it requires the flexibility to adapt to a constantly changing environment. Through experimental studies and simulation, we were able to determine that using our proposed solution suite and through the addition of a set of extensions to the COPS protocol, we can achieve our objective of a self-organizing, robust, and efficient PBNM system for managing MANETs. / Ph. D.

Even if 3rd and 4th generation wireless systems aim to achieve multimedia services at high speed, it is rather difficult to have full-fledged multimedia services due to insufficient capacity of the systems. There are many technical challenges placed on us in order to realize the real multimedia services. One of those challenges is how efficiently to allocate resources to traffic as the wireless systems evolve. The review of the literature shows that strategic manipulation of traffic can lead to an efficient use of resources in both wire-line and wireless networks. This aspect brings our attention to the role of link layer protocols, which is to orchestrate the transmission of packets in an efficient way using given resources. Therefore, the Media Access Control (MAC) layer plays a very important role in this context. In this research, we investigate technical challenges involving resource control and management in the design of MAC protocols based on the characteristics of traffic, and provide some strategies to solve those challenges. The first and foremost matter in wireless MAC protocol research is to choose the type of multiple access schemes. Each scheme has advantages and disadvantages. We choose Wireless Code Division Multiple Access/Time Division Duplexing (WCDMA/TDD) systems since they are known to be efficient for bursty traffic. Most existing MAC protocols developed for WCDMA/TDD systems are interested in the performance of a unidirectional link, in particular in the uplink, assuming that the number of slots for each link is fixed a priori. That ignores the dynamic aspect of TDD systems. We believe that adaptive dynamic slot allocation can bring further benefits in terms of efficient resource management. Meanwhile, this adaptive slot allocation issue has been dealt with from a completely different angle. Related research works are focused on the adaptive slot allocation to minimize inter-cell interference under multi-cell environments. We believe that these two issues need to be handled together in order to enhance the performance of MAC protocols, and thus embark upon a study on the adaptive dynamic slot allocation for the MAC protocol. This research starts from the examination of key factors that affect the adaptive allocation strategy. Through the review of the literature, we conclude that traffic characterization can be an essential component for this research to achieve efficient resource control and management. So we identify appropriate traffic characteristics and metrics. The volume and burstiness of traffic are chosen as the characteristics for our adaptive dynamic slot allocation. Based on this examination, we propose four major adaptive dynamic slot allocation strategies: (i) a strategy based on the estimation of burstiness of traffic, (ii) a strategy based on the estimation of volume and burstiness of traffic, (iii) a strategy based on the parameter estimation of a distribution of traffic, and (iv) a strategy based on the exploitation of physical layer information. The first method estimates the burstiness in both links and assigns the number of slots for each link according to a ratio of these two estimates. The second method estimates the burstiness and volume of traffic in both links and assigns the number of slots for each link according to a ratio of weighted volumes in each link, where the weights are driven by the estimated burstiness in each link. For the estimation of burstiness, we propose a new burstiness measure that is based on a ratio between peak and median volume of traffic. This burstiness measure requires the determination of an observation window, with which the median and the peak are measured. We propose a dynamic method for the selection of the observation window, making use of statistical characteristics of traffic: Autocorrelation Function (ACF) and Partial ACF (PACF). For the third method, we develop several estimators to estimate the parameters of a traffic distribution and suggest two new slot allocation methods based on the estimated parameters. The last method exploits physical layer information as another way of allocating slot to enhance the performance of the system. The performance of our proposed strategies is evaluated in various scenarios. Major simulations are categorized as: simulation on data traffic, simulation on combined voice and data traffic, simulation on real trace data. The performance of each strategy is evaluated in terms of throughput and packet drop ratio. In addition, we consider the frequency of slot changes to assess the performance in terms of control overhead. We expect that this research work will add to the state of the knowledge in the field of link-layer protocol research for WCDMA/TDD systems. / Ph. D.

Quality-of-Service (QoS) to users is a critical requirement of resource allocation in wireless networks and has drawn significant research attention over a long time. However, the QoS requirements differ vastly based on the wireless network paradigm. At one extreme, we have a millimeter wave small-cell network for streaming data that requires very high throughput and low latency. At the other end, we have Machine-to-Machine (M2M) uplink traffic with low throughput and low latency. In this dissertation, we investigate and solve QoS-aware resource allocation problems for diverse wireless paradigms. We first study cross-layer dynamic spectrum allocation in a LTE macro-cellular network with fractional frequency reuse to improve the spectral efficiency for cell-edge users. We show that the resultant optimization problem is NP-hard and propose a low-complexity layered spectrum allocation heuristic that strikes a balance between rate maximization and fairness of allocation. Next, we develop an energy efficient downlink power control scheme in a energy harvesting small-cell base station equipped with local cache and wireless backhaul. We also study the tradeoff between the cache size and the energy harvesting capabilities. We next analyzed the file read latency in Distributed Storage Systems (DSS). We propose a heterogeneous DSS model wherein the stored data is categorized into multiple classes based on arrival rate of read requests, fault-tolerance for storage etc. Using a queuing theoretic approach, we establish bounds on the average read latency for different scheduling policies. We also show that erasure coding in DSS serves the dual purpose of reducing read latency and increasing the energy efficiency. Lastly, we investigate the problem of delay-efficient packet scheduling in M2M uplink with heterogeneous traffic characteristics. We classify the uplink traffic into multiple classes and propose a proportionally-fair delay-efficient heuristic packet scheduler. Using a queuing theoretic approach, we next develop a delay optimal multiclass packet scheduler and later extend it to joint medium access control and packet scheduling for M2M uplink. Using extensive simulations, we show that the proposed schedulers perform better than state-of-the-art schedulers in terms of average delay and packet delay jitter. / PHD

Traffic congestion has become one of the major challenging problems of modern life in many urban areas. This growing problem leads to negative environmental impacts, wasted fuel, lost productivity, and increased travel time. In big cities, trains and buses bring riders to transit stations near shopping and employment centers, but riders then need another transportation mode to reach their final destination, which is known as the last mile problem. A smart bike-sharing system (BSS) can help address this problem and encourage more people to ride public transportation, thus relieving traffic congestion. At the strategic level, we start with proposing a novel two-layer hierarchical classifier that increases the accuracy of traditional transportation mode classification algorithms. In the transportation sector, researchers can use smartphones to track and obtain information of multi-mode trips. These data can be used to recognize the user's transportation mode, which can be then utilized in several different applications; such as planning new BSS instead of using costly surveys. Next, a new method is proposed to quantify the effect of several factors such as weather conditions on the prediction of bike counts at each station. The proposed approach is promising to quantify the effect of various features on BSSs in cases of large networks with big data. Third, these resulted significant features were used to develop state-of-the-art toolbox algorithms to operate BSSs efficiently at two levels: network and station. Finally, we proposed a quality-of-service (QoS) measurement, namely Optimal Occupancy, which considers the impact of inhomogeneity in a BSS. We used one of toolbox algorithms modeled earlier to estimate the proposed QoS. Results revealed that the Optimal Occupancy is beneficial and outperforms the traditionally-known QoS measurement. / PHD / A growing population, with more people living in cities, has led to increased pollution, noise, congestion, and greenhouse gas emissions. One possible approach to mitigating these problems is encouraging the use of bike-sharing systems (BSSs). BSSs are an integral part of urban mobility in many cities and are sustainable and environmentally friendly. As urban density increases, it is likely that more BSSs will appear due to their relatively low capital and operational costs, ease of installation, pedal assistance for people who are physically unable to pedal for long distances or on difficult terrain, and the ability to track bikes in some cases. This dissertation is a building block for a smart BSS in the strategic level, which could be used in real and different applications. The main aims of the dissertation are to boost the redistribution operation, to gain new insights into and correlations between bike demand and other factors, and to support policy makers and operators in making good decisions regarding planning new or existing BSS. This dissertation makes many significant contributions. These contributions include novel methods, measurements, and applications using machine learning and statistical learning techniques in order to design a smart BSS. We start with proposing a novel framework that increases the accuracy of traditional transportation mode classification algorithms. In the transportation sector, researchers can use smartphones to track and obtain information of multi-mode trips. These data can be used to recognize the user’s transportation mode, which can be then used in planning new BSS. Next, a new method is proposed to quantify the effect of several factors such as weather conditions on the prediction of bike station counts. Third, we use state-of-the-art data analytics to develop a toolbox to operate BSSs efficiently at two levels: network and station. Finally, we propose a quality-of-service (QoS) measurement, which considers the impact of inhomogeneity of BSS properties.

Land mobile radio (LMR) systems are used for communication by public safety and other government and commercial organizations. LMR systems offer mission-critical or even life-critical service in the day-to-day activities of such organizations. Traditionally, a variety of different LMR systems have been deployed by different organizations, leading to a lack of radio interoperability. A voice application that connects LMR systems via a packet-switched network is called an LMR Voice over IP (LMRVoIP) system and is a potential solution to the interoperability problem. LMRVoIP systems are time critical, i.e., are delay and jitter sensitive. Transmission of LMRVoIP traffic in a congested packet-switched network with no quality of service (QoS) or priority mechanisms in place could lead to high delays and extreme variations in delay, i.e., high jitter, thus resulting in poor application performance. LMRVoIP systems may also have performance issues with the use of virtual private networks (VPNs). To the best of our knowledge, there has been no prior thorough investigation of the performance of an LMRVoIP system with different queuing schemes for QoS and with the use of VPN. In this thesis, we investigate the performance of an LMRVoIP system with different queuing schemes and with the use of VPN. An experimental test bed was created to evaluate four QoS queuing schemes: first-in first-out queuing (FIFO), priority queuing (PQ), weighted fair queuing (WFQ), and class-based weighted fair queuing (CBWFQ). Quantitative results were obtained for voice application throughput, delay, jitter, and signaling overhead. Results show that, compared to a baseline case with no background traffic, LMRVoIP traffic suffers when carried over links with heavy contention from other traffic sources when FIFO queuing is used. There is significant packet loss for voice and control traffic and jitter increases. FIFO queuing provides no QoS and, therefore, should not be used for critical applications where the network may be congested. The situation can be greatly improved by using one of the other queuing schemes, PQ, WFQ, or CBWFQ, which perform almost equally well with one voice flow. Although PQ has the best overall performance, it tends to starve the background traffic. CBWFQ was found to have some performance benefits over WFQ in most cases and, thus, is a good candidate for deployment. The LMRVoIP application was also tested using a VPN, which led to a modest increase in latency and bandwidth utilization, but was found to perform well. / Master of Science

We present a resource allocation perspective to Quality of Service in Distributed Virtual Environments. The user of a DVE system will have improved Quality of Service if he/she is allocated the right amount of resources at the right time. Instead of allocating resources on a static basis, we adopt a dynamic need based resource allocation scheme that provides real-time resource allocation. Optimal resource assignments are calculated offline and a neural network is trained with the knowledge of optimal solutions from the offline Operations Research Techniques and it is then used to deliver near-optimal resource allocation decisions in real-time. We also present a case study of network bandwidth allocation and prove the usefulness of the technique. / Master of Science

No / Jayne Donaldson, Bryan McIntosh and Simon Jones argue that England can learn from Scotland's approaches to the nature of hospital capacity and the workforce's delivery of service.

Submitted by SBI Biblioteca Digital (sbi.bibliotecadigital@puc-campinas.edu.br) on 2017-08-08T12:17:56Z No. of bitstreams: 1 PABLO GULIAS RUFINO DE FREITAS.pdf: 2140333 bytes, checksum: 1e937a0df855e15ff38bbf36da286844 (MD5) / Made available in DSpace on 2017-08-08T12:17:56Z (GMT). No. of bitstreams: 1 PABLO GULIAS RUFINO DE FREITAS.pdf: 2140333 bytes, checksum: 1e937a0df855e15ff38bbf36da286844 (MD5) Previous issue date: 2017-05-02 / Pontif?cia Universidade Cat?lica de Campinas ? PUC Campinas / Traditionally, Information Security (IS) and Quality of Service (QoS), which means the capacity of a service to satisfy the needs of a user, have been considered separately, with different purposes and needs. However, the service levels that are advertised and expected for both are strongly linked. In this sense, despite the improvement in the performance of communication and of the confidentiality, integrity and the availability of data trafficked having greater premise, there still is no standardization for the joint and efficient use of IS and QoS. There are also no defined metrics or indicators that allow for this grouped measurement. This study proposed and tested a model for the management of communication networks, based on the best practices of the library for Information Technology Service Management (ITSM), Information Technology Infrastructure Library (ITIL), having the novelty of using the information security risk management process, from the 27005 (Risk Management) standard, in conjunction with a list of requirements checks of QoS and controls from the 27002 (Code of Practice) standard. This study looks to find the equilibrium between IS, performance and productivity. The results obtained showed the effectiveness of this proposal decreasing by approximately 16%, the number of incidents directly linked to IS and QoS, detected and solved in a proactive manner. / Tradicionalmente, Seguran?a da Informa??o (SI) e Qualidade de Servi?o (Quality of Service (QoS)), que significa a capacidade de um servi?o para satisfazer as necessidades do usu?rio, t?m sido consideradas, separadamente, com diferentes prop?sitos e necessidades. No entanto, os n?veis de servi?os anunciados e esperados por ambos est?o fortemente ligados. Nesse sentido, apesar da melhoria no desempenho da comunica??o e da confidencialidade, integridade e disponibilidade dos dados transportados serem premissas maiores, ainda n?o h? uma padroniza??o para um uso conjunto e eficiente entre SI e QoS. Tamb?m n?o h? uma defini??o de m?tricas ou indicadores que possibilitem essa medi??o agrupada. No presente trabalho, prop?e-se e testa-se um modelo de gerenciamento de redes de telecomunica??es, baseado nas melhores pr?ticas da biblioteca de Gerenciamento de Servi?os de Tecnologia da Informa??o (GSTI), Information Technology Infrastructure Library (ITIL), tendo como novidade a utiliza??o do processo de gest?o de riscos de seguran?a da informa??o, da norma 27005 (Gest?o de riscos), em conjun??o com uma lista de verifica??es de requisitos de QoS e controles da norma 27002 (C?digo de pr?ticas). Este trabalho busca o equil?brio entre SI, desempenho e produtividade. Os resultados obtidos mostraram a efetividade da proposta com uma diminui??o aproximada de 16%, da quantidade de incidentes diretamente ligados ? SI e QoS, detectados e solucionados de forma proativa.