Dynamic Quality of Service in Software-Defined Networks

Quality of service is a necessary function of today’s networks. A proper quality of service ensures that packets are delivered effectively and fast. In traditional networks, quality of service has to be manually configured on each piece of hardware in the network. This manual procedure makes the process of implementing a quality of service in a network costly. Not to mention, if part of the configuration is incorrect, or a mistake is made during the configuration, everything must be corrected on each piece of affected hardware. In this paper, I will be exploring the effect of using a software-defined network controller and a quality of service to handle certain flows of traffic in a network. The main tool used is the OpenFlow defined queue. Queues and flow rules will allow a switch to control individual flows and the network resources that each flow consumes. Factors that will be explored are the bandwidth usage of a flow and the time taken by the network to implement new flow rules. While bandwidth usage is taken into account in traditional networks, changing a quality of service is a new dynamic

A step too far? Leader racism inhibits transgression credit

Prior research established that when in-group leaders commit serious transgressions, such as breaking enforceable rules or engaging in bribery, people treat them leniently compared with similarly transgressive regular group members or out-group leaders (‘transgression credit’). The present studies test a boundary condition of this phenomenon, specifically the hypothesis that transgression credit will be lost if a leader's action implies racist motivation. In study 1, in a corporate scenario, a transgressive in-group leader did or did not express racism. In study 2, in a sports scenario, an in-group or out-group leader or member transgressed rules with or without a racist connotation. Both studies showed that in-group transgressive leaders lost their transgression credit if their transgression included a racial connotation. Wider implications for constraining leaders' transgressions are discussed

Making sense of step-by-step procedures

Procedural instructions that consist of only a sequence of steps will probably be executable, but nevertheless ¿meaningless¿ to users of technical devices. The paper discusses three features that can make procedural instructions more meaningful: adding functional coordinating information, adding information about the use of the technical device in real life, and adding operational information about how the device works. The research literature supports the effectiveness of the first feature, but offers little evidence that real life elements enhance understanding of instructions. As for operational information, the research suggests that users are willing to read it, and that it contributes to better understanding and performance in the long term, but only if it is closely related to the procedure. As a conclusion, we propose a theoretical framework that assumes three levels of mental representation of instructions: syntactical, semantic, and situationa

Making a Great Performance: A Step-by-Step Guide

This project is meant to synthesize the body of knowledge I gained from my First-Year Seminar and my own research into a practical guide for excellence in performance. In it I address a number of stages and steps necessary for successful performance and various ways of going about those. While it focuses more heavily on the performance of music, due to my background and my intention to become a music educator, much of the text can be used in any field

Baby-Step Giant-Step Algorithms for the Symmetric Group

We study discrete logarithms in the setting of group actions. Suppose that $G$ is a group that acts on a set $S$. When $r,s \in S$, a solution $g \in G$ to $r^g = s$ can be thought of as a kind of logarithm. In this paper, we study the case where $G = S_n$, and develop analogs to the Shanks baby-step / giant-step procedure for ordinary discrete logarithms. Specifically, we compute two sets $A, B \subseteq S_n$ such that every permutation of $S_n$ can be written as a product $ab$ of elements $a \in A$ and $b \in B$. Our deterministic procedure is optimal up to constant factors, in the sense that $A$ and $B$ can be computed in optimal asymptotic complexity, and $|A|$ and $|B|$ are a small constant from $\sqrt{n!}$ in size. We also analyze randomized "collision" algorithms for the same problem

A Step Forward

QC 20140805</p