N 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
|
|
- David Fleming
- 6 years ago
- Views:
Transcription
1 UI 5 thernet s onna arren
2 opics for this Unit thernet History ypical network components functionality versus technologies and specifications he advantages and disadvantages of thernet technology in s dvantages of using ayer 2 devices to segment s ools to roubleshoot wired s onna arren
3 Introduction to thernet onna arren
4 etwork rchitectures thernet oken ing FI (Fiber istributed ata Interface) ireless onna arren
5 hared ccess etworks hared ccess etworks assume multiple nodes on the same physical link Bus, ring and wireless structures ransmission sent by one node is received by all others o intermediate switches eed methods for moderating access (M protocols) Fairness erformance onna arren
6 Multiple ccess Methods Fixed assignment artition the channel so each node gets a slice of the bandwidth ssentially circuit switching thus inefficient xamples: M, FM, M (all used in wireless/cellular environments) ontention-based odes contends equally for bandwidth and recover from collisions such as thernet oken-based or reservation-based ake turns using the channel such as token ring onna arren
7 History thernet eveloped by Bob Metcalfe and others at Xerox in mid-1970s tandardized by Xerox,, and Intel in 1978 standards define M and physical layer connectivity I (M/ - thernet) I 802.3u- 100Mbps I 802.3z - 1,000Mbps onna arren
8 thernet tandard hysical ayer standard defines both M and physical layer details he picture below is Metcalfe s original sketch. onna arren
9 ireless thernet onna arren
10 Informal thernet ames peed Informal ame 10 Mbps thernet 100 Mbps Fast thernet Fast ther common informal names 1 Gbps Gigabit thernet Gig, 1 Gb 10 Gbps 10 Gig 10 Gb 40 Gbps 40 Gig 40 Gb 100 Gbps 100 Gig 100 Gb onna arren
11 M/ M/ - thernet s Media ccess ontrol (M) = carrier sense M = multiple access = collision detection end only if medium is idle top sending immediately if collision is detected onna arren
12 ollision omains onna arren
13 ypical thernet onna arren
14 tate iagram for M/ acket? ense arrier end o etect ollision iscard acket attempts < 16 attempts == 16 Yes Jam channel b=alcbackoff(); wait(b); attempts++; onna arren
15 ollision etection/backoff rocess onna arren
16 M lgorithm enders handle all access control eceivers simply read frames with acceptable address ddress to host ddress to broadcast ddress to multicast to which host belongs ll frames if host is in promiscuous mode onna arren
17 thernet and the I Model onna arren
18 ayered ata ncapsulation onna arren
19 thernet and the I Model onna arren
20 M aming onna arren
21 Frame ata ncapsulation ach layer of the I model can add a header and/or trailer to the message onna arren
22 ayer 2 Framing onna arren
23 thernet Frame tructure onna arren
24 thernet rrors ollision or runt - imultaneous transmission occurring before slot time has elapsed ate collision - imultaneous transmission occurring after slot time has elapsed Jabber, long frame and range errors - transmission >1504 bytes hort frame, collision fragment or runt - transmission < 64 bytes F / error - orrupted transmission lignment error - Insufficient or excessive number of bits transmitted ange error - ctual and reported number of octets in frame do not match (length field) Ghost or jabber - Unusually long reamble or Jam event onna arren
25 uplex ort onfiguration uplex must be the same on both ends of the cable Full / half mismatch won t work Full / auto negotiate auto side defaults to half - mismatch Half / auto negotiate auto defaults to half works uto negotiate / auto negotiate depends on cables (eg. GB defaults to full and 100Mbps defaults to half) onna arren
26 peed ort onfiguration ifferent speeds mismatch peed / auto will revert to lowest speed mismatch if different uto / auto each reverts to lowest speed mismatch if different onna arren
27 ypes of witching ymmetric applies the same amount of bandwidth to each active port symmetric can provide variable amounts of bandwidth to each port to do better load balancing ort based memory buffers - use memory tied to port (slower) hares memory buffers only requires a single queue so faster onna arren
28 witched thernet he advantage the backplane is able to repeat more than one frame in parallel because there is a separate backplane bus line for each node he frame is relayed onto the required output port via the port s own backplane bus line hile collisions are still possible when two concurrently arriving frames are destined for the same station, the probability is approaching zero ach parallel transmission can take place at the switch s maximum speed onna arren
29 witching onna arren
30 witch Broadcast onna arren
31 /I roubleshooting ools onna arren
32 Internet ontrol Message rotocol IM (Internet ontrol Message rotocol) - reports messages and errors regarding data delivery (eg. Used by ping) estination Unreachable (ime to ive) ource Quench - input buffers full edirect cho and cho eply onna arren
33 arp arp (ddress resolution protocol) - displays I address mapped to M addresses :\> arp -a Interface: on Interface 2 Internet ddress hysical ddress ype e0-f ca dynamic Interface - the I address the machine where arp -a was executed Interface 2 indicates that this is only one of the interfaces on this computer onna arren
34 ipconfig ipconfig - display s the computer s I configuration :\> ipconfig /all thernet adapter 100B1: escription : Intel therxpress /100B I dapter hysical ddress..... : B0-57-4B-8 H nabled : Yes I ddress : ubnet Mask : efault Gateway.... : H erver : rimary I erver.. : econdary I erver. : ease btained.: hursday, January 14, :48:50 M ease xpires.: Friday, January 15, :48:50 M onna arren
35 ping ping (acket Internet Gopher) - used to test connectivity :\> ping inging with 32 bytes of data: eply from : bytes=32time<10ms =255 eply from : bytes=32time<10ms =255 eply from : bytes=32time<10ms =255 eply from : bytes=32time<10ms =255 onna arren
36 netstat netstat - isplays protocol statistics and current /I network connections onna arren
37 tracert racert traces the route to a destination address onna arren
38 ab 5 esearching tandards omparing M and I ddresses ractice using the following /I tools rp ping ipconfig tracert netstat roubleshooting research onna arren
UNIT 7. DHCP, DNS and Disaster Recovery
UI 7 H, and isaster ecovery onna arren esigning a ampus etwork onna arren etwork onfiguration in a ampus ore istribution ccess ore Backbone of the network ayer 3 switches and routers istribution point
More informationUNIT 4. Connecting to a Network & Sharing Resources
U 4 onnecting to a etwork & haring esources onna arren opics for this Unit ransmission ontrol Protocol (P)/ nternet Protocol (P) for wired and wireless networks he pen ystems nterconnection ti () model,
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 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 informationInstalling Windows Server 2012 r2 in VMware
nstalling indows erver r in Mware P P onna arren 5- Post-nstallation Tasks hile erver has been redesigned to allow most tasks to be completed remotely, there are tasks that must be performed directly from
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 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 informationChapter # 4: Programmable and Steering Logic
hapter # : Programmable and teering Logic ontemporary Logic esign Randy H. Katz University of alifornia, erkeley June 993 No. - PLs and PLs Pre-fabricated building block of many N/OR gates (or NOR, NN)
More informationModeling and Simulation NETW 707
Modeling and Simulation NETW 707 Lecture 6 ARQ Modeling: Modeling Error/Flow Control Course Instructor: Dr.-Ing. Maggie Mashaly maggie.ezzat@guc.edu.eg C3.220 1 Data Link Layer Data Link Layer provides
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 informationAnalysis of random-access MAC schemes
Analysis of random-access MA schemes M. Veeraraghavan and Tao i ast updated: Sept. 203. Slotted Aloha [4] First-order analysis: if we assume there are infinite number of nodes, the number of new arrivals
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 informationP300. Technical Manual
+ I/Os, solenoid drivers Technical Manual icasso venue, avis, C, US Tel: -- Fax: -- Email: sales@tern.com http://www.tern.com COYRIHT, i-engine, -Engine, R-Engine and CTF are trademarks of TERN, Inc. mes
More informationEDP-AM-DIO54 Digital IO Module User Manual. This document contains information on the DIO54 digital IO module for the RS EDP system.
P-M-IO igital IO Module User Manual This document contains information on the IO digital IO module for the RS P system. Version v.0, 0/0/00 P-M-IO Manual ontents. igital IO Module. igital Outputs.... Using
More informationGiuseppe Bianchi, Ilenia Tinnirello
Capacity of WLAN Networs Summary Per-node throughput in case of: Full connected networs each node sees all the others Generic networ topology not all nodes are visible Performance Analysis of single-hop
More informationCONTENTION RESOLUTION IN OPTICAL BURST SWITCHES USING FIBER DELAY LINE BUFFERS
Journal of Engineering Science and Technology Vol. 12, No. 2 (2017) 530-547 School of Engineering, Taylor s University CONTENTION RESOLUTION IN OPTICAL BURST SWITCHES USING FIBER DELAY LINE BUFFERS SHIVANGI
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 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 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 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 informationMobility Entropy and Message Routing in Community-Structured Delay Tolerant Networks
Mobility Entropy an Message Routing in Community-Structure Delay Tolerant Networks Hieya Ochiai Hiroshi Esaki The University of Tokyo / NICT Asia Future Internet (AsiaFI) 2009 12 th -16 th January 2009.
More informationESTIMATION OF THE BURST LENGTH IN OBS NETWORKS
ESTIMATION OF THE BURST LENGTH IN OBS NETWORKS Pallavi S. Department of CSE, Sathyabama University Chennai, Tamilnadu, India pallavi.das12@gmail.com M. Lakshmi Department of CSE, Sathyabama University
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 informationCoding for loss tolerant systems
Coding for loss tolerant systems Workshop APRETAF, 22 janvier 2009 Mathieu Cunche, Vincent Roca INRIA, équipe Planète INRIA Rhône-Alpes Mathieu Cunche, Vincent Roca The erasure channel Erasure codes Reed-Solomon
More informationStrong Performance Guarantees for Asynchronous Buffered Crossbar Schedulers
Strong Performance Guarantees for Asynchronous Buffered Crossbar Schedulers Jonathan Turner Washington University jon.turner@wustl.edu January 30, 2008 Abstract Crossbar-based switches are commonly used
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 informationDistributed Systems Principles and Paradigms. Chapter 06: Synchronization
Distributed Systems Principles and Paradigms Maarten van Steen VU Amsterdam, Dept. Computer Science Room R4.20, steen@cs.vu.nl Chapter 06: Synchronization Version: November 16, 2009 2 / 39 Contents Chapter
More informationElectrical Engineering Written PhD Qualifier Exam Spring 2014
Electrical Engineering Written PhD Qualifier Exam Spring 2014 Friday, February 7 th 2014 Please do not write your name on this page or any other page you submit with your work. Instead use the student
More informationBurst Scheduling Based on Time-slotting and Fragmentation in WDM Optical Burst Switched Networks
Burst Scheduling Based on Time-slotting and Fragmentation in WDM Optical Burst Switched Networks G. Mohan, M. Ashish, and K. Akash Department of Electrical and Computer Engineering National University
More informationDistributed Systems Principles and Paradigms
Distributed Systems Principles and Paradigms Chapter 6 (version April 7, 28) Maarten van Steen Vrije Universiteit Amsterdam, Faculty of Science Dept. Mathematics and Computer Science Room R4.2. Tel: (2)
More informationChapter # 4: Programmable and Steering Logic
hapter Overview PLs and PLs hapter # : Programmable and teering Logic Non-Gate Logic witch Logic Multiplexers/electers and ecoders Tri-tate Gates/Open ollector Gates ROM ombinational Logic esign Problems
More informationData Structures and Algorithms CMPSC 465
ata Structures and Algorithms MPS LTUR ellman-ford Shortest Paths Algorithm etecting Negative ost ycles Adam Smith // A. Smith; based on slides by K. Wayne,. Leiserson,. emaine L. Negative Weight dges
More informationDynamic Silicon Firewall
Dynamic Silicon Firewall A Thesis Submitted to the College of Graduate Studies and Research in Partial Fulfillment of the Requirements for the degree of Master of Science in the Department of Electrical
More informationLecture 15: Remote Monitoring (RMON)
Lecture 15: Remote Monitoring (RMON) Prof. Shervin Shirmohammadi SITE, University of Ottawa Prof. Shervin Shirmohammadi CEG 4395 15-1 RMON Remote Network Monitoring (RMON): monitoring the state of a network
More informationGiuseppe Bianchi, Ilenia Tinnirello
Capacity of WLAN Networs Summary Ł Ł Ł Ł Arbitrary networ capacity [Gupta & Kumar The Capacity of Wireless Networs ] Ł! Ł "! Receiver Model Ł Ł # Ł $%&% Ł $% '( * &%* r (1+ r Ł + 1 / n 1 / n log n Area
More informationPerformance analysis of IEEE WLANs with saturated and unsaturated sources
Performance analysis of IEEE 82.11 WLANs with saturated and unsaturated sources Suong H. Nguyen, Hai L. Vu, Lachlan L. H. Andrew Centre for Advanced Internet Architectures, Technical Report 11811A Swinburne
More informationService differentiation without prioritization in IEEE WLANs
Service differentiation without prioritization in IEEE 8. WLANs Suong H. Nguyen, Student Member, IEEE, Hai L. Vu, Senior Member, IEEE, and Lachlan L. H. Andrew, Senior Member, IEEE Abstract Wireless LANs
More informationNOTE: Opening and Closing Reports must be enabled. See CL 2C Digit Positions 1 and 3 for additional information.
SYSTM 6 Installation Manual L - 8 & - 68 ommand Location : Installer ombination igit Positions () - (6): Installer ombination ombination must have 6 digits. Valid entries are - 9. ommand Location - 8 and
More informationMotors Automation Energy Transmission & Distribution Coatings. Servo Drive SCA06 V1.5X. Addendum to the Programming Manual SCA06 V1.
Motors Automation Energy Transmission & Distribution Coatings Servo Drive SCA06 V1.5X SCA06 V1.4X Series: SCA06 Language: English Document Number: 10003604017 / 01 Software Version: V1.5X Publication Date:
More informationAsymptotic Distortion Performance of Source-Channel Diversity Schemes over Relay Channels
Asymptotic istortion Performance of Source-Channel iversity Schemes over Relay Channels Karim G. Seddik 1, Andres Kwasinski 2, and K. J. Ray Liu 1 1 epartment of Electrical and Computer Engineering, 2
More informationComparison of Various Scheduling Techniques in OBS Networks
International Journal of Electronics and Communication Engineering. ISSN 0974-2166 Volume 5, Number 2 (2012), pp. 143-149 International Research Publication House http://www.irphouse.com Comparison of
More informationRandom Access Protocols ALOHA
Random Access Protocols ALOHA 1 ALOHA Invented by N. Abramson in 1970-Pure ALOHA Uncontrolled users (no coordination among users) Same packet (frame) size Instant feedback Large (~ infinite) population
More informationToday. Vector Clocks and Distributed Snapshots. Motivation: Distributed discussion board. Distributed discussion board. 1. Logical Time: Vector clocks
Vector Clocks and Distributed Snapshots Today. Logical Time: Vector clocks 2. Distributed lobal Snapshots CS 48: Distributed Systems Lecture 5 Kyle Jamieson 2 Motivation: Distributed discussion board Distributed
More informationModeling Approximations for an IEEE WLAN under Poisson MAC-Level Arrivals
Modeling Approximations for an IEEE 802.11 WLAN under Poisson MAC-Level Arrivals Ioannis Koukoutsidis 1 and Vasilios A. Siris 1,2 1 FORTH-ICS, P.O. Box 1385, 71110 Heraklion, Crete, Greece 2 Computer Science
More informationIEEE C /058r3
Project Title IEEE 802.16 Broadband Wireless Access Working Group MAC support and the general structure of the Coexistence Protocol messages Date Submitted 2006-07-13 Source(s)
More informationApproximate Fairness with Quantized Congestion Notification for Multi-tenanted Data Centers
Approximate Fairness with Quantized Congestion Notification for Multi-tenanted Data Centers Abdul Kabbani Stanford University Joint work with: Mohammad Alizadeh, Masato Yasuda, Rong Pan, and Balaji Prabhakar
More informationPerformance analysis of IEEE WLANs with saturated and unsaturated sources
1 Performance analysis of IEEE 8.11 WLANs with saturated and unsaturated sources Suong H. Nguyen, Student Member, IEEE, Hai L. Vu, Senior Member, IEEE, and Lachlan L. H. Andrew, Senior Member, IEEE Abstract
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 informationAn Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters
IEEE/ACM TRANSACTIONS ON NETWORKING An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters Mehrnoosh Shafiee, Student Member, IEEE, and Javad Ghaderi, Member, IEEE
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 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 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 informationStability Analysis in a Cognitive Radio System with Cooperative Beamforming
Stability Analysis in a Cognitive Radio System with Cooperative Beamforming Mohammed Karmoose 1 Ahmed Sultan 1 Moustafa Youseff 2 1 Electrical Engineering Dept, Alexandria University 2 E-JUST Agenda 1
More informationTechnion - Computer Science Department - Technical Report CS On Centralized Smooth Scheduling
On Centralized Smooth Scheduling Ami Litman January 25, 2005 Abstract Shiri Moran-Schein This paper studies evenly distributed sets of natural numbers and their applications to scheduling in a centralized
More informationIEEE abc-01/22r1
Project IEEE 802.16 Broadband Wireless Access Working Group Title An ARQ proposal for consideration by TG3/4 MAC group Date Submitted 2001-08 -31 Source(s) Yigal Leiba Itzik Kitroser
More informationThe impact of varying channel capacity on the quality of advanced data services in PCS networks
The impact of varying channel capacity on the quality of advanced data services in PCS networks Markus Fiedler Dept. of Telecommunications and Signal Processing, University of Karlskrona/Ronneby, S-371
More informationP e = 0.1. P e = 0.01
23 10 0 10-2 P e = 0.1 Deadline Failure Probability 10-4 10-6 10-8 P e = 0.01 10-10 P e = 0.001 10-12 10 11 12 13 14 15 16 Number of Slots in a Frame Fig. 10. The deadline failure probability as a function
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 informationSoftware Defined Radio A High Performance Challenge
Software efined adio A High Performance Challenge PFL, Lausanne, Switzerland, September 2006 Yuan Lin 1, Hyunseok Lee 1, Mark oh 1, Yoav Harel 1, Sangwon Seo 1, ob Mullenix 1 Scott Mahlke 1, Trevor Mudge
More information<Outline> JPEG 2000 Standard - Overview. Modes of current JPEG. JPEG Part I. JPEG 2000 Standard
JPEG 000 tandard - Overview Ping-ing Tsai, Ph.D. JPEG000 Background & Overview Part I JPEG000 oding ulti-omponent Transform Bit Plane oding (BP) Binary Arithmetic oding (BA) Bit-Rate ontrol odes
More informationPerformance Evaluation of Deadline Monotonic Policy over protocol
Performance Evaluation of Deadline Monotonic Policy over 80. protocol Ines El Korbi and Leila Azouz Saidane National School of Computer Science University of Manouba, 00 Tunisia Emails: ines.korbi@gmail.com
More informationA Data Communication Reliability and Trustability Study for Cluster Computing
A Data Communication Reliability and Trustability Study for Cluster Computing Speaker: Eduardo Colmenares Midwestern State University Wichita Falls, TX HPC Introduction Relevant to a variety of sciences,
More informationBackup and Restoration
UT Backup and estoration P P onna arren 5-1 ystem Backups All users can backup a file or directory if they have read permission hat hould be Backed Up? Always Critical files and folders ystem configuration
More informationConvolutional Coding LECTURE Overview
MIT 6.02 DRAFT Lecture Notes Spring 2010 (Last update: March 6, 2010) Comments, questions or bug reports? Please contact 6.02-staff@mit.edu LECTURE 8 Convolutional Coding This lecture introduces a powerful
More informationSources: The Data Compression Book, 2 nd Ed., Mark Nelson and Jean-Loup Gailly.
Lossless ompression Multimedia Systems (Module 2 Lesson 2) Summary: daptive oding daptive Huffman oding Sibling Property Update lgorithm rithmetic oding oding and ecoding Issues: OF problem, Zero frequency
More informationOutline Network structure and objectives Routing Routing protocol protocol System analysis Results Conclusion Slide 2
2007 Radio and Wireless Symposium 9 11 January 2007, Long Beach, CA. Lifetime-Aware Hierarchical Wireless Sensor Network Architecture with Mobile Overlays Maryam Soltan, Morteza Maleki, and Massoud Pedram
More informationPERFORMANCE ANALYSIS OF WIRELESS LANS: AN INTEGRATED PACKET/FLOW LEVEL APPROACH
PERFORMANCE ANALYSIS OF WIRELESS LANS: AN INTEGRATED PACKET/FLOW LEVEL APPROACH Remco Litjens 1,FrankRoijers, Hans van den Berg,, Richard J. Boucherie, and Maria Fleuren Knowledge Innovation Center, TNO
More informationPing Pong Protocol & Auto-compensation
Ping Pong Protocol & Auto-compensation Adam de la Zerda For QIP seminar Spring 2004 02.06.04 Outline Introduction to QKD protocols + motivation Ping-Pong protocol Security Analysis for Ping-Pong Protocol
More informationLecture 3: Superdense coding, quantum circuits, and partial measurements
CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 3: Superdense coding, quantum circuits, and partial measurements Superdense Coding January 4, 006 Imagine a situation where two
More informationMS BA Micro Altimeter Module
High resolution module, 20cm Fast conversion down to ms Low power, µa (standby < 0.5 µa) QFN package 5.0 x 3.0 x.0 mm 3 Supply voltage.8 to 3.6 V Integrated digital pressure sensor (24 bit Σ AC) Operating
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 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 informationOn queueing in coded networks queue size follows degrees of freedom
On queueing in coded networks queue size follows degrees of freedom Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard Laboratory for Information and Decision Systems, Massachusetts Institute of Technology,
More informationDownlink Traffic Scheduling in Green Vehicular Roadside Infrastructure
Downlink Traffic Scheduling in Green Vehicular Roadside Infrastructure Abdulla A. Hammad, Terence D. Todd, George Karakostas and Dongmei Zhao Department of Electrical and Computer Engineering McMaster
More informationPerformance Analysis of the IEEE e Block ACK Scheme in a Noisy Channel
Performance Analysis of the IEEE 802.11e Block ACK Scheme in a Noisy Channel Tianji Li, Qiang Ni, Hamilton Institute, NUIM, Ireland. Thierry Turletti, Planete Group, INRIA, France. Yang Xiao, University
More informationANALYSIS OF THE RTS/CTS MULTIPLE ACCESS SCHEME WITH CAPTURE EFFECT
ANALYSIS OF THE RTS/CTS MULTIPLE ACCESS SCHEME WITH CAPTURE EFFECT Chin Keong Ho Eindhoven University of Technology Eindhoven, The Netherlands Jean-Paul M. G. Linnartz Philips Research Laboratories Eindhoven,
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 informationSlides for Chapter 14: Time and Global States
Slides for Chapter 14: Time and Global States From Coulouris, Dollimore, Kindberg and Blair Distributed Systems: Concepts and Design Edition 5, Addison-Wesley 2012 Overview of Chapter Introduction Clocks,
More informationQuantum Teleportation Pt. 1
Quantum Teleportation Pt. 1 PHYS 500 - Southern Illinois University April 17, 2018 PHYS 500 - Southern Illinois University Quantum Teleportation Pt. 1 April 17, 2018 1 / 13 Types of Communication In the
More informationVFD- RoHS Compliant M0116MY-161LSBR2-1. User s Guide. (Vacuum Fluorescent Display Module) For product support, contact
User s Guide M0116MY-161LSBR2-1 VF- RoHS Compliant (Vacuum Fluorescent isplay Module) For product support, contact Newhaven isplay International 2511 Technology rive, #101 Elgin, IL 60124 Tel: (847) 844-8795
More informationThe Discrete EVent System specification (DEVS) formalism
The Discrete EVent System specification (DEVS) formalism Hans Vangheluwe The DEVS formalism was conceived by Zeigler [Zei84a, Zei84b] to provide a rigourous common basis for discrete-event modelling and
More informationDIFS DIFS DIFS DIFS DIFS DIFS. defer
A apacity Analysis for the I 802.11 MA Protocol Y.. Tay K.. hua National University of Singapore Abstract The recently proposed I 802.11 MA protocol provides shared access to a wireless channel. This paper
More informationMS BA01 Variometer Module, with LCP cap
High resolution module, 10 cm Fast conversion down to 1 ms Low power, 1 µa (standby < 0.15 µa) QFN package 5.0 x 3.0 x 1.7 mm 3 Supply voltage 1.8 to 3.6 V Integrated digital pressure sensor (24 bit ΔΣ
More informationAn Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters
An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters Mehrnoosh Shafiee, and Javad Ghaderi Electrical Engineering Department Columbia University arxiv:704.0857v
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 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 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 informationOptimal Association of Stations and APs in an IEEE WLAN
Optimal Association of Stations and APs in an IEEE 802. WLAN Anurag Kumar and Vinod Kumar Abstract We propose a maximum utility based formulation for the problem of optimal association of wireless stations
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 informationBINARY CODES. Binary Codes. Computer Mathematics I. Jiraporn Pooksook Department of Electrical and Computer Engineering Naresuan University
Binary Codes Computer Mathematics I Jiraporn Pooksook Department of Electrical and Computer Engineering Naresuan University BINARY CODES: BCD Binary Coded Decimal system is represented by a group of 4
More informationChapter 7: Digital Components. Oregon State University School of Electrical Engineering and Computer Science. Review basic digital design concepts:
hapter 7: igital omponents Prof. en Lee Oregon tate University chool of Electrical Engineering and omputer cience hapter Goals Review basic digital design concepts: esigning basic digital components using
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 informationDigital Integrated Circuits A Design Perspective
rithmetic ircuitsss dapted from hapter 11 of Digital Integrated ircuits Design Perspective Jan M. Rabaey et al. opyright 2003 Prentice Hall/Pearson 1 Generic Digital Processor MEMORY INPUT-OUTPUT ONTROL
More informationChapter 8. Low-Power VLSI Design Methodology
VLSI Design hapter 8 Low-Power VLSI Design Methodology Jin-Fu Li hapter 8 Low-Power VLSI Design Methodology Introduction Low-Power Gate-Level Design Low-Power Architecture-Level Design Algorithmic-Level
More informationProduct manual. Mylos KNX Shutter actuator 2CSY1104C/S
Product manual Mylos KNX Shutter actuator 2CSY1104C/S Contents Contents 1 Technical features... 3 1.1 Technical data... 3 1.2 Connection diagram... 4 2 Commissioning... 5 2.1 Parameters... 5 2.1.1 General...
More informationImmediate Detection of Predicates in Pervasive Environments
Immediate Detection of redicates in ervasive Environments Ajay Kshemkalyani University of Illinois at Chicago November 30, 2010 A. Kshemkalyani (U Illinois at Chicago) Immediate Detection of redicates......
More informationAnswers to selected exercises
Answers to selected exercises A First Course in Stochastic Models, Henk C. Tijms 1.1 ( ) 1.2 (a) Let waiting time if passengers already arrived,. Then,, (b) { (c) Long-run fraction for is (d) Let waiting
More informationCLX000 Technical Manual (v5.7x)
CLX000 Technical Manual (v5.7x) CSS Electronics (Updated 2018-04-24) Figure 1: CL1000, CL2000 & CL3000 Updated: 2018-04-24 Contents 1 About This Document 1 2 Introduction 2 3 Technical Specification 2
More informationTDR, S-Parameters & Differential Measurements. TDR, S-Parameters & Differential Measurements
DR, -Parameters & Differential Measurements Agenda Introduction DR theory of operation Real Example: amtec Golden tandard Board ingle Ended Impedance Coupling Effects Odd & Even Modes Differential Impedance
More information