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.advisor | Gutiérrez Salamanca, Rafael María | - |
dc.contributor.advisor | Hernández Duarte, Andrés Ignacio | - |
dc.contributor.advisor | Gómez Cajas, Diego Ferney | - |
dc.creator | Pinto Serrano, Mario Augusto | - |
dc.date.accessioned | 2022-08-25T21:33:01Z | - |
dc.date.available | 2022-08-25T21:33:01Z | - |
dc.date.created | 2022-07-06 | - |
dc.identifier.uri | http://repositorio.uan.edu.co/handle/123456789/6837 | - |
dc.description.abstract | Given 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 components | es_ES |
dc.description.tableofcontents | Dado 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.iso | spa | es_ES |
dc.publisher | Universidad Antonio Nariño | es_ES |
dc.source | instname:Universidad Antonio Nariño | es_ES |
dc.source | reponame:Repositorio Institucional UAN | es_ES |
dc.source | instname:Universidad Antonio Nariño | es_ES |
dc.source | reponame:Repositorio Institucional UAN | es_ES |
dc.subject | atención al cliente- Método | es_ES |
dc.subject.ddc | 658.5038 | es_ES |
dc.title | Método y sistema para reducir tiempos de procesamiento de solicitudes en líneas de espera. | es_ES |
dc.type | Tesis - Trabajo de grado - Monografia - Doctorado | es_ES |
dc.publisher.program | Doctorado en Ciencia Aplicada | es_ES |
dc.rights.accesRights | openAccess | es_ES |
dc.subject.keyword | customer service's | es_ES |
dc.type.spa | Tesis y disertaciones (Maestría y/o Doctorado) | es_ES |
dc.type.hasVersion | info:eu-repo/semantics/acceptedVersion | es_ES |
dc.source.bibliographicCitation | Akar, 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.bibliographicCitation | Al-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.7324643 | es_ES |
dc.source.bibliographicCitation | Alqaydi, 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.7847 | es_ES |
dc.source.bibliographicCitation | Arcese M.,Pichetti L., (2015), U.S, US9,009,717 B2, Managing scheduling of processes, New York, Mark and patents office. | es_ES |
dc.source.bibliographicCitation | Baccelli, 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-9 | es_ES |
dc.source.bibliographicCitation | Backer, 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.bibliographicCitation | Barcelo, 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.655561 | es_ES |
dc.source.bibliographicCitation | Blake, S. (2008). TRAFFIC MANAGER AND METHOD FOR PERFORMING ACTIVE QUEUE MANAGEMENT OF DISCARD-ELIGIBLE TRAFFIC. Retrieved from http:// | es_ES |
dc.source.bibliographicCitation | Blesa, 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-1 | es_ES |
dc.description.degreename | Doctor(a) en Ciencia Aplicada | es_ES |
dc.description.degreelevel | Doctorado | es_ES |
dc.publisher.faculty | Doctorado en Ciencia Aplicada | es_ES |
dc.audience | Especializada | es_ES |
dc.description.notes | Presencial | es_ES |
dc.creator.cedula | 13001428790 | es_ES |
dc.publisher.campus | Bogotá - Circunvalar | es_ES |
dc.description.degreetype | Investigación | es_ES |
Aparece en las colecciones: | Doctorado en Ciencia aplicada |
Ficheros en este ítem:
Fichero | Tamaño | |
---|---|---|
2022_MarioPinto.pdf | 4.68 MB | Visualizar/Abrir |
2022_MarioPinto_Autorizacion.pdf Restricted Access | 738.75 kB | Visualizar/Abrir Request a copy |
2022_MarioPinto_Acta.pdf Restricted Access | 356.78 kB | Visualizar/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.