Balancing of rotors is used to remove unwanted vibrations caused by uneven distribution of mass around the axis of rotation of the rotor. Operation of an unbalanced rotor may causes shortening of bearing life, fatigue of materials and deformation of shafts. This work deals with construction of a balancing machine (balancer). Because of its good properties, a soft bearing type balancer was chosen for construction. This type of balancer achieves higher sensitivity at the cost of calibration required for each type of rotor. To capture the magnitude of vibration electrodynamics sensors were chosen. To enter data and display results a microprocessor is used.

VISIR “Virtual Instrument Systems in Reality” is a remote laboratory that empowers students and researchers to design, implement, and measure on electronic circuits remotely. Users are able to connect to this system regardless of their location and use traditional lab resources online via JavaScript and HTML5 enabled web browser. The VISIR project is deployed to seven universities around the globe including Blekinge Institute of Technology (BTH) in Sweden. In this thesis work, the main aim is to introduce load-balancing Scenarios in VISIR network in order to enable and improve load balancing, stability, and scalability in this system. The participant universities will be connected in a grid topology, and they exchange capabilities, features, and data repository in order to share workload and resources. For this purpose, the behavior of VISIR network nodes were studied and simplified as simple servers. According to the VISIR characteristics, infrastructure, and requirement a set of design paradigms and guidelines were defined for selecting suitable load balancing mechanism to be used in VISIR system. Four different load-balancing methods described, were selected for comparison in an experimental setup. Moreover, an experimental test bed with utilizing virtual Linux machines was modeled, and chosen scenarios were implemented and tested under different circumstances i.e. various number of servers and clients.

In this thesis, we investigate methods by which discrete event network diffusion simulators may execute without the restriction of lockstep or near lockstep synchronicity. We develop a discrete event simulator that allows free clock drift between threads, develop a differential equations model to approximate communication cost of such a simulator, and propose an algorithm by which we leverage information gathered in the natural course of simulation to redistribute agents to parallel threads such that the burden of communication is lowered during future replicates.

In the arid western United States (U.S.), population expansion is dependent on water supply. With the majority of the water being consumed in agriculture, municipalities often obtain water supply needed for growth from agriculture. Water supply reallocation generally occurs through agricultural-to-urban water right transfers. This trend in agricultural-to-urban water transfers drives the question of how to strike a balance between agricultural and urban water needs in rapidly growing arid regions. In the Intermountain West region of the United States, Utah is a state with a rapidly growing population and limited water supply. This study occurred between 2015 and 2016, using a multi-method approach to understand agricultural-to-urban water transfers in Utah. Inperson interviews, participant observation, and secondary data collection methods focused on existing challenges and opportunities for striking a balance between these water interests. Data revealed that water transfers out of agriculture and into municipalities are more significant to areas of Utah experiencing rapid population growth. Policy challenges arise as water is seen as a monetary asset, incentivizing the reintroduction of old water rights into an established water priority system. Further challenges occur as municipal uses are given preference in state development strategies over agricultural uses. This preference can incentivize both the selling of water to municipalities and the gathering of large municipal water right portfolios. Balancing growth and water interests in transitioning landscapes is suggested through the use of agreements, as well as regional planning and collaboration. This transition, if not properly planned and accounted for in the water budget, can create dilemmas with water availability, delivery, and use as separate water providers prepare for growth within their own geographic boundaries. The Mt. Nebo Water Agency provides the opportunity for stakeholder involvement and boundary-spanning to occur between regional municipal and agricultural interests. Stakeholder involvement and boundary-spanning solutions are considered crucial factors for regional planning, particularly with resources like water that traverse political boundaries.

