Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets.

Asymmetries and shortages of the network neutrality principle: What could neutrality achieve?

The debate on network neutrality has reached sufficient notoriety to eliminate the need for detailed explanation. A simple definition will suffice: “network neutrality” is understood as the principle by which the owners of broadband networks would not be allowed to establish any type of discrimination or preference over the traffic transmitted through them

Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets.

Co2 capture in power plants-using the oxy-combustion principle

In the C02 capture from power generation, the energy penalties for the capture are one of the main challenges. Nowadays, the post-combustion methods have energy penalties 10wer than the oxy combustion and pre-combustion technologies. One of the main disadvantages of the post combustion method is the fact that the capture ofC02at atmospheric pressure requires quite big equipment for the high flow rates of flue gas, and the 10w partial pressure of the CO2generates an important 10ss of energy. The A1lam cyc1e presented for NETPOWER gives high efficiencies in the power production and 10w energy penalties. A simulation of this cyc1e is made together with a simulation of power plants with pre-combustion and post-combustion capture and without capture for natural gas and forcoa1. The simulations give 10wer efficiencies than the proposed for NETPOWER For natural gas the efficiency is 52% instead of the 59% presented, and 33% instead of51% in the case of using coal as fuel. Are brought to light problems in the CO2compressor due the high flow ofC02that is compressed unti1300 bar to be recyc1ed into the combustor.

Hoshin Kanri. Principle Centered Leadership

The purpose of this paper is to sketch the outlines of what will, hopefully become my PhD thesis: the proposal of an evolutional leadership behavioral pattern, Hoshin Kanri, that enables process owners in organizations attain alignment by achieving their goals while increasing trust. ! I intend to develop such a behavioral pattern or “proper way” 善道 1 by adopting a network perspective over two organizational dimensions: process dimension and process owner dimension. In both dimensions I will propose measures of their topological structure and functionality. From there I will propose quantifiable characteristics that will help me enunciate several hypothesis about their dynamical and evolutional characteristics. I intend to test these hypothesis in the field and report the results to enable others to challenge this research.

On the harmonic analysis of cup anemometer rotation speed: A principle to monitor performance and maintenance status of rotating meteorological sensors

The calibration results of one anemometer equipped with several rotors, varying their size, were analyzed. In each case, the 30-pulses pert turn output signal of the anemometer was studied using Fourier series decomposition and correlated with the anemometer factor (i.e., the anemometer transfer function). Also, a 3-cup analytical model was correlated to the data resulting from the wind tunnel measurements. Results indicate good correlation between the post-processed output signal and the working condition of the cup anemometer. This correlation was also reflected in the results from the proposed analytical model. With the present work the possibility of remotely checking cup anemometer status, indicating the presence of anomalies and, therefore, a decrease on the wind sensor reliability is revealed.