Using SPLAY Tree s for state-full packet classification
|
|
- Charla York
- 5 years ago
- Views:
Transcription
1 Curse Prject Using SPLAY Tree s fr state-full packet classificatin 1- What is a Splay Tree? These ntes discuss the splay tree, a frm f self-adjusting search tree in which the amrtized time fr an access, insertin, r deletin O(lg n ). Splay trees are binary search trees that have implemented a selfadjusting mechanism. This mechanism perfrms in the fllwing way: every time we access a nde f the tree, whether fr insertin r retrieval, we perfrm rtatins (like in AVL trees), lifting the newly inserted/accessed nde all the way up, s that it becmes the rt f the mdified tree. The ndes n the way are rtated such that the tree becmes mre balanced. The splay tree is NOT a height balanced tree since there are situatins when a nde may have the balance factr different frm -1, 0 r +1. Ndes that are frequently accessed will frequently be lifted up t becme the rt, and they will never drift t far frm the tp psitin. Inactive ndes, n the ther hand, will slwly be pushed farther and farther frm the rt. It is pssible that splay trees can becme highly unbalanced, s that a single access t a nde f the tree can be quite expensive. Hwever, we can prve that, ver a lng sequence f accesses, splay trees are nt at all expensive and are guaranteed t require nt many mre peratins even than AVL amrtized analysis trees. The analytical tl used is called amrtized algrithm analysis, since, like insurance calculatins, the few expensive cases are averaged in with many less expensive cases t btain excellent perfrmance ver a lng sequence f peratins. The peratins that are perfrmed are rtatins f a similar frm t thse used fr AVL trees, but nw with many rtatins dne fr every insertin r retrieval in the tree. In fact, rtatins are dne all alng the path frm the rt t the target nde that is being accessed. Let us nw discuss precisely hw these rtatins prceed. The structure f a splay nde is similar with the ne that was used fr binary search trees. Nte the appearance f the parent pinter. struct NdeSplay{ int key; nd *left, *right, *parent;
2 }; Where: - key represents the tag f the nde(integer number), - left, right and parent represent pinters t the left and right children and t parent nde. Splay trees are typically used in the implementatin f caches, memry allcatrs, ruters, garbage cllectrs, data cmpressin, rpes (replacement f string used fr lng text strings), in Windws NT (in the virtual memry, netwrking, and file system cde) etc. A splay tree is an efficient implementatin f a balanced binary search tree that takes advantage f lcality in the keys used in incming lkup requests. Fr many applicatins, there is excellent key lcality. A gd example is a netwrk ruter. A netwrk ruter receives netwrk packets at a high rate frm incming cnnectins and must quickly decide n which utging wire t send each packet, based n the IP address in the packet. The ruter needs a big table (a map) that can be used t lk up an IP address and find ut which utging cnnectin t use. If an IP address has been used nce, it is likely t be used again, perhaps many times. Splay trees can prvide gd perfrmance in this situatin. 2- Operatins n Splay Trees These are binary search trees which are self-adjusting in the fllwing way: Every time we access a nde f the tree, whether fr retrieval r insertin r deletin, we perfrm radical surgery n the tree, resulting in the newly accessed nde becming the rt f the mdified tree. This surgery will ensure that ndes that are frequently accessed will never drift t far away frm the rt whereas inactive ndes will get pushed away farther frm the rt. Amrtized cmplexity Splay trees can becme highly unbalanced s that a single access t a nde f the tree can be quite expensive. Hwever, ver a lng sequence f accesses, the few expensive cases are averaged in with many inexpensive cases t btain gd perfrmance. Des nt need heights r balance factrs as in AVL trees and clurs as in Red-Black trees. The surgery n the tree is dne using rtatins, als called as splaying steps. There are six different splaying steps.
3 1. Zig Rtatin (Right Rtatin) 2. Zag Rtatin (Left Rtatin) 3. Zig-Zag (Zig fllwed by Zag) 4. Zag-Zig (Zag fllwed by Zig) 5. Zig-Zig 6. Zag-Zag Here we briefly explain them: Cnsider the path ging frm the rt dwn t the accessed nde. Each time we mve left ging dwn this path, we say we ``zig'' and each time we mve right, we say we ``zag.'' Zig Rtatin and Zag Rtatin Nte that a zig rtatin is the same as a right rtatin whereas the zag step is the left rtatin. See Figure 1 Zig-Zag This is the same as a duble rtatin in an AVL tree. Nte that the target element is lifted up by tw levels. See Figure 2 Zag-Zig This is als the same as a duble rtatin in an AVL tree. Here again, the target element is lifted up by tw levels. See Figure 3 Zig-Zig and Zag-Zag The target element is lifted up by tw levels in each case. Zig-Zig is different frm tw successive right rtatins; zag-zag is different frm tw successive left rtatins. Fr example, see Figures 4, and 5.
4 See Figure 6 fr an example Figure 1: Zig rtatin and zag rtatin Figure 2: Zig-zag rtatin Figure 3: Zag-zig rtatin Figure 4: Zig-zig and zag-zag rtatins
5 Figure 5: Tw successive right rtatins Figure 6: An example f splaying
6 The abve scheme f splaying is called bttm-up splaying. In tp-dwn splaying, we start frm the rt and as we lcate the target element and mve dwn, we splay as we g. This is mre efficient. 3- Search, Insert, Delete in Bttm-up Splaying Search (i, t) If item i is in tree t, return a pinter t the nde cntaining i; therwise return a pinter t the null nde. Search dwn the rt f t, lking fr i If the search is successful and we reach a nde x cntaining i, we cmplete the search by splaying at x and returning a pinter t x If the search is unsuccessful, i.e., we reach the null nde, we splay at the last nn-null nde reached during the search and return a pinter t null. If the tree is empty, we mit any splaying peratin. Example f an unsuccessful search: See Figure 7
7 figure 7: An example f searching in splay trees Insert (i, t) Search fr i. If the search is successful then splay at the nde cntaining i. If the search is unsuccessful, replace the pinter t null reached during the search by a pinter t a new nde x t cntain i and splay the tree at x Fr an example, See Figure 8. Figure 8: An example f an insert in a splay tree Delete (i, t) Search fr i. If the search is unsuccessful, splay at the last nn-null nde encuntered during search. If the search is successful, let x be the nde cntaining i. Assume x is nt the rt and let y be the parent f x. Replace x by an apprpriate descendent f y in the usual fashin and then splay at y. Fr an example, see Figure 9.
8 Figure 9: An example f a delete in a splay tree A sample cde f splay tree my be fund at : 4- Splay Trees t d state-full packet classificatin The prcess f classifying packets int flws in ruters, firewalls, packet filters etc., is called packet classificatin. Packet classificatin is used in a variety f applicatins such as security, mnitring, multimedia applicatins etc. These applicatins perate n packet flws r set f flws. Therefre these ndes must classify packets traversing thrugh it in rder t assign a flw identifier, called as Flw. Packet Classificatin starts by building a classifier f rules r filter table, then searching that table fr a particular filter r a set f filters that match the incming packets. Each filter cnsists f a number f filed values. The field values may be an address filed such as surce, destinatin addresses r a prt field namely surce, destinatin prts r prtcl type. The main research issues in the design f ptimal packet classificatin techniques are: t increase the packet classificatin speed, t increase the update perfrmance speeds fr new rules, t decrease the strage requirements fr caching these rules.
9 Splay trees are self balancing (r) self adjusting binary search trees [2]. It has special update and access rules. Every time we access a nde f the tree, whether fr retrieval r insertin r deletin, we perfrm radical surgery n the tree, resulting in the newly accessed nde becming the rt f the mdified tree. This surgery will ensure that ndes that are frequently accessed will never drift t far away frm the rt whereas inactive ndes will get pushed away farther frm the rt. When we access a nde, we apply either a single rtatin r a series f rtatins t mve the nde t the rt. The biggest advantage f using Splay trees is that it des nt require height r balance factrs as in AVL trees and clrs as in Red-Black trees. Infrmally, ne can think f the splay trees as implementing a srt f LRU plicy n tree accesses i.e. the mst recently accessed elements are pulled clser t the rt; and indeed, ne can shw that the tree structure adapts dynamically t the elements accessed, s that the least frequently used elements will be thse furthest frm the rt. But remarkably, althugh n explicit balance cnditins are impsed n the tree, each f these peratins can be shwn t use time O(lg n) n an n-element tree, in an amrtized sense. as it is mentined befre, There are six rtatins pssible in a splay tree: 1. Zig Rtatin 2. Zag Rtatin 3. Zig-Zig Rtatin 4. Zag-Zag Rtatin 5. Zig-Zag Rtatin 6. Zag-Zig Rtatin All peratins are illustrated in figure 10.
10 Figure10. Splay Tree peratin Descriptin f SP-Classifier In this prject, we examine a nvel representatin f the input set and build a tree frm this input set. The basic idea is t cnvert the set f prefixes int integers. Firstly, we find ut the lwer and upper bunds fr each prefix in the surce address. Then we cnvert these values t integers and stre them in a database. The same prcedure is carried ut fr each f the prefixes f the destinatin and stred in the database. While classifying incming packets, we reject packets if they d nt match the cnstraints. Finally we find ut the best matching filter (rule) amng the varius filters fr the valid packets. The prpsed wrk is a basic extensin f the Hierarchical Tries. Here, we cnvert each f the surce and destinatin prefixes int integer ranges. Then the crrespnding tree is cnstructed. The greatest advantage f this apprach is that the prefix specificatin can be extended t any number f bits. Let fllw a sample filter-set representatin by this methd. Table 1 and Table 2 represent a sample filter set. We first cmpute the lwer and upper bunds fr each f the prefixes in the surce address as shwn in Table 1.Then a surce splay tree is cnstructed with the bunds cnverted t integers, which is shwn in Figure 11.Similarly, using the destinatin addresses, a destinatin splay tree is cnstructed as shwn in Table 2 and Figure 12. Table1. Surce prefixes cnversin
11 Figure11. Surce Splay Tree Table2. Destinatin Prefix Cnversin Figure11. Destinatin Splay Tree
12 Nw the surce and destinatin splay trees are t be linked. Fr this, we cnnect each leaf f the surce splay tree t the rt f the destinatin splay tree. This cnnectin pinter is similar t a Next-Trie pinter used in a hierarchical trie data structure. In rder t find ut the best matching filter, we cnvert the surce and destinatin prefixes f the search packet t integer values and then begin searching. We first see the integer surce value f the packet and find ut the filters whse lwer bund is less than the packet s surce integer value and whse upper bund is greater than the packet s destinatin integer value. In ther wrds, we pick ut all thse filters within whse range the search packet s value lies. Similarly, we find ut the matching filters fr the destinatin s integer value f the search packet. Then, we perfrm a simple cmparisn between the filters that have matched the surce and destinatin f the packet separately. T cnstruct a surce search table and a destinatin search table, we get the set f distinct integer values in bth the surce and destinatin trees and arrange them in the ascending rder. We nw find the set f filters that match all pints between the first and secnd integer values, between the secnd and third value and s n until the entire table is cnstructed as shwn in Tables 3 and 4. An example search packet is als shwn belw these tables. We firstly cnvert the prefixes f the search packet t integers and then find the separate surce and destinatin matching filters and finally find the final set f matching filters fr that particular search packet. Search Table3. Surce Search table Table4. Destinatin Search table
13 Example Search Objectives: 1- Use ClassBench tl t prduce sme synthetic rule-set and headers. 2- Implement SP-Classifier accrding t abve explanatin ( in C++ Only). 3- Stre yur rule-set in SP-Classifier 4- Classify synthetic packets f step1, and cmpute fllwing parameters: 1- Number f memry accesses fr classifying each packet 2- Max/ Min and average number f memry accesses fr classifying all synthetic packets. 5- Prepare a technical reprt explain steps f implementatin, simulatin and results! Prject due date is 18 Feb 2015 Gd Luck!
Data Structure Interview Questions
Data Structure Interview Questins A list f tp frequently asked Data Structure interview questins and answers are given belw. 1) What is Data Structure? Explain. Data structure is a way that specifies hw
More information1 Binary Trees and Adaptive Data Compression
University f Illinis at Chicag CS 202: Data Structures and Discrete Mathematics II Handut 5 Prfessr Rbert H. Slan September 18, 2002 A Little Bttle... with the wrds DRINK ME, (r Adaptive data cmpressin
More informationUsing CppSim to Generate Neural Network Modules in Simulink using the simulink_neural_net_gen command
Using CppSim t Generate Neural Netwrk Mdules in Simulink using the simulink_neural_net_gen cmmand Michael H. Perrtt http://www.cppsim.cm June 24, 2008 Cpyright 2008 by Michael H. Perrtt All rights reserved.
More information$ARCSIGHT_HOME/current/user/agent/map. The files are named in sequential order such as:
Lcatin f the map.x.prperties files $ARCSIGHT_HOME/current/user/agent/map File naming cnventin The files are named in sequential rder such as: Sme examples: 1. map.1.prperties 2. map.2.prperties 3. map.3.prperties
More informationTRAINING GUIDE. Overview of Lucity Spatial
TRAINING GUIDE Overview f Lucity Spatial Overview f Lucity Spatial In this sessin, we ll cver the key cmpnents f Lucity Spatial. Table f Cntents Lucity Spatial... 2 Requirements... 2 Setup... 3 Assign
More informationUsing the Swiftpage Connect List Manager
Quick Start Guide T: Using the Swiftpage Cnnect List Manager The Swiftpage Cnnect List Manager can be used t imprt yur cntacts, mdify cntact infrmatin, create grups ut f thse cntacts, filter yur cntacts
More informationINSTALLING CCRQINVOICE
INSTALLING CCRQINVOICE Thank yu fr selecting CCRQInvice. This dcument prvides a quick review f hw t install CCRQInvice. Detailed instructins can be fund in the prgram manual. While this may seem like a
More information1 Version Spaces. CS 478 Homework 1 SOLUTION
CS 478 Hmewrk SOLUTION This is a pssible slutin t the hmewrk, althugh there may be ther crrect respnses t sme f the questins. The questins are repeated in this fnt, while answers are in a mnspaced fnt.
More informationIntegrating QuickBooks with TimePro
Integrating QuickBks with TimePr With TimePr s QuickBks Integratin Mdule, yu can imprt and exprt data between TimePr and QuickBks. Imprting Data frm QuickBks The TimePr QuickBks Imprt Facility allws data
More informationDue Date: Lab report is due on Mar 6 (PRA 01) or Mar 7 (PRA 02)
Lab 3 Packet Scheduling Due Date: Lab reprt is due n Mar 6 (PRA 01) r Mar 7 (PRA 02) Teams: This lab may be cmpleted in teams f 2 students (Teams f three r mre are nt permitted. All members receive the
More informationLab 1 - Calculator. K&R All of Chapter 1, 7.4, and Appendix B1.2
UNIVERSITY OF CALIFORNIA, SANTA CRUZ BOARD OF STUDIES IN COMPUTER ENGINEERING CMPE13/L: INTRODUCTION TO PROGRAMMING IN C SPRING 2012 Lab 1 - Calculatr Intrductin In this lab yu will be writing yur first
More informationThe UNIVERSITY of NORTH CAROLINA at CHAPEL HILL
Yu will learn the fllwing in this lab: The UNIVERSITY f NORTH CAROLINA at CHAPEL HILL Designing a mdule with multiple memries Designing and using a bitmap fnt Designing a memry-mapped display Cmp 541 Digital
More informationThe UNIVERSITY of NORTH CAROLINA at CHAPEL HILL
Yu will learn the fllwing in this lab: The UNIVERSITY f NORTH CAROLINA at CHAPEL HILL Cmp 541 Digital Lgic and Cmputer Design Spring 2016 Lab Prject (PART A): A Full Cmputer! Issued Fri 4/8/16; Suggested
More informationUsing the Swiftpage Connect List Manager
Quick Start Guide T: Using the Swiftpage Cnnect List Manager The Swiftpage Cnnect List Manager can be used t imprt yur cntacts, mdify cntact infrmatin, create grups ut f thse cntacts, filter yur cntacts
More informationIn Java, we can use Comparable and Comparator to compare objects.
Pririty Queues CS231 - Fall 2017 Pririty Queues In a pririty queue, things get inserted int the queue in rder f pririty Pririty queues cntain entries = {keys, values /** Interface fr a key- value pair
More informationThese tasks can now be performed by a special program called FTP clients.
FTP Cmmander FAQ: Intrductin FTP (File Transfer Prtcl) was first used in Unix systems a lng time ag t cpy and mve shared files. With the develpment f the Internet, FTP became widely used t uplad and dwnlad
More informationEastern Mediterranean University School of Computing and Technology Information Technology Lecture2 Functions
Eastern Mediterranean University Schl f Cmputing and Technlgy Infrmatin Technlgy Lecture2 Functins User Defined Functins Why d we need functins? T make yur prgram readable and rganized T reduce repeated
More informationMySqlWorkbench Tutorial: Creating Related Database Tables
MySqlWrkbench Tutrial: Creating Related Database Tables (Primary Keys, Freign Keys, Jining Data) Cntents 1. Overview 2 2. Befre Yu Start 2 3. Cnnect t MySql using MySqlWrkbench 2 4. Create Tables web_user
More informationBI Publisher TEMPLATE Tutorial
PepleSft Campus Slutins 9.0 BI Publisher TEMPLATE Tutrial Lessn T2 Create, Frmat and View a Simple Reprt Using an Existing Query with Real Data This tutrial assumes that yu have cmpleted BI Publisher Tutrial:
More informationThe UNIVERSITY of NORTH CAROLINA at CHAPEL HILL
The UNIVERSITY f NORTH CAROLINA at CHAPEL HILL Cmp 541 Digital Lgic and Cmputer Design Prf. Mntek Singh Spring 2019 Lab #7: A Basic Datapath; and a Sprite-Based Display Issued Fri 3/1/19; Due Mn 3/25/19
More informationAutomatic imposition version 5
Autmatic impsitin v.5 Page 1/9 Autmatic impsitin versin 5 Descriptin Autmatic impsitin will d the mst cmmn impsitins fr yur digital printer. It will autmatically d flders fr A3, A4, A5 r US Letter page
More informationLAB 7 (June 29/July 4) Structures, Stream I/O, Self-referential structures (Linked list) in C
LAB 7 (June 29/July 4) Structures, Stream I/O, Self-referential structures (Linked list) in C Due: July 9 (Sun) 11:59 pm 1. Prblem A Subject: Structure declaratin, initializatin and assignment. Structure
More informationClassFlow Administrator User Guide
ClassFlw Administratr User Guide ClassFlw User Engagement Team April 2017 www.classflw.cm 1 Cntents Overview... 3 User Management... 3 Manual Entry via the User Management Page... 4 Creating Individual
More informationOn the road again. The network layer. Data and control planes. Router forwarding tables. The network layer data plane. CS242 Computer Networks
On the rad again The netwrk layer data plane CS242 Cmputer Netwrks The netwrk layer The transprt layer is respnsible fr applicatin t applicatin transprt. The netwrk layer is respnsible fr hst t hst transprt.
More information1 Getting and Extracting the Upgrader
Hughes BGAN-X 9202 Upgrader User Guide (Mac) Rev 1.0 (23-Feb-12) This dcument explains hw t use the Hughes BGAN Upgrader prgram fr the 9202 User Terminal using a Mac Nte: Mac OS X Versin 10.4 r newer is
More information1 Getting and Extracting the Upgrader
Hughes BGAN-X 9202 Upgrader User Guide (PC) Rev 1.0 (23-Feb-12) This dcument explains hw t use the Hughes BGAN-X Upgrader prgram fr the 9202 User Terminal using a PC. 1 Getting and Extracting the Upgrader
More informationParaben s Phone Recovery Stick
Paraben s Phne Recvery Stick v. 3.0 User manual Cntents Abut Phne Recvery Stick... 3 What s new!... 3 System Requirements... 3 Applicatin User Interface... 4 Understanding the User Interface... 4 Main
More informationROCK-POND REPORTING 2.1
ROCK-POND REPORTING 2.1 AUTO-SCHEDULER USER GUIDE Revised n 08/19/2014 OVERVIEW The purpse f this dcument is t describe the prcess in which t fllw t setup the Rck-Pnd Reprting prduct s that users can schedule
More informationTL 9000 Quality Management System. Measurements Handbook. SFQ Examples
Quality Excellence fr Suppliers f Telecmmunicatins Frum (QuEST Frum) TL 9000 Quality Management System Measurements Handbk Cpyright QuEST Frum Sftware Fix Quality (SFQ) Examples 8.1 8.1.1 SFQ Example The
More informationLab 0: Compiling, Running, and Debugging
UNIVERSITY OF CALIFORNIA, SANTA CRUZ BOARD OF STUDIES IN COMPUTER ENGINEERING CMPE13/L: INTRODUCTION TO PROGRAMMING IN C SPRING 2012 Lab 0: Cmpiling, Running, and Debugging Intrductin Reading This is the
More informationTransmission Control Protocol Introduction
Transmissin Cntrl Prtcl Intrductin TCP is ne f the mst imprtant prtcls f Internet Prtcls suite. It is mst widely used prtcl fr data transmissin in cmmunicatin netwrk such as Internet. Features TCP is reliable
More informationLink-layer switches. Jurassic Park* LANs with backbone hubs are good. LANs with backbone hubs are bad. Hubs, bridges, and switches
Link-layer switches Jurassic Park* Hubs, bridges, and switches CS4 Cmputer Netwrks Department f Cmputer Science Wellesley Cllege *A multi-tier hub design. Switches 0- LANs with backbne hubs are gd. Prvide
More informationUML : MODELS, VIEWS, AND DIAGRAMS
UML : MODELS, VIEWS, AND DIAGRAMS Purpse and Target Grup f a Mdel In real life we ften bserve that the results f cumbersme, tedius, and expensive mdeling simply disappear in a stack f paper n smene's desk.
More informationDynamic Storage (ECS)
User Guide Dynamic Strage (ECS) Swisscm (Schweiz) AG 1 / 10 Cntent 1 Abut Dynamic Strage... 3 2 Virtual drive, the EMC CIFS-ECS Tl... 4 3 Amazn S3 Brwer... 6 4 Strage Gateway Appliance... 9 5 Amazn S3
More informationChapter 6: Lgic Based Testing LOGIC BASED TESTING: This unit gives an indepth verview f lgic based testing and its implementatin. At the end f this unit, the student will be able t: Understand the cncept
More informationHomework: Populate and Extract Data from Your Database
Hmewrk: Ppulate and Extract Data frm Yur Database 1. Overview In this hmewrk, yu will: 1. Check/revise yur data mdel and/r marketing material frm last week's hmewrk- this material will later becme the
More informationLab 5 Sorting with Linked Lists
UNIVERSITY OF CALIFORNIA, SANTA CRUZ BOARD OF STUDIES IN COMPUTER ENGINEERING CMPE13/L: INTRODUCTION TO PROGRAMMING IN C WINTER 2013 Lab 5 Srting with Linked Lists Intrductin Reading This lab intrduces
More informationTutorial 5: Retention time scheduling
SRM Curse 2014 Tutrial 5 - Scheduling Tutrial 5: Retentin time scheduling The term scheduled SRM refers t measuring SRM transitins nt ver the whle chrmatgraphic gradient but nly fr a shrt time windw arund
More information1 Getting and Extracting the Upgrader
Hughes BGAN-X 9211 Upgrader User Guide (Mac) Rev 1.2 (6-Jul-17) This dcument explains hw t use the Hughes BGAN Upgrader prgram fr the 9211 User Terminal using a Mac Nte: Mac OS X Versin 10.4 r newer is
More informationPopulate and Extract Data from Your Database
Ppulate and Extract Data frm Yur Database 1. Overview In this lab, yu will: 1. Check/revise yur data mdel and/r marketing material (hme page cntent) frm last week's lab. Yu will wrk with tw classmates
More informationPlease contact technical support if you have questions about the directory that your organization uses for user management.
Overview ACTIVE DATA CALENDAR LDAP/AD IMPLEMENTATION GUIDE Active Data Calendar allws fr the use f single authenticatin fr users lgging int the administrative area f the applicatin thrugh LDAP/AD. LDAP
More informationScatter Search And Bionomic Algorithms For The Aircraft Landing Problem
Scatter Search And Binmic Algrithms Fr The Aircraft Landing Prblem J. E. Beasley Mathematical Sciences Brunel University Uxbridge UB8 3PH United Kingdm http://peple.brunel.ac.uk/~mastjjb/jeb/jeb.html Abstract:
More informationLab 1 - Calculator. K&R All of Chapter 1, 7.4, and Appendix B1.2 Iterative Code Design handout Style Guidelines handout
UNIVERSITY OF CALIFORNIA, SANTA CRUZ BOARD OF STUDIES IN COMPUTER ENGINEERING CMPE13/L: INTRODUCTION TO PROGRAMMING IN C SPRING 2013 Lab 1 - Calculatr Intrductin Reading Cncepts In this lab yu will be
More informationPerformance of VSA in VMware vsphere 5
Perfrmance f VSA in VMware vsphere 5 Perfrmance Study TECHNICAL WHITE PAPER Table f Cntents Intrductin... 3 Executive Summary... 3 Test Envirnment... 3 Key Factrs f VSA Perfrmance... 4 Cmmn Strage Perfrmance
More informationSTIPalm Basics. Quick Reference Guide STI_ STIPalm Basics 1
STIPalm Basics First HtSync Operatin: Installing the Handheld Applicatin Immediately after running the installatin n the lcal wrkstatin, yu must perfrm a HtSync peratin t install the STIPalm applicatin
More informationSTIDistrict AL Rollover Procedures
2009-2010 STIDistrict AL Rllver Prcedures General Infrmatin abut STIDistrict Rllver IMPORTANT NOTE! Rllver shuld be perfrmed between June 25 and July 25 2010. During this perid, the STIState applicatin
More informationVMware AirWatch Certificate Authentication for Cisco IPSec VPN
VMware AirWatch Certificate Authenticatin fr Cisc IPSec VPN Fr VMware AirWatch Have dcumentatin feedback? Submit a Dcumentatin Feedback supprt ticket using the Supprt Wizard n supprt.air-watch.cm. This
More informationUiPath Automation. Walkthrough. Walkthrough Calculate Client Security Hash
UiPath Autmatin Walkthrugh Walkthrugh Calculate Client Security Hash Walkthrugh Calculate Client Security Hash Start with the REFramewrk template. We start ff with a simple implementatin t demnstrate the
More informationWord 2007 The Ribbon, the Mini toolbar, and the Quick Access Toolbar
Wrd 2007 The Ribbn, the Mini tlbar, and the Quick Access Tlbar In this practice yu'll get the hang f using the new Ribbn, and yu'll als master the use f the helpful cmpanin tls, the Mini tlbar and the
More informationTroubleshooting of network problems is find and solve with the help of hardware and software is called troubleshooting tools.
Q.1 What is Trubleshting Tls? List their types? Trubleshting f netwrk prblems is find and slve with the help f hardware and sftware is called trubleshting tls. Trubleshting Tls - Hardware Tls They are
More informationOperational Security. Speaking Frankly The Internet is not a very safe place. A sense of false security... Firewalls*
Operatinal Security Firewalls and Intrusin Detectin CS242 Cmputer Netwrks Speaking Frankly The Internet is nt a very safe place Frm ur netwrk administratr s pint f view, the wrld divides int tw camps:
More informationECE 545 Project Deliverables
Tp-level flder: _ Secnd-level flders: 1_assumptins 2_blck_diagrams 3_interface 4_ASM_charts 5_surce_cdes 6_verificatin 7_timing_analysis 8_results 9_benchmarking 10_bug_reprts
More informationProgramming Project: Building a Web Server
Prgramming Prject: Building a Web Server Submissin Instructin: Grup prject Submit yur cde thrugh Bb by Dec. 8, 2014 11:59 PM. Yu need t generate a simple index.html page displaying all yur grup members
More informationChapter 3 Stack. Books: ISRD Group New Delhi Data structure Using C
C302.3 Develp prgrams using cncept f stack. Bks: ISRD Grup New Delhi Data structure Using C Tata McGraw Hill What is Stack Data Structure? Stack is an abstract data type with a bunded(predefined) capacity.
More informationAvaya 9610 IP Telephone End User Guide
Avaya 9610 IP Telephne End User Guide 9610 IP Telephne End User Guide 1 P age Table f Cntents Abut Yur Telephne... 3 Abut Scrlling and Navigatin... 3 Selecting Names, Numbers, r Features... 3 Starting
More informationBecause this underlying hardware is dedicated to processing graphics commands, OpenGL drawing is typically very fast.
The Open Graphics Library (OpenGL) is used fr visualizing 2D and 3D data. It is a multipurpse pen-standard graphics library that supprts applicatins fr 2D and 3D digital cntent creatin, mechanical and
More informationDate: October User guide. Integration through ONVIF driver. Partner Self-test. Prepared By: Devices & Integrations Team, Milestone Systems
Date: Octber 2018 User guide Integratin thrugh ONVIF driver. Prepared By: Devices & Integratins Team, Milestne Systems 2 Welcme t the User Guide fr Online Test Tl The aim f this dcument is t prvide guidance
More informationTRAINING GUIDE. Lucity Mobile
TRAINING GUIDE The Lucity mbile app gives users the pwer f the Lucity tls while in the field. They can lkup asset infrmatin, review and create wrk rders, create inspectins, and many mre things. This manual
More informationAdverse Action Letters
Adverse Actin Letters Setup and Usage Instructins The FRS Adverse Actin Letter mdule was designed t prvide yu with a very elabrate and sphisticated slutin t help autmate and handle all f yur Adverse Actin
More information24-4 Image Formation by Thin Lenses
24-4 Image Frmatin by Thin Lenses Lenses, which are imprtant fr crrecting visin, fr micrscpes, and fr many telescpes, rely n the refractin f light t frm images. As with mirrrs, we draw ray agrams t help
More informationTwo Dimensional Truss
Tw Dimensinal Truss Intrductin This tutrial was created using ANSYS 7.0 t slve a simple 2D Truss prblem. This is the first f fur intrductry ANSYS tutrials. Prblem Descriptin Determine the ndal deflectins,
More informationFIREWALL RULE SET OPTIMIZATION
Authr Name: Mungle Mukupa Supervisr : Mr Barry Irwin Date : 25 th Octber 2010 Security and Netwrks Research Grup Department f Cmputer Science Rhdes University Intrductin Firewalls have been and cntinue
More informationOASIS SUBMISSIONS FOR FLORIDA: SYSTEM FUNCTIONS
OASIS SUBMISSIONS FOR FLORIDA: SYSTEM FUNCTIONS OASIS SYSTEM FUNCTIONS... 2 ESTABLISHING THE COMMUNICATION CONNECTION... 2 ACCESSING THE OASIS SYSTEM... 3 SUBMITTING OASIS DATA FILES... 5 OASIS INITIAL
More informationWEB LAB - Subset Extraction
WEB LAB - Subset Extractin Fall 2005 Authrs: Megha Siddavanahalli Swati Singhal Table f Cntents: Sl. N. Tpic Page N. 1 Abstract 2 2 Intrductin 2 3 Backgrund 2 4 Scpe and Cnstraints 3 5 Basic Subset Extractin
More informationLab 4. Name: Checked: Objectives:
Lab 4 Name: Checked: Objectives: Learn hw t test cde snippets interactively. Learn abut the Java API Practice using Randm, Math, and String methds and assrted ther methds frm the Java API Part A. Use jgrasp
More informationCOP2800 Homework #3 Assignment Spring 2013
YOUR NAME: DATE: LAST FOUR DIGITS OF YOUR UF-ID: Please Print Clearly (Blck Letters) YOUR PARTNER S NAME: DATE: LAST FOUR DIGITS OF PARTNER S UF-ID: Please Print Clearly Date Assigned: 15 February 2013
More informationSAS Viya 3.2 Administration: Mobile Devices
SAS Viya 3.2 Administratin: Mbile Devices Mbile Devices: Overview As an administratr, yu can manage a device s access t SAS Mbile BI, either by exclusin r inclusin. If yu manage by exclusin, all devices
More informationHierarchical Classification of Amazon Products
Hierarchical Classificatin f Amazn Prducts Bin Wang Stanfrd University, bwang4@stanfrd.edu Shaming Feng Stanfrd University, superfsm@ stanfrd.edu Abstract - This prjects prpsed a hierarchical classificatin
More informationComputer Organization and Architecture
Campus de Gualtar 4710-057 Braga UNIVERSIDADE DO MINHO ESCOLA DE ENGENHARIA Departament de Infrmática Cmputer Organizatin and Architecture 5th Editin, 2000 by William Stallings Table f Cntents I. OVERVIEW.
More informationParaben s Phone Recovery Stick
Paraben s Phne Recvery Stick v. 4.3 User Manual Cntents Abut Phne Recvery Stick... 3 What s New!... 3 Getting Started... 4 System Requirements... 4 Hw t Use the Phne Recvery Stick... 4 Applicatin User
More informationFrequently Asked Questions
Frequently Asked Questins Date f Last Update: FAQ SatView 0001 SatView is nt pening and hangs at the initial start-up splash screen This is mst likely an issue with ne f the dependency, SQL LcalDB, missing
More informationTo start your custom application development, perform the steps below.
Get Started T start yur custm applicatin develpment, perfrm the steps belw. 1. Sign up fr the kitewrks develper package. Clud Develper Package Develper Package 2. Sign in t kitewrks. Once yu have yur instance
More informationInformationNOW Standardized Tests
InfrmatinNOW Standardized Tests Abut this Guide This Quick Reference Guide prvides an verview f the ptins available fr tracking standardized tests in InfrmatinNOW. Creating Standardized Tests T create
More informationModule Contents Duration Self- Study. Operation on Files: Open, Reset, Find, delete, modify, insert, close, scan
Mdule-6 Strage and Indexing 6.1. Mtivatin: Crrsin is the disintegratin f an engineered material int its cnstituent atms due t chemical and electrchemical reactins with its surrundings. It includes the
More informationHow to effectively log your data
Hw t effectively lg yur data Like any SCADA system ne f the essential requirements f Adrit is t lg values, s that they can be retrieved fr lng term analysis and reprting purpses. At first it wuld appear
More informationAssignment 10: Transaction Simulation & Crash Recovery
Database Systems Instructr: Ha-Hua Chu Fall Semester, 2004 Assignment 10: Transactin Simulatin & Crash Recvery Deadline: 23:59 Jan. 5 (Wednesday), 2005 This is a grup assignment, and at mst 2 students
More informationBecause of security on the site, you cannot create a bookmark through the usual means. In order to create a bookmark that will work consistently:
The CllegeNet URL is: https://admit.applyweb.cm/admit/shibbleth/crnell Lg in with Crnell netid and Kerbers passwrd Because f security n the site, yu cannt create a bkmark thrugh the usual means. In rder
More informationTaiRox Mail Merge. Running Mail Merge
TaiRx Mail Merge TaiRx Mail Merge TaiRx Mail Merge integrates Sage 300 with Micrsft Wrd s mail merge functin. The integratin presents a Sage 300 style interface frm within the Sage 300 desktp. Mail Merge
More informationMOS Access 2013 Quick Reference
MOS Access 2013 Quick Reference Exam 77-424: MOS Access 2013 Objectives http://www.micrsft.cm/learning/en-us/exam.aspx?id=77-424 Create and Manage a Database Create a New Database This bjective may include
More informationUiPath Automation. Walkthrough. Walkthrough Calculate Client Security Hash
UiPath Autmatin Walkthrugh Walkthrugh Calculate Client Security Hash Walkthrugh Calculate Client Security Hash Start with the REFramewrk template. We start ff with a simple implementatin t demnstrate the
More informationBMC Remedyforce Integration with Bomgar Remote Support
BMC Remedyfrce Integratin with Bmgar Remte Supprt 2017 Bmgar Crpratin. All rights reserved wrldwide. BOMGAR and the BOMGAR lg are trademarks f Bmgar Crpratin; ther trademarks shwn are the prperty f their
More informationBMC Remedyforce Integration with Remote Support
BMC Remedyfrce Integratin with Remte Supprt 2003-2018 BeyndTrust, Inc. All Rights Reserved. BEYONDTRUST, its lg, and JUMP are trademarks f BeyndTrust, Inc. Other trademarks are the prperty f their respective
More information3 AXIS STAGE CONTROLLER
CORTEX CONTROLLERS 50, St Stephen s Pl. Cambridge CB3 0JE Telephne +44(0)1223 368000 Fax +44(0)1223 462800 http://www.crtexcntrllers.cm sales@crtexcntrllers.cm 3 AXIS STAGE CONTROLLER Instructin Manual
More informationStealing passwords via browser refresh
Stealing passwrds via brwser refresh Authr: Karmendra Khli [karmendra.khli@paladin.net] Date: August 07, 2004 Versin: 1.1 The brwser s back and refresh features can be used t steal passwrds frm insecurely
More informationDNS (Domain Name Service)
mywbut.cm DNS (Dmain Name Service) The internet primarily uses IP addresses fr lcating ndes. Hwever, its humanly nt pssible fr us t keep track f the many imprtant ndes as numbers. Alphabetical names as
More informationAvocent Power Management Distribution Unit (PM PDU) Release Notes Firmware Version April 18, 2011
Avcent Pwer Management Distributin Unit (PM PDU) Release Ntes Firmware Versin 2.0.1.8 April 18, 2011 This dcument utlines: 1. Update Instructins 2. Appliance Firmware Versin Infrmatin 3. Features/Enhancements
More informationDashboard Extension for Enterprise Architect
Dashbard Extensin fr Enterprise Architect Dashbard Extensin fr Enterprise Architect... 1 Disclaimer... 2 Dependencies... 2 Overview... 2 Limitatins f the free versin f the extensin... 3 Example Dashbard
More informationProject #1 - Fraction Calculator
AP Cmputer Science Liberty High Schl Prject #1 - Fractin Calculatr Students will implement a basic calculatr that handles fractins. 1. Required Behavir and Grading Scheme (100 pints ttal) Criteria Pints
More informationExercises: Plotting Complex Figures Using R
Exercises: Pltting Cmplex Figures Using R Versin 2017-11 Exercises: Pltting Cmplex Figures in R 2 Licence This manual is 2016-17, Simn Andrews. This manual is distributed under the creative cmmns Attributin-Nn-Cmmercial-Share
More informationA FRAMEWORK FOR PROCESSING K-BEST SITE QUERY
Internatinal Jurnal f Database Management Systems ( IJDMS ) Vl., N., Octber 0 A FRAMEWORK FOR PROCESSING K-BEST SITE QUERY Yuan-K Huang * and Lien-Fa Lin Department f Infrmatin Cmmunicatin Ka-Yuan University;
More informationNiceLabel LMS. Installation Guide for Single Server Deployment. Rev-1702 NiceLabel
NiceLabel LMS Installatin Guide fr Single Server Deplyment Rev-1702 NiceLabel 2017. www.nicelabel.cm 1 Cntents 1 Cntents 2 2 Architecture 3 2.1 Server Cmpnents and Rles 3 2.2 Client Cmpnents 3 3 Prerequisites
More informationThis labs uses traffic traces from Lab 1 and traffic generator and sink components from Lab 2.
Lab 3 Packet Scheduling Purpse f this lab: Packet scheduling algrithms determine the rder f packet transmissin at the utput link f a packet switch. This lab includes experiments that exhibit prperties
More informationData Miner Platinum. DataMinerPlatinum allows you to build custom reports with advanced queries. Reports > DataMinerPlatinum
Data Miner Platinum DataMinerPlatinum allws yu t build custm reprts with advanced queries. Reprts > DataMinerPlatinum Click Add New Recrd. Mve thrugh the tabs alng the tp t build yur reprt, with the end
More informationOverview of OPC Alarms and Events
Overview f OPC Alarms and Events Cpyright 2016 EXELE Infrmatin Systems, Inc. EXELE Infrmatin Systems (585) 385-9740 Web: http://www.exele.cm Supprt: supprt@exele.cm Sales: sales@exele.cm Table f Cntents
More informationB Tech Project First Stage Report on
B Tech Prject First Stage Reprt n GPU Based Image Prcessing Submitted by Sumit Shekhar (05007028) Under the guidance f Prf Subhasis Chaudhari 1. Intrductin 1.1 Graphic Prcessr Units A graphic prcessr unit
More informationStructure Query Language (SQL)
Structure Query Language (SQL) 1. Intrductin SQL 2. Data Definitin Language (DDL) 3. Data Manipulatin Language ( DML) 4. Data Cntrl Language (DCL) 1 Structured Query Language(SQL) 6.1 Intrductin Structured
More informationExtended Traceability Report for Enterprise Architect
Extended Traceability Reprt User Guide Extended Traceability Reprt fr Enterprise Architect Extended Traceability Reprt fr Enterprise Architect... 1 Disclaimer... 2 Dependencies... 2 Overview... 2 Limitatins
More informationAugust 22, 2006 IPRO Tech Client Services Tip of the Day. Concordance and IPRO Camera Button / Backwards DB Link Setup
Cncrdance and IPRO Camera Buttn / Backwards DB Link Setup When linking Cncrdance and IPRO, yu will need t update the DDEIVIEW.CPL file t establish the camera buttn. Setting up the camera buttn feature
More informationDesign Rules for PCB Layout Using Altium Designer
Design Rules fr PCB Layut Using Altium Designer 1.0 Intrductin The Department currently has an in-huse facility fr making PCBs which permits bards t be made relatively quickly at lw cst. This facility
More informationEnabling Your Personal Web Page on the SacLink
53 Enabling Yur Persnal Web Page n the SacLink *Yu need t enable yur persnal web page nly ONCE. It will be available t yu until yu graduate frm CSUS. T enable yur Persnal Web Page, fllw the steps given
More information