We study a new method of generating random $d$-regular graphs by repeatedly applying an operation called pegging. The pegging algorithm, which applies the pegging operation in each step, is a method of generating large random regular graphs beginning with small ones. We prove that the limiting joint distribution of the numbers of short cycles in the resulting graph is independent Poisson. We use the coupling method to bound the total variation distance between the joint distribution of short cycle counts and its limit and thereby show that $O(\epsilon^{-1})$ is an upper bound of the $\eps$-mixing time. The coupling involves two different, though quite similar, Markov chains that are not time-homogeneous. We also show that the $\epsilon$-mixing time is not $o(\epsilon^{-1})$. This demonstrates that the upper bound is essentially tight. We study also the connectivity of random $d$-regular graphs generated by the pegging algorithm. We show that these graphs are asymptotically almost surely $d$-connected for any even constant $d\ge 4$. The problem of orientation of random hypergraphs is motivated by the classical load balancing problem. Let $h>w>0$ be two fixed integers. Let $\orH$ be a hypergraph whose hyperedges are uniformly of size $h$. To {\em $w$-orient} a hyperedge, we assign exactly $w$ of its vertices positive signs with respect to this hyperedge, and the rest negative. A $(w,k)$-orientation of $\orH$ consists of a $w$-orientation of all hyperedges of $\orH$, such that each vertex receives at most $k$ positive signs from its incident hyperedges. When $k$ is large enough, we determine the threshold of the existence of a $(w,k)$-orientation of a random hypergraph. The $(w,k)$-orientation of hypergraphs is strongly related to a general version of the off-line load balancing problem. The other topic we discuss is computing the probability of induced subgraphs in a random regular graph. Let $0<s<n$ and $H$ be a graph on $s$ vertices. For any $S\subset [n]$ with $|S|=s$, we compute the probability that the subgraph of $\mathcal{G}_{n,d}$ induced by $S$ is $H$. The result holds for any $d=o(n^{1/3})$ and is further extended to $\mathcal{G}_{n,{\bf d}}$, the probability space of random graphs with given degree sequence $\bf d$. This result provides a basic tool for studying properties, for instance the existence or the counts, of certain types of induced subgraphs.

We study a new method of generating random $d$-regular graphs by repeatedly applying an operation called pegging. The pegging algorithm, which applies the pegging operation in each step, is a method of generating large random regular graphs beginning with small ones. We prove that the limiting joint distribution of the numbers of short cycles in the resulting graph is independent Poisson. We use the coupling method to bound the total variation distance between the joint distribution of short cycle counts and its limit and thereby show that $O(\epsilon^{-1})$ is an upper bound of the $\eps$-mixing time. The coupling involves two different, though quite similar, Markov chains that are not time-homogeneous. We also show that the $\epsilon$-mixing time is not $o(\epsilon^{-1})$. This demonstrates that the upper bound is essentially tight. We study also the connectivity of random $d$-regular graphs generated by the pegging algorithm. We show that these graphs are asymptotically almost surely $d$-connected for any even constant $d\ge 4$. The problem of orientation of random hypergraphs is motivated by the classical load balancing problem. Let $h>w>0$ be two fixed integers. Let $\orH$ be a hypergraph whose hyperedges are uniformly of size $h$. To {\em $w$-orient} a hyperedge, we assign exactly $w$ of its vertices positive signs with respect to this hyperedge, and the rest negative. A $(w,k)$-orientation of $\orH$ consists of a $w$-orientation of all hyperedges of $\orH$, such that each vertex receives at most $k$ positive signs from its incident hyperedges. When $k$ is large enough, we determine the threshold of the existence of a $(w,k)$-orientation of a random hypergraph. The $(w,k)$-orientation of hypergraphs is strongly related to a general version of the off-line load balancing problem. The other topic we discuss is computing the probability of induced subgraphs in a random regular graph. Let $0<s<n$ and $H$ be a graph on $s$ vertices. For any $S\subset [n]$ with $|S|=s$, we compute the probability that the subgraph of $\mathcal{G}_{n,d}$ induced by $S$ is $H$. The result holds for any $d=o(n^{1/3})$ and is further extended to $\mathcal{G}_{n,{\bf d}}$, the probability space of random graphs with given degree sequence $\bf d$. This result provides a basic tool for studying properties, for instance the existence or the counts, of certain types of induced subgraphs.

As streaming video and audio over the Internet become popular, the deployment of a large-scale multimedia streaming application requires an enormous amount of server and network resources. In a video-on-demand environment, batching of video requests are often used to reduced I/O demand and improve throughput. Since users may leave if they experience long waits, a good video scheduling policy needs to consider not only the batch size but also the user defection probabilities and wait times. The common scheduling policies are the first-come-first-served (FCFS), the maximum queue length (MQL), and the maximum factored queue length (MFQL). But these schemes may choose the same video and serve the same video requests. Users choosing other video can not receive the video segment and may leave after waiting a long time. In this paper, we propose a batching policy that schedules the video with the concept of the bandwidth balancing scheme in DQDB networks. We refer to this as the SPBB policy. Our goal is to make sure that users can get the video segment and don¡¦t leave the video-on-demand system.

