Lecture 15: Remote Monitoring (RMON)
|
|
- Dominick Mathews
- 5 years ago
- Views:
Transcription
1 Lecture 15: Remote Monitoring (RMON) Prof. Shervin Shirmohammadi SITE, University of Ottawa Prof. Shervin Shirmohammadi CEG RMON Remote Network Monitoring (RMON): monitoring the state of a network and its nodes through a remote probe. Why? Significantly reduces SNMP traffic due to local polling. No need for agent to be visible to managers all the time. Reduces Ping messages. Continuous monitoring of individual segments Has been shown to increase productivity for network administrators. components: Data gatherer: a physical device Data analyzer: processor that analyzes RMON does both and reports to a manager. Prof. Shervin Shirmohammadi CEG
2 RMON in the Network All 4 probes in this example are RMON probes. Remote FDDI LAN Router with RMON FDDI Probe Router FDDI Backbone Network Bridge Local LAN Router Remote Token Ring LAN NMS Ethernet Probe Token Ring Probe Figure 8.1 Network Configuration with RMONs Prof. Shervin Shirmohammadi CEG RMON MIB Ethernet RMON: (rmon 1-9) Token ring extension: (rmon 10) RMON 2: Higher layers (rmon 3 7 and rmon 11-20) rmon (mib-2 16) statistics (1) history (2) alarm (3) host (4) hosttopn (5) (6) filter (7) capture (8) event (9) rmonconformance (20) probeconfig (19) usrhistory (18) a1matrix (17) a1host (16) n1matrix (15) n1host (14) addressmap (13) protocoldist (12) protocoldir (11) Token Ring (10) RMON1 RMON1 Extension RMON2 Figure 8.2 RMON Group Prof. Shervin Shirmohammadi CEG
3 Row Creation & Deletion EntryStatus type introduced in RMON similar to RowStatus in SNMPv2 used to create and delete conceptual row. Only 4 states in RMON compared to 6 in SNMPv2 State Enumeration Description valid 1 Row exists and is active. It is fully configured and operational createrequest 2 Create a new row by creating this object undercreation 3 Row is not fully active invalid 4 Delete the row by disassociating the mapping of this entry Prof. Shervin Shirmohammadi CEG RMON Groups and Functions Probe gathers Functions Statistics on Ethernet, token ring, and hosts conversations Filter group filters Remotely Monitored Network prior to capture of Generation of alarms and events Data Gathering Token Ring Statistics Token Ring Statistics Ethernet Statistics Ethernet Statistics Host and Conversation Statistics Host Statistics Filter Group Packet Filtering Alarm Generation Token Ring History Ethernet History HostTopN Statistics Channel Filtering Event Generation History History Matrix Statistics Packet Capture Network Manager Figure 8.3 RMON1 Groups and Functions Prof. Shervin Shirmohammadi CEG
4 RMON1 MIB Groups & Tables Ten groups divided into three categories Statistics groups (rmon 1, 2, 4, 5, 6, and 10) Event reporting groups (rmon 3 and 9) Filter and packet capture groups(romon 7 and 8) Groups with 2 in the name are enhancements with RMON2 Group OID Function Tables Statistics rmon 1 Link level statistics -etherstatstable -etherstats2table History rmon 2 Periodic statistical collection and storage for later retrieval Alarm rmon 3 Generates events when the sample gathered crosses preestablished thresholds -historytable -etherhistorytable -history2table -etherhistory2table -alarmtable Host rmon 4 Gathers statistical on hosts -hosttable -hosttable -hosttimetable -host2table HostTopN rmon 5 Computes the top N hosts on the respective categories of statistics gathered Matrix rmon 6 Statistics on traffic between pair of hosts Filter rmon 7 Filter function that enables capture of desired parameters Packet Capture rmon 8 Packet capture capability to gather packets after they flow through a -hosttopntable -Table -Table -DSTable -2Table -filtertable -Table -filter2table -2Table -buffertable -capturebuffertable Event rmon 9 s the generation of -eventtable events and notifications Token Ring rmon 10 See Table 8.3 See Table 8.3 Prof. Shervin Shirmohammadi CEG and Data Tables table used to set the instances of rows in the table. Can be set to gather and store different instances of. Values of index and index are the same. Table Table Entry Entry Addl DataSource TableSize Owner Status Addl DataSource TableSize Owner Status Addl Addl Note on Indices: Indices marked in bold letter Value of same as value of Prof. Shervin Shirmohammadi CEG Figure 8.4 Relationship between and Data Tables 4
5 Table Values Integer uniquely identifying the row in the table. DataSource identifies the source of the being collected. TableSize identifies the entries associated with the source. Owner entity or person that created the entry. Can be a management station name, phone number, contact info Status entry status of textual conversion (valid, createrequest, undercreation, invalid). Could be another object Prof. Shervin Shirmohammadi CEG Example: Matrix and Tables Table Table Entry Entry Source Destination = 1 Pkts = = 1 DataSource =ifindiex.1 TableSize = 10 Owner = "Bob" Status = 1 Last DeleteTime = 1000 Source Destination = 1 Pkts = = 2 DataSource =ifindiex.2 TableSize = 10 Owner = "Bob" Status = 1 Note on Indices: Indices marked in bold letter Value of same as value of Last DeleteTime = Source Source Destination Destination = 2 = 2 Pkts = Pkts = Prof. Shervin Shirmohammadi CEG Figure 8.4 Relationship between and Data Tables 5
6 The Statistics Group The simplest of the RMON groups. Counters to store number of packets. The etherstatstable in this group has an entry for each interface. Counts packets with characteristics defined by objects in the etherstatstable. There are 21 columns in the table, such as: etherstatsoversizepackets - >1518 octets etherstatsundersizepackets - < 64 octets etherstatscrcalignerrors etherstatscollision etherstatspkts65to127octests etherstatspkts128to255octests etherstatspkts256to511octests Good example of monitoring! Prof. Shervin Shirmohammadi CEG History Group Enables the network manager to build a record of what is happening in the network over time. Two tables: historytable (7 columns) allows for the settings: Data source historydatasource sampling intervals historyinterval Number of sampling intervals historycontolbuckets etherhistorytable (15 columns) allows for Ethernetspecific settings how many Ethernet packets were sampled in the interval time. Prof. Shervin Shirmohammadi CEG
7 Host Group Identifies traffic statistics with the host that is detected on the subnet. This group makes a connection between the host and the traffic. We can ask a question like Why is host A transmitting more packets than host B? Three tables: hosttable (6 columns), records the number of hosts that have transmitted or received frames in the subnet. hosttable (10 columns), the actual For each interface specified in hosttable, hosttable contains one row for each MAC address on that interface. instance identifier for the hostaddress object: = MAC address Object 6 = Number of Octets in the Ethernet address = decimal equivalent to A3 E hosttimetable (10 columns) information stored based on time, not MAC Has the exact same information as hosttable, except it is index by creation order, not MAC address Prof. Shervin Shirmohammadi CEG Host Top N Group This group makes it possible to calculate the rate at which host traffic for one of the variables listed in the hosttable is increasing or decreasing (Rate of change). Because views of hosttopn objects are time-dependant views may not correspond to one another in time. In addition to its table it has the hosttopntable that keeps: hosttopn identifies the from one host hosttopnaddress MAC Address hosttopnrate amount of change packets/s Host 1 Host 2 Host 3 Host 4 Host 5 Host 6 Host 7 Host 8 Host 9 Host 10 HostTopN Giga Octets Figure 8.5 HostTop-10 Output Octets Prof. Shervin Shirmohammadi CEG
8 Matrix Group This allows us to determine the source and destination of a communication. Aadds another dimension to network management in that we will know which communications are causing the most traffic, not just which hosts. This is done using 3 tables: Table Table ed by matric, then by source address, then by destination address matricdstable ed by matricds, then by destination address, then by source address Prof. Shervin Shirmohammadi CEG Table Example Source Address Dest Address Pkts Octets Errors A B A C A D B C B D C D Prof. Shervin Shirmohammadi CEG
9 Filter and Capture Group Capture group used to capture packets from a probe to a management station. Filter group defines how to filter that using logical expressions. These 2 groups are closely related. For each capture buffer created in a probe there is a corresponding row in the buffertable. These are known as s. Channel is a stream of captured based on a logical expression. Each row in the capturebuffertable corresponds to each packet in the a buffer. A row in the table is associated with multiple rows in the filter table. i.e a set of filters can be associated with a. If a packet passes each test then it is associated with that Prof. Shervin Shirmohammadi CEG Filter table allows packets to be filtered with an arbitrary filter expression Defines the filtertable and Table The filters at this level are based on matching bits to a mask. This leads to fairly complicated procedure that needs to be followed to set up a and filter. =1 = 2 Filter Group If = 1 If Table Entry AcceptType AcceptType Data Data Note on Indices: Indices marked in bold letter Value of filterchannel same as value of Channel Channel Somewhat easier to do with a GUI filter = 1 filter = 2 filter = 3 filter = 4 filtertable filterentry filter Channel = 1 filter Channel = 1 filter Channel = 2 filter Channel = 2 Prof. Shervin Shirmohammadi CEG Filter Filter Filter Filter 9
10 Packet Capture Group Packet capture group is a post-filter group Buffer table used to select s Captured stored in the capture buffer table Channel Table Filter Table (many for each ) Capture Buffer Table (One entry per Channel) Prof. Shervin Shirmohammadi CEG Alarm and Event Groups This group of objects consists of one table, the alarmtable (12 columns), that triggers an alarm or event when a particular threshold is reached in the value of the monitored object. Example: an alarm could be generated if there are more than 500 CRC errors in any 5-miute interval. Contains objects such as alarminterval, alarmrisingthreshold, alarmfallingthreshold, Each row in the alarmtable is identified by a threshold value and an object that is sampled for a specified interval. The Alarm Group is closely related to the Event Group that is used to define events that can be triggered by objects in the Alarm Group or elsewhere in the MIB and can trigger actions elsewhere in the MIB. E.g., an alarm triggers an event which then turns the off. Event group consists of two tables: eventtable, which contains event definitions, and LogTable which is a log of events that must be recorded. Prof. Shervin Shirmohammadi CEG
11 Token Ring Extensions Two statistics groups and associated history groups Statistics group collects TR MAC parameters Promiscuous Statistics group collects packets promiscuously on sizes and types of packets Both of the above have associated hsitory groups Three groups associated with the stations: RingStation, RingStationOrder, and RingStationConfiguration. Finally, Routing group gathers on routing. Prof. Shervin Shirmohammadi CEG RMON TR Extension Groups T o k e n R i n g G r o u p F u n c t i o n T a b l e s S t a t i s ti c s C u r r e n t u til i z a tio n a n d e r r o r s ta tis ti c s o f M a c L a y e r t o k e n R in g M L S t a t s T a b le t o k e n R in g M L S t a t s 2 T a b le P r o m i s c u o u s S t a t is ti c s M a c - L a y e r H i s to r y P r o m i s c u o u s H i s t o r y C u r r e n t u til i z a tio n a n d e r r o r s ta tis ti c s o f p r o m is c u o u s d a ta H i s to ric a l u t ili z a tio n a n d e r r o r s t a ti s ti c s o f M a c L a y e r H i s to ric a l u t ili z a tio n a n d e r r o r s t a ti s ti c s o f p r o m i s c u o u s d a t a t o k e n R in g P S ta ts T a b le t o k e n R in g P S ta ts 2 T a b l e t o k e n R in g M L H i s to r y T a b l e t o k e n R in g P H i s to r y T a b l e R in g S ta ti o n S ta ti o n s t a ti s ti c s r i n g S t a ti o n C o n tr o l T a b l e r i n g S t a ti o n T a b l e r i n g S t a ti o n C o n tr o l 2 T a b le R in g S ta ti o n O r d e r R in g S ta ti o n C o n f i g u r a tio n S o u r c e R o u ti n g O r d e r o f t h e s ta t io n s A c ti v e c o n fig u r a tio n o f r i n g s ta ti o n s U t ili z a ti o n s t a ti s ti c s o f s o u r c e r o u ti n g i n f o r m a t io n r i n g S t a ti o n O r d e rt a b le r i n g S t a ti o n C o n fi g C o n t r o lt a b l e r i n g S t a ti o n C o n fi g T a b le s o u r c e R o u ti n g S t a t s T a b le s o u r c e R o u ti n g S t a t s 2 T a b l e Prof. Shervin Shirmohammadi CEG
Lan Performance LAB Ethernet : CSMA/CD TOKEN RING: TOKEN
Lan Performance LAB Ethernet : CSMA/CD TOKEN RING: TOKEN Ethernet Frame Format 7 b y te s 1 b y te 2 o r 6 b y te s 2 o r 6 b y te s 2 b y te s 4-1 5 0 0 b y te s 4 b y te s P r e a m b le S ta r t F r
More informationcs/ee/ids 143 Communication Networks
cs/ee/ids 143 Communication Networks Chapter 5 Routing Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Warning These notes are not self-contained, probably not understandable, unless you also
More informationEECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs. Cross-coupled NOR gates
EECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs April 16, 2009 John Wawrzynek Spring 2009 EECS150 - Lec24-blocks Page 1 Cross-coupled NOR gates remember, If both R=0 & S=0, then
More informationWireless Internet Exercises
Wireless Internet Exercises Prof. Alessandro Redondi 2018-05-28 1 WLAN 1.1 Exercise 1 A Wi-Fi network has the following features: Physical layer transmission rate: 54 Mbps MAC layer header: 28 bytes MAC
More informationComputer Networks ( Classroom Practice Booklet Solutions)
Computer Networks ( Classroom Practice Booklet Solutions). Concept Of Layering 0. Ans: (b) Sol: Data Link Layer is responsible for decoding bit stream into frames. 0. Ans: (c) Sol: Network Layer has the
More information*** SAMPLE ONLY! The actual NASUNI-FILER-MIB file can be accessed through the Filer address>/site_media/snmp/nasuni-filer-mib ***
*** SAMPLE ONLY! The actual NASUNI-FILER-MIB file can be accessed through the https:///site_media/snmp/nasuni-filer-mib *** NASUNI-FILER-MIB DEFINITIONS ::= BEGIN -- Nasuni Filer
More informationMODBUS Protocol for CS141 network card families
Last update: 20/09/208 MODBUS Protocol for CS4 network card families Summary. MODBUS PROTOCOL... 2.. MODBUS COMMUNICATION PARAMETERS... 2.2. AVAILABLE MODBUS FUNCTION CODES... 2.3. EXCEPTION CODES... 3
More informationMininet on OpenBSD. Using rdomains for Interactive SDN Testing and Development. Ayaka Koshibe. AsiaBSDCon
Mininet on OpenBSD Using rdomains for Interactive SDN Testing and Development Ayaka Koshibe akoshibe@openbsd.org AsiaBSDCon 2018 SDN? Network split into programmable nodes that handle traffic and entities
More informationOverlay Transport Virtualization (OTV) Unicast-Mode Transport Infrastructure Deployment
Overlay Transport Virtualization (OTV) Unicast-Mode Transport Infrastructure Deployment July 24, 2012 ALL DESIGNS, SPECIFICATIONS, STATEMENTS, INFORMATION, AND RECOMMENDATIONS (COLLECTIVELY, "DESIGNS")
More informationN E T W O R K S T A N D A R D S UNIT 5. Ethernet LANs & P R O T O C O L S DPW
UI 5 thernet s onna arren opics for this Unit thernet History ypical network components functionality versus technologies and specifications he advantages and disadvantages of thernet technology in s dvantages
More informationECEN 689 Special Topics in Data Science for Communications Networks
ECEN 689 Special Topics in Data Science for Communications Networks Nick Duffield Department of Electrical & Computer Engineering Texas A&M University Lecture 13 Measuring and Inferring Traffic Matrices
More informationDNP V3.00 Level2. ProtocolAssignm entsusermanual
DNP V3.00 Level2 ProtocolAssignm entsusermanual Electro Industries/GaugeTech assumes no responsibility for any inaccuracies and/or errors that may appear in this document. The information printed in this
More informationrequests/sec. The total channel load is requests/sec. Using slot as the time unit, the total channel load is 50 ( ) = 1
Prof. X. Shen E&CE 70 : Examples #2 Problem Consider the following Aloha systems. (a) A group of N users share a 56 kbps pure Aloha channel. Each user generates at a Passion rate of one 000-bit packet
More informationData Gathering and Personalized Broadcasting in Radio Grids with Interferences
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences Jean-Claude Bermond a,, Bi Li a,b, Nicolas Nisse a, Hervé Rivano c, Min-Li Yu d a Coati Project, INRIA I3S(CNRS/UNSA), Sophia
More information1 Descriptions of Function
Wide-Area Wind Generation Forecasting 1 Descriptions of Function All prior work (intellectual property of the company or individual) or proprietary (non-publicly available) work should be so noted. 1.1
More informationxlogic SuperRelay is a compact and expandable CPU replacing mini PLCs, multiple timers, relays and counters.
SuperRelay S U P E R R E L A Y, T H E P E R F E C T A L T E R N A T I V E T O L O W C O S T P L C s A N D B A S I C R E L A Y S I N T H I S B R O C H U R E : ELC 18 Standard Models ELC 18 Economy Models
More informationDefinition and Examples of DTMCs
Definition and Examples of DTMCs Natarajan Gautam Department of Industrial and Systems Engineering Texas A&M University 235A Zachry, College Station, TX 77843-3131 Email: gautam@tamuedu Phone: 979-845-5458
More informationHiSPARC Detector - Detector Station
HiSPARC Detector - Detector Station Koos Kortland translated and adapted by K. Schadenberg 1 Introduction This module is a part of a series describing the HiSPARC detector. A detector station consists
More informationAlgorithms for Collective Communication. Design and Analysis of Parallel Algorithms
Algorithms for Collective Communication Design and Analysis of Parallel Algorithms Source A. Grama, A. Gupta, G. Karypis, and V. Kumar. Introduction to Parallel Computing, Chapter 4, 2003. Outline One-to-all
More informationLecture on Sensor Networks
Lecture on Sensor Networks Cyclic Historical Redundancy Development Copyright (c) 2008 Dr. Thomas Haenselmann (University of Mannheim, Germany). Permission is granted to copy, distribute and/or modify
More information15-451/651: Design & Analysis of Algorithms September 13, 2018 Lecture #6: Streaming Algorithms last changed: August 30, 2018
15-451/651: Design & Analysis of Algorithms September 13, 2018 Lecture #6: Streaming Algorithms last changed: August 30, 2018 Today we ll talk about a topic that is both very old (as far as computer science
More informationGeodatabase Best Practices. Dave Crawford Erik Hoel
Geodatabase Best Practices Dave Crawford Erik Hoel Geodatabase best practices - outline Geodatabase creation Data ownership Data model Data configuration Geodatabase behaviors Data integrity and validation
More informationFPGA Resource Utilization Estimates for NI crio LabVIEW FPGA Version: 8.6 NI-RIO Version: 3.0 Date: 8/5/2008
FPGA Resource Utilization Estimates for NI crio-9104 LabVIEW FPGA Version: 8.6 NI-RIO Version: 3.0 Date: 8/5/2008 Note: The numbers presented in this document are estimates. Actual resource usage for your
More information(Cat. No CFM) Product Data
(Cat. No. 1771-CFM) Product Data The CFM module interfaces Allen-Bradley programmable logic controllers (PLCs ) with magnetic pickups, single-channel shaft encoders, turbine flowmeters or any source of
More informationATM VP-Based Ring Network Exclusive Video or Data Traffics
ATM VP-Based Ring Network Exclusive Video or Data Traffics In this chapter, the performance characteristic of the proposed ATM VP-Based Ring Network exclusive video or data traffic is studied. The maximum
More informationIEEE Working Group on Mobile Broadband Wireless Access. <http://grouper.ieee.org/groups/802/20/>
C802.20-07/35 Project IEEE 802.20 Working Group on Mobile Broadband Wireless Access Title Date Submitted Practice letter ballot 2 comment LDPC harmonized text from
More informationDistributed systems Lecture 4: Clock synchronisation; logical clocks. Dr Robert N. M. Watson
Distributed systems Lecture 4: Clock synchronisation; logical clocks Dr Robert N. M. Watson 1 Last time Started to look at time in distributed systems Coordinating actions between processes Physical clocks
More informationTime. To do. q Physical clocks q Logical clocks
Time To do q Physical clocks q Logical clocks Events, process states and clocks A distributed system A collection P of N single-threaded processes (p i, i = 1,, N) without shared memory The processes in
More informationMininet on OpenBSD. Using rdomains for Interactive SDN Testing and Development. Ayaka Koshibe. BSDCan
Mininet on OpenBSD Using rdomains for Interactive SDN Testing and Development Ayaka Koshibe akoshibe@openbsd.org BSDCan 2018 SDN? Anything you want it to mean... Or rather, a way to logically centralize
More informationMATRIX MULTIPLICATION AND INVERSION
MATRIX MULTIPLICATION AND INVERSION MATH 196, SECTION 57 (VIPUL NAIK) Corresponding material in the book: Sections 2.3 and 2.4. Executive summary Note: The summary does not include some material from the
More informationChannel Selection in Cognitive Radio Networks with Opportunistic RF Energy Harvesting
1 Channel Selection in Cognitive Radio Networks with Opportunistic RF Energy Harvesting Dusit Niyato 1, Ping Wang 1, and Dong In Kim 2 1 School of Computer Engineering, Nanyang Technological University
More informationFPGA Resource Utilization Estimates for NI PXI-7854R. LabVIEW FPGA Version: 8.6 NI-RIO Version: 3.0 Date: 8/5/2008
FPGA Resource Utilization Estimates for NI PXI-7854R LabVIEW FPGA Version: 8.6 NI-RIO Version: 3.0 Date: 8/5/2008 Note: The numbers presented in this document are estimates. Actual resource usage for your
More informationAppendix A Prototypes Models
Appendix A Prototypes Models This appendix describes the model of the prototypes used in Chap. 3. These mathematical models can also be found in the Student Handout by Quanser. A.1 The QUANSER SRV-02 Setup
More informationLecture 14: Quantum information revisited
CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 4: Quantum information revisited March 4, 006 So far, this course has focused almost entirely on quantum algorithms The next
More informationDistributed Systems Fundamentals
February 17, 2000 ECS 251 Winter 2000 Page 1 Distributed Systems Fundamentals 1. Distributed system? a. What is it? b. Why use it? 2. System Architectures a. minicomputer mode b. workstation model c. processor
More information9-Channel 64steps Constant-Current LED Driver with SPI Control. Features
BCT3119 with SPI Control General Description The BCT3119 is a constant current driver incorporating shift register and data latch. This CMOS device is designed for LED display applications. The max output
More informationConstraint Technology for Solving Combinatorial Problems
First Exam for Course 1DL023: Constraint Technology for Solving Combinatorial Problems Autumn 2009, Uppsala University, Sweden Prepared by Pierre Flener Wednesday 21 October 2009, from 08:00 to 13:00,
More information"Transport statistics" MEETING OF THE WORKING GROUP ON RAIL TRANSPORT STATISTICS. Luxembourg, 25 and 26 June Bech Building.
Document: Original: Rail/2007/9/EN English "Transport statistics" MEETING OF THE WORKING GROUP ON RAIL TRANSPORT STATISTICS Luxembourg, 25 and 26 June 2007 Bech Building Room BECH Ampere Beginning 10:00
More informationEECS150 - Digital Design Lecture 21 - Design Blocks
EECS150 - Digital Design Lecture 21 - Design Blocks April 3, 2012 John Wawrzynek Spring 2012 EECS150 - Lec21-db3 Page 1 Fixed Shifters / Rotators fixed shifters hardwire the shift amount into the circuit.
More informationFlowSpec. Frédéric Gabut-Deloraine. FRnOG - 2 décembre 2011 NEO TELECOMS
FlowSpec Frédéric Gabut-Deloraine NEO TELECOMS FRnOG - 2 décembre 2011 Introduction Dissemination of Flow Specification Rules D(D)oS filtering Regular use Easy to disseminate Agenda Background Forwarding
More informationNetworked Control Systems
Networked Control Systems Simulation & Analysis J.J.C. van Schendel DCT 2008.119 Traineeship report March till June 2008 Coaches: Supervisor TU/e: Prof. Dr. D. Nesic, University of Melbourne Dr. M. Tabbara,
More informationIntroduction to GIS. Dr. M.S. Ganesh Prasad
Introduction to GIS Dr. M.S. Ganesh Prasad Department of Civil Engineering The National Institute of Engineering, MYSORE ganeshprasad.nie@gmail.com 9449153758 Geographic Information System (GIS) Information
More informationChapter 5. GIS The Global Information System
Chapter 5 GIS The Global Information System What is GIS? We have just discussed GPS a simple three letter acronym for a fairly sophisticated technique to locate a persons or objects position on the Earth
More informationCpE358/CS381. Switching Theory and Logical Design. Summer
Switching Theory and Logical Design - Class Schedule Monday Tuesday Wednesday Thursday Friday May 7 8 9 - Class 2 - Class 2 2 24 - Class 3 25 26 - Class 4 27 28 Quiz Commencement 3 June 2 - Class 5 3 -
More informationAdministrivia. Course Objectives. Overview. Lecture Notes Week markem/cs333/ 2. Staff. 3. Prerequisites. 4. Grading. 1. Theory and application
Administrivia 1. markem/cs333/ 2. Staff 3. Prerequisites 4. Grading Course Objectives 1. Theory and application 2. Benefits 3. Labs TAs Overview 1. What is a computer system? CPU PC ALU System bus Memory
More informationDynamic resource sharing
J. Virtamo 38.34 Teletraffic Theory / Dynamic resource sharing and balanced fairness Dynamic resource sharing In previous lectures we have studied different notions of fair resource sharing. Our focus
More informationAnd for polynomials with coefficients in F 2 = Z/2 Euclidean algorithm for gcd s Concept of equality mod M(x) Extended Euclid for inverses mod M(x)
Outline Recall: For integers Euclidean algorithm for finding gcd s Extended Euclid for finding multiplicative inverses Extended Euclid for computing Sun-Ze Test for primitive roots And for polynomials
More informationCS418 Operating Systems
CS418 Operating Systems Lecture 14 Queuing Analysis Textbook: Operating Systems by William Stallings 1 1. Why Queuing Analysis? If the system environment changes (like the number of users is doubled),
More information3F1 Information Theory, Lecture 1
3F1 Information Theory, Lecture 1 Jossy Sayir Department of Engineering Michaelmas 2013, 22 November 2013 Organisation History Entropy Mutual Information 2 / 18 Course Organisation 4 lectures Course material:
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1982, 28. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 199. It is available free to all individuals,
More informationIntelligent GIS: Automatic generation of qualitative spatial information
Intelligent GIS: Automatic generation of qualitative spatial information Jimmy A. Lee 1 and Jane Brennan 1 1 University of Technology, Sydney, FIT, P.O. Box 123, Broadway NSW 2007, Australia janeb@it.uts.edu.au
More informationData Collection. Lecture Notes in Transportation Systems Engineering. Prof. Tom V. Mathew. 1 Overview 1
Data Collection Lecture Notes in Transportation Systems Engineering Prof. Tom V. Mathew Contents 1 Overview 1 2 Survey design 2 2.1 Information needed................................. 2 2.2 Study area.....................................
More informationVISY-Quick Communication Protocol
VISY-Quick Communication Protocol Rev. Protocol Version Modification VI Version Date Name 0 1.00 First release 2.0.1 2000-03-29 Willmer 1 1.10 New commands date and time (3.2... 3.5) 2.0.2 2000-07-07 Willmer
More informationLecture 14 October 22
EE 2: Coding for Digital Communication & Beyond Fall 203 Lecture 4 October 22 Lecturer: Prof. Anant Sahai Scribe: Jingyan Wang This lecture covers: LT Code Ideal Soliton Distribution 4. Introduction So
More informationAbout the Sens it Payload
About the Sens it Payload Payload structure 4 bytes 8 bytes Mode values Configuration values (optional) If the message is an uplink only frame, the payload contains only the 4 bytes of mode values. If
More informationA Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors Qian Guo Thomas Johansson Paul Stankovski Dept. of Electrical and Information Technology, Lund University ASIACRYPT 2016 Dec 8th, 2016
More informationWe are here. Assembly Language. Processors Arithmetic Logic Units. Finite State Machines. Circuits Gates. Transistors
CSC258 Week 3 1 Logistics If you cannot login to MarkUs, email me your UTORID and name. Check lab marks on MarkUs, if it s recorded wrong, contact Larry within a week after the lab. Quiz 1 average: 86%
More informationParallelization of the QC-lib Quantum Computer Simulator Library
Parallelization of the QC-lib Quantum Computer Simulator Library Ian Glendinning and Bernhard Ömer September 9, 23 PPAM 23 1 Ian Glendinning / September 9, 23 Outline Introduction Quantum Bits, Registers
More informationLaboratory II. Exploring Digital Logic
Laboratory II Exploring Digital Logic Abstract Few devices in the world are as ubiquitous as the seven-segment display. This device, which was invented in the 1960 s, can be found everywhere from digital
More informationA New Technique for Link Utilization Estimation
A New Technique for Link Utilization Estimation in Packet Data Networks using SNMP Variables S. Amarnath and Anurag Kumar* Dept. of Electrical Communication Engineering Indian Institute of Science, Bangalore
More informationThe prediction of passenger flow under transport disturbance using accumulated passenger data
Computers in Railways XIV 623 The prediction of passenger flow under transport disturbance using accumulated passenger data T. Kunimatsu & C. Hirai Signalling and Transport Information Technology Division,
More informationK D A A M P L I F I E R S F I R M W A R E U S E R G U I D E
K D A A M P L I F I E R S F I R M W A R E U S E R G U I D E T A B L E O F C O N T E N T S S E C T I O N 1 : P R E PA R I N G Y O U R F I L E S Via Network Router 3 S E C T I O N 2 : A C C E S S I N G T
More informationDigital Circuits, Binary Numbering, and Logic Gates Cornerstone Electronics Technology and Robotics II
Digital Circuits, Binary Numbering, and Logic Gates Cornerstone Electronics Technology and Robotics II Administration: o Prayer Electricity and Electronics, Section 20.1, Digital Fundamentals: o Fundamentals:
More informationAntonio Falabella. 3 rd nternational Summer School on INtelligent Signal Processing for FrontIEr Research and Industry, September 2015, Hamburg
INFN - CNAF (Bologna) 3 rd nternational Summer School on INtelligent Signal Processing for FrontIEr Research and Industry, 14-25 September 2015, Hamburg 1 / 44 Overview 1 2 3 4 5 2 / 44 to Computing The
More informationWeather Responsive. in Maryland. Richard R. Dye Maryland State Highway Administration. Maryland State Highway Administration
Weather Responsive Traffic Management in Maryland Richard R. Dye Maryland State Highway Administration i ti 1st Stakeholder Workshop on Weather Responsive Traffic Mgt October 6-7, 2011 1 RWIS Grew From
More informationAileen Buckley, Ph.D. and Charlie Frye
An Information Model for Maps: Towards Production from GIS Databases Aileen Buckley, Ph.D. and Charlie Frye Researchers, ESRI GIS vs. cart GIS Outline of the presentation Introduction Differences between
More informationChapter 7. Sequential Circuits Registers, Counters, RAM
Chapter 7. Sequential Circuits Registers, Counters, RAM Register - a group of binary storage elements suitable for holding binary info A group of FFs constitutes a register Commonly used as temporary storage
More informationTime. Today. l Physical clocks l Logical clocks
Time Today l Physical clocks l Logical clocks Events, process states and clocks " A distributed system a collection P of N singlethreaded processes without shared memory Each process p i has a state s
More informationHigh Performance Computing
Master Degree Program in Computer Science and Networking, 2014-15 High Performance Computing 2 nd appello February 11, 2015 Write your name, surname, student identification number (numero di matricola),
More informationUniversity of New Mexico Department of Computer Science. Final Examination. CS 561 Data Structures and Algorithms Fall, 2013
University of New Mexico Department of Computer Science Final Examination CS 561 Data Structures and Algorithms Fall, 2013 Name: Email: This exam lasts 2 hours. It is closed book and closed notes wing
More informationCOMP9334: Capacity Planning of Computer Systems and Networks
COMP9334: Capacity Planning of Computer Systems and Networks Week 2: Operational analysis Lecturer: Prof. Sanjay Jha NETWORKS RESEARCH GROUP, CSE, UNSW Operational analysis Operational: Collect performance
More informationRecovery of Low-Rank Plus Compressed Sparse Matrices with Application to Unveiling Traffic Anomalies
July 12, 212 Recovery of Low-Rank Plus Compressed Sparse Matrices with Application to Unveiling Traffic Anomalies Morteza Mardani Dept. of ECE, University of Minnesota, Minneapolis, MN 55455 Acknowledgments:
More informationSection 1.1 Algorithms. Key terms: Algorithm definition. Example from Trapezoidal Rule Outline of corresponding algorithm Absolute Error
Section 1.1 Algorithms Key terms: Algorithm definition Example from Trapezoidal Rule Outline of corresponding algorithm Absolute Error Approximating square roots Iterative method Diagram of a general iterative
More informationCommon Information of Random Linear Network Coding Over A 1-Hop Broadcast Packet Erasure Channel
Wang, ISIT 2011 p. 1/15 Common Information of Random Linear Network Coding Over A 1-Hop Broadcast Packet Erasure Channel Chih-Chun Wang, Jaemin Han Center of Wireless Systems and Applications (CWSA) School
More informationNetwork Congestion Measurement and Control
Network Congestion Measurement and Control Wasim El-Hajj Dionysios Kountanis Anupama Raju email: {welhajj, kountan, araju}@cs.wmich.edu Department of Computer Science Western Michigan University Kalamazoo,
More informationTechnical Report Communicating Secret Information Without Secret Messages
Technical Report 013-605 Communicating Secret Information Without Secret Messages Naya Nagy 1, Marius Nagy 1, and Selim G. Akl 1 College of Computer Engineering and Science Prince Mohammad Bin Fahd University,
More informationTopic 3. Design of Sequences with Low Correlation
Topic 3. Design of Sequences with Low Correlation M-sequences and Quadratic Residue Sequences 2 Multiple Trace Term Sequences and WG Sequences 3 Gold-pair, Kasami Sequences, and Interleaved Sequences 4
More informationInferring Passenger Boarding and Alighting Preference for the Marguerite Shuttle Bus System
Inferring Passenger Boarding and Alighting Preference for the Marguerite Shuttle Bus System Adrian Albert Abstract We analyze passenger count data from the Marguerite Shuttle system operating on the Stanford
More informationArtificial Neural Networks Examination, June 2005
Artificial Neural Networks Examination, June 2005 Instructions There are SIXTY questions. (The pass mark is 30 out of 60). For each question, please select a maximum of ONE of the given answers (either
More informationAteneo de Manila, Philippines
Ideal Flow Based on Random Walk on Directed Graph Ateneo de Manila, Philippines Background Problem: how the traffic flow in a network should ideally be distributed? Current technique: use Wardrop s Principle:
More informationExamining Mono-Polarity Bit Sequences in the Controller Area Network Specification
Examining Mono-Polarity Bit Sequences in the Controller Area Network Specification Steve C. Talbot Illinois Institute of Technology Chicago, Illinois 6066, USA talbste@iit.edu Abstract The Controller Area
More informationRandom Delay Insertion: Effective Countermeasure against DPA on FPGAs
Random Delay Insertion: Effective Countermeasure against DPA on FPGAs Lu, Yingxi Dr. Máire O Neill Prof. John McCanny Overview September 2004 PRESENTATION OUTLINE DPA and countermeasures Random Delay Insertion
More informationData Gathering and Personalized Broadcasting in Radio Grids with Interferences
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences Jean-Claude Bermond a,b,, Bi Li b,a,c, Nicolas Nisse b,a, Hervé Rivano d, Min-Li Yu e a Univ. Nice Sophia Antipolis, CNRS,
More informationAnnouncements Monday, September 18
Announcements Monday, September 18 WeBWorK 1.4, 1.5 are due on Wednesday at 11:59pm. The first midterm is on this Friday, September 22. Midterms happen during recitation. The exam covers through 1.5. About
More informationMAGPOWR TENSION CONTROL DLCA NET-SLIM. User Manual. Digital Load Cell Amplifier MI 850A358 1 A
MAGPOWR TENSION CONTROL DLCA NET-SLIM User Manual EN Digital Load Cell Amplifier MI 850A358 1 A CONTENTS 1.0 INTRODUCTION 4 1.1 About these operating instructions... 4 1.2 Product overview... 5 1.2.1 Additional
More informationUSTER LABORATORY SYSTEMS
USTER LABORATORY SYSTEMS APPLICATION REPORT Measurement of slub yarns with the USTER TESTER 4 THE STANDARD FROM FIBER TO FABRIC Richard Furter October 2003 SE 580 Copyright 2007 by Uster Technologies AG
More informationTowards Dynamically Adaptive Weather Analysis and Forecasting in LEAD
Towards Dynamically Adaptive Weather Analysis and Forecasting in LEAD Beth Plale 1, Dennis Gannon 1, Dan Reed 2, Sara Graves 3, Kelvin Droegemeier 4, Bob Wilhelmson 5, Mohan Ramamurthy 6 1 Indiana University
More informationECE 2300 Digital Logic & Computer Organization
ECE 23 Digital Logic & Computer Organization Spring 28 Combinational Building Blocks Lecture 5: Announcements Lab 2 prelab due tomorrow HW due Friday HW 2 to be posted on Thursday Lecture 4 to be replayed
More informationExam 1. March 12th, CS525 - Midterm Exam Solutions
Name CWID Exam 1 March 12th, 2014 CS525 - Midterm Exam s Please leave this empty! 1 2 3 4 5 Sum Things that you are not allowed to use Personal notes Textbook Printed lecture notes Phone The exam is 90
More informationAnnual TTFO Meeting April 10, 2018 Michael J. Wittman, P.S. Chief Surveyor / GIS Coordinator
Annual TTFO Meeting April 10, 2018 Michael J. Wittman, P.S. Chief Surveyor / GIS Coordinator Text Book Definition: Layman Terms: An organized collection of hardware, software and geographic data designed
More informationENG2410 Digital Design Introduction to Digital Systems. Fall 2017 S. Areibi School of Engineering University of Guelph
ENG2410 Digital Design Introduction to Digital Systems Fall 2017 S. Areibi School of Engineering University of Guelph Resources Chapter #1, Mano Sections 1.1 Digital Computers 1.2 Number Systems 1.3 Arithmetic
More informationPart 2: Random Routing and Load Balancing
1 Part 2: Random Routing and Load Balancing Sid C-K Chau Chi-Kin.Chau@cl.cam.ac.uk http://www.cl.cam.ac.uk/~ckc25/teaching Problem: Traffic Routing 2 Suppose you are in charge of transportation. What do
More informationMass Asset Additions. Overview. Effective mm/dd/yy Page 1 of 47 Rev 1. Copyright Oracle, All rights reserved.
Overview Effective mm/dd/yy Page 1 of 47 Rev 1 System References None Distribution Oracle Assets Job Title * Ownership The Job Title [list@yourcompany.com?subject=eduxxxxx] is responsible for ensuring
More informationActive Measurement for Multiple Link Failures Diagnosis in IP Networks
Active Measurement for Multiple Link Failures Diagnosis in IP Networks Hung X. Nguyen and Patrick Thiran EPFL CH-1015 Lausanne, Switzerland Abstract. Simultaneous link failures are common in IP networks
More informationGIS Support for a Traffic. Delaware
GIS Support for a Traffic Operations Management Plan in Delaware Geospatial Information Systems for Transportation AASHTO GIS-T, Hershey Pennsylvania March 28th, 2011 David Racca Center for Applied Demography
More informationTransmitting and Hiding Quantum Information
2018/12/20 @ 4th KIAS WORKSHOP on Quantum Information and Thermodynamics Transmitting and Hiding Quantum Information Seung-Woo Lee Quantum Universe Center Korea Institute for Advanced Study (KIAS) Contents
More informationCHAPTER 2 NUMBER SYSTEMS
CHAPTER 2 NUMBER SYSTEMS The Decimal Number System : We begin our study of the number systems with the familiar decimal number system. The decimal system contains ten unique symbol 0, 1, 2, 3, 4, 5, 6,
More informationEntanglement and Quantum Teleportation
Entanglement and Quantum Teleportation Stephen Bartlett Centre for Advanced Computing Algorithms and Cryptography Australian Centre of Excellence in Quantum Computer Technology Macquarie University, Sydney,
More informationComputational Integer Programming. Lecture 2: Modeling and Formulation. Dr. Ted Ralphs
Computational Integer Programming Lecture 2: Modeling and Formulation Dr. Ted Ralphs Computational MILP Lecture 2 1 Reading for This Lecture N&W Sections I.1.1-I.1.6 Wolsey Chapter 1 CCZ Chapter 2 Computational
More informationSUPPLEMENTARY INFORMATION
SUPPLEMENTARY INFORMATION doi:10.1038/nature11875 Method for Encoding and Decoding Arbitrary Computer Files in DNA Fragments 1 Encoding 1.1: An arbitrary computer file is represented as a string S 0 of
More information