Using Client Migrations for Load-Balancing in Video-on- Demand Systems
|
|
- Joshua McLaughlin
- 8 years ago
- Views:
Transcription
1 The Interdisciplinary Center, Herzlia Efi Arazi School of Computer Science Using Client Migrations for Load-Balancing in Video-on- Demand Systems M.Sc. Final project Submitted by Adam Oren Under the supervision of Dr. Tami Tamir September, 2007.
2 Table of Contents 1 Introduction Problem Statement Objectives and Motivation Organization of this Document Preliminaries Definitions and Notation Implemented Algorithms The Static Phase The Dynamic Phase Experimental Study Simulation Model Storage System File Properties User Behavior The Simulator Simulation Results Experiment 1 Varying arrival gaps Experiment 2 Varying pause frequencies Experiment 3 Varying remote service bandwidth costs Experiment 4 Varying migration threshold Experiment 5 Varying color migration thresholds Experiment 6 Partial migrations Experiment 7 - Changing pause duration Experiment 8 Tracking migrations performance over time Experiment 9 Varying pause frequencies Conclusions Upper bound Migrate only at pauses method performance Migrations can be done with a subset of the migration types and still give satisfying results Too low migration threshold causes low migration rate The remote service bandwidth cost has great impact on the number of rejected customers Long pause duration will reduce performance The system performs better with pause migrations than with free migrations over time Migrations improves performance at best by about 20% Further Research
3 1 Introduction 1.1 Problem Statement Given a set of video files with fixed popularities, we need to find a data placement mechanism and a dynamic load balancing scheme that achieve best Quality of Service with respect to various measures (including throughput, resource utilization, resource requirement) 1.2 Objectives and Motivation This document presents the experimental results of the simulation system we developed by feeding it different sets of parameters. Given the problem and some known parameters (number of movies, movie length, number of clusters, etc.) we want to detect sets of parameters that enable successful simulations. We declare a successful simulation as one that has less than 1% rejections. we would like to find the set (or sets) of parameters that services the largest number of clients successfully. Because of the dynamic nature of the system, we can use load balancing to improve the quality of service. Migrating customers from one disk to another can make more room for other user, because different disks contain different movies and have different available load. We want the migrations to improve the locality of the servers. We distinguish between three types of migrations: 1. Green migration: applying the migration will improve the locality of the service. 2. Blue migration: applying the migration won't change the locality of the service. 3. Red migration: applying the migration will hurt the locality of the service. We distinguish between two settings: in the first one we will allow the migrations to occur only when a user pauses his transmission. This setting is motivated by the fact that migrating a user during a movie causes a brief flickering in current technologies and it is desirable to avoid or minimize it. In the second setting we allow migrations to occur whenever applicable, which will give us a good comparison to the first setting. We would like to analyze the results and make some conclusions about the system behavior. 1.3 Organization of this Document. In section 2 we discuss the algorithms we implemented in our Media-on- Demand system simulator. We first give some definitions and notations used later to describe the algorithms, and then describe each algorithm 3
4 briefly. In section 3 we present the experimental study. In section 3.1 we present the simulation model abilities. Then, we discuss the simulator itself and how it is implemented. In section 4 we present the analyzed data of the experimental results we got. In section 5 we present the conclusion of these experiments. Finally, In section 6 we suggest directions for further research and improvements of the model. 2 Preliminaries 2.1 Definitions and Notation Static Phase - In the static phase we have two main processes, the first process is to determine how many copies each movie should have in the system, according to its popularity, and the second process is to determine in which disks and cluster to put those copies. M - the number of movies the system contains. Theta Parameter - A Zipf distribution over M items is defined as follows. C The probability of the i-th item is p i = 1 Θ, where 0 Θ 1. i Recursive Depth - How many time we divide the items collection to 80% / 20%. Pop Cluster - The system services clients from 3 geographical regions. Each of the three pop-clusters is located in one of these regions. Each of those clusters contains 10 disks. The pop clusters can service remote clients, but only to a parameter defined fraction of their bandwidth. Root Cluster - The root consists of 20 disks, and it contains at least one copy of all the movies in the system. The root is being used to service remote clients when the local cluster cannot service them. Disk Capacity -The amount of movies a disk can contain. Dynamic Phase - In the dynamic phase the system gets requests for movies and assign customer to their requested movie, or reject them if it cannot service them. The system also balance itself by migrating customers from one disk to another. Successful simulation - a simulation in which at most 1% of the client requests are rejected. Green migration edge - applying the migration will improve the locality of the service. That is, the source disk is in a remote cluster for some client while the target disk is local. Blue migration edge - applying the migration will not change the locality of the service. That is, the source disk and the target disk belong to the same cluster or to two neighbor clusters. 4
5 Red migration edge - applying the migration will hurt the locality of the service. That is, the source disk is in a local cluster, while the target disk is in remote cluster. Parameters Static Utilization Parameter - measuring the fraction of the storage that is allowed to be used for the initial set of movies. Migration Threshold - it's the load threshold that a disk reach in order to start migrating customers from it. It is also being used to determined if a disk can accept migrations from other disks. Red / Blue / Green Threshold - The difference between the source disk and the target disk that should exist for the migration to be allowed. Root / Pop Cluster Remote Cost - The load overhead required in order to give the customer remote service (from another pop cluster or from the root). Expected Pause Frequency - The expected number of pauses a client will do during watching one movie. Expected Pause Duration - The expected time the user will be pausing his movie with each pause. Migrate During Pause Determines if the system will perform migrations during the customers pauses. Migrate During Not Pause Determines if the system will perform migrations when it is possible to do so (but actually not during the customers pauses). Statistics Arrival Gap - the expected gap in seconds between customers' requests. Arrived Customers - how many customers got successfully serviced by the system. Rejected Customers - how many customers got rejected by the system. Migrated Customers The total number of migrations performed by the customers. Green Migrated how many customers performed migration using a green edge. Blue Migrated how many customers performed migration using a blue edge. Red Migrated how many customers performed migration using a red edge. 2.2 Implemented Algorithms The simulation process is roughly divided into two phases: the static phase and the dynamic phase. The static phase initializes the system: during this 5
6 phase we need to determine how many copies each movie should have and where those copies should be stored. We are given the vector of movies ordered by their popularity, and the distribution that defines the ratio between the movies. The dynamic phase starts when the first client requests a movie. Each disk has a certain fixed load capacity to service clients and we need to determine which cluster and which disk in this cluster will service the client. If no disk can service the client then he is rejected. The system balances the load over the disks also by migrating customers from one disk to another from time to time. In this section we will describe in detail the algorithms we used to implement the above phases The Static Phase 1. First, we calculate how many copies of each movie will be stored in the system. 1. Compute how many movies should be stored in total 1. The number of copies we can store is the total number of disks multiplied by the disk capacity multiplied by the static utilization parameter. 2. Next, find the probability for each movie to be requested. 1. Initialize a vector of size M 2. Cut the vector to two parts: 20% and 80% (see image). 6
7 3. The 20% part is Zipf distributed: 0.2M Calculate the Zipf C constant => C = 1 5 i Θ 2. For all the Zipf distributed movies C 1. Calculate the probability using Zipf: p i = 1 Θ i 3. Assign their probability to the probability vector. 4. Now handle the 80% part (the tail) 1. level = 1 2. k=recursivedepth 3. While (level<=k) 1. Cut the vector The 20% part gets probability of level++; 2. Divide this part to and repeat recursively (until depth k) 3. The 80% part (the tail) gets the cumulative probability of We multiply the total number of copies computed in step 1 by the probability for each movie to get the number of copies we should assign for that movie. 1. We make sure that each of the movies has at least one copy. 2. Now we take all movies that have more copies than the number of disks (each disk should have at most one copy of a certain movie) 1. We distribute the difference between that movie's copies to the number of disks to all other disks. For example, if a movie should get 80 copies and there are 50 disks in the system then 30 copies should be distributed among all the movies that 1 7
8 have less than 50 copies, if there are 1000 movies that have less than 50 copies then each of these movies should have 0.03 more copies. 3. We round the number of copies each movie got and distribute the remainder between all movies. 1. If a movie has copies, we round the number to 47 and we take the remainder and distribute it between the other movies (just as we did in step 2.1). 4. Now we need to determine in which clusters and disks the movies should be stored The Dynamic Phase 1. Store the movies starting from the most popular one, concluding with the least popular. Assume you need to store Fi copies of movie i, then 2. Store one copy of i on the root cluster. 3. If Fi >1, use round-robin over the clusters; in each cluster store one copy of the movie on the least loaded disk (that does not hold a copy of this movie yet). If all the disks of some cluster are full to capacity 1300 x Static Utilization Parameter, move to the next cluster. It might be that more than one disk from a cluster will hold a copy of the movie. Note that the root cluster participates in this stage as a regular cluster and might get additional copies of i. As we mentioned in section 1.2, there are three types of migration edges - red, blue and green. each color denotes the effect we will get by migrating with this edge in the context of locality. red edges means that we will hurt the locality, i.e. we will migrate a customer to a further cluster than his current cluster. blue edges mean that the migration will have no effect on the locality, it can either be migration to the same cluster or to a cluster that is as far from the customer as his previous cluster. green migration will actually improve the locality, meaning that migrating with this edge will service the user from a closer cluster than the previous one. In order to migrate a customer from d1 to d2 three conditions need to hold: (1) d 2 holds at least one copy of some file that is currently transmitted by d 1, (2) the load on d 1 is at least Migration Threshold, and (3) the load on d 2 is at most Migration Threshold-g (another parameter). g is the edge weight, specifically: Red / Blue / Green Threshold. we give them different weights because we would like to encourage green edges more than blue and red edges, and blue edges more than red edges. we would like to increase the 8
9 locality as much as possible, because remote service costs more than local service. 1. Loop for 24 hours 1. generate a new customer request 1. generate customer request time 2. The arrival time is generated using the arrival gap parameter as an input to a random variable generator that simulates exponential distribution. 3. generate the customer region (which of the three clusters the request is coming from) 4. randomize a movie that the customer requests 2. check whether there are awaiting events to handle before the customer arrival 1. if there are departure events 1. release the customer from the movie and update the disk capacity 2. If there are pause events 1. Check if the disk has reached the migration threshold 2. if it has, check if the customer can migrate to another disk 1. if the customer edge is valid for migration 1. migrate the customer 2. else 3. Find the best edge in the current state, and if it exists, migrate the customer with it. 3. Add the customer arrival event to the time line (and handle it). 1. Find an available disk in an available cluster containing the movie 2. If the local cluster doesn't contain the movie, we search the other clusters and add the appropriate remote service cost. 3. assign the customer to the available disk found (or reject him if no disk was found) 4. Select the best possible edge to another disk from all the disks containing the movie (by that order - green, blue and then red). 5. add the edge to the graph 4. Generate customer pauses according to the expected number of pauses parameter. 1. Distribute the pauses events along the movie duration. 2. Add resuming events after each pause. 5. Add the leaving event to the time line. The leaving event should is added after calculating the movie length and the expected pausing duration. 9
10 3 Experimental Study In this section we discuss the way we simulated the system and how the simulator is implemented. 3.1 Simulation Model As mentioned above, we are to simulate an on-demand multimedia system. Our requests arrival model is designed to simulate the customers behavior in real scenarios. Our simulation will simulate arrival of movie requests and pauses made by users Storage System The Media-on-Demand system consists of 50 disks (servers) organized in four clusters. One of these clusters is the root. The other 3 are called popclusters. The root consists of 20 disks, and each of the 3 pop clusters consists of 10 disks. The storage capacity of each disk is 3.5 Terabytes. For standard movie files (we assume all the movies have the same storage requirement), this means that each disk is capable of storing 1300 movie files. Therefore, the total storage capacity of the system is 50*1300 = movie files. The streaming (load) capacity of each disk is L= 480. As will be explained later, the bandwidth required for a transmission of one stream depends on the locations of the transmitting server and the destination File Properties All movies are assumed to have the same length of 90 minutes. There are 6000 movies in the system. The static phase determines the initial allocation of the movie files. In the following we describe the distribution of the file popularities. This distribution can be viewed also as the probability that a specific movie is requested by an arriving client. The first (most popular) 20% of the movies are distributed with Zipf distribution, the other 80% of the movies are distributed with distribution. This means that 20% of this part has cumulative probability 0.8 and the rest (the tail) 80% of the movies has cumulative probability 0.2. The first 20% have equal probability and the other 80% continue to be divided into the same way until we reach a certain level determined by a parameter User Behavior Client requests are expected to arrive every arrival gap seconds. When a request arrives, if the system can service that request that client is serviced immediately and he will get rejected if it cannot. we predict that 10
11 the client is also expected to do a certain amount of pauses during the movie which is determined by another parameter. The pauses length is distributed exponentially with an expected value of ExpectedPauseLength, and the client resumes after that time. The client leaves the system after the period of time that is equal to the movie length plus his pauses length. Clients have equal probability to come from each of the three regions and the movies will be picked by the clients according to their popularity. 3.2 The Simulator The simulator is a Windows application written in.net C#. The main class is called Simulator, and it manages the simulation process. It has three main methods: StaticAssignment(), StartSimulation(), EndSimulation(). StaticAssignment() implements the static phase process, and what it generally does is to assign the movies to the different clusters before the simulation starts. StartSimulation() implements the dynamic phase process, and what it generally does is to simulate client arrivals, assign the client to their requested movies and balance the system. EndSimulation() is used to interrupt the simulation process and stop it, it's being used inside the project when the system overloads and can be used outside of the project as well. In order to handle the different events in the right order we have a class called TimeLine the keeps track on the different events and prevents, for example, a situation that a client's request will be serviced before other clients should have been released. The TimeLine class keeps track on all the events including client's arrival, leaving pausing and resuming. In order to handle the migration process we have a class call MigrationManager. This class is using a graph object as data structure to keep track after possible migrations to balance the load on the cluster. Each time we assign a customer to a movie, we look for the best possible migration, so when the time will come (for example, when that customer will pause) we can check if the migration is possible and migrate the customer. MigrationManager has also a method to migrate an entire disk (if the disk can be migrated). The Logger class allows us to log the events to a XML file. It is turned off by default due to performance issues. The Statistics class is a static class we use to gather data during the simulation process (how many customers were serviced, how many got rejected, etc.). We will use these results later to draw conclusions. The project design is designed to be object oriented as much as possible. Entities in the system like: cluster, pop cluster, disk, root, time event, etc. are represented by different classes and have some hierarchy between them. These classes can be extended easily later if we would like to simulate the system even more accurately (for example, add names to the 11
12 movie or to the clusters). Some classes aggregate other classes. for example, PopCluster (which is derived from Cluster) aggregate a collection of disks in it, and each disk aggregate a collection of the movies the disk contains, and of course the customers who are assigned to that disk. Other classes in the project mostly have technical roles. We use those classes to unit test the project, manage settings, declare constants, draw graphs and to test the system. 4 Simulation Results In order to check the how the system's quality of service behaves under different sets of parameters, we simulated several experiments. A good simulation is a one that services a maximal number of customers and has less than 1% rejections. Since the rejection rate is our main success indicator, we will mostly check this parameter against different scenarios. To provide basis of comparison, all experiments were simulated under similar basic conditions: hours simulation. 2. Teta Parameter = Same input stream (unless mentioned otherwise) seconds arrival gap (unless mentioned otherwise). 5. We perform migrations on customers only during their pauses of the movie (unless mentioned otherwise). 6. We expect each customer to pause his movie twice (unless mentioned otherwise). 7. We expect each pause to last on the average 60 seconds (unless mentioned otherwise) load unit when we serve a customer through another cluster (unless mentioned otherwise) load unit when we serve a customer through the root cluster (unless mentioned otherwise). 10. The migration threshold is 400 (unless mentioned otherwise). 11. Red Threshold = 8, Blue Threshold = 2, Green Threshold = 0 (unless mentioned otherwise). 12
13 Theta = 0.5 Theta = 0.4 Theta = 0.6 Figure 1.1: The distribution of the top 20% of the copies after the static phase (see section 2.2.1) The graph in figure 1.1 represents the accumulated probability of the movies according to Zipf distribution under different Theta constants. Below we can see actual data that we are trying to simulate. We can see that when Theta = 0.5 our graph is very similar to the actual data. Figure 1.2: Proportion of video accesses sorted by popularity. A total of 6176 videos (Taken from: Understanding User Behavior in Large-Scale Video-on- Demand Systems, EuroSys 2006) 13
14 In figure 1.3 we can see the simulated distribution of the movie copies probabilities in comparison to the real data in figure 1.2. Theta = 0.5 Figure 1.3: The simulated distribution of the movie copies created by our VOD system in the static phase 4.1 Experiment 1 Varying arrival gaps In this experiment we simulated the system with varying arrival gap between the customer requests. In figure 2.1 we can see that a small gap (under 0.26 seconds) overloads the system, but we can see that already with 0.28 seconds gap there are no rejected customers. As we can see in figure 2.2, the arrival gap has strong effect on the number of accepted requests, and when we increase the gap, the quality of service gets reduced. 14
15 Figure 2.1: Number of rejected requests depends on the arrival gap (see section 2.2.2) Figure 2.2: Number of accepted requests depends on the arrival gap (see section 2.2.2) 4.2 Experiment 2 Varying pause frequencies In this experiment we can see how the number of pauses affects the number of rejections. It might be surprising to see that although the 15
16 migrations are only being performed when the user pauses his movie, the quality is still being reduced as the number of pauses increases. This happens because the more pauses we have for each user, the more idle time the system cannot use. In other words, the more pauses we have, the longer the movies get and thus the system's quality of service get damaged. Figure 3: Number of rejected requests depends on the pause frequency. The blue and red lines were generated when migrations happened only at pauses, and the orange line was generated when migration happened always (see section 2.2.2) 4.3 Experiment 3 Varying remote service bandwidth costs In this experiment we can see how the bandwidth cost of the remote services effect the number of rejected requests. 16
17 Figure 4: Number of rejected requests depends on the fraction of bandwidth for remote service (see section 2.2.2) 4.4 Experiment 4 Varying migration threshold Figure 5: Number of rejected requests depends on the minimum migration threshold (see section 2.2.2) 4.5 Experiment 5 Varying color migration thresholds In this experiment we can see the number of rejected customers when we increase the threshold condition of each migration color and when we 17
18 increase all the thresholds together. Figure 6: Number of rejected requests depends on color specific varying migration threshold. Here we compare the performance, by changing a different migration threshold each time and all of them at the same time (see section 2.2.2). We can see that if we disable one of the migration types the system's quality of service is still about the same (see section 5.3). 4.6 Experiment 6 Partial migrations In this experiment we can see that even if we use only a subset of the migration types, we are still able to get good results in most cases. Red Migrations Blue Migrations Green Migrations Rejected Customers X X X 298 X X 102 X X 244 X X 176 X 151 X 315 X overloaded overloaded 18
19 Table 1: The number of rejected customers depends on the type of edges used in the simulations. 4.7 Experiment 7 - Changing pause duration Figure 7: Number of rejected requests depends on pause duration. Note that when the pause duration is 0 seconds, it will be redundant to perform migrations only during pauses. The system would have overloaded in that case if we would have taken that factor into account. 19
20 4.8 Experiment 8 Tracking migrations performance over time Figure 8: Number of migrations depends on time (represented by the current customer arrival). We can see that we get more migrations with 'free migrations' mode at the left side of the graph, but in the middle it changes and there are more migrations in 'pause migrations' mode (see section 5.7). 20
21 4.9 Experiment 9 Varying pause frequencies Figure 9: Maximum number of accepted requests depends on the pause frequency. As in experiment 2, the peak is achieved when we have expected pauses per customer. If there are no pauses, and as a result no migrations, we can only service about 260,000 customers is 24 hours (instead of about 300,000). 21
22 5 Conclusions we now summarize the main results of our study. We explain the results we obtained, expected and unexpected. We sum up the results and their implications, and mention several issues that may be interesting for further research. 5.1 Upper bound If the system occupies all disk with customers all the time in 24 hours, the number of customers that will be serviced will be 384,000 (50 disks X 480 customers per disk * 16 movies = 384,000). Of course, this bound can never be reached because requests don't arrive in groups and because of migrations and remote services, but this can give us a reference point to our results. 5.2 Migrate only at pauses method performance When the system performs a migration of a customer from one server to another, the user may see flickering in the screen if he's being migrated while his movie plays. Because of that, we prefer to perform migrations on customers only when they pause their movie. In section 4.2 we can see that no matter how many pauses we expect the user to do, the results will be quite similar to if we do migration only at pauses or always. In section 4.1, if the users are expected to pause their movie twice, the performance is similar to the results we get if we migrate customers whenever possible. With these results we can conclude that performing migrations on the customers only when they pause their movie will not hurt the quality of service. 5.3 Migrations can be done with a subset of the migration types and still give satisfying results As we can see in table 1 (section 4.6), we get good results even if use only one type of edges in most cases. This happens because the total number of migrations is about the same in most cases, so the system actually compensates for the missing edges, and converges to the same results. The one exception is with green edges, because the number of green migrations is relatively low, it will not be enough to settle with just green edges and the system overloads. Experiment 5 supports this results and we can see that when we change the threshold of just color it doesn't affect the results very much. If we look at the red line we can see that disabling the red migrations hurts the quality of service slightly more than the others. The reason for that is that it is much easier to compensate the loss of a migration type by using red migrations than by using any other
23 type of migrations, because it is easier to hurt the locality than to improve it. When we disable the red migrations, the overall number of migrations is smaller and that is causing more requests to get rejected. Of course if we raise all thresholds together the system's migrations will get hurt along with the overall performance. 5.4 Too low migration threshold causes low migration rate In experiment 4 (section 4.4) we can see that the minimum migration threshold can definitely be too low, this might be surprising at first, but the reason for this is that when we lower the minimum migration threshold we not only encourage disks to migrate, but also discourage disks to accept migrations. The best result is somewhere in the middle. 5.5 The remote service bandwidth cost has great impact on the number of rejected customers In experiment 3 (section 4.3) we can see that even the slightest increase in the remote service bandwidth cost can cause the system to overload very quickly. Because under the experiment settings local services will not suffice for successful simulation, the system must use remote service, and because even if we raise the cost just by 0.1 load bandwidth, it means 10% more in the total remote service cost, and that is what causing the system to overload very quickly. 5.6 Long pause duration will reduce performance In experiment 7 (section 4.7) we can see that when we increase the pause duration, the number of rejected customers will stay steady until a certain point and then the number of rejected customers will rise up very quickly and eventually the system will overload. 5.7 The system performs better with pause migrations than with free migrations over time In experiment 8 (section 4.8) we can see that at the beginning there are more migrations in the free migrations, but as the simulation progress, we can see that the pause migrations are ahead. The reason for that is that when we do free migrations we are in a kind of greedy algorithm (i.e. we migrate when we can) but if we are in pause migration then we wait more time before we migrate and then we sometimes find a better migration available (blue instead of red for example), and because of that the load is reduced and there's more room for other customers. 23
Load Balancing. Load Balancing 1 / 24
Load Balancing Backtracking, branch & bound and alpha-beta pruning: how to assign work to idle processes without much communication? Additionally for alpha-beta pruning: implementing the young-brothers-wait
More informationProduction Floor Optimizations Using Dynamic Modeling and Data Mining
The Interdisciplinary Center, Herzliya Efi Arazi School of Computer Science Production Floor Optimizations Using Dynamic Modeling and Data Mining M.Sc dissertation Submitted by Under the supervision of
More informationLoad Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load
More informationDistributed Caching Algorithms for Content Distribution Networks
Distributed Caching Algorithms for Content Distribution Networks Sem Borst, Varun Gupta, Anwar Walid Alcatel-Lucent Bell Labs, CMU BCAM Seminar Bilbao, September 30, 2010 Introduction Scope: personalized/on-demand
More informationA Dynamic Approach for Load Balancing using Clusters
A Dynamic Approach for Load Balancing using Clusters ShwetaRajani 1, RenuBagoria 2 Computer Science 1,2,Global Technical Campus, Jaipur 1,JaganNath University, Jaipur 2 Email: shwetarajani28@yahoo.in 1
More informationCHAPTER 5 WLDMA: A NEW LOAD BALANCING STRATEGY FOR WAN ENVIRONMENT
81 CHAPTER 5 WLDMA: A NEW LOAD BALANCING STRATEGY FOR WAN ENVIRONMENT 5.1 INTRODUCTION Distributed Web servers on the Internet require high scalability and availability to provide efficient services to
More informationQuantitative Analysis of Cloud-based Streaming Services
of Cloud-based Streaming Services Fang Yu 1, Yat-Wah Wan 2 and Rua-Huan Tsaih 1 1. Department of Management Information Systems National Chengchi University, Taipei, Taiwan 2. Graduate Institute of Logistics
More informationVISUALIZING HIERARCHICAL DATA. Graham Wills SPSS Inc., http://willsfamily.org/gwills
VISUALIZING HIERARCHICAL DATA Graham Wills SPSS Inc., http://willsfamily.org/gwills SYNONYMS Hierarchical Graph Layout, Visualizing Trees, Tree Drawing, Information Visualization on Hierarchies; Hierarchical
More informationComputing Load Aware and Long-View Load Balancing for Cluster Storage Systems
215 IEEE International Conference on Big Data (Big Data) Computing Load Aware and Long-View Load Balancing for Cluster Storage Systems Guoxin Liu and Haiying Shen and Haoyu Wang Department of Electrical
More informationThe International Journal Of Science & Technoledge (ISSN 2321 919X) www.theijst.com
THE INTERNATIONAL JOURNAL OF SCIENCE & TECHNOLEDGE Efficient Parallel Processing on Public Cloud Servers using Load Balancing Manjunath K. C. M.Tech IV Sem, Department of CSE, SEA College of Engineering
More informationAn Approach to Load Balancing In Cloud Computing
An Approach to Load Balancing In Cloud Computing Radha Ramani Malladi Visiting Faculty, Martins Academy, Bangalore, India ABSTRACT: Cloud computing is a structured model that defines computing services,
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding
More informationEfficient Parallel Processing on Public Cloud Servers Using Load Balancing
Efficient Parallel Processing on Public Cloud Servers Using Load Balancing Valluripalli Srinath 1, Sudheer Shetty 2 1 M.Tech IV Sem CSE, Sahyadri College of Engineering & Management, Mangalore. 2 Asso.
More informationOnline Classification of VoD and Live Video Streaming Applications
The Interdisciplinary Center Herzliya Efi Arazi School of Computer Science Online Classification of VoD and Live Video Streaming Applications M.Sc. Dissertation Submitted in Partial Fulfillment of the
More informationOscillations of the Sending Window in Compound TCP
Oscillations of the Sending Window in Compound TCP Alberto Blanc 1, Denis Collange 1, and Konstantin Avrachenkov 2 1 Orange Labs, 905 rue Albert Einstein, 06921 Sophia Antipolis, France 2 I.N.R.I.A. 2004
More informationLoad Balancing in cloud computing
Load Balancing in cloud computing 1 Foram F Kherani, 2 Prof.Jignesh Vania Department of computer engineering, Lok Jagruti Kendra Institute of Technology, India 1 kheraniforam@gmail.com, 2 jigumy@gmail.com
More informationIMPROVED PROXIMITY AWARE LOAD BALANCING FOR HETEROGENEOUS NODES
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 2 Issue 6 June, 2013 Page No. 1914-1919 IMPROVED PROXIMITY AWARE LOAD BALANCING FOR HETEROGENEOUS NODES Ms.
More informationEnergy Constrained Resource Scheduling for Cloud Environment
Energy Constrained Resource Scheduling for Cloud Environment 1 R.Selvi, 2 S.Russia, 3 V.K.Anitha 1 2 nd Year M.E.(Software Engineering), 2 Assistant Professor Department of IT KSR Institute for Engineering
More informationOptimal Load Balancing in a Beowulf Cluster. Daniel Alan Adams. A Thesis. Submitted to the Faculty WORCESTER POLYTECHNIC INSTITUTE
Optimal Load Balancing in a Beowulf Cluster by Daniel Alan Adams A Thesis Submitted to the Faculty of WORCESTER POLYTECHNIC INSTITUTE in partial fulfillment of the requirements for the Degree of Master
More informationDecentralized Utility-based Sensor Network Design
Decentralized Utility-based Sensor Network Design Narayanan Sadagopan and Bhaskar Krishnamachari University of Southern California, Los Angeles, CA 90089-0781, USA narayans@cs.usc.edu, bkrishna@usc.edu
More informationCROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING
CHAPTER 6 CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING 6.1 INTRODUCTION The technical challenges in WMNs are load balancing, optimal routing, fairness, network auto-configuration and mobility
More informationComparative Analysis of Congestion Control Algorithms Using ns-2
www.ijcsi.org 89 Comparative Analysis of Congestion Control Algorithms Using ns-2 Sanjeev Patel 1, P. K. Gupta 2, Arjun Garg 3, Prateek Mehrotra 4 and Manish Chhabra 5 1 Deptt. of Computer Sc. & Engg,
More informationHow To Model A System
Web Applications Engineering: Performance Analysis: Operational Laws Service Oriented Computing Group, CSE, UNSW Week 11 Material in these Lecture Notes is derived from: Performance by Design: Computer
More informationSCALABILITY AND AVAILABILITY
SCALABILITY AND AVAILABILITY Real Systems must be Scalable fast enough to handle the expected load and grow easily when the load grows Available available enough of the time Scalable Scale-up increase
More informationLCMON Network Traffic Analysis
LCMON Network Traffic Analysis Adam Black Centre for Advanced Internet Architectures, Technical Report 79A Swinburne University of Technology Melbourne, Australia adamblack@swin.edu.au Abstract The Swinburne
More informationKeywords: Dynamic Load Balancing, Process Migration, Load Indices, Threshold Level, Response Time, Process Age.
Volume 3, Issue 10, October 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Load Measurement
More informationLoad Balancing in Distributed Web Server Systems With Partial Document Replication
Load Balancing in Distributed Web Server Systems With Partial Document Replication Ling Zhuo, Cho-Li Wang and Francis C. M. Lau Department of Computer Science and Information Systems The University of
More informationQoS Parameters. Quality of Service in the Internet. Traffic Shaping: Congestion Control. Keeping the QoS
Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:
More informationAN ADAPTIVE DISTRIBUTED LOAD BALANCING TECHNIQUE FOR CLOUD COMPUTING
AN ADAPTIVE DISTRIBUTED LOAD BALANCING TECHNIQUE FOR CLOUD COMPUTING Gurpreet Singh M.Phil Research Scholar, Computer Science Dept. Punjabi University, Patiala gurpreet.msa@gmail.com Abstract: Cloud Computing
More informationAIC Attendance Management System
AMS E 2 (V6.0) AIC Attendance Management System Enterprise Edition Specification 1. Enterprise Edition Transfer the application from server base to service. Import data automatically (prior schedule each
More informationAdaptive Tolerance Algorithm for Distributed Top-K Monitoring with Bandwidth Constraints
Adaptive Tolerance Algorithm for Distributed Top-K Monitoring with Bandwidth Constraints Michael Bauer, Srinivasan Ravichandran University of Wisconsin-Madison Department of Computer Sciences {bauer, srini}@cs.wisc.edu
More informationLoad Balancing in Fault Tolerant Video Server
Load Balancing in Fault Tolerant Video Server # D. N. Sujatha*, Girish K*, Rashmi B*, Venugopal K. R*, L. M. Patnaik** *Department of Computer Science and Engineering University Visvesvaraya College of
More information15-441: Computer Networks Homework 2 Solution
5-44: omputer Networks Homework 2 Solution Assigned: September 25, 2002. Due: October 7, 2002 in class. In this homework you will test your understanding of the TP concepts taught in class including flow
More informationLocal Area Networks transmission system private speedy and secure kilometres shared transmission medium hardware & software
Local Area What s a LAN? A transmission system, usually private owned, very speedy and secure, covering a geographical area in the range of kilometres, comprising a shared transmission medium and a set
More informationBuilding a Highly Available and Scalable Web Farm
Page 1 of 10 MSDN Home > MSDN Library > Deployment Rate this page: 10 users 4.9 out of 5 Building a Highly Available and Scalable Web Farm Duwamish Online Paul Johns and Aaron Ching Microsoft Developer
More informationQuality of Service versus Fairness. Inelastic Applications. QoS Analogy: Surface Mail. How to Provide QoS?
18-345: Introduction to Telecommunication Networks Lectures 20: Quality of Service Peter Steenkiste Spring 2015 www.cs.cmu.edu/~prs/nets-ece Overview What is QoS? Queuing discipline and scheduling Traffic
More informationSla Aware Load Balancing Algorithm Using Join-Idle Queue for Virtual Machines in Cloud Computing
Sla Aware Load Balancing Using Join-Idle Queue for Virtual Machines in Cloud Computing Mehak Choudhary M.Tech Student [CSE], Dept. of CSE, SKIET, Kurukshetra University, Haryana, India ABSTRACT: Cloud
More informationHow to recover a failed Storage Spaces
www.storage-spaces-recovery.com How to recover a failed Storage Spaces ReclaiMe Storage Spaces Recovery User Manual 2013 www.storage-spaces-recovery.com Contents Overview... 4 Storage Spaces concepts and
More informationCall Center - Supervisor Application User Manual
Forum 700 Call Center Supervisor Application User Manual Legal notice: Belgacom and the Belgacom logo are trademarks of Belgacom. All other trademarks are the property of their respective owners. The information
More informationExperiments on the local load balancing algorithms; part 1
Experiments on the local load balancing algorithms; part 1 Ştefan Măruşter Institute e-austria Timisoara West University of Timişoara, Romania maruster@info.uvt.ro Abstract. In this paper the influence
More informationCompetitive Analysis of On line Randomized Call Control in Cellular Networks
Competitive Analysis of On line Randomized Call Control in Cellular Networks Ioannis Caragiannis Christos Kaklamanis Evi Papaioannou Abstract In this paper we address an important communication issue arising
More informationA NOVEL RESOURCE EFFICIENT DMMS APPROACH
A NOVEL RESOURCE EFFICIENT DMMS APPROACH FOR NETWORK MONITORING AND CONTROLLING FUNCTIONS Golam R. Khan 1, Sharmistha Khan 2, Dhadesugoor R. Vaman 3, and Suxia Cui 4 Department of Electrical and Computer
More informationA NETWORK CONSTRUCTION METHOD FOR A SCALABLE P2P VIDEO CONFERENCING SYSTEM
A NETWORK CONSTRUCTION METHOD FOR A SCALABLE P2P VIDEO CONFERENCING SYSTEM Hideto Horiuchi, Naoki Wakamiya and Masayuki Murata Graduate School of Information Science and Technology, Osaka University 1
More informationOn demand synchronization and load distribution for database grid-based Web applications
Data & Knowledge Engineering 51 (24) 295 323 www.elsevier.com/locate/datak On demand synchronization and load distribution for database grid-based Web applications Wen-Syan Li *,1, Kemal Altintas, Murat
More informationMultimedia Caching Strategies for Heterogeneous Application and Server Environments
Multimedia Tools and Applications 4, 279 312 (1997) c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. Multimedia Caching Strategies for Heterogeneous Application and Server Environments
More informationLoad Balancing to Save Energy in Cloud Computing
presented at the Energy Efficient Systems Workshop at ICT4S, Stockholm, Aug. 2014 Load Balancing to Save Energy in Cloud Computing Theodore Pertsas University of Manchester United Kingdom tpertsas@gmail.com
More informationQuality of Service in the Internet. QoS Parameters. Keeping the QoS. Traffic Shaping: Leaky Bucket Algorithm
Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:
More informationOn the Interaction and Competition among Internet Service Providers
On the Interaction and Competition among Internet Service Providers Sam C.M. Lee John C.S. Lui + Abstract The current Internet architecture comprises of different privately owned Internet service providers
More informationReal-Time (Paradigms) (51)
Real-Time (Paradigms) (51) 5. Real-Time Communication Data flow (communication) in embedded systems : Sensor --> Controller Controller --> Actor Controller --> Display Controller Controller Major
More informationThe Feasibility of Supporting Large-Scale Live Streaming Applications with Dynamic Application End-Points
The Feasibility of Supporting Large-Scale Live Streaming Applications with Dynamic Application End-Points Kay Sripanidkulchai, Aditya Ganjam, Bruce Maggs, and Hui Zhang Instructor: Fabian Bustamante Presented
More informationOptimization of AODV routing protocol in mobile ad-hoc network by introducing features of the protocol LBAR
Optimization of AODV routing protocol in mobile ad-hoc network by introducing features of the protocol LBAR GUIDOUM AMINA University of SIDI BEL ABBES Department of Electronics Communication Networks,
More informationKeywords Load balancing, Dispatcher, Distributed Cluster Server, Static Load balancing, Dynamic Load balancing.
Volume 5, Issue 7, July 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Hybrid Algorithm
More informationDynamic Resource Allocation in Software Defined and Virtual Networks: A Comparative Analysis
Dynamic Resource Allocation in Software Defined and Virtual Networks: A Comparative Analysis Felipe Augusto Nunes de Oliveira - GRR20112021 João Victor Tozatti Risso - GRR20120726 Abstract. The increasing
More informationProcess Scheduling CS 241. February 24, 2012. Copyright University of Illinois CS 241 Staff
Process Scheduling CS 241 February 24, 2012 Copyright University of Illinois CS 241 Staff 1 Announcements Mid-semester feedback survey (linked off web page) MP4 due Friday (not Tuesday) Midterm Next Tuesday,
More informationEnergy Efficient MapReduce
Energy Efficient MapReduce Motivation: Energy consumption is an important aspect of datacenters efficiency, the total power consumption in the united states has doubled from 2000 to 2005, representing
More informationVarious Schemes of Load Balancing in Distributed Systems- A Review
741 Various Schemes of Load Balancing in Distributed Systems- A Review Monika Kushwaha Pranveer Singh Institute of Technology Kanpur, U.P. (208020) U.P.T.U., Lucknow Saurabh Gupta Pranveer Singh Institute
More informationEffects of Filler Traffic In IP Networks. Adam Feldman April 5, 2001 Master s Project
Effects of Filler Traffic In IP Networks Adam Feldman April 5, 2001 Master s Project Abstract On the Internet, there is a well-documented requirement that much more bandwidth be available than is used
More informationExamining Self-Similarity Network Traffic intervals
Examining Self-Similarity Network Traffic intervals Hengky Susanto Byung-Guk Kim Computer Science Department University of Massachusetts at Lowell {hsusanto, kim}@cs.uml.edu Abstract Many studies have
More informationAn Algorithm for Automatic Base Station Placement in Cellular Network Deployment
An Algorithm for Automatic Base Station Placement in Cellular Network Deployment István Törős and Péter Fazekas High Speed Networks Laboratory Dept. of Telecommunications, Budapest University of Technology
More informationCHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS
137 CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS 8.1 CONCLUSION In this thesis, efficient schemes have been designed and analyzed to control congestion and distribute the load in the routing process of
More informationNetwork analysis and dimensioning course project
Network analysis and dimensioning course project Alexander Pyattaev March 10, 2014 Email: alexander.pyattaev@tut.fi 1 Project description Your task in this project is to be a network architect. You will
More informationCompetitive Analysis of QoS Networks
Competitive Analysis of QoS Networks What is QoS? The art of performance analysis What is competitive analysis? Example: Scheduling with deadlines Example: Smoothing real-time streams Example: Overflow
More informationThe Bus (PCI and PCI-Express)
4 Jan, 2008 The Bus (PCI and PCI-Express) The CPU, memory, disks, and all the other devices in a computer have to be able to communicate and exchange data. The technology that connects them is called the
More informationOn the Feasibility of Prefetching and Caching for Online TV Services: A Measurement Study on Hulu
On the Feasibility of Prefetching and Caching for Online TV Services: A Measurement Study on Hulu Dilip Kumar Krishnappa, Samamon Khemmarat, Lixin Gao, Michael Zink University of Massachusetts Amherst,
More informationStorage I/O Control: Proportional Allocation of Shared Storage Resources
Storage I/O Control: Proportional Allocation of Shared Storage Resources Chethan Kumar Sr. Member of Technical Staff, R&D VMware, Inc. Outline The Problem Storage IO Control (SIOC) overview Technical Details
More informationMultimedia Requirements. Multimedia and Networks. Quality of Service
Multimedia Requirements Chapter 2: Representation of Multimedia Data Chapter 3: Multimedia Systems Communication Aspects and Services Multimedia Applications and Transfer/Control Protocols Quality of Service
More informationEfficient and low cost Internet backup to Primary Video lines
Efficient and low cost Internet backup to Primary Video lines By Adi Rozenberg, CTO Table of Contents Chapter 1. Introduction... 1 Chapter 2. The DVP100 solution... 2 Chapter 3. VideoFlow 3V Technology...
More informationSecure SCTP against DoS Attacks in Wireless Internet
Secure SCTP against DoS Attacks in Wireless Internet Inwhee Joe College of Information and Communications Hanyang University Seoul, Korea iwjoe@hanyang.ac.kr Abstract. The Stream Control Transport Protocol
More informationThe Effect of Priorities on LUN Management Operations
Abstract This white paper describes the effect of each of the four Priorities (ASAP, High, Medium, and Low) on overall EMC CLARiiON performance in executing. The LUN Management Operations are migrate,
More informationVeritas Enterprise Vault. Miron Krokhmal CTO Emet IT
Veritas Enterprise Vault Miron Krokhmal CTO Emet IT Summary Information and Data Management Archiving Framework Product Architecture QA Thank you Information and Data Management תקשורת עסקית הוראות מסמכים
More informationD1.1 Service Discovery system: Load balancing mechanisms
D1.1 Service Discovery system: Load balancing mechanisms VERSION 1.0 DATE 2011 EDITORIAL MANAGER Eddy Caron AUTHORS STAFF Eddy Caron, Cédric Tedeschi Copyright ANR SPADES. 08-ANR-SEGI-025. Contents Introduction
More informationLecture Outline Overview of real-time scheduling algorithms Outline relative strengths, weaknesses
Overview of Real-Time Scheduling Embedded Real-Time Software Lecture 3 Lecture Outline Overview of real-time scheduling algorithms Clock-driven Weighted round-robin Priority-driven Dynamic vs. static Deadline
More informationFair Scheduling Algorithm with Dynamic Load Balancing Using In Grid Computing
Research Inventy: International Journal Of Engineering And Science Vol.2, Issue 10 (April 2013), Pp 53-57 Issn(e): 2278-4721, Issn(p):2319-6483, Www.Researchinventy.Com Fair Scheduling Algorithm with Dynamic
More informationUSING ADAPTIVE SERVER ACTIVATION/DEACTIVATION FOR LOAD BALANCING IN CLOUD-BASED CONTENT DELIVERY NETWORKS
USING ADAPTIVE SERVER ACTIVATION/DEACTIVATION FOR LOAD BALANCING IN CLOUD-BASED CONTENT DELIVERY NETWORKS Darshna Dalvadi 1 and Dr. Keyur Shah 2 1 School of Computer Studies, Ahmedabad University, Ahmedabad,
More information6.6 Scheduling and Policing Mechanisms
02-068 C06 pp4 6/14/02 3:11 PM Page 572 572 CHAPTER 6 Multimedia Networking 6.6 Scheduling and Policing Mechanisms In the previous section, we identified the important underlying principles in providing
More informationAcceleration Systems Performance Assessment Tool (PAT) User Guide v 2.1
Acceleration Systems Performance Assessment Tool (PAT) User Guide v 2.1 December 2015 Table of Contents 1 PAT... 1 1.1 Network Quality Report (Pre-test Evaluation)... 1 1.1.1 Raw MTR Data... 4 2 Executing
More informationReviewer s Guide. Morpheus Photo Animation Suite. Screenshots. Tutorial. Included in the Reviewer s Guide:
Morpheus Photo Animation Suite Reviewer s Guide The all-in-one animation suite includes Morpheus Photo Morpher, Morpheus Photo Warper, Morpheus Photo Mixer, as well as all 15 sample morphs, warps, and
More informationUser Manual. Call Center - Supervisor Application
User Manual Call Center - Supervisor Application Release 8.0 - September 2010 Legal notice: Alcatel, Lucent, Alcatel-Lucent and the Alcatel-Lucent logo are trademarks of Alcatel-Lucent. All other trademarks
More informationMINIMIZING STORAGE COST IN CLOUD COMPUTING ENVIRONMENT
MINIMIZING STORAGE COST IN CLOUD COMPUTING ENVIRONMENT 1 SARIKA K B, 2 S SUBASREE 1 Department of Computer Science, Nehru College of Engineering and Research Centre, Thrissur, Kerala 2 Professor and Head,
More informationSmart Queue Scheduling for QoS Spring 2001 Final Report
ENSC 833-3: NETWORK PROTOCOLS AND PERFORMANCE CMPT 885-3: SPECIAL TOPICS: HIGH-PERFORMANCE NETWORKS Smart Queue Scheduling for QoS Spring 2001 Final Report By Haijing Fang(hfanga@sfu.ca) & Liu Tang(llt@sfu.ca)
More informationAPPENDIX 1 USER LEVEL IMPLEMENTATION OF PPATPAN IN LINUX SYSTEM
152 APPENDIX 1 USER LEVEL IMPLEMENTATION OF PPATPAN IN LINUX SYSTEM A1.1 INTRODUCTION PPATPAN is implemented in a test bed with five Linux system arranged in a multihop topology. The system is implemented
More informationScheduling Allowance Adaptability in Load Balancing technique for Distributed Systems
Scheduling Allowance Adaptability in Load Balancing technique for Distributed Systems G.Rajina #1, P.Nagaraju #2 #1 M.Tech, Computer Science Engineering, TallaPadmavathi Engineering College, Warangal,
More informationManaging Applications, Services, Folders, and Libraries
Lesson 4 Managing Applications, Services, Folders, and Libraries Learning Objectives Students will learn to: Understand Local versus Network Applications Remove or Uninstall an Application Understand Group
More informationAnalysis of QoS Routing Approach and the starvation`s evaluation in LAN
www.ijcsi.org 360 Analysis of QoS Routing Approach and the starvation`s evaluation in LAN 1 st Ariana Bejleri Polytechnic University of Tirana, Faculty of Information Technology, Computer Engineering Department,
More informationOperating Systems. III. Scheduling. http://soc.eurecom.fr/os/
Operating Systems Institut Mines-Telecom III. Scheduling Ludovic Apvrille ludovic.apvrille@telecom-paristech.fr Eurecom, office 470 http://soc.eurecom.fr/os/ Outline Basics of Scheduling Definitions Switching
More informationLow-rate TCP-targeted Denial of Service Attack Defense
Low-rate TCP-targeted Denial of Service Attack Defense Johnny Tsao Petros Efstathopoulos University of California, Los Angeles, Computer Science Department Los Angeles, CA E-mail: {johnny5t, pefstath}@cs.ucla.edu
More informationIntraVUE Diagnostics. Device Failure
IntraVUE provides a method to record and capture the issues that occur in the Ethernet networks being used for automation applications. Automation networks are susceptible to subtle disturbances due to
More information4. Fixed-Priority Scheduling
Simple workload model 4. Fixed-Priority Scheduling Credits to A. Burns and A. Wellings The application is assumed to consist of a fixed set of tasks All tasks are periodic with known periods This defines
More informationWelcome to ScopServ. ScopTEL ACD Module
Welcome to ScopServ ScopTEL ACD Module Table of contents 1. Introduction... 2 2. ACD manager... 3 2.1. Queues... 3 2.1.1. General parameters... 3 2.1.2. Managing notifications (queue)... 3 2.1.3. Managing
More informationMicrosoft Axapta Inventory Closing White Paper
Microsoft Axapta Inventory Closing White Paper Microsoft Axapta 3.0 and Service Packs Version: Second edition Published: May, 2005 CONFIDENTIAL DRAFT INTERNAL USE ONLY Contents Introduction...1 Inventory
More informationNames of Parts. English. Mic. Record Button. Status Indicator Micro SD Card Slot Speaker Micro USB Port Strap Hook
User Manual Names of Parts Record Button Mic Status Indicator Micro SD Card Slot Speaker Micro USB Port Strap Hook Video Mode Photo Mode Local Mode Cloud Mode Mode Button Power Button Tripod Mount Clip
More informationBasic Multiplexing models. Computer Networks - Vassilis Tsaoussidis
Basic Multiplexing models? Supermarket?? Computer Networks - Vassilis Tsaoussidis Schedule Where does statistical multiplexing differ from TDM and FDM Why are buffers necessary - what is their tradeoff,
More informationEXTENDING NETWORK KNOWLEDGE: MAKING OLSR A QUALITY OF SERVICE CONDUCIVE PROTOCOL
EXTENDING NETWORK KNOWLEDGE: MAKING OLSR A QUALITY OF SERVICE CONDUCIVE PROTOCOL by Pedro Eduardo Villanueva-Pena, Thomas Kunz Carleton University January, 2006 This report examines mechanisms to gradually
More informationReal Time Bus Monitoring System by Sharing the Location Using Google Cloud Server Messaging
Real Time Bus Monitoring System by Sharing the Location Using Google Cloud Server Messaging Aravind. P, Kalaiarasan.A 2, D. Rajini Girinath 3 PG Student, Dept. of CSE, Anand Institute of Higher Technology,
More informationExploring Big Data in Social Networks
Exploring Big Data in Social Networks virgilio@dcc.ufmg.br (meira@dcc.ufmg.br) INWEB National Science and Technology Institute for Web Federal University of Minas Gerais - UFMG May 2013 Some thoughts about
More informationEnergy Efficient Load Balancing among Heterogeneous Nodes of Wireless Sensor Network
Energy Efficient Load Balancing among Heterogeneous Nodes of Wireless Sensor Network Chandrakant N Bangalore, India nadhachandra@gmail.com Abstract Energy efficient load balancing in a Wireless Sensor
More informationPRIORITY-BASED NETWORK QUALITY OF SERVICE
PRIORITY-BASED NETWORK QUALITY OF SERVICE ANIMESH DALAKOTI, NINA PICONE, BEHROOZ A. SHIRAZ School of Electrical Engineering and Computer Science Washington State University, WA, USA 99163 WEN-ZHAN SONG
More informationSocial Media Mining. Data Mining Essentials
Introduction Data production rate has been increased dramatically (Big Data) and we are able store much more data than before E.g., purchase data, social media data, mobile phone data Businesses and customers
More informationMap-like Wikipedia Visualization. Pang Cheong Iao. Master of Science in Software Engineering
Map-like Wikipedia Visualization by Pang Cheong Iao Master of Science in Software Engineering 2011 Faculty of Science and Technology University of Macau Map-like Wikipedia Visualization by Pang Cheong
More information