FLAME Flexible Lightweight Active Measurement Environment
|
|
- Blaise Lewis
- 5 years ago
- Views:
Transcription
1 FLAME Flexible Lightweight Active Measurement Environment Marcos L. Kirszenblatt Thiago B. Cardozo Artur Ziviani Antônio Tadeu A. Gomes National Laboratory for Scientific Computing (LNCC) M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
2 1 Motivation Goal Related Work 2 3 Why Lua? LAMP API 4 Experimental scenarios RTT measurements Tracing Route One-way delay measurements Link capacity estimation 5 Conclusions Future work Questions? M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
3 Motivation Goal Related Work Typical research fronts in active measurements development or improvement of measurement tools deployment of large-scale platforms Problems in developing/improving active measurement tools large development and testing time low code reuse absence of standardized storage of results M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
4 Goal Motivation Goal Related Work A platform for the rapid prototyping of active measurement tools that: offers basic primitives for active measurement Active measurement: involves the sending of probe packets is extensible stores the results in a centralized repository allows carrying out cooperative and uncooperative experiments Cooperative experiment: the tool must be executed at both ends Uncooperative experiment: the tool is executed only at the origin M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
5 Tools for active network measurement Motivation Goal Related Work each tool targets a limited set of metrics low code reuse results are presented in an ad hoc way Tools COP OWD OWV RTT PLR PRO ROT PHC ECP ABW Iperf owping pathchar pathload pathrate ping QoSMet sprobe sting traceroute traceroute-paris Legend: COP: tools that depend on cooperative destination nodes. OWD: one-way delay; OWV: OWD variation; RTT: round-trip time; PLR: packet loss rate; PRO: packet reordering; ROT: route tracing; PHC: per-hop capactity; ECP: end-to-end link capacity; ABW: available bandwidth. M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
6 Platforms for active network measurement Motivation Goal Related Work Manager-agent architecture NIMI ETOMIC DIMES NetQuest Scriptroute is the closest to ours Ruby scripts no centralized repository no cooperative experiments M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
7 XMPP (Extensible Messaging and Presence Protocol) Measurement manager User console Measurement agents Components XMPP server measurement manager user console measurement agents M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
8 XMPP (Extensible Messaging and Presence Protocol) Measurement manager User console Measurement agents XMPP server acts as a message hub among other FLAME components presence control connectivity control offline message store for temporally disconnected components NAT/firewall friendly M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
9 XMPP (Extensible Messaging and Presence Protocol) Measurement manager User console Measurement agents Measurement manager controls the starting and the finishing of experiments only component that accesses the data repository M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
10 XMPP (Extensible Messaging and Presence Protocol) Measurement manager User console Measurement agents User console registers an experiment at the manager allows access to specific agents sends commands or Lua scripts to the selected agent(s) M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
11 XMPP (Extensible Messaging and Presence Protocol) Measurement manager User console Measurement agents Measurement agents host a Lua interpreter run the scripts in a Sandbox environment provide access to a measurement API (LAMP) send the results to the manager may operate in exclusive mode M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
12 Why Lua? Why Lua? LAMP API Lua characteristics interpreted programming language simple syntax extensible semantics portability low memory footprint Don t know Lua? Try it: Lua is a powerful, fast, lightweight, embeddable scripting language. Lua combines simple procedural syntax with powerful data description constructs based on associative arrays and extensible semantics. Lua is dynamically typed, runs by interpreting bytecode for a register-based virtual machine, and has automatic memory management with incremental garbage collection, making it ideal for configuration, scripting, and rapid prototyping. M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
13 Why Lua? LAMP API LAMP API: Lua Active Measurements Primitives The active measurement primitives are implemented in C, being available through a minimalist API LAMP API lamp.sendudpow ( ) lamp.sendudptw ( ) lamp.sendtcpow ( ) lamp.sendtcptw ( ) lamp.sendicmptw ( ) lamp.sendudppt ( ) Notation OW = One Way (Cooperative) TW = Two Way (Uncooperative) PT = Packet Train (Cooperative) M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
14 Experimental scenarios Experimental scenarios RTT measurements Tracing Route One-way delay measurements Link capacity estimation Source and target nodes of the Planet-lab experiments IP address Domain name Source S planetlab1.pop-mg.rnp.br Targets T host1.planetlab.informatik.tu-darmstadt.de T alice.cs.princeton.edu T planet1.cs.huji.ac.il T planetlab-1.cs.auckland.ac.nz T node2.planet-lab.titech.ac.jp M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
15 Experimental scenarios Experimental scenarios RTT measurements Tracing Route One-way delay measurements Link capacity estimation Local testbed 10 Mbps {10, 100}Mbps 10 Mbps Mac Minis running Quagga over Ubuntu 9.04 M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
16 FLAME ping prototype Experimental scenarios RTT measurements Tracing Route One-way delay measurements Link capacity estimation 1 function flameping ( params) 2 Ping params ( and corresponding defaul ts ) 3 lo c al target = params. target or lo c al si ze = params. size or 56 5 lo c al i n t e r v a l = params. i n t e r v a l or microsecond r e s ol ut i o n 6 lo c al npackets = params. npackets or 10 7 lo c al protocol = params. protocol or icmp 8 lo c al timeout = params. timeout or microsecond r e s o l u t i o n 9 lo c al t t l = params. t t l or for i = 1, npackets do 12 lo c al response Choose probing protocol ( for UDP and TCP primitives, 15 since port i s not indicated i t i s randomly chosen above 1024) 16 i f protocol == icmp then 17 response=lamp.sendicmptw{ip= target, si ze= size, 18 timeout= timeout, t t l= t t l } 19 e l s e i f proto co l == udp then 20 response=lamp.sendudptw{ip= target, size= size, 21 timeout= timeout, t t l= t t l } 22 e l s e i f proto co l == tcp then 23 response=lamp.sendtcptw{ip= target, size= size, 24 timeout= timeout, t t l= t t l } 25 else 26 print ( INVALID PROTOCOL:, protocol ) 27 return 28 end Check host/ net u nreach ab i l i t y 31 i f response and response. l oss == ICMP HOST UNREACH then 32 print ( DESTINATION UNREACHABLE :, target ) 33 return 34 end Wait time between probes 37 i f type ( i n t e r v a l ) == number then 38 lamp. sleep ( i n t e r v a l ) 39 e l s e i f type ( i n t e r v a l ) == table then 40 lamp. sleep ( i n t e r v a l. func ( i n t e r v a l. params )) end end f or i 43 end M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
17 Experimental scenarios RTT measurements Tracing Route One-way delay measurements Link capacity estimation Commands to execute flameping over Planet-lab nodes Probes uniformly spaced l o ca l t argets = { , , , , } for k, v in i p a i r s ( t a rg ets ) do flameping{ target=v} end Probes exponentially spaced l oc al function expdist ( lambda ) l o c al r = 0 repeat r = math. random () un ti l ( r = 0) return math. f l o o r ( math. log ( r )/ lambda ) end l oc al t argets =... same as l e f t for k, v in i p a i r s ( t arge ts ) do flameping{ t ar get=v, i n t e r v a l={ func=expdist, params=1/ } } end M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
18 RTT measurement statistics in Planet-lab Experimental scenarios RTT measurements Tracing Route One-way delay measurements Link capacity estimation ping flame ping flame ping exp RTT (ms) T1 T2 T3 T4 T5 Targets for the RTT measurements M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
19 FLAME tracing route prototype Experimental scenarios RTT measurements Tracing Route One-way delay measurements Link capacity estimation 1 function flametrace ( params ) 2 lo c al target = params. target or lo c al si ze = params. size or 60 4 lo c al i n t e r v a l = params. i n t e r v a l or lo c al npackets = params. npackets or 3 6 lo c al protocol = params. protocol or udp 7 lo c al timeout = params. timeout or 5 8 lo c al maxhops = params. maxhops or for h = 1, maxhops do 11 lo c al response for i = 1, npackets do 14 Choose probing protocol ( for UDP and TCP primitives, 15 since port i s not indicated i t i s randomly chosen above 1024) 16 i f protocol == icmp then 17 response=lamp.sendicmptw{ip= target, si ze= size, 18 timeout= timeout, t t l=h} 19 e l s e i f proto co l == udp then 20 response=lamp.sendudptw{ip= target, size= size, 21 timeout= timeout, t t l=h} 22 e l s e i f proto co l == tcp then 23 response=lamp.sendtcptw{ip= target, size= size, 24 timeout= timeout, t t l=h} 25 else 26 print ( INVALID PROTOCOL:, protocol ) 27 return 28 end same as l i ne s in flameping 31 end f or i I s current node the target? 34 i f ( response. dstip == target ) then break end 35 end f or h 36 end M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
20 Experimental scenarios RTT measurements Tracing Route One-way delay measurements Link capacity estimation Graph representation of traceroute and flametrace results (T1) The numbered edges indicate the number of omitted hops between the corresponding nodes (T3) (T5) (T2) (T4) M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
21 FLAME one-way delay measurement prototype Experimental scenarios RTT measurements Tracing Route One-way delay measurements Link capacity estimation 1 function flameowd( params ) 2 lo c al target = params. target or lo c al si ze = params. size or 56 4 lo c al i n t e r v a l = params. i n t e r v a l or lo c al npackets = params. npackets or 5 6 lo c al protocol = params. protocol or udp 7 lo c al timeout = params. timeout or lo c al port = params. port or n i l 9 10 for i = 1, npackets do 11 lo c al response Choose probing protocol ( i f port i s not indicated the destination node 14 chooses a port above In any case, for OW operations, 15 the source and destinat i on nodes agree on the used port 16 through XMPP messages ) 17 i f protocol == udp then 18 response=lamp.sendudpow{ip= target, size= size, 19 timeout= timeout, port= port} 20 e l s e i f proto co l == tcp then 21 response=lamp.sendtcpow{ip= target, size= size, 22 timeout= timeout, port= port} 23 else 24 print ( INVALID PROTOCOL:, protocol ) 25 return 26 end Check port u n a v a i l a b i l i t y and host/ net u nreach ab i l i t y 29 i f response then 30 i f response. loss == ICMP HOST UNREACH then 31 print ( DESTINATION UNREACHABLE :, target ) return e l s e i f response. l o s s == PORT ALREADY IN USE then 34 print ( DESTINATION PORT ALREADY IN USE:, target, port ) 35 return 36 end 37 end same as l i n e s i n flameping 40 end f or i 41 end M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
22 Measured one-way delay in ms Experimental scenarios RTT measurements Tracing Route One-way delay measurements Link capacity estimation Topology Topology P05 Median P95 P05 Median P95 owping flameowd NTP estimated synch error is±0.41 ms M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
23 FLAME link capacity estimation prototype Experimental scenarios RTT measurements Tracing Route One-way delay measurements Link capacity estimation 1 function flamechar ( params) 2 lo c al mtu = params. mtu or 1500 probe size l im i t 3 lo c al increment = params. increment or 32 dif fe re nc e between probe si ze s 4 lo c al npackets = math. f l o o r ( mtu/ increment ) 5 lo c al maxhops = params. maxhops or 30 maximum number of allowed hops 6 lo c al r e p e t i t i o n s = params. r e p e t i t i o n s or 32 number of t e st s per hop 7 lo c al target = params. target or lo c al timeout = params. timeout or 3 9 lo c al i n t e r v a l = param table. i n t e r v a l or time between probes 10 lo c al s i z e l i s t = generateprobesizelist( npackets, increment ) for h = 1, maxhops do 13 lo c al response 14 for t = 1, r e p e t i t i o n s do 15 for i = 1, npackets do 16 local response Choose probing protocol ( for UDP and TCP primitives, 19 since port i s not indicated i t i s randomly chosen above 1024) 20 i f protocol == icmp then 21 response = lamp.sendicmptw{i p= target, s i z e= s i z e l i s t [ i ], t t l=h, timeout= timeout} 22 e l s e i f proto co l == udp then 23 response = lamp.sendudptw{i p= target, s i z e= s i z e l i s t [ i ], t t l=h, timeout= timeout} 24 e l s e i f proto co l == udp then 25 response = lamp.sendtcptw{i p= target, s i z e= s i z e l i s t [ i ], t t l=h, timeout= timeout} else print ( INVALID PROTOCOL:, protocol ) 28 return 29 end same as l i ne s in flameping 32 end f or i 33 end f or t I s current node the target? 36 i f ( response. remip == target ) then break end 37 end f or h 38 end Function to create a shuffle d package siz e l i s t 41 function generateprobesizelist( npackets, increment) implementation omitted due to space l i mi ta ti ons 43 end M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
24 Link capacity measurements Experimental scenarios RTT measurements Tracing Route One-way delay measurements Link capacity estimation RTT (ms) pchar datapoints pchar best fit (R 2 = 0.92) flamechar datapoints flamechar best fit (R 2 = 0.92) C pchar = 4.69 Mbps C flamechar = 5.03 Mbps RTT (ms) pchar datapoints pchar best fit (R 2 = 0.93) flamechar datapoints flamechar best fit (R 2 = 0.91) C pchar = 4.73 Mbps C flamechar = 5.11 Mbps Size of the probe traffic (bytes) (a) Link 1, Topology Size of the probe traffic (bytes) (b) Link 1, Topology RTT (ms) pchar datapoints pchar best fit (R 2 = 0.98) flamechar datapoints flamechar best fit (R 2 = 0.98) C pchar = 4.83 Mbps C flamechar = 4.46 Mbps RTT (ms) pchar datapoints pchar best fit (R 2 = 0.93) flamechar datapoints flamechar best fit (R 2 = 0.94) C pchar = Mbps C flamechar = Mbps Size of the probe traffic (bytes) Size of the probe traffic (bytes) (c) Link 2, Topology (d) Link 2, Topology M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
25 Conclusions Conclusions Future work Questions? FLAME provides the following contributions an environment for the rapid prototyping of active measurement tools based on a small but comprehensive set of probing primitives, allowing the implementation of tools that depend or not on cooperative destination nodes; a centralized repository for implicitly gathering measurement results in a common data format, encouraging the untangling of probing and data output functionality and easing the process of further analysis and comparison among different result datasets. M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
26 Conclusions Conclusions Future work Questions? Possible uses of FLAME prototyping besides rapid prototyping of new active measurement techniques... fair comparison among different measurement techniques easier combination of results from different tools easier tailoring of FLAME-based prototypes M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
27 Future work Conclusions Future work Questions? It s an ongoing work! Future work 1 dynamic selection of available agents 2 enrichment of the measurement toolkit with usual active measurement tools Application in other contexts porting measurement agents to resource-constrained devices taking benefit of Lua s low memory footprint M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
28 That s all, folks! Conclusions Future work Questions? Interested? Give FLAME a try! FLAME code is available at Contact Marcos Kirszenblatt: marcoslk@lncc.br Thiago Cardozo: thiagoc@lncc.br Artur Ziviani: ziviani@lncc.br Antônio Tadeu Azevedo Gomes: atagomes@lncc.br M. L. Kirszenblatt et al. STIC-AmSud Project Meeting Dec /28
cs/ee/ids 143 Communication Networks
cs/ee/ids 143 Communication Networks Chapter 4 Transport Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Agenda Internetworking n Routing across LANs, layer2-layer3 n DHCP n NAT Transport layer
More informationThese are special traffic patterns that create more stress on a switch
Myths about Microbursts What are Microbursts? Microbursts are traffic patterns where traffic arrives in small bursts. While almost all network traffic is bursty to some extent, storage traffic usually
More informationFraud within Asymmetric Multi-Hop Cellular Networks
Financial Cryptography 2005 EPFL, Lausanne, Switzerland ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE Wireless networks Single-hop cellular network Multi-hop network Multi-hop cellular network Asymmetric multi-hop
More informationEfficient Network-wide Available Bandwidth Estimation through Active Learning and Belief Propagation
Efficient Network-wide Available Bandwidth Estimation through Active Learning and Belief Propagation mark.coates@mcgill.ca McGill University Department of Electrical and Computer Engineering Montreal,
More informationCSE 123: Computer Networks
CSE 123: Computer Networks Total points: 40 Homework 1 - Solutions Out: 10/4, Due: 10/11 Solutions 1. Two-dimensional parity Given below is a series of 7 7-bit items of data, with an additional bit each
More informationSocket Programming. Daniel Zappala. CS 360 Internet Programming Brigham Young University
Socket Programming Daniel Zappala CS 360 Internet Programming Brigham Young University Sockets, Addresses, Ports Clients and Servers 3/33 clients request a service from a server using a protocol need an
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 informationE8 TCP. Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione
E8 TP Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione Exercises o onsider the connection in the figure A =80 kbit/s τ =0 ms R =? τ =? B o o o Host A wants to know the capacity
More informationMin Congestion Control for High- Speed Heterogeneous Networks. JetMax: Scalable Max-Min
JetMax: Scalable Max-Min Min Congestion Control for High- Speed Heterogeneous Networks Yueping Zhang Joint work with Derek Leonard and Dmitri Loguinov Internet Research Lab Department of Computer Science
More informationTelecommunication Services Engineering (TSE) Lab. Chapter IX Presence Applications and Services.
Chapter IX Presence Applications and Services http://users.encs.concordia.ca/~glitho/ Outline 1. Basics 2. Interoperability 3. Presence service in clouds Basics 1 - IETF abstract model 2 - An example of
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 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 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 informationA Mathematical Model of the Skype VoIP Congestion Control Algorithm
A Mathematical Model of the Skype VoIP Congestion Control Algorithm Luca De Cicco, S. Mascolo, V. Palmisano Dipartimento di Elettrotecnica ed Elettronica, Politecnico di Bari 47th IEEE Conference on Decision
More informationIntroduction to Portal for ArcGIS
Introduction to Portal for ArcGIS Derek Law Product Management March 10 th, 2015 Esri Developer Summit 2015 Agenda Web GIS pattern Product overview Installation and deployment Security and groups Configuration
More informationTCP over Cognitive Radio Channels
1/43 TCP over Cognitive Radio Channels Sudheer Poojary Department of ECE, Indian Institute of Science, Bangalore IEEE-IISc I-YES seminar 19 May 2016 2/43 Acknowledgments The work presented here was done
More informationA Different Kind of Flow Analysis. David M Nicol University of Illinois at Urbana-Champaign
A Different Kind of Flow Analysis David M Nicol University of Illinois at Urbana-Champaign 2 What Am I Doing Here??? Invite for ICASE Reunion Did research on Peformance Analysis Supporting Supercomputing
More informationUtility Maximizing Routing to Data Centers
0-0 Utility Maximizing Routing to Data Centers M. Sarwat, J. Shin and S. Kapoor (Presented by J. Shin) Sep 26, 2011 Sep 26, 2011 1 Outline 1. Problem Definition - Data Center Allocation 2. How to construct
More informationunderstanding of these differences is the focus of this research. and thus this characterization is crucial to evolving this research field.
Abstract Tactical networks, networks designed to facilitate command and control capabilities for militaries, have key attributes that differ from the Internet. Characterizing, modeling, and exploiting
More informationIntroduction to Portal for ArcGIS. Hao LEE November 12, 2015
Introduction to Portal for ArcGIS Hao LEE November 12, 2015 Agenda Web GIS pattern Product overview Installation and deployment Security and groups Configuration options Portal for ArcGIS + ArcGIS for
More informationNICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1
NICTA Short Course Network Analysis Vijay Sivaraman Day 1 Queueing Systems and Markov Chains Network Analysis, 2008s2 1-1 Outline Why a short course on mathematical analysis? Limited current course offering
More informationLan 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 informationNetwork Configuration Example
Network Configuration Example Validated Reference - Business Edge Solution - Device PE-6 Release 1.0 Published: 2014-03-31 Juniper Networks, Inc. 1194 North Mathilda Avenue Sunnyvale, California 94089
More informationComputer Science Introductory Course MSc - Introduction to Java
Computer Science Introductory Course MSc - Introduction to Java Lecture 1: Diving into java Pablo Oliveira ENST Outline 1 Introduction 2 Primitive types 3 Operators 4 5 Control Flow
More informationA Case for Performance-Centric Network Allocation
A Case for Performance-Centric Network Allocation Gautam Kumar, Mosharaf Chowdhury, Sylvia Ratnasamy, Ion Stoica UC Berkeley Datacenter Applications 3 Data Parallelism Applications execute in several computation
More informationCompiling Techniques
Lecture 11: Introduction to 13 November 2015 Table of contents 1 Introduction Overview The Backend The Big Picture 2 Code Shape Overview Introduction Overview The Backend The Big Picture Source code FrontEnd
More informationThe Analysis of Microburst (Burstiness) on Virtual Switch
The Analysis of Microburst (Burstiness) on Virtual Switch Chunghan Lee Fujitsu Laboratories 09.19.2016 Copyright 2016 FUJITSU LABORATORIES LIMITED Background What is Network Function Virtualization (NFV)?
More informationModel-based Prototyping of an Interoperability Protocol for Mobile Ad-hoc Networks
Model-based Prototyping of an Interoperability Protocol for Mobile Ad-hoc Networks L. M. Kristensen, M. Westergaard, and P. C. Nørgaard 2 Department of Computer Science, University of Aarhus, IT-parken,
More informationRouting. Topics: 6.976/ESD.937 1
Routing Topics: Definition Architecture for routing data plane algorithm Current routing algorithm control plane algorithm Optimal routing algorithm known algorithms and implementation issues new solution
More informationSDS developer guide. Develop distributed and parallel applications in Java. Nathanaël Cottin. version
SDS developer guide Develop distributed and parallel applications in Java Nathanaël Cottin sds@ncottin.net http://sds.ncottin.net version 0.0.3 Copyright 2007 - Nathanaël Cottin Permission is granted to
More informationTSCCLOCK: A LOW COST, ROBUST, ACCURATE SOFTWARE CLOCK FOR NETWORKED COMPUTERS
TSCCLOCK: A LOW COST, ROBUST, ACCURATE SOFTWARE CLOCK FOR NETWORKED COMPUTERS Darryl Veitch d.veitch@ee.unimelb.edu.au http://www.cubinlab.ee.unimelb.edu.au/ darryl Collaboration with Julien Ridoux CUBIN,
More informationArcGIS Earth for Enterprises DARRON PUSTAM ARCGIS EARTH CHRIS ANDREWS 3D
ArcGIS Earth for Enterprises DARRON PUSTAM ARCGIS EARTH CHRIS ANDREWS 3D ArcGIS Earth is ArcGIS Earth is a lightweight globe desktop application that helps you explore any part of the world and investigate
More informationCS276 Homework 1: ns-2
CS276 Homework 1: ns-2 Erik Peterson October 28, 2006 1 Part 1 - Fairness between TCP variants 1.1 Method After learning ns-2, I wrote a script (Listing 3) that runs a simulation of one or two tcp flows
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 informationWiFi MAC Models David Malone
WiFi MAC Models David Malone November 26, MACSI Hamilton Institute, NUIM, Ireland Talk outline Introducing the 82.11 CSMA/CA MAC. Finite load 82.11 model and its predictions. Issues with standard 82.11,
More information6.852: Distributed Algorithms Fall, Class 10
6.852: Distributed Algorithms Fall, 2009 Class 10 Today s plan Simulating synchronous algorithms in asynchronous networks Synchronizers Lower bound for global synchronization Reading: Chapter 16 Next:
More informationSPLITTING AND MERGING OF PACKET TRAFFIC: MEASUREMENT AND MODELLING
SPLITTING AND MERGING OF PACKET TRAFFIC: MEASUREMENT AND MODELLING Nicolas Hohn 1 Darryl Veitch 1 Tao Ye 2 1 CUBIN, Department of Electrical & Electronic Engineering University of Melbourne, Vic 3010 Australia
More informationDiscrete-event simulations
Discrete-event simulations Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Why do we need simulations? Step-by-step simulations; Classifications;
More informationPortal for ArcGIS: An Introduction
Portal for ArcGIS: An Introduction Derek Law Esri Product Management Esri UC 2014 Technical Workshop Agenda Web GIS pattern Product overview Installation and deployment Security and groups Configuration
More informationPortal for ArcGIS: An Introduction. Catherine Hynes and Derek Law
Portal for ArcGIS: An Introduction Catherine Hynes and Derek Law Agenda Web GIS pattern Product overview Installation and deployment Configuration options Security options and groups Portal for ArcGIS
More informationCorrelating the Perceived Quality of Networked Games to Broadband Cable Network Design Parameters. Project Update: 7/20/2011
Correlating the Perceived Quality of Networked Games to Broadband Cable Network Design Parameters Project Update: 7/20/2011 Networking Team: Rahul Amin, Jim Martin School of Computing HCI Team: Dr Juan
More informationConcise Paper: Deconstructing MPTCP Performance
04 IEEE nd International Conference on Network Protocols Concise Paper: Deconstructing MPTCP Performance Behnaz Arzani, Alexander Gurney, Sitian Cheng, Roch Guerin and Boon Thau Loo University Of Pennsylvania
More informationI N T R O D U C T I O N : G R O W I N G I T C O M P L E X I T Y
Global Headquarters: 5 Speen Street Framingham, MA 01701 USA P.508.872.8200 F.508.935.4015 www.idc.com W H I T E P A P E R I n v a r i a n t A n a l y z e r : A n A u t o m a t e d A p p r o a c h t o
More information1 Reed Solomon Decoder Final Project. Group 3 Abhinav Agarwal S Branavan Grant Elliott. 14 th May 2007
1 Reed Solomon Decoder 6.375 Final Project Group 3 Abhinav Agarwal S Branavan Grant Elliott 14 th May 2007 2 Outline Error Correcting Codes Mathematical Foundation of Reed Solomon Codes Decoder Architecture
More informationLeveraging Web GIS: An Introduction to the ArcGIS portal
Leveraging Web GIS: An Introduction to the ArcGIS portal Derek Law Product Management DLaw@esri.com Agenda Web GIS pattern Product overview Installation and deployment Configuration options Security options
More informationProcessor Sharing Flows in the Internet
STANFORD HPNG TECHNICAL REPORT TR4-HPNG4 Processor Sharing Flows in the Internet Nandita Dukkipati, Nick McKeown Computer Systems Laboratory Stanford University Stanford, CA 9434-93, USA nanditad, nickm
More informationNCU EE -- DSP VLSI Design. Tsung-Han Tsai 1
NCU EE -- DSP VLSI Design. Tsung-Han Tsai 1 Multi-processor vs. Multi-computer architecture µp vs. DSP RISC vs. DSP RISC Reduced-instruction-set Register-to-register operation Higher throughput by using
More informationConcepts for Wireless Ad Hoc
Bandwdth and Avalable Bandwdth oncepts for Wreless Ad Hoc Networks Marco A. Alzate Unversdad Dstrtal, Bogotá Néstor M. Peña Unversdad de los Andes, Bogotá Mguel A. abrador Unversty of South Florda, Tampa
More informationFormal Verification of Mobile Network Protocols
Dipartimento di Informatica, Università di Pisa, Italy milazzo@di.unipi.it Pisa April 26, 2005 Introduction Modelling Systems Specifications Examples Algorithms Introduction Design validation ensuring
More informationCooperative HARQ with Poisson Interference and Opportunistic Routing
Cooperative HARQ with Poisson Interference and Opportunistic Routing Amogh Rajanna & Mostafa Kaveh Department of Electrical and Computer Engineering University of Minnesota, Minneapolis, MN USA. Outline
More informationMulticast-Based Inference of Network-Internal Delay Distributions
Multicast-Based Inference of Network-Internal Delay Distributions F Lo Presti NG Duffield J Horowitz D Towsley AT&T Labs Research Dept Math & Statistics Dept of Computer Science 18 Park Avenue University
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 informationBRISK: A Portable and Flexible Distributed Instrumentation System Λ
BRISK: A Portable and Flexible Distributed Instrumentation System Λ Aleksandar M Bakić, Matt W Mutka Michigan State University Department of Computer Science and Engineering 3115 Engineering Building East
More informationOne Optimized I/O Configuration per HPC Application
One Optimized I/O Configuration per HPC Application Leveraging I/O Configurability of Amazon EC2 Cloud Mingliang Liu, Jidong Zhai, Yan Zhai Tsinghua University Xiaosong Ma North Carolina State University
More informationCongestion Control. Topics
Congestion Control Topics Congestion control what & why? Current congestion control algorithms TCP and UDP Ideal congestion control Resource allocation Distributed algorithms Relation current algorithms
More informationAgreement. Today. l Coordination and agreement in group communication. l Consensus
Agreement Today l Coordination and agreement in group communication l Consensus Events and process states " A distributed system a collection P of N singlethreaded processes w/o shared memory Each process
More information4th year Project demo presentation
4th year Project demo presentation Colm Ó héigeartaigh CASE4-99387212 coheig-case4@computing.dcu.ie 4th year Project demo presentation p. 1/23 Table of Contents An Introduction to Quantum Computing The
More informationScripting Languages Fast development, extensible programs
Scripting Languages Fast development, extensible programs Devert Alexandre School of Software Engineering of USTC November 30, 2012 Slide 1/60 Table of Contents 1 Introduction 2 Dynamic languages A Python
More informationEnd-to-end Estimation of the Available Bandwidth Variation Range
1 End-to-end Estimation of the Available Bandwidth Variation Range Manish Jain Georgia Tech jain@cc.gatech.edu Constantinos Dovrolis Georgia Tech dovrolis@cc.gatech.edu Abstract The available bandwidth
More informationDetecting Wormhole Attacks in Wireless Networks Using Local Neighborhood Information
Detecting Wormhole Attacks in Wireless Networks Using Local Neighborhood Information W. Znaidi M. Minier and JP. Babau Centre d'innovations en Télécommunication & Intégration de services wassim.znaidi@insa-lyon.fr
More informationConnectivity in the LAC region
Cristián Varas, Speedchecker Ltd. Agustín Formoso, Lacnic Labs Connectivity in the LAC region A study made by LACNIC Labs and Speedchecker Ltd. Outline The challenge of measuring regions not well covered
More informationTWO PROBLEMS IN NETWORK PROBING
TWO PROBLEMS IN NETWORK PROBING DARRYL VEITCH The University of Melbourne 1 Temporal Loss and Delay Tomography 2 Optimal Probing in Convex Networks Paris Networking 27 Juin 2007 TEMPORAL LOSS AND DELAY
More informationThe processing and interpretation of communication network performance data
Loughborough University Institutional Repository The processing and interpretation of communication network performance data This item was submitted to Loughborough University's Institutional Repository
More informationReliable Data Transport: Sliding Windows
Reliable Data Transport: Sliding Windows 6.02 Fall 2013 Lecture 23 Exclusive! A Brief History of the Internet guest lecture by Prof. Hari Balakrishnan Wenesday December 4, 2013, usual 6.02 lecture time
More informationA Reconfigurable Quantum Computer
A Reconfigurable Quantum Computer David Moehring CEO, IonQ, Inc. College Park, MD Quantum Computing for Business 4-6 December 2017, Mountain View, CA IonQ Highlights Full Stack Quantum Computing Company
More informationPerformance Evaluation. On optimal monitor placement for localizing node failures via network tomography
Performance Evaluation ( ) Contents lists available at ScienceDirect Performance Evaluation journal homepage: www.elsevier.com/locate/peva On optimal monitor placement for localizing node failures via
More informationEP2200 Course Project 2017 Project II - Mobile Computation Offloading
EP2200 Course Project 2017 Project II - Mobile Computation Offloading 1 Introduction Queuing theory provides us a very useful mathematic tool that can be used to analytically evaluate the performance of
More information10:00 12:30. Do not open this problem booklet until the start of the examination is announced.
0 I 19 8 1 10:00 1:30 (1),. Do not open this problem booklet until the start of the examination is announced. () 4.. Answer the following 4 problems. Use the designated answer sheet for each problem. (3).
More informationAn Admission Control Mechanism for Providing Service Differentiation in Optical Burst-Switching Networks
An Admission Control Mechanism for Providing Service Differentiation in Optical Burst-Switching Networks Igor M. Moraes, Daniel de O. Cunha, Marco D. D. Bicudo, Rafael P. Laufer, and Otto Carlos M. B.
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 informationArcGIS Deployment Pattern. Azlina Mahad
ArcGIS Deployment Pattern Azlina Mahad Agenda Deployment Options Cloud Portal ArcGIS Server Data Publication Mobile System Management Desktop Web Device ArcGIS An Integrated Web GIS Platform Portal Providing
More informationCeilbot navigation functions
Vito Pizzolato Ceilbot navigation functions School of Computer Engineering Department of Computer Science and Engineering Espoo, August 3, 2011 Instructor: David Leal-Martinez Aalto University School of
More informationDistributed Computing. Synchronization. Dr. Yingwu Zhu
Distributed Computing Synchronization Dr. Yingwu Zhu Topics to Discuss Physical Clocks Logical Clocks: Lamport Clocks Classic paper: Time, Clocks, and the Ordering of Events in a Distributed System Lamport
More informationBuilding a Multi-FPGA Virtualized Restricted Boltzmann Machine Architecture Using Embedded MPI
Building a Multi-FPGA Virtualized Restricted Boltzmann Machine Architecture Using Embedded MPI Charles Lo and Paul Chow {locharl1, pc}@eecg.toronto.edu Department of Electrical and Computer Engineering
More informationINF 5860 Machine learning for image classification. Lecture 5 : Introduction to TensorFlow Tollef Jahren February 14, 2018
INF 5860 Machine learning for image classification Lecture 5 : Introduction to TensorFlow Tollef Jahren February 14, 2018 OUTLINE Deep learning frameworks TensorFlow TensorFlow graphs TensorFlow session
More informationRouting Algorithms. CS60002: Distributed Systems. Pallab Dasgupta Dept. of Computer Sc. & Engg., Indian Institute of Technology Kharagpur
Routing Algorithms CS60002: Distributed Systems Pallab Dasgupta Dept. of Computer Sc. & Engg., Indian Institute of Technology Kharagpur Main Features Table Computation The routing tables must be computed
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 informationCHAPTER 3 MATHEMATICAL AND SIMULATION TOOLS FOR MANET ANALYSIS
44 CHAPTER 3 MATHEMATICAL AND SIMULATION TOOLS FOR MANET ANALYSIS 3.1 INTRODUCTION MANET analysis is a multidimensional affair. Many tools of mathematics are used in the analysis. Among them, the prime
More informationPARASITIC COMPUTING: PROBLEMS AND ETHICAL
ISSN 2320-9194 8 International Journal of Advance Research, IJOAR.org Volume 1, Issue 11, November 2013, Online: ISSN 2320-9194 PARASITIC COMPUTING: PROBLEMS AND ETHICAL CONSIDERATION Abstract Parasitic
More informationCongestion Control. Need to understand: What is congestion? How do we prevent or manage it?
Congestion Control Phenomenon: when too much traffic enters into system, performance degrades excessive traffic can cause congestion Problem: regulate traffic influx such that congestion does not occur
More informationMPTCP is not Pareto-Optimal: Performance Issues and a Possible Solution
MPTCP is not Pareto-Optimal: Performance Issues and a Possible Solution Ramin Khalili, Nicolas Gast, Miroslav Popovic, Jean-Yves Le Boudec To cite this version: Ramin Khalili, Nicolas Gast, Miroslav Popovic,
More informationInformation in Aloha Networks
Achieving Proportional Fairness using Local Information in Aloha Networks Koushik Kar, Saswati Sarkar, Leandros Tassiulas Abstract We address the problem of attaining proportionally fair rates using Aloha
More informationTensorFlow. Dan Evans
TensorFlow Presentation references material from https://www.tensorflow.org/get_started/get_started and Data Science From Scratch by Joel Grus, 25, O Reilly, Ch. 8 Dan Evans TensorFlow www.tensorflow.org
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 informationBroadband Internet Access Disclosure
Broadband Internet Access Disclosure This document provides information about the network practices, performance characteristics, and commercial terms applicable broadband Internet access services provided
More informationIntegrated Electricity Demand and Price Forecasting
Integrated Electricity Demand and Price Forecasting Create and Evaluate Forecasting Models The many interrelated factors which influence demand for electricity cannot be directly modeled by closed-form
More informationMathematical Analysis of IEEE Energy Efficiency
Information Engineering Department University of Padova Mathematical Analysis of IEEE 802.11 Energy Efficiency A. Zanella and F. De Pellegrini IEEE WPMC 2004 Padova, Sept. 12 15, 2004 A. Zanella and F.
More informationEstimation of DNS Source and Cache Dynamics under Interval-Censored Age Sampling
Estimation of DNS Source and Cache Dynamics under Interval-Censored Age Sampling Di Xiao, Xiaoyong Li, Daren B.H. Cline, Dmitri Loguinov Internet Research Lab Department of Computer Science and Engineering
More informationWorst-case delay control in multigroup overlay networks. Tu, Wanqing; Sreenan, Cormac J.; Jia, Weijia. Article (peer-reviewed)
Title Author(s) Worst-case delay control in multigroup overlay networks Tu, Wanqing; Sreenan, Cormac J.; Jia, Weijia Publication date 2007-0 Original citation Type of publication Link to publisher's version
More informationNew Mexico Tech Hyd 510
Vectors vector - has magnitude and direction (e.g. velocity, specific discharge, hydraulic gradient) scalar - has magnitude only (e.g. porosity, specific yield, storage coefficient) unit vector - a unit
More informationEstimation of clock offset from one-way delay measurement on asymmetric paths
Estimation of clock offset from one-way delay measurement on asymmetric paths Masato TSURU 1, Tetsuya TAKINE 2 and Yuji OIE 3 1 Telecommunications Advancement Organization of Japan. 2 Graduate School of
More informationECEN 651: Microprogrammed Control of Digital Systems Department of Electrical and Computer Engineering Texas A&M University
ECEN 651: Microprogrammed Control of Digital Systems Department of Electrical and Computer Engineering Texas A&M University Prof. Mi Lu TA: Ehsan Rohani Laboratory Exercise #4 MIPS Assembly and Simulation
More informationArcGIS Enterprise: What s New. Philip Heede Shannon Kalisky Melanie Summers Sam Williamson
ArcGIS Enterprise: What s New Philip Heede Shannon Kalisky Melanie Summers Sam Williamson ArcGIS Enterprise is the new name for ArcGIS for Server What is ArcGIS Enterprise ArcGIS Enterprise is powerful
More informationExperimental evaluation of DDoS detection and prevention using opensource and commodity hardware
Experimental evaluation of DDoS detection and prevention using opensource and commodity hardware Meklit Elfiyos Dekita Master of Science in Telematics - Communication Networks and Networked Submission
More informationProgram Performance Metrics
Program Performance Metrics he parallel run time (par) is the time from the moment when computation starts to the moment when the last processor finished his execution he speedup (S) is defined as the
More informationImpression Store: Compressive Sensing-based Storage for. Big Data Analytics
Impression Store: Compressive Sensing-based Storage for Big Data Analytics Jiaxing Zhang, Ying Yan, Liang Jeff Chen, Minjie Wang, Thomas Moscibroda & Zheng Zhang Microsoft Research The Curse of O(N) in
More informationIntegrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks
VANET Analysis Integrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks Tom Hao Luan, Xuemin (Sherman) Shen, and Fan Bai BBCR, ECE, University of Waterloo, Waterloo, Ontario, N2L 3G1,
More informationExisting Open Source Tools and Possibilities for Cadastre Systems
Existing Open Source Tools and Possibilities for Cadastre Systems Gertrude Pieper Espada FIG Congress Sydney, 11-16 April 2010 What is FLOSS? What is open source? What open source software tools are available?
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 informationContinuous-time hidden Markov models for network performance evaluation
Performance Evaluation 49 (2002) 129 146 Continuous-time hidden Markov models for network performance evaluation Wei Wei, Bing Wang, Don Towsley Department of Computer Science, University of Massachusetts,
More information