+ Random Number Tests. + Load balancing (computing) Load balancing is a computer networking method for distributing workloads across multiple computing.

Slides:



Advertisements
Similar presentations
Kasumi Block Cipher Data Encryptors Darshan Gandhi Rushabh Pasad.
Advertisements

Random Number Generation & Testing Juan Soto 301/
Data and Computer Communications
1 A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Application This contribution discusses some aspects of testing.
File Processing - Indirect Address Translation MVNC1 Hashing Indirect Address Translation Chapter 11.
Likelihood Ratio, Wald, and Lagrange Multiplier (Score) Tests
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
Bioinformatics Finding signals and motifs in DNA and proteins Expectation Maximization Algorithm MEME The Gibbs sampler Lecture 10.
QUANTITATIVE DATA ANALYSIS
Heuristic alignment algorithms and cost matrices
1 A Comparison of Load Balancing Techniques for Scalable Web Servers Haakon Bryhni, University of Oslo Espen Klovning and Øivind Kure, Telenor Reserch.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
Simulation.
Statistics.
Web Server Software Architectures Author: Daniel A. Menascé Presenter: Noshaba Bakht.
Tch-prob1 Chapter 4. Multiple Random Variables Ex Select a student’s name from an urn. S In some random experiments, a number of different quantities.
1 Lecture 24: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Sections 8.1 – 8.5)
Wide Web Load Balancing Algorithm Design Yingfang Zhang.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
Sequence comparison: Score matrices Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas
Review for Exam 2 Some important themes from Chapters 6-9 Chap. 6. Significance Tests Chap. 7: Comparing Two Groups Chap. 8: Contingency Tables (Categorical.
Lecture II-2: Probability Review
Monté Carlo Simulation MGS 3100 – Chapter 9. Simulation Defined A computer-based model used to run experiments on a real system.  Typically done on a.
Network Simulation Internet Technologies and Applications.
CSE Lectures 22 – Huffman codes
Guide to Using Excel For Basic Statistical Applications To Accompany Business Statistics: A Decision Making Approach, 6th Ed. Chapter 5: Discrete and Continuous.
Random Number Generation Pseudo-random number Generating Discrete R.V. Generating Continuous R.V.
EE513 Audio Signals and Systems Statistical Pattern Classification Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Server Load Balancing. Introduction Why is load balancing of servers needed? If there is only one web server responding to all the incoming HTTP requests.
Internet Addressing. When your computer is on the Internet, anything you do requires data to be transmitted and received. For example, when you visit.
Standard Statistical Distributions Most elementary statistical books provide a survey of commonly used statistical distributions. The reason we study these.
1 Interconnects Shared address space and message passing computers can be constructed by connecting processors and memory unit using a variety of interconnection.
Continuous Probability Distributions  Continuous Random Variable  A random variable whose space (set of possible values) is an entire interval of numbers.
CH2 System models.
CORE 2: Information systems and Databases CENTRALISED AND DISTRIBUTED DATABASES.
Section 8.1 Estimating  When  is Known In this section, we develop techniques for estimating the population mean μ using sample data. We assume that.
1 Chapter 17 Standing in line – at the bank, the market, the movies – is the time-waster everyone loves to hate. Stand in just one 15-minute line a day,
● Final exam Wednesday, 6/10, 11:30-2:30. ● Bring your own blue books ● Closed book. Calculators and 2-page cheat sheet allowed. No cell phone/computer.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Lecture Slides Elementary Statistics Eleventh Edition and the Triola Statistics Series by.
1 Topic 4 - Continuous distributions Basics of continuous distributions Uniform distribution Normal distribution Gamma distribution.
© 2003, Carla Ellis Simulation Techniques Overview Simulation environments emulation exec- driven sim trace- driven sim stochastic sim Workload parameters.
Chapter 2 Describing Data.
Basic Concepts in Number Theory Background for Random Number Generation 1.For any pair of integers n and m, m  0, there exists a unique pair of integers.
ICS 145B -- L. Bic1 Project: Main Memory Management Textbook: pages ICS 145B L. Bic.
OPIM 5103-Lecture #3 Jose M. Cruz Assistant Professor.
Random Number Generators 1. Random number generation is a method of producing a sequence of numbers that lack any discernible pattern. Random Number Generators.
Statistical Applications Binominal and Poisson’s Probability distributions E ( x ) =  =  xf ( x )
Randomness Test Fall 2012 By Yaohang Li, Ph.D.. Review Last Class –Random Number Generation –Uniform Distribution This Class –Test of Randomness –Chi.
Lecture 3 Applications of TDM ( T & E Lines ) & Statistical TDM.
The generalization of Bayes for continuous densities is that we have some density f(y|  ) where y and  are vectors of data and parameters with  being.
SESSION 37 & 38 Last Update 5 th May 2011 Continuous Probability Distributions.
Discrete Random Variables. Introduction In previous lectures we established a foundation of the probability theory; we applied the probability theory.
CITA 310 Section 3 Additional Topics. Common IPv4 Classes ClassFirst numberSubnet maskNumber of networks Number of addresses Class A0 – ,777,216.
Distance Vector Routing
MODELING AND SIMULATION CS 313 Simulation Examples 1.
Statistical Testing of Random Number Generators Juan Soto 301/
Theory of Computational Complexity M1 Takao Inoshita Iwama & Ito Lab Graduate School of Informatics, Kyoto University.
CWR 6536 Stochastic Subsurface Hydrology Optimal Estimation of Hydrologic Parameters.
Continuous Probability Distributions
Introductory Statistics and Data Analysis
Auburn University COMP7330/7336 Advanced Parallel and Distributed Computing Data Partition Dr. Xiao Qin Auburn University.
Queuing Theory Queuing Theory.
Modeling and Simulation CS 313
ROUND ROBIN DNS Round robin DNS is usually used for balancing the load of geographically distributed Web servers. For example, a company has one domain.
An Introduction to Computer Networking
EE513 Audio Signals and Systems
Advance Database System
Further Topics on Random Variables: 1
Berlin Chen Department of Computer Science & Information Engineering
Chrysostomos Koutsimanis and G´abor Fodor
Presentation transcript:

+ Random Number Tests

+ Load balancing (computing) Load balancing is a computer networking method for distributing workloads across multiple computing resources, such as computers, a computer cluster, network links, central processing units or disk drives. Load balancing aims to optimize resource use, maximize throughput, minimize response time, and avoid overload of any one of the resources.

+ Round-robin DNS An alternate method of load balancing, which does not necessarily require a dedicated software or hardware node, is called round robin DNS In this technique, multiple IP addresses are associated with a single domain name; clients are expected to choose which server to connect to. Unlike the use of a dedicated load balancer, this technique exposes to clients the existence of multiple backend servers. The technique has other advantages and disadvantages, depending on the degree of control over the DNS server and the granularity of load balancing desired. Another more effective technique for load-balancing using DNS is to delegate as a sub-domain whose zone is served by each of the same servers that are serving the web site. This technique works particularly well where individual servers are spread geographically on the Internet.

+ /R/Round_Robin_DNS.html Round robin works on a rotating basis in that one server IP address is handed out, then moves to the back of the list; the next server IP address is handed out, and then it moves to the end of the list; and so on, depending on the number of servers being used. This works in a looping fashion. Round robin DNS is usually used for balancing the load of geographically distributed Web servers. For example, a company has one domain name and three identical home pages residing on three servers with three different IP addresses. When one user accesses the home page it will be sent to the first IP address. The second user who accesses the home page will be sent to the next IP address, and the third user will be sent to the third IP address. In each case, once the IP address is given out, it goes to the end of the list. The fourth user, therefore, will be sent to the first IP address, and so forth.

+ Sources

+ In Donald Knuth’s book, The Art of Computer Programming Seminumerical Algorithms, Volume 2, he describes several empirical tests which include the: frequency, serial, gap, poker, coupon collector's, permutation, run, maximum-of-t, collision, birthday spacings, and serial correlation.

+ The DIEHARD suite of statistical tests developed by George Marsaglia birthday spacings, overlapping permutations, ranks of 31x31 and 32x32 matrices, ranks of 6x8 matrices, monkey tests on 20-bit Words, monkey tests OPSO, OQSO, DNA, count the 1's in a stream of bytes, count the 1's in specific bytes, parking lot, minimum distance, random spheres, squeeze, overlapp­ ing sums, runs, and craps.

+ ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: :: This is the BIRTHDAY SPACINGS TEST :: :: Choose m birthdays in a year of n days. List the spacings :: :: between the birthdays. If j is the number of values that :: :: occur more than once in that list, then j is asymptotically :: :: Poisson distributed with mean m^3/(4n). Experience shows n :: :: must be quite large, say n>=2^18, for comparing the results :: :: to the Poisson distribution with that mean. This test uses :: :: n=2^24 and m=2^9, so that the underlying distribution for j :: :: is taken to be Poisson with lambda=2^27/(2^26)=2. A sample :: :: of 500 j's is taken, and a chi-square goodness of fit test :: :: provides a p value. The first test uses bits 1-24 (counting :: :: from the left) from integers in the specified file. :: :: Then the file is closed and reopened. Next, bits 2-25 are :: :: used to provide birthdays, then 3-26 and so on to bits :: :: Each set of bits provides a p-value, and the nine p-values :: :: provide a sample for a KSTEST. :: :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::

+ :: THE OVERLAPPING 5-PERMUTATION TEST :: :: This is the OPERM5 test. It looks at a sequence of one mill- :: :: ion 32-bit random integers. Each set of five consecutive :: :: integers can be in one of 120 states, for the 5! possible or- :: :: derings of five numbers. Thus the 5th, 6th, 7th,...numbers :: :: each provide a state. As many thousands of state transitions :: :: are observed, cumulative counts are made of the number of :: :: occurences of each state. Then the quadratic form in the :: :: weak inverse of the 120x120 covariance matrix yields a test :: :: equivalent to the likelihood ratio test that the 120 cell :: :: counts came from the specified (asymptotically) normal dis- :: :: tribution with the specified 120x120 covariance matrix (with :: :: rank 99). This version uses 1,000,000 integers, twice. :: :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::

+ :: This is the BINARY RANK TEST for 31x31 matrices. The leftmost :: :: 31 bits of 31 random integers from the test sequence are used :: :: to form a 31x31 binary matrix over the field {0,1}. The rank :: :: is determined. That rank can be from 0 to 31, but ranks< 28 :: :: are rare, and their counts are pooled with those for rank 28. :: :: Ranks are found for 40,000 such random matrices and a chisqua-:: :: re test is performed on counts for ranks 31,30,29 and <=28. :: :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::

+ :: This is the BINARY RANK TEST for 32x32 matrices. A random 32x :: :: 32 binary matrix is formed, each row a 32-bit random integer. :: :: The rank is determined. That rank can be from 0 to 32, ranks :: :: less than 29 are rare, and their counts are pooled with those :: :: for rank 29. Ranks are found for 40,000 such random matrices :: :: and a chisquare test is performed on counts for ranks 32,31, :: :: 30 and <=29. :: :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::

+ The Crypt-XS Information Security Research Centre at Queensland University of Technology in Australia frequency, binary derivative, change point, runs, sequence complexity linear complexity.

+ The NIST Statistical Test Suite requency, block frequency, cumulative sums, runs, long runs, Marsaglia's rank, spectral (based on the Discrete Fourier Transform), nonoverlapping template matchings, overlapping template matchings, Maurer's universal statistical, approximate entropy (based on the work of Pincus, Singer and Kalman), random excursions (due to Baron and Rukhin), Lempel-Ziv complexity, linear complexity, and serial.

+ Evaluation Approaches Given a binary sequence s Case A: Threshold Values compute a test statistic to a threshold value. a binary sequence fails this test "whenever the value of c(s) falls below the threshold value.” Case B: Fixed Ranges Computing a test statistic for s as before. s fails a test if the test statistic falls outside of a range. 800 bits ignificance level is fixed at 5%, 400 – 1.96/2*√800 = [373,427]

+ Case C: Probability Values computing a test statistic for s and its corresponding probability value (P-value) Typically, test statistics are constructed so that large values of a statistic suggest a non-random sequence

+ Example - Simulation of a Bank Teller Objective is to determine the percent of time the teller is idle and the average time a customer spends at the bank

+ Manual Simulation The manual simulation of this example corresponding to the values in the above table is summarized in the table below by customer number. It is assumed that initially there are no customers in the system, the teller is idle, and the first customer is to arrive at time 3.2.

+

+ Average Values (expected values) time in queue 2.61 minutes time in bank for each customer 5.81 minutes

+

+ Results In first 40 minutes is average customer in the bank is and that the teller is idle 20 percent of the time.