The Experts below are selected from a list of 3321 Experts worldwide ranked by ideXlab platform
Cabanillas Chávez, Juan Carlos - One of the best experts on this subject based on the ideXlab platform.
-
Propuesta de implementación de control de tráfico de la red con linux para mejorar la calidad de servicio de la red lan en una universidad privada de la ciudad de Cajamarca.
'Dipartimento di Economia Universita di Perugia (IT)', 2015Co-Authors: Cabanillas Chávez, Juan CarlosAbstract:ABSTRACT In this thesis the analysis and study of the different architectures Quality of Service (QoS), as arises: Integrated Services (IntServ), which is based on guaranteeing QoS by reserving resources end-to-end for each stream, and the Differentiated Services (DiffServ) architecture, which is provided to certain applications or protocols, certain priority over other traffic on the network. The potential of the Linux operating system within the networking to improve QoS (Quality of Service) in the LAN, reviewing in detail queuing theory and the mechanisms used to control traffic, such as will be described: scheduling, policing , Clasifying, etc. We also describe in detail the issue Queue Discipline, emphasizing those that can be applied in the field of traffic control network. We will address the issue of advanced routing with LINUX, and their applicability to traffic control, presenting the tools available to the operating system kernel 2.6.x, which includes IPTABLES which uses methods of marking packets on a firewall, and iproute2 where we will see the use of utility tc (Traffic Control) that allows control of network traffic, applying the concepts and Queue Discipline, classes and filters. With traffic control network with Linux - a proposal to end Quality of Service (QoS Quality of Service) is raised. Implementation is through the tools that has the Linux operating system to control traffic on the Internet output interface to the LAN of the University.En ésta tesis se plantea el análisis y estudio de las diferentes Arquitecturas de Calidad de Servicio (QoS), como: Servicios Integrados (IntServ), que se basa en garantizar QoS a través de la reserva de recursos extremo a extremo para cada flujo, y la arquitectura Servicios Diferenciados (DiffServ), en donde se provee a ciertas aplicaciones o protocolos, determinadas prioridades sobre el resto del tráfico en la red. Se describirá las posibilidades que ofrece el sistema operativo LINUX, dentro del networking para mejorar la Calidad de Servicio (Quality of Service) en la red LAN, revisando detalladamente teoría de colas y los mecanismos usados para control de tráfico, como son: scheduling, policing, Clasifying, etc. También describiremos de forma detallada el tema de disciplina de colas, haciendo énfasis en aquellas que se pueden aplicar en el campo de control de tráfico de la red. Abordaremos el tema de enrutamiento avanzado con LINUX, y su aplicabilidad al control de tráfico, presentando las herramientas con que cuenta el sistema operativo con Kernel 2.6.x., que incluye IPTABLES el cual utiliza métodos de marcado de paquetes en un firewall, e IPROUTE2, donde veremos el uso de la utilidad tc (Traffic Control) que permite hacer el control de tráfico de la red, aplicando los conceptos como disciplina de colas, clases y filtros. Al final se planteara una propuesta de Calidad de Servicio (Quality of Service - QoS) con control de tráfico de la red con Linux. Se realiza la Implementación a través de las herramientas que posee el sistema operativo Linux para el control de tráfico en la interfaz de salida hacia Internet de la red LAN de la Universidad
-
Propuesta de implementación de control de tráfico de la red con LINUX para mejorar la calidad de servicio de la red LAN en una universidad privada de la ciudad de Cajamarca.
2015Co-Authors: Cabanillas Chávez, Juan CarlosAbstract:RESUMEN En ésta tesis se plantea el análisis y estudio de las diferentes Arquitecturas de Calidad de Servicio (QoS), como: Servicios Integrados (IntServ), que se basa en garantizar QoS a través de la reserva de recursos extremo a extremo para cada flujo, y la arquitectura Servicios Diferenciados (DiffServ), en donde se provee a ciertas aplicaciones o protocolos, determinadas prioridades sobre el resto del tráfico en la red. Se describirá las posibilidades que ofrece el sistema operativo LINUX, dentro del networking para mejorar la Calidad de Servicio (Quality of Service) en la red LAN, revisando detalladamente teoría de colas y los mecanismos usados para control de tráfico, como son: scheduling, policing, Clasifying, etc. También describiremos de forma detallada el tema de disciplina de colas, haciendo énfasis en aquellas que se pueden aplicar en el campo de control de tráfico de la red. Abordaremos el tema de enrutamiento avanzado con LINUX, y su aplicabilidad al control de tráfico, presentando las herramientas con que cuenta el sistema operativo con Kernel 2.6.x., que incluye IPTABLES el cual utiliza métodos de marcado de paquetes en un firewall, e IPROUTE2, donde veremos el uso de la utilidad tc (Traffic Control) que permite hacer el control de tráfico de la red, aplicando los conceptos como disciplina de colas, clases y filtros. Al final se planteara una propuesta de Calidad de Servicio (Quality of Service - QoS) con control de tráfico de la red con Linux. Se realiza la Implementación a través de las herramientas que posee el sistema operativo Linux para el control de tráfico en la interfaz de salida hacia Internet de la red LAN de la Universidad.ABSTRACT In this thesis the analysis and study of the different architectures Quality of Service (QoS), as arises: Integrated Services (IntServ), which is based on guaranteeing QoS by reserving resources end-to-end for each stream, and the Differentiated Services (DiffServ) architecture, which is provided to certain applications or protocols, certain priority over other traffic on the network. The potential of the Linux operating system within the networking to improve QoS (Quality of Service) in the LAN, reviewing in detail queuing theory and the mechanisms used to control traffic, such as will be described: scheduling, policing , Clasifying, etc. We also describe in detail the issue Queue Discipline, emphasizing those that can be applied in the field of traffic control network. We will address the issue of advanced routing with LINUX, and their applicability to traffic control, presenting the tools available to the operating system kernel 2.6.x, which includes IPTABLES which uses methods of marking packets on a firewall, and iproute2 where we will see the use of utility tc (Traffic Control) that allows control of network traffic, applying the concepts and Queue Discipline, classes and filters. With traffic control network with Linux - a proposal to end Quality of Service (QoS Quality of Service) is raised. Implementation is through the tools that has the Linux operating system to control traffic on the Internet output interface to the LAN of the University
Demetrios Fakinos - One of the best experts on this subject based on the ideXlab platform.
-
The G/G/1 (LCFS/P) Queue with service depending on Queue size
European Journal of Operational Research, 1992Co-Authors: Demetrios FakinosAbstract:Abstract This paper studies a general single server Queue, assuming that customers have service times depending on the Queue size and also that they are served in accordance with a last-come-first-served Queue Discipline with preemption and arbitrary restarting policy. Expressions are given for the Queue size limiting distribution when the system is considered at arrival (or departure) epochs and in continuous time, by using very simple arguments.
Benny Moldovanu - One of the best experts on this subject based on the ideXlab platform.
-
Priority Auctions and Queue Disciplines That Depend on Processing Time
Management Science, 2005Co-Authors: Thomas Kittsteiner, Benny MoldovanuAbstract:We analyze the allocation of priority in Queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing time. They make bids upon arrival at a Queue whose length is unobservable. We consider two bidding schemes that differ in the definition of bids (these may reflect either total payments or payments per unit of time) and in the timing of payments (before or after service). In both schemes, a customer obtains priority over all customers, waiting in the Queue or arriving while he is waiting, who make lower bids. Our main results show how the convexity/concavity of the function expressing the costs of delay determines the Queue Discipline (i.e., shortest-processing-time-first (SPT), longest-processing-time-first (LPT)) arising in a bidding equilibrium.
Sivasamy Ramasamy - One of the best experts on this subject based on the ideXlab platform.
-
geo λ geo μ g 2 Queues with heterogeneous servers operating under fcfs Queue Discipline
American Journal of Applied Mathematics and Statistics, 2015Co-Authors: Thaga Keaogile, Adebayo Fatai Adewole, Sivasamy RamasamyAbstract:This article discusses the steady analysis of a discrete time Queue of Geo/Geo+G/2 type. All arriving customers are served either by server-1 according to a geometrically distributed service time S1=k slots for k=1,2, …∞, with mass function f1(k)==Pr(S1=k) = μ(1- μ) k-1 with mean rate 0 or mean service rate μ2=1/β. Sequel to some objections raised on the use of the classical 'First Come First Served (FCFS)' Queue Discipline when the two heterogeneous servers operate as parallel service providers, an alternative Queue Discipline in a serial configuration of servers are considered in this work; the objective is that if, in a single-channel Queue in equilibrium, the service rate suddenly increases and exceeds the present service capacity, install a new channel to work serially with the first channel as suggested by Krishnamoorthy (1968). Using the embedded method subject to different service time distributions we present an exact analysis for finding the ‘Probability generating Function (PGF)’ of steady state number of customers in the system and most importantly, the actual waiting time expectation of customers in the system. This work shows that one can obtain all stationery probabilities and other vital measures for this Queue under certain additional and simple but realistic assumptions.
-
Geo (λ)/ Geo (μ) +G/2 Queues with heterogeneous servers operating under FCFS Queue Discipline
American Journal of Applied Mathematics and Statistics, 2015Co-Authors: Thaga Keaogile, Adebayo Fatai Adewole, Sivasamy RamasamyAbstract:This article discusses the steady analysis of a discrete time Queue of Geo/Geo+G/2 type. All arriving customers are served either by server-1 according to a geometrically distributed service time S1=k slots for k=1,2, …∞, with mass function f1(k)==Pr(S1=k) = μ(1- μ) k-1 with mean rate 0 or mean service rate μ2=1/β. Sequel to some objections raised on the use of the classical 'First Come First Served (FCFS)' Queue Discipline when the two heterogeneous servers operate as parallel service providers, an alternative Queue Discipline in a serial configuration of servers are considered in this work; the objective is that if, in a single-channel Queue in equilibrium, the service rate suddenly increases and exceeds the present service capacity, install a new channel to work serially with the first channel as suggested by Krishnamoorthy (1968). Using the embedded method subject to different service time distributions we present an exact analysis for finding the ‘Probability generating Function (PGF)’ of steady state number of customers in the system and most importantly, the actual waiting time expectation of customers in the system. This work shows that one can obtain all stationery probabilities and other vital measures for this Queue under certain additional and simple but realistic assumptions.
-
An M/G/2 Queue where customers are served subject to a minimum violation of FCFS Queue Discipline
European Journal of Operational Research, 2015Co-Authors: Sivasamy Ramasamy, Onkabetse A. Daman, Sulaiman SaniAbstract:This article discusses the steady state analysis of the M/G/2 queuing system with two heterogeneous servers under new Queue Disciplines when the classical First Come First Served ‘(FCFS)’ Queue Discipline is to be violated. Customers are served either by server-I according to an exponential service time distribution with mean rate μ or by server-II with a general service time distribution B(t). Sequel to some objections raised in the literature on the use of the classical FCFS Queue Discipline in heterogeneous service systems, two alternative Queue Disciplines (Serial and Parallel) are considered in this work with the objective that if the FCFS is violated then the violation is a minimum in the long run. Using the embedded method under the serial Queue Discipline and the supplementary variable technique under the parallel Queue Discipline, we present an exact analysis of the steady state number of customers in the system and most importantly, the actual waiting time expectation of customers in the system. Our work shows that one can obtain all stationary probabilities and other vital measures for this Queue under certain simple but realistic assumptions.
Rasoul Haji - One of the best experts on this subject based on the ideXlab platform.
-
Second Moment of Queue Size with Stationary Arrival Processes and Arbitrary Queue Discipline
International Journal of Engineering, 1993Co-Authors: Rasoul HajiAbstract:In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the Queue Discipline is arbitrary. For this queuing system we obtain the steady state second moment of the Queue size in terms of the stationary waiting time distribution of a similar queuing system in which the Queue Discipline is first-in-first-out.
