Por favor, use este identificador para citar o enlazar este ítem: http://repositorio.uan.edu.co/handle/123456789/6837
Registro completo de metadatos
Campo DC Valor Lengua/Idioma
dc.contributor.advisorGutiérrez Salamanca, Rafael María-
dc.contributor.advisorHernández Duarte, Andrés Ignacio-
dc.contributor.advisorGómez Cajas, Diego Ferney-
dc.creatorPinto Serrano, Mario Augusto-
dc.date.accessioned2022-08-25T21:33:01Z-
dc.date.available2022-08-25T21:33:01Z-
dc.date.created2022-07-06-
dc.identifier.urihttp://repositorio.uan.edu.co/handle/123456789/6837-
dc.description.abstractGiven that generally the customer service's resources cannot give service to all service demands, all the time, the queues are generated, also known as waiting lines. These queues are present in several aspects of the daily life. From a phenomenon present in optical communication systems, known as contention (When two or more packets are simultaneously at the same point), are proposed algorithms in order to deal with the contention. These algorithms are classified in two categories: pre-reservation and post-reservation. In the pre-reservation algorithms, the output channel is reserved before the packet ingress, in contrast with the pos-reservation algorithms, where the reservation is postponed, until after the ingress of the packet to the system. Based on the theoretical foundations of the post-reservation algorithms, and making abstractions of the used concepts, we propose a queue management system, focused on high complexity operative services, with high demands and interactions between the componentses_ES
dc.description.tableofcontentsDado que generalmente los recursos de atención al cliente no pueden atender a toda la demanda de servicios, todo el tiempo, se generan las colas, conocidas como líneas de espera. Estas colas están presentes en múltiples aspectos de la vida cotidiana. A partir de un fenómeno presente en los sistemas de comunicaciones ópticos conocido como contención (cuando dos paquetes o más se encuentran simultáneamente en un mismo punto), se han planteado algoritmos para manejar la contención.es_ES
dc.language.isospaes_ES
dc.publisherUniversidad Antonio Nariñoes_ES
dc.sourceinstname:Universidad Antonio Nariñoes_ES
dc.sourcereponame:Repositorio Institucional UANes_ES
dc.sourceinstname:Universidad Antonio Nariñoes_ES
dc.sourcereponame:Repositorio Institucional UANes_ES
dc.subjectatención al cliente- Métodoes_ES
dc.subject.ddc658.5038es_ES
dc.titleMétodo y sistema para reducir tiempos de procesamiento de solicitudes en líneas de espera.es_ES
dc.typeTesis - Trabajo de grado - Monografia - Doctoradoes_ES
dc.publisher.programDoctorado en Ciencia Aplicadaes_ES
dc.rights.accesRightsopenAccesses_ES
dc.subject.keywordcustomer service'ses_ES
dc.type.spaTesis y disertaciones (Maestría y/o Doctorado)es_ES
dc.type.hasVersioninfo:eu-repo/semantics/acceptedVersiones_ES
dc.source.bibliographicCitationAkar, N., & Gunalay, Y. (2013). Dimensioning shared-per-node recirculating fiber delay line buffers in an optical packet switch. Performance Evaluation, 70(12), 1059-1071.es_ES
dc.source.bibliographicCitationAl-Shaikhli, A., & Esmailpour, A. (2015). Quality of Service management in 5G broadband converged networks. 2015 36th IEEE Sarnoff Symposium, 56–61. https://doi.org/10.1109/SARNOF.2015.7324643es_ES
dc.source.bibliographicCitationAlqaydi, F., Salah, K., & Zemerly, J. (2015). Queuing Theory Algorithm to find the minimal number of VMs to satisfy SLO response time. https://doi.org/10.13140/RG.2.1.4476.7847es_ES
dc.source.bibliographicCitationArcese M.,Pichetti L., (2015), U.S, US9,009,717 B2, Managing scheduling of processes, New York, Mark and patents office.es_ES
dc.source.bibliographicCitationBaccelli, F., Kauffmann, B., & Veitch, D. (2009). Inverse Problems in Queueing Theory and Internet Probing. Queueing Syst. Theory Appl., 63(1–4), 59–107. https://doi.org/10.1007/s11134-009- 9150-9es_ES
dc.source.bibliographicCitationBacker, A. M. T. R. (2017). QUEUE AND RESERVATION MANAGEMENT SYSTEM. Retrieved from http:// Bao, L (2014), U.S, US 8,886,899 B1, Managing memory requests based on priority, Westford, MA, Mark and patents office.es_ES
dc.source.bibliographicCitationBarcelo, F., & Ramon, A. (1997). PRMA performance evaluation based on queueing theory. 1997 IEEE International Conference on Personal Wireless Communications (Cat. No.97TH8338), 455–459. https://doi.org/10.1109/ICPWC.1997.655561es_ES
dc.source.bibliographicCitationBlake, S. (2008). TRAFFIC MANAGER AND METHOD FOR PERFORMING ACTIVE QUEUE MANAGEMENT OF DISCARD-ELIGIBLE TRAFFIC. Retrieved from http://es_ES
dc.source.bibliographicCitationBlesa, M., Calzada, D., Fernández, A., López, L., Martínez, A. L., Santos, A., … Thraves, C. (2009). Adversarial Queueing Model for Continuous Network Dynamics. Theory of Computing Systems, 44(3), 304–331. https://doi.org/10.1007/s00224-007-9046-1es_ES
dc.description.degreenameDoctor(a) en Ciencia Aplicadaes_ES
dc.description.degreelevelDoctoradoes_ES
dc.publisher.facultyDoctorado en Ciencia Aplicadaes_ES
dc.audienceEspecializadaes_ES
dc.description.notesPresenciales_ES
dc.creator.cedula13001428790es_ES
dc.publisher.campusBogotá - Circunvalares_ES
dc.description.degreetypeInvestigaciónes_ES
Aparece en las colecciones: Doctorado en Ciencia aplicada

Ficheros en este ítem:
Fichero Tamaño  
2022_MarioPinto.pdf4.68 MBVisualizar/Abrir
2022_MarioPinto_Autorizacion.pdf
  Restricted Access
738.75 kBVisualizar/Abrir  Request a copy
2022_MarioPinto_Acta.pdf
  Restricted Access
356.78 kBVisualizar/Abrir  Request a copy


Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.