El objetivo de este trabajo de investigación busca analizar de una manera elemental la relación entre los proveedores de experiencia (ExPros) personal y entorno espacial con la fidelización en el sector de barberías de Lima, Perú. El presente trabajo de investigación tiene carácter de una investigación no experimental y de corte transversal. Se utilizaron instrumentos cuantitativos (SPSS) y cualitativos para recolectar información y data numérica representativa. Se realizo un análisis descriptivo sobre el público objetivo que son hombres de 18 a 35 años. Se encontró que entre los dos ExPros investigados, el personal tiene mayor relación con la satisfacción, a comparación que el entorno espacial, siendo la satisfacción la variable intermedia ara llegar a la fidelización del cliente. Finalmente se mencionan las posibles futuras investigaciones que se pueden realizar teniendo en cuenta lo descubierto en el trabajo de investigación elaborado. / The objective of this research work seeks to analyze in an elementary way the relationship between personal experience providers (ExPros) and space environment with loyalty in the barbershop sector of Lima, Peru. This research work has the character of a non-experimental and cross-sectional investigation. Quantitative and qualitative instruments (SPSS) were used to collect information and representative numerical data. A descriptive analysis was carried out on the target audience that are men between 18 and 35 years old. It was found that between the two ExPros investigated, the people has a greater relationship with satisfaction, compared to the spatial environment, with satisfaction being the intermediate variable to reach customer loyalty. Finally, the possible future research that can be carried out is mentioned, taking into account what was discovered in the research work prepared. / Trabajo de investigación

Objetivo. Determinar el nivel de satisfacción global basado en la calidad percibida por los usuarios hospitalizados atendidos por el Servicio de Nutrición de una Clínica de Lima Norte, 2019. Material y método. Investigación de diseño descriptivo, observacional, transversal y prospectivo que determina el nivel de satisfacción de la calidad percibida del usuario a través del instrumento SERVPERF que está compuesto de veintidós preguntas distribuidas en sus cinco dimensiones de la calidad (elementos tangibles, fiabilidad, capacidad de respuesta, seguridad y empatía), las cuales son medidas por la escala de Likert de 7 puntos. El muestreo fue por conveniencia y la muestra fue de 75 usuarios hospitalizados, siendo el 58.7% del sexo femenino y el 41.3% del sexo masculino, además el 68.0% son pacientes continuadores y el 82.7% tienen un seguro médico. Resultados. La satisfacción de los usuarios hospitalizados en la Clínica Lima Norte basados en la calidad percibida fue de 87,4%. Respecto a las cinco dimensiones en forma independiente de la calidad percibida se observa que los elementos tangibles son los que mejor calificación reciben con un 92.8% de excelente satisfacción, seguido de las dimensiones de fiabilidad y seguridad con el 90.85% y 90.0% respectivamente de ser excelente, por otro lado la dimensión capacidad de respuesta consiguió una calificación buena con el 84.57 % y la dimensión empatía una calificación regular con el 78.85 % de satisfacción. Conclusión. El nivel de satisfacción global del servicio de nutrición fue buena con un 87.4% de aprobación por los usuarios hospitalizados. / Objective. Determine the level of global satisfaction based on the quality perceived by hospitalized users served by the Nutrition Service of a Clinic in Lima North, 2019. Material and method. Descriptive, observational, transversal and prospective design research that determines the level of satisfaction of the perceived quality of the user through the SERVPERF instrument that is composed of twenty-two questions distributed in its five dimensions of quality (tangible elements, reliability, responsiveness , security and empathy), which are measured by the 7-point Likert scale. The sampling was for convenience and the sample was 75 hospitalized users, being 58.7% female and 41.3% male, in addition 68.0% are continuing patients and 82.7% have medical insurance. Results. The satisfaction of hospitalized users in the Lima Norte Clinic based on perceived quality was 87.4%. Regarding the five dimensions independently of the perceived quality, it is observed that the tangible elements are the ones that receive the best qualification with 92.8% of excellent satisfaction, followed by the dimensions of reliability and safety with 90.85% and 90.0% respectively of being excellent, on the other hand the response capacity dimension achieved a good rating with 84.57% and the dimension empathized a regular rating with 78.85% satisfaction. Conclusion. The level of global satisfaction of the nutrition service was good with 87.4% approval by hospitalized users. / Tesis

La calidad del servicio en la actualidad es indispensable para las empresas que quieran ser exitosas, sobre todo, en tiempos donde una noticia viral puede catapultar o hundir a una compañía en cuestión de días. Dicha realidad nos motivó a estudiar este caso aplicando una herramienta de medición de calidad. La tesis propone evaluar la calidad del servicio de instituciones dedicadas a la enseñanza del idioma francés, un idioma hablado por más de 300 millones de personas en todos los continentes y que ha alcanzado un evidente desarrollo en los últimos años. Mediante la herramienta SERVQUAL se estudiarán las brechas entre las expectativas y percepciones de los alumnos activos para que a través de los resultados y conclusiones las instituciones dedicadas a la enseñanza del idioma francés puedan plantear estrategias para mejorar su servicio. Las aplicaciones de este método de medición de la calidad servirán para futuras evaluaciones de las instituciones. / The quality of service today is essential for companies that want to be successful, especially, in times where viral news can catapult or sink a company in a matter of days. This reality motivated us to study this case by applying a quality measurement tool. The thesis proposes to evaluate the quality of the service of the institutions dedicated on the teaching of French languages, a language spoken by more than 300 million people in all continents and that has had an evident development in recent years. Through the SERVQUAL tool, the gaps between the expectations and perceptions of active students will be studied so that through the results and conclusions, the institutions dedicated on teaching the French language can propose strategies to improve their service. The applications of this quality measurement method will work for future evaluations of the institutions. / Tesis

Indiana University-Purdue University Indianapolis (IUPUI) / This thesis contains four interrelated research areas. Before presenting the four research areas, this thesis presents literature review on Software-Defined Networking (SDN), a network architecture that allows network operator to manage the network using high level abstractions. This thesis presents taxonomy for classifying SDN research. In research first area, this thesis presents Video over Software-Defined Networking (VSDN), a network architecture that selects feasible paths using the network-wide view. This thesis describes the VSDN protocol which is used for requesting service from the network. This thesis presents the results of implementing VSDN prototype and evaluates behavior of VSDN. Requesting service from the network requires developer to provide three input parameters to application programmable interface. The message complexity of VSDN is linear. In research second area, this thesis presents Explicit Routing in Software-Defined Networking (ERSDN), a routing scheme that selects transit routers at the edge of network. This thesis presents the design and implementation of ERSDN. This thesis evaluates the effect of ERSDN on the scalability of controller by measuring the control plane network events-packets. ERSDN reduces the network events in the control plane by 430%. In research third area, this thesis presents Reliable Video over Software-Defined Networking (RVSDN) which builds upon previous work of Video over Software-Defined Networking (VSDN) to address the issue of finding most reliable path. This thesis presents the design and implementation of RVSDN. This thesis presents the experience of integrating RVSDN into ns-3, a network simulator which research community uses to simulate and model computer networks. This thesis presents RVSDN results and analyzes the results. RVSDN services 31 times more requests than VSDN and Multiprotocol Label Switching (MPLS) explicit routing when the reliability constraint is 0.995 or greater. In research fourth area, this thesis presents Multi-Domain Video over Software-Defined Networking (MDVSDN), a network architecture that selects end-to-end network path or path for real-time interactive video applications across independent network domains. This thesis describes the architectural elements of MDVSDN. This thesis presents the results of implementing a prototype of MDVSDN and evaluates the behavior of MDVSDN. The message complexity of MDVSDN is linear. The contribution of this thesis lays the foundation for developing a network architecture that improves the performance of real-time interactive video applications by selecting feasible end-to-end multi-domain path among multiple paths using bandwidth, delay, jitter, and reliability.

The concept of using qualitative measures to describe the quality of service at signalized intersections provided by different designs and controls has been discussed in numerous conferences. Such measures may include driver's comfort, convenience, anxiety, and preferences. The primary objective of this study was to demonstrate the feasibility of using the University of Central Florida's interactive driving simulator to execute several scenarios involving different unusual design and operation practices to measure the quality of service at a signalized intersection. This thesis describes the scenarios, the experiments conducted, the data collected, and analysis of results. Signalized intersections with 3 types of characteristic features were identified for this study. They included 1. A lane dropping on the downstream side of the intersection 2. Misalignment of traffic lanes between the approach and downstream side 3. Shared left turn and through traffic lane or separate lanes for each approaching the intersection The experimental phase consisted of a brief orientation session to get acclimated to the driving simulator followed by two driving scenarios presented to all subjects. Each scenario consisted of a drive through an urban section of the simulator's visual data base where each subject encountered a Type 1, 2 and 3 intersections. A total of 40 subjects, 25 males and 15 females were recruited for the experiment. Data logging at 60 Hz for each scenario consisted of time-stamped values of x-position and y-position of the simulator vehicle, steering, accelerator and brake inputs by the driver, and vehicle speed. After the experiment a questionnaire soliciting opinions and reactions about each intersection was administered. Simulator experiment results showed that there was a significant difference between the merge lengths for the two cases of Type 1 intersection (lane drop on the downstream side of the intersection). For Type 2 intersection (misalignment of traffic lanes between the approach and downstream side) there was a considerable difference between the average paths followed by subjects for the two cases. For Type 3 intersection (shared left and through traffic lane approaching the intersection) the simulator experiment supported the fact that people get frustrated when trapped behind a left turning vehicle in a joint left and through lane intersection and take evasive actions to cross the intersection as soon as possible.

As the Internet evolves, there is a continued demand for high Internet bandwidth. This demand is driven partly by the widely spreading real-time video applications, such as on-line gaming, teleconference, high-definition video streaming. All-optical switches and routers have long been studied as a promising solution to the rapidly growing demand. Nevertheless, buffer sizes in all-optical switches and routers are very limited due to the challenges in manufacturing larger optical buffers. On the other hand, Internet traffic is bursty. The existence of burstiness in network traffic has been shown at all time scales, from tens of milliseconds to thousands of seconds. The widely existing burstiness has a very significant impact on the performance of small buffer networks, resulting in high packet drop probabilities and low link utilization. There have been many solutions proposed in the literature to solve the burstiness issue of network traffic. Traffic engineering techniques, such as traffic shaping and polishing, have been available in commercial routers/switches since the era of Asynchronous Transfer Mode (ATM) networks. Moreover, TCP pacing, as a natural solution to the TCP burstiness, has long been studied. Furthermore, several traffic conditioning and scheduling techniques are proposed to smooth core network traffics in a coordinated manner. However, all the existing solutions are inadequate to efficiently solve the burstiness issue of high-speed traffic. In this dissertation we aim to tackle the burstiness issue in small buffer networks, which refer to the future Internet core network consisting of all-optical routers and switches with small buffers. This dissertation is composed of two parts. In the first part, we analyze the impact of a general pacing scheme on the performance of a tandem queue network. This part serves as a theoretical foundation, based on which we demonstrate the benefits of pacing in a tandem queue model. Specifically, we use the Infinitesimal Perturbation Analysis (IPA) technique to study the impact of pacing on the instantaneous and average queue lengths of a series of nodes. Through theoretical analyses and extensive simulations, we show that under certain conditions there exists a linear relationship between system parameters and instantaneous/average queue lengths of nodes and that pacing improves the performance of the underlying tandem queue system by reducing the burstiness of the packet arrival process. In the second part, we propose a practical on-line packet pacing scheme, named Queue Length Based Pacing (QLBP). We analyze the impact of QLBP on the underlying network traffic in both time and frequency domains. We also present two implementation algorithms that allow us to evaluate the performance of QLBP in real experimental and virtual simulation environments. Through extensive simulations, we show that QLBP can effectively reduce the burstiness of network traffic and hence significantly improve the performance of a small buffer network. More important, the network traffic paced with QLBP does not exhibit a weakened competition capability when competing with non-paced traffic, which makes the QLBP scheme more attractive for ISPs.

<p>Packet transmission scheduling plays a key role in Quality of Service (QoS) support for real-time traffic and efficient radio resource utilization in a wireless mesh network (WMN). It is a highly complicated problem due to the fact that any scheduling decision at one mesh access point (AP) may affect the scheduling decisions in the entire network. The strict delay requirement of real-time applications makes the scheduling problem even more challenging.</p> <p> In this thesis, the packet transmission scheduling problem for real-time constant-bit-rate (CBR) traffic in a WMN is first formulated as a standard integer linear programming problem, which takes into consideration both the multihop packet transmission delay and timeline coordinations of the mesh APs. The objective is to efficiently utilize the radio resources, subject to available bandwidth of the mesh APs, co-channel interference, and packet transmission latency requirement.</p> <p>Two heuristic schemes, namely AP-based scheduling (ABS) and connection-based scheduling (CBS) schemes, are then proposed to support real-time CBR traffic. ABS makes scheduling decisions on a per-AP basis. Scheduling decisions at APs with a higher traffic load are determined before those at APs with a lower traffic load. ABS achieves close-to-optimum capacity but may go through multiple iterations before reaching a feasible solution. CBS makes scheduling decisions on a connection-by-connection basis. It gives a higher priority to connections with more hops. In CBS, connections with a lower priority can only use resources remaining from serving all higher priority connections. CBS requires much lower complexity than ABS while achieving capacity performance slightly lower than ABS.</p> <p>We extend the proposed ABS and CBS scheduling schemes for supporting real-time variable bit rate (VBR) traffic in a WMN. By combining the concept of effective bandwidth and the proposed scheduling schemes, both delay and packet loss performance of the VBR traffic can be effectively satisfied. The scheduling schemes are further extended for supporting real-time traffic in a WMN with multi-radio APs.</p> <p>All the scheduling decisions are done at the time when new connection requests arrive and the results are used to make admission control decisions. In this sense, the work in this thesis is for both packet transmission scheduling and admission control for real-time traffic in WMNs.</p> / Thesis / Doctor of Philosophy (PhD)

In the recent decade, peer-to-peer (P2P) technology has greatly enhanced the scalability of multimedia streaming on the Internet by enabling efficient cooperation among end-users. However, existing streaming applications are plagued by the problems of long playback latency and long churn-induced delays. First of all, many streaming applications, such as IPTV and video conferencing, have rigorous constraints on end-to-end delays. Moreover, churn-induced delays, including delays from channel switching and streaming recovery, in current P2P streaming applications are typically in the scale of 10-60 seconds, which is far below the favorable user experience as in cable TV systems. These two issues in terms of playback latency and churn-induced delays have hindered the extensive commercial deployment of P2P systems. Motivated by this, in this dissertation, we focus on reducing delays in P2P live streaming systems. Specifically, we propose solutions for reducing delays in P2P live streaming systems in four problem spaces: (1) minimizing the maximum end-to-end delay in P2P streaming; (2) minimizing the average end-to-end delay in P2P streaming; (3) minimizing the average delay in multi-channel P2P streaming; and (4) reducing churn-induced delays. We devise a streaming scheme to minimize the maximum end-to-end streaming delay under a mesh-based overlay network paradigm. We call this problem, the MDPS problem. We formulate the MDPS problem and prove its NP-completeness. We then present a polynomial-time approximation algorithm, called Fastream-I, for this problem, and show that the performance of Fastream-I is bounded by a ratio of O(SQRT(log n)), where n is the number of peers in the system. We also develop a distributed version of Fastream-I that can adapt to network dynamics. Our simulation study reveals the effectiveness of Fastream-I, and shows a reasonable message overhead. While Fastream-I yields the minimum maximum end-to-end streaming delay (within a factor of O(SQRT(log n)), in many P2P settings, users may desire the minimum average end-to-end P2P streaming delay. Towards this, we devise a streaming scheme which optimizes the bandwidth allocation to achieve the minimum average end-to-end P2P streaming delay. We call this problem, the MADPS problem. We first develop a generic analytical framework for the MADPS problem. We then present Fastream-II as a solution to the MADPS problem. The core part of Fastream-II is a fast approximation algorithm, called APX-Fastream-II, based on primal-dual schema. We prove that the performance of APX-Fastream-II is bounded by a ratio of 1+w, where w is an adjustable input parameter. Furthermore, we show that the flexibility of w provides a trade-off between the approximation factor and the running time of Fastream-II. The third problem space of the dissertation is minimizing the average delay in multi-channel P2P streaming systems. Toward this, we present an algorithm, called Fastream-III. To reduce the influence from frequent channel-switching behavior, we build Fastream-III for the view-upload decoupling (VUD) model, where the uploaded content from a serving node is independent of the channel it views. We devise an approximation algorithm based on primal-dual schema for the critical component of Fastream-III, called APX-Fastream-III. In contrast to APX-Fastream-II, APX-Fastream-III addresses the extra complexity in the multichannel scenario and maintains the approximation bound by a ratio of 1+w. Besides playback lag, delays occurring in P2P streaming may arise from two other factors: node churn and channel switching. Since both stem from the re-connecting request in churn, we call them churn-induced delays. Optimizing churn-induced delays is the dissertation's fourth problem space. Toward this, we propose NAP, a novel agent-based P2P scheme, that provides preventive connections to all channels. Each channel in NAP selects powerful peers as agents to represent the peers in the channel to minimize control and message overheads. Agents distill the bootstrapping peers with superior bandwidth and lifetime expectation to quickly serve the viewer in the initial period of streaming. We build a queueing theory model to analyze NAP. Based on this model, we numerically compare NAP's performance with past efforts. The results of the numerical analysis reveal the effectiveness of NAP. / Ph. D.

Because of their ubiquity and low cost fabrication techniques, electronic textiles (e-textiles) are an excellent platform for pervasive computing. Many e-textile applications are already available in the commercial, military, and academic domains, but most are very highly specialized and do not lend themselves easily to reuse or alteration. The purpose of this work is threefold: development of a methodology for building flexible and reusable applications that facilitates their use in the evolution of more complex systems, creation of a resource manager that realizes the methodology and enforces quality of service guarantees on tightly constrained textile resources, and construction of a simulation environment that allows for the rapid development and reconfiguration of systems to circumvent the need for the expensive physical prototyping process. This work discuss the effectiveness and appropriateness of the deployed event-driven hierarchical service model for application development. Additionally, this work explores the results of providing fault tolerance and quality of service guarantees in a textile environment that is particularly susceptible to faults. Further addressed by this work is the success of rapid prototyping and evaluation of applications in the simulation environment. / Master of Science

Long Term Evolution (LTE) was designed to provide fast data rates to replace 3G service for mobile devices. As LTE networks and the user base for those networks grow, it becomes necessary for the resources used for those networks to be used as efficiently as possible. This thesis presents an implementation which utilizes an algorithm extended upon the Frank Kelly algorithm to determine resource allocation for UEs and shapes traffic for each UE to meet those allocation limits. The implementation's network represents what an LTE network would do to manage data rates for a UE through a distributed algorithm for rate allocation. The main focus of the implementation is on the UE, where traffic shaping limits application rates by an elastic or inelastic classification through the use of Hierarchical Token Bucket (HTB) queuing disciplines. / Master of Science