In this thesis, we first propose a modified version of the CDPthread to eliminate the restriction on the number of execution engines supported¡Xby dynamically instead of statically allocating the execution engines to a process. Then, we describe a method to balance the workload among nodes under the control of the modified CDPthread to improve its performance. The proposed method keeps track of the workload of each node and decides to which node the next job is to be assigned. More precisely, the number of jobs assigned to each node is proportional to, but not limited to, the number of cores in each node. Our experimental results show that with a small loss of performance compared to the original CDPthread, which uses a static method for allocating the execution engines to a process, the modified CDPthread with load balancing outperforms the modified CDPthread without load balancing by about 25 to 45 percent in terms of the computation time. Moreover, the modified CDPthread can now handle as many threads as necessary.

A peer-to-peer (P2P) system is a networked system characterized by the lack of centralized control, in which all or most communication is symmetric. Also, a P2P system is supposed to handle frequent arrivals and departures of nodes, and is expected to scale to very large network sizes. These requirements make the design of P2P systems particularly challenging. We investigate two central issues pertaining to the design of P2P systems: load balancing and routing. In the first part of this thesis, we study the problem of load balancing in the context of Distributed Hash Tables (DHTs). Briefly, a DHT is a giant hash table that is maintained in a P2P fashion: Keys are mapped to a hash space I --- typically the interval [0,1), which is partitioned into blocks among the nodes, and each node stores the keys that are mapped to its block. Based on the position of their blocks in I, the nodes also set up connections among themselves, forming a routing network, which facilitates efficient key location. Typically, in a DHT it is desirable that the nodes' blocks are roughly of equal size, since this usually implies a balanced distribution of the load of storing keys among nodes, and it also simplifies the design of the routing network. We propose and analyze a simple distributed scheme for partitioning I, inspired by the multiple random choices paradigm. This scheme guarantees that, with high probability, the ratio between the largest and smallest blocks remains bounded by a small constant. It is also message efficient, and the arrival or departure of a node perturbs the current partition of I minimally. A unique feature of this scheme is that it tolerates adversarial arrivals and departures of nodes. In the second part of the thesis, we investigate the complexity of a natural decentralized routing protocol, in a broad family of randomized networks. The network family and routing protocol in question are inspired by a framework proposed by Kleinberg to model small-world phenomena in social networks, and they capture many designs that have been proposed for P2P systems. For this model we establish a general lower bound on the expected message complexity of routing, in terms of the average node degree. This lower bound almost matches the corresponding known upper bound.

A peer-to-peer (P2P) system is a networked system characterized by the lack of centralized control, in which all or most communication is symmetric. Also, a P2P system is supposed to handle frequent arrivals and departures of nodes, and is expected to scale to very large network sizes. These requirements make the design of P2P systems particularly challenging. We investigate two central issues pertaining to the design of P2P systems: load balancing and routing. In the first part of this thesis, we study the problem of load balancing in the context of Distributed Hash Tables (DHTs). Briefly, a DHT is a giant hash table that is maintained in a P2P fashion: Keys are mapped to a hash space I --- typically the interval [0,1), which is partitioned into blocks among the nodes, and each node stores the keys that are mapped to its block. Based on the position of their blocks in I, the nodes also set up connections among themselves, forming a routing network, which facilitates efficient key location. Typically, in a DHT it is desirable that the nodes' blocks are roughly of equal size, since this usually implies a balanced distribution of the load of storing keys among nodes, and it also simplifies the design of the routing network. We propose and analyze a simple distributed scheme for partitioning I, inspired by the multiple random choices paradigm. This scheme guarantees that, with high probability, the ratio between the largest and smallest blocks remains bounded by a small constant. It is also message efficient, and the arrival or departure of a node perturbs the current partition of I minimally. A unique feature of this scheme is that it tolerates adversarial arrivals and departures of nodes. In the second part of the thesis, we investigate the complexity of a natural decentralized routing protocol, in a broad family of randomized networks. The network family and routing protocol in question are inspired by a framework proposed by Kleinberg to model small-world phenomena in social networks, and they capture many designs that have been proposed for P2P systems. For this model we establish a general lower bound on the expected message complexity of routing, in terms of the average node degree. This lower bound almost matches the corresponding known upper bound.