Media Access Protocols. Spring 2018 CS 438 Staff, University of Illinois 1
|
|
- Virgil Simpson
- 6 years ago
- Views:
Transcription
1 Media Access Protocols Sprig 2018 CS 438 Staff, Uiversity of Illiois 1
2 Where are We? you are here A midterm is here Sprig 2018 CS 438 Staff, Uiversity of Illiois 2
3 Multiple Access Media Multiple seders o some media Buses (Etheret) Radio, Satellite Toke Rig Need methods to mediate access Fair arbitratio Good performace Sprig 2018 CS 438 Staff, Uiversity of Illiois 3
4 Poit-to-Poit vs. Broadcast Media Poit-to-poit: dedicated pairwise commuicatio Log-distace fiber lik Poit-to-poit lik betwee Etheret switch ad host Broadcast: shared wire or medium Traditioal Etheret wireless LAN Sprig 2018 CS 438 Staff, Uiversity of Illiois 4
5 Types of Shared Lik Networks Bus Topology: Shared Etheret, Toke Bus Rig Topology: Multihop FDDI, IEEE Star Topology: Active or Passive Hub ATM Wireless: Shared IEEE Sprig 2018 CS 438 Staff, Uiversity of Illiois 5
6 Multiple Access Algorithm Sigle shared broadcast chael Must avoid havig multiple odes speakig at oce Otherwise, collisios lead to garbled data Need distributed algorithm for sharig the chael Algorithm determies which ode ca trasmit Typical assumptios Commuicatio eeds vary Over time Betwee hosts Network is ot fully utilized Sprig 2018 CS 438 Staff, Uiversity of Illiois 6
7 Multiple Access Media Which kid of multiplexig is best? Chael partitioig: divide chael ito pieces Frequecy-divisio multiplexig (FDM, separate bads) Takig turs: scheme for tradig off who gets to trasmit Time-divisio multiplexig (TDM, sychroous time slots) Statistical time-divisio multiplexig (STDM, time slots o demad) Radom access: allow collisios, ad the recover Sprig 2018 CS 438 Staff, Uiversity of Illiois 7
8 Chael Partitioig: FDMA FDMA: Frequecy Divisio Multiple Access Chael spectrum divided ito frequecy bads Each statio assiged fixed frequecy bad Uused trasmissio time i frequecy bads go idle Example: 6-statio LAN, 1,3,4 have pkt, frequecy bads 2,5,6 idle FDM cable frequecy bads time Sprig 2018 CS 438 Staff, Uiversity of Illiois 8
9 Chael Partitioig: TDMA TDMA: Time Divisio Multiple Access Access to chael i "rouds" Each statio gets fixed legth slot i each roud Time-slot legth is packet trasmissio time Uused slots go idle Example: 6-statio LAN with slots 0, 3, ad 4 Rouds Slots = Sprig 2018 CS 438 Staff, Uiversity of Illiois 9
10 Chael Partitioig: STDMA STDMA: Statistical Time Divisio Multiple Access Access to chael as eeded Each statio gets fixed legth o trasmissio Time-slot legth is packet trasmissio time Example Uused slots go idle oly if o statio has data to sed Slots = Sprig 2018 CS 438 Staff, Uiversity of Illiois 10
11 Chael Partitioig: Takig Turs slaves data data Pollig Master ode ivites slave odes to trasmit i tur Cocers poll master Pollig overhead Latecy Sigle poit of failure (master) Toke passig Cotrol toke passed from oe ode to ext sequetially Node must have toke to sed Cocers Toke overhead Latecy At mercy of ay ode Sprig 2018 CS 438 Staff, Uiversity of Illiois 11
12 Multiple Access Media: Radom Access Radom access Optimize for the commo case (o collisio) Do t avoid collisios, just recover from them. Whe ode has packet to sed Trasmit at full chael data rate No a priori coordiatio amog odes Two or more trasmittig odes Þ collisio Data lost Radom access MAC protocol specifies How to detect collisios How to recover from collisios Sprig 2018 CS 438 Staff, Uiversity of Illiois 12
13 Multiple Access Media to Discuss Two solutios (of may) Carrier sese multiple access with collisio detectio (CSMA/CD) Sed oly if medium is idle Stop sedig immediately if collisio detected Carrier sese multiple access with collisio Avoidace (CSMA/CA) Sed oly if medium is idle Desig sed algorithm to avoid collisios Taebaum Sec. 4.2 covers may others Sprig 2018 CS 438 Staff, Uiversity of Illiois 13
14 Carrier Sese Multiple Access with Collisio Detectio (CSMA/CD) Used by Etheret Xerox ad IEEE (10Mbps stadards) IEEE 802.3u (Fast Etheret, 100Mbps stadard) IEEE 802.3z,ab (1Gbps Etheret) IEEE /8 (10 Gbps Etheret, o shared bus) Outlie Historical developmet Topologies ad compoets MAC algorithm Collisio detectio limitatios Lessos leared Sprig 2018 CS 438 Staff, Uiversity of Illiois 14
15 Aloha, Networkig! Aloha Packet Radio Network Norm Abramso left Staford to surf Set up first data commuicatio system for Hawaiia islads Hub at U. Hawaii, Oahu Two radio chaels: Radom access: for sites sedig data Broadcast for hub rebroadcastig data Sprig 2018 CS 438 Staff, Uiversity of Illiois 15
16 Pure ALOHA Keep it simple User trasmits at will If two or more messages overlap i time collisio Receiver caot decode packets Wait roudtrip time plus a fixed icremet collisio Lack of ACK After a collisio Collidig statios retrasmit Stagger attempts radomly to reduce repeat collisios After several attempts, seders give up Simple but wasteful Max efficiecy of at most 1/(2e) = 18%! Sprig 2018 CS 438 Staff, Uiversity of Illiois 16
17 From Aloha comes Etheret Etheret Developed by Xerox PARC, 1974 Stadardized by Xerox, DEC ad Itel i 1978 Later, IEEE stadard Fast Etheret (100 Mbps) - IEEE 802.3u stadard Switched Etheret ow popular Numerous stadards with icreasig badwidth over the years 10 Mbps 100 Mbps 1 Gbps 10 Gbps Xerox Alto, first machie etworked with etheret Sprig 2018 CS 438 Staff, Uiversity of Illiois 17
18 Etheret - CSMA/CD CS Carrier Sese Nodes ca distiguish betwee a idle ad a busy lik MA - Multiple Access A set of odes sed ad receive frames over a shared lik CD Collisio Detectio Nodes liste durig trasmissio to determie if there has bee iterferece Sprig 2018 CS 438 Staff, Uiversity of Illiois 18
19 Etheret Topologies Bus Topology: Shared All odes coected to a wire Star Topology: All odes coected to a cetral repeater Sprig 2018 CS 438 Staff, Uiversity of Illiois 19
20 Etheret Coectivity 10Base5 ThickNet < 500m Vampire Tap Cotroller Trasceiver Bus Topology Sprig 2018 CS 438 Staff, Uiversity of Illiois 20
21 Etheret Coectivity 10Base2 ThiNet < 200m Trasceiver BNC T-Juctio Cotroller Bus Topology Sprig 2018 CS 438 Staff, Uiversity of Illiois 21
22 Etheret Coectivity 10BaseT < 100m Cotroller Star Topology Sprig 2018 CS 438 Staff, Uiversity of Illiois 22
23 Etheret Specificatios Coaxial Cable up to 500m Taps > 2.5m apart Trasceiver Idle detectio Seds/Receives sigal Repeater Jois multiple Etheret segmets < 5 repeaters betwee ay two hosts < 1024 hosts Sprig 2018 CS 438 Staff, Uiversity of Illiois 23
24 10Mb Etheret Specificatios Broadcast Ecodig Machester 10 Mbps Þ Trasmissio at 20Mhz Faster Etheret stadards use more efficiet ecodigs Framig Preamble marks begiig, setiel marks ed of frame Bit orieted (similar to HDLC) Data-depedet legth Error Detectio 32-bit CRC Sprig 2018 CS 438 Staff, Uiversity of Illiois 24
25 Etheret MAC Algorithm Node A Node B Node A starts trasmissio at time 0 At time almost T, ode A s message has almost arrived Ä Node B starts trasmissio at time T How ca we esure that A kows about the collisio? Sprig 2018 CS 438 Staff, Uiversity of Illiois 25
26 Collisio Detectio Problem How ca A detect a collisio? Solutio A must still be trasmittig whe it receives B s trasmissio! Example Node A s message reaches ode B at time T Node B s message reaches ode A at time 2T For ode A to detect a collisio, ode A must still be trasmittig at time 2T Sprig 2018 CS 438 Staff, Uiversity of Illiois 26
27 Etheret MAC Algorithm Node A Node B Ä At time almost T, ode A s message has almost arrived Node A starts trasmissio at time 0 Node B starts trasmissio at time T At time 2T, A is still trasmittig ad otices a collisio Sprig 2018 CS 438 Staff, Uiversity of Illiois 27
28 Collisio Detectio IEEE T is bouded to 51.2µs At 10Mbps 51.2µs = 512b or 64 = 512b or 64B Packet legth ³ 64B Jam after collisio Esures that all hosts otice the collisio Sprig 2018 CS 438 Staff, Uiversity of Illiois 28
29 Etheret MAC Algorithm Seder/Trasmitter If lie is idle (carrier sesed) Sed immediately Sed maximum of 1500B data (1527B total) Wait 9.6 µs before sedig agai If lie is busy (o carrier sese) Wait util lie becomes idle Sed immediately (1-persistet) If collisio detected Stop sedig ad jam sigal Try agai later Why have a max size? Wat to prevet oe ode from takig over completely Why 9.6 µs? Too log: wastes time Too short: does't allow other odes to trasmit (fairess) How do we do this? How do we do this? Sprig 2018 CS 438 Staff, Uiversity of Illiois 29
30 Collisio Detectio Techiques: Bus Topology Trasceiver hadles Carrier detectio Collisio detectio Jammig after collisio Trasceiver sees sum of voltages Outgoig sigal Icomig sigal Trasceiver looks for Voltages impossible for oly outgoig Trasceivers Sprig 2018 CS 438 Staff, Uiversity of Illiois 30
31 Collisio Detectio Techiques: Hub Topology Cotroller/Card hadles Carrier detectio Hub hadles Collisio detectio Jammig after collisio Need to detect activity o all lies If more tha oe lie is active Assert collisio to all lies Cotiue util o lies are active Sprig 2018 CS 438 Staff, Uiversity of Illiois 31
32 Frame Receptio Seder hadles all access cotrol Receiver simply pulls the frame from the etwork Etheret cotroller/card Sees all frames Selectively passes frames to host processor Acceptable frames Addressed to host Addressed to broadcast Addressed to multicast address to which host belogs Aythig (if i promiscuous mode) Need this for packet siffers/tcpdump Sprig 2018 CS 438 Staff, Uiversity of Illiois 32
33 Retrasmissio How log should a host wait to retry after a collisio? What happes if the host waits too log? Wasted badwidth What happes if the host does t wait log eough? More collisios Etheret Solutio Biary expoetial backoff Maximum backoff doubles with each failure After N failures, pick a N-bit umber Sprig 2018 CS 438 Staff, Uiversity of Illiois 33 2 N discrete possibilities from 0 to maximum
34 Biary Expoetial Backoff Choices after 2 collisios Choices after 1 collisio 0 Ts 2Ts 3Ts Time of collisio Why use fixed time slots? How log should the slots be? Sprig 2018 CS 438 Staff, Uiversity of Illiois 34
35 Biary Expoetial Backoff For IEEE 802.3, T = 51.2 µs Cosider the followig k hosts collide Each picks a radom umber from 0 to 2 (N-1) If the miimum value is uique All other hosts see a busy lie Note: Etheret RTT < 51.2 µs If the miimum value is ot uique Hosts with miimum value slot collide agai! Next slot is idle Cosider the ext smallest backoff value Sprig 2018 CS 438 Staff, Uiversity of Illiois 35
36 Biary Expoetial backoff algorithm Whe collisio first occurs Sed a jammig sigal to prevet further data beig set Resed a frame After either 0 or T secods, chose at radom If resed fails, resed the frame agai After either 0, T, 2T, or 3T secods. I other words, sed after kt secods, where k is a radom iteger with 0 k < 2 2 If that still does't work, resed the frame agai After kt, where k is a radom umber with 0 k < 2 3 I geeral, after the th failed attempt, resed the frame after kt, where k is a radom umber ad 0 k < 2 Sprig 2018 CS 438 Staff, Uiversity of Illiois 36
37 10 Mbps Etheret Example Two odes are ready to sed a packet at the same time a third eds trasmissio i th roud Each odes wait [0, 1,, 2 (i 1) 1] slots util ext attempt 1 st roud choices: 0 2 d roud choices: 0, 1 3 rd roud choices: 0, 1, 2, 3 All 2 i-1 choices have equal probability q i = P[collisio i the i th roud] Assumig collisios i all the previous i 1 rouds Sprig 2018 CS 438 Staff, Uiversity of Illiois 37
38 10 Mbps Etheret Example Fid q i as a fuctio of i for all i 1 There are 2 (i-1) slots to chose from Statio A selects a slot with probability 1/2 (i-1) Statio B selects a slot with probability 1/2 (i-1) Ad the same slot is chose with probability 1/2 (i-1) This probability does t deped o the slot the first statio selected, so the ucoditioal probability is q i = 2 (i 1) Sprig 2018 CS 438 Staff, Uiversity of Illiois 38
39 10 Mbps Etheret Example Fid the probability p i that exactly i rouds are eeded for the first success p i = q 1 q 2 q 3 q i-1 (1 q i ) Compute p 1, p 2, p 3, p 4 ad p 5 p 1 = 1 q 1 = 0 p 2 = q 1 (1 q 2 ) = 1 (1 ½) p 3 = q 1 q 2 (1 q 3 ) = 1 ½ (1 ¼) p 4 = q 1 q 2 q 3 (1 q 4 ) = 1 ½ ¼ (1 1/8) p 5 = q 1 q 2 q 3 q 4 (1 q 5 ) = 1 ½ ¼ 1/8 (1 1/16) Sprig 2018 CS 438 Staff, Uiversity of Illiois 39
40 10 Mbps Etheret Example Give a upper boud o the probability it takes more that 20 ms util the first success Slot duratio is 51.2μs 20 ms = 390 slots Maximum probability smallest umber of collisios Both statios must wait maximum amout of time Delay for eight collisios = = 255 Delay for ie collisios = = 511 Sprig 2018 CS 438 Staff, Uiversity of Illiois 40
41 10 Mbps Etheret Example Give a upper boud o the probability it takes more that 20 ms util the first success At least 8 collisios delay >= 20 ms P(delay >= 20 ms) = q 1 q 2 q 3 q 4 q 5 q 6 q 7 q 8 = 2 ( ) Sprig 2018 CS 438 Staff, Uiversity of Illiois 41
42 10Mbps Etheret Media Name Cable Advatages Max. Segmet Legth Max Nodes o Segmet 10Base5 Thick Coaxial (10mm) Good for backboes 500m Base2 Thi Coaxial (5mm) Cheapest system 200m 30 10BaseT Twisted Pair (0.5mm) Easy Maiteace 100m 1 (to hub) 10BaseFP Fiber (0.1mm) Best betwee buildigs 500m 33 Exteded segmets may have up to 4 repeaters (total of 2.5km) Sprig 2018 CS 438 Staff, Uiversity of Illiois 42
43 10Mbps Etheret Media Name Cable Advatages Max. Segmet Legth 10Base5 10Base2 10BaseT 10BaseFP Thick Coaxial (10mm) Thi Coaxial Good for backboes The fixed T defies (5mm) the maximum segmet legth Twisted Pair (0.5mm) Fiber (0.1mm) Cheapest system Easy Maiteace Best betwee buildigs Max Nodes o Segmet 500m m m 1 (to hub) 500m 33 Exteded segmets may have up to 4 repeaters (total of 2.5km) Sprig 2018 CS 438 Staff, Uiversity of Illiois 43
44 100Mbps Etheret Media Name Cable Max. Segmet Legth Advatages 100BaseT4 4 Twisted Pair 100m Cat 3, 4 or 5 UTP 100BaseTX Twisted Pair 100m Full duplex o Cat 5 UTP 100BaseFX Fiber Pair 100m Full duplex, log rus All hub based. Other types ot allowed. Hubs ca be shared or switched Sprig 2018 CS 438 Staff, Uiversity of Illiois 44
45 100Mbps Etheret Media Name Cable Max. Segmet Legth Advatages 100BaseT4 4 Twisted Pair 100m Cat 3, 4 or 5 UTP Shorter distaces, 100BaseTX Twisted Pair 100m Full duplex o same protocol! Cat 5 UTP 100BaseFX Fiber Pair 100m Full duplex, log rus All hub based. Other types ot allowed. Hubs ca be shared or switched Sprig 2018 CS 438 Staff, Uiversity of Illiois 45
46 ..ad beyod Gigabit etheret commo i PCs 100 GB etheret stadard ratified i Jue 2010 Sprig 2018 CS 438 Staff, Uiversity of Illiois 46
47 Etheret i Practice Number of hosts Limited to 200 i practice, stadard allows 1024 Rage Typically much shorter tha 2.5km limit i stadard Roud Trip Time Typically 5 or 10 µs, ot 50 Flow Cotrol Higher level flow cotrol limits load (e.g. TCP) Topology Star easier to admiister tha bus Eve better: exclusive access rather tha shared! Sprig 2018 CS 438 Staff, Uiversity of Illiois 47
Announcements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components
Aoucemets Readig Chapter 4 (4.1-4.2) Project #4 is o the web ote policy about project #3 missig compoets Homework #1 Due 11/6/01 Chapter 6: 4, 12, 24, 37 Midterm #2 11/8/01 i class 1 Project #4 otes IPv6Iit,
More informationIntroduction to Wireless & Mobile Systems. Chapter 6. Multiple Radio Access Cengage Learning Engineering. All Rights Reserved.
Itroductio to Wireless & Mobile Systems Chapter 6 Multiple Radio Access 1 Outlie Itroductio Multiple Radio Access Protocols Cotetio-based Protocols Pure ALOHA Slotted ALOHA CSMA (Carrier Sese Multiple
More informationReliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1
Reliable Trasmissio Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Reliable Trasmissio Hello! My computer s ame is Alice. Alice Bob Hello! Alice. Sprig 2018 CS 438 Staff - Uiversity of Illiois 2 Reliable
More informationCopyright 2010, Elsevier Inc. All rights Reserved
Computer Networks: A Systems Approach, 5e Larry L. Peterso ad Bruce S. Davie (Subset of topics) Gettig Coected Framig Error Detectio. Reliable Trasmissio Sharig: Etheret ad Multiple Access Networks, Wireless
More informationLecture 28: Data Link Layer
Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig
More informationSwitching Hardware. Spring 2018 CS 438 Staff, University of Illinois 1
Switchig Hardware Sprig 208 CS 438 Staff, Uiversity of Illiois Where are we? Uderstad Differet ways to move through a etwork (forwardig) Read sigs at each switch (datagram) Follow a kow path (virtual circuit)
More informationIntroduction to Network Technologies & Layered Architecture BUPT/QMUL
Itroductio to Network Techologies & Layered Architecture BUPT/QMUL 2018-3-12 Review What is the Iteret? How does it work? Whe & how did it come about? Who cotrols it? Where is it goig? 2 Ageda Basic Network
More information1. SWITCHING FUNDAMENTALS
. SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig
More informationQuality of Service. Spring 2018 CS 438 Staff - University of Illinois 1
Quality of Service Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Quality of Service How good are late data ad lowthroughput chaels? It depeds o the applicatio. Do you care if... Your e-mail takes 1/2
More informationHistory Based Probabilistic Backoff Algorithm
America Joural of Egieerig ad Applied Scieces, 2012, 5 (3), 230-236 ISSN: 1941-7020 2014 Rajagopala ad Mala, This ope access article is distributed uder a Creative Commos Attributio (CC-BY) 3.0 licese
More informationBluetooth Basics. Bluetooth Overview
Bluetooth Basics Bluetooth Overview Wireless techology for short-rage voice ad data commuicatio Low-cost ad low-power Provides a commuicatio platform betwee a wide rage of smart devices Not limited to
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationCourse Information. Details. Topics. Network Examples. Overview. Walrand Lecture 1. EECS 228a. EECS 228a Lecture 1 Overview: Networks
Walrad Lecture 1 Course Iformatio Lecture 1 Overview: Networks Jea Walrad www.eecs.berkeley.edu/~wlr Istructor: Jea Walrad Office Hours: M-Tu 1:00-2:00 Time/Place: MW 2:00-3:30 i 285 Cory Home Page: http://wwwist.eecs.berkeley.edu/~ee228a
More informationDirect Link Communication II: Wired Media. Multi-Access Communication
Direct Link Communication II: Wired Media Multi-Access Communication Two classes: contention-based e.g., CSMA/CD, CSMA/CA used in Ethernet, WLAN contention-free e.g., TDM, FDM, TDMA, CDMA, token ring used
More informationSwitch Construction CS
Switch Costructio CS 00 Workstatio-Based Aggregate badwidth /2 of the I/O bus badwidth capacity shared amog all hosts coected to switch example: Gbps bus ca support 5 x 00Mbps ports (i theory) I/O bus
More informationCommunication methods. Communication methods. Communication methods. Dimensions to consider. Waveform
Commuicatio methods Commuicatio methods Media ad sigalig covetios used to trasmit data betwee digital devices Differet physical layers methods icludig: wires, radio freuecy (RF), optical (IR, fiber) Differet
More informationThe Idea. Leader Election. Outline. Why Rings? Network. We study leader election in rings. Specification of Leader Election YAIR. Historical reasons
The Idea Leader Electio Network We study leader electio i rigs Why Rigs? Outlie Specificatio of Leader Electio Historical reasos origial motivatio: regeerate lost toke i toke rig etworks Illustrates techiques
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationCommunication methods. Communication methods. Communication methods. Dimensions to consider. Waveform
Commuicatio methods Commuicatio methods Media ad sigalig covetios used to trasmit data betwee digital devices Differet physical layers methods icludig: wires, radio freuecy (RF), optical (IR, fiber) Differet
More informationHigh Level View. EE 122: Ethernet and Random Access protocols. Medium Access Protocols
High Level View EE 122: Ethernet and 802.11 Ion Stoica September 18, 2002 Goal: share a communication medium among multiple hosts connected to it Problem: arbitrate between connected hosts Solution goals:
More informationCS 43: Computer Networks Media Access. Kevin Webb Swarthmore College November 30, 2017
CS 43: Computer Networks Media Access Kevin Webb Swarthmore College November 30, 2017 Multiple Access Links & Protocols Two classes of links : point-to-point dial-up access link between Ethernet switch,
More informationK-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns
K-NET bus The K-Net bus is based o the SPI bus but it allows to addressig may differet turrets like the I 2 C bus. The K-Net is 6 a wires bus (4 for SPI wires ad 2 additioal wires for request ad ackowledge
More informationOverview Queueing Disciplines TCP Congestion Control Congestion Avoidance Mechanisms Quality of Service
Cogestio Cotrol Overview Queueig Disciplies TCP Cogestio Cotrol Cogestio Avoidace Mechaisms Quality of Service Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Today s Topic: Vacatios Sa Fracisco Moterey
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationEE 122: Ethernet and
EE 122: Ethernet and 802.11 Ion Stoica September 18, 2002 (* this talk is based in part on the on-line slides of J. Kurose & K. Rose) High Level View Goal: share a communication medium among multiple hosts
More informationIS-IS in Detail. ISP Workshops
IS-IS i Detail ISP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 27 th November
More informationCSE 461: Multiple Access. Homework: Chapter 2, problems 1, 8, 12, 18, 23, 24, 35, 43, 46, and 58
CSE 461: Multiple Access Homework: Chapter 2, problems 1, 8, 12, 18, 23, 24, 35, 43, 46, and 58 Next Topic Key Focus: How do multiple parties share a wire? This is the Medium Access Control (MAC) portion
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationAdministrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today
Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised
More informationLecture 10 Collision resolution. Collision resolution
Lecture 10 Collisio resolutio Collisio resolutio May applicatios ivolve a iquiry over a shared chael, which ca be ivoked for: discovery of eighborig devices i ad hoc etworks, coutig the umber of RFID tags
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationCS 43: Computer Networks. 27: Media Access Contd. December 3, 2018
CS 43: Computer Networks 27: Media Access Contd. December 3, 2018 Last Class The link layer provides lots of functionality: addressing, framing, media access, error checking could be used independently
More informationMessage Integrity and Hash Functions. TELE3119: Week4
Message Itegrity ad Hash Fuctios TELE3119: Week4 Outlie Message Itegrity Hash fuctios ad applicatios Hash Structure Popular Hash fuctios 4-2 Message Itegrity Goal: itegrity (ot secrecy) Allows commuicatig
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationTopics. Link Layer Services (more) Link Layer Services LECTURE 5 MULTIPLE ACCESS AND LOCAL AREA NETWORKS. flow control: error detection:
1 Topics 2 LECTURE 5 MULTIPLE ACCESS AND LOCAL AREA NETWORKS Multiple access: CSMA/CD, CSMA/CA, token passing, channelization LAN: characteristics, i basic principles i Protocol architecture Topologies
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More informationBasic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.
5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationCMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems
More informationIntroduction to OSPF. ISP Training Workshops
Itroductio to OSPF ISP Traiig Workshops 1 OSPF p Ope Shortest Path First p Lik state or SPF techology p Developed by OSPF workig group of IETF (RFC 1247) p OSPFv2 stadard described i RFC2328 p Desiged
More informationTransitioning to BGP
Trasitioig to BGP ISP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 24 th April
More informationComputer and Network Security
CIS 551 / TCOM 401 Computer and Network Security Spring 2009 Lecture 6 Announcements First project: Due: 6 Feb. 2009 at 11:59 p.m. http://www.cis.upenn.edu/~cis551/project1.html Plan for Today: Networks:
More informationDirect Link Communication II: Wired Media. Multi-Access Communication
Direct Link Communication II: Wired Media Multi-Access Communication Two classes: contention-based e.g., CSMA/CD, CSMA/CA used in Ethernet, WLAN contention-free e.g., TDM, FDM, TDMA, CDMA, token ring one
More informationCIS 551 / TCOM 401 Computer and Network Security. Spring 2007 Lecture 7
CIS 551 / TCOM 401 Computer and Network Security Spring 2007 Lecture 7 Announcements Reminder: Project 1 is due on Thursday. 2/1/07 CIS/TCOM 551 2 Network Architecture General blueprints that guide the
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationWYSE Academic Challenge Sectional Computer Science 2005 SOLUTION SET
WYSE Academic Challege Sectioal Computer Sciece 2005 SOLUTION SET 1. Correct aswer: a. Hz = cycle / secod. CPI = 2, therefore, CPI*I = 2 * 28 X 10 8 istructios = 56 X 10 8 cycles. The clock rate is 56
More informationGoals. Fundamentals of Network Media. More topics. Topics. Multiple access communication. Multiple access solutions
Fundamentals of Network Media Local Area Networks Ursula Holmström Goals Learn the basic concepts related to LAN technologies, for example use of shared media medium access control topologies Know the
More informationSecurity of Bluetooth: An overview of Bluetooth Security
Versio 2 Security of Bluetooth: A overview of Bluetooth Security Marjaaa Träskbäck Departmet of Electrical ad Commuicatios Egieerig mtraskba@cc.hut.fi 52655H ABSTRACT The purpose of this paper is to give
More informationComputer Networks Medium Access Control. Mostafa Salehi Fall 2008
Computer Networks Medium Access Control Mostafa Salehi Fall 2008 2008 1 Outline Issues ALOHA Network Ethernet Token Ring Wireless 2 Main Issues Local Area Network (LAN) : Three or more machines are physically
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationData Link Layer -2- Network Access
EITF25 Internet: Technology and Applications Data Link Layer -2- Network Access 2013, Lecture 03 Kaan Bür, Stefan Höst Previously on EITF25 Logical Link Control Sublayer Flow control Send data Wait for
More informationContention Protocols and Networks
4/13/2005 314 Lecture Contention Protocols and Networks 1 Contention Protocols and Networks Contention Protocols CSMA/CD Network Topologies Ethernet 4/13/2005 314 Lecture Contention Protocols and Networks
More informationLAN. CS 4/55231 Internet Engineering. Kent State University Dept. of Computer Science
1 CS 4/55231 Internet Engineering Kent State University Dept. of Computer Science LECT-4A4 LAN 1 2 LAN Topologies-1 In the last class we saw how two computers can connect to each other. In this class we
More informationEE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )
EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders
More informationLinks. Error Detection. Link Layer. Multiple access protocols. Nodes Links Frame. Shared channel Problem: collisions How nodes share a channel
Link Layer Error Detection Nodes Links Frame R yclic Redundancy hecksum Parity its More about this in exercise! Data Link Layer -1 Data Link Layer -2 Links Two types of links : point-to-point broadcast
More informationCS 111: Program Design I Lecture 21: Network Analysis. Robert H. Sloan & Richard Warner University of Illinois at Chicago April 10, 2018
CS 111: Program Desig I Lecture 21: Network Aalysis Robert H. Sloa & Richard Warer Uiversity of Illiois at Chicago April 10, 2018 NETWORK ANALYSIS Which displays a graph i the sese of graph/etwork aalysis?
More informationData Link Layer -2- Network Access
EITF25 Internet: Technology and Applications Data Link Layer -2- Network Access 2015, Lecture 03 Kaan Bür Previously on EITF25 Logical Link Control Sublayer Flow control Send data Wait for ACK Error control
More informationUNIVERSITY OF MORATUWA
UNIVERSITY OF MORATUWA FACULTY OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING B.Sc. Egieerig 2014 Itake Semester 2 Examiatio CS2052 COMPUTER ARCHITECTURE Time allowed: 2 Hours Jauary 2016
More informationGetting Connected (Chapter 2 Part 4) Networking CS 3470, Section 1 Sarah Diesburg
Getting Connected (Chapter 2 Part 4) Networking CS 3470, Section 1 Sarah Diesburg Five Problems Encoding/decoding Framing Error Detection Error Correction Media Access Five Problems Encoding/decoding Framing
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationEthernet. Introduction. CSE 3213 Fall 2011
Ethernet CSE 3213 Fall 2011 19 October 2011 1 Introduction Rapid changes in technology designs Broader use of LANs New schemes for high-speed LANs High-speed LAN technologies: Fast and gigabit Ethernet
More informationThroughput-Delay Scaling in Wireless Networks with Constant-Size Packets
Throughput-Delay Scalig i Wireless Networks with Costat-Size Packets Abbas El Gamal, James Mamme, Balaji Prabhakar, Devavrat Shah Departmets of EE ad CS Staford Uiversity, CA 94305 Email: {abbas, jmamme,
More informationRandom Network Coding in Wireless Sensor Networks: Energy Efficiency via Cross-Layer Approach
Radom Network Codig i Wireless Sesor Networks: Eergy Efficiecy via Cross-Layer Approach Daiel Platz, Dereje H. Woldegebreal, ad Holger Karl Uiversity of Paderbor, Paderbor, Germay {platz, dereje.hmr, holger.karl}@upb.de
More informationMultiprocessors. HPC Prof. Robert van Engelen
Multiprocessors Prof. Robert va Egele Overview The PMS model Shared memory multiprocessors Basic shared memory systems SMP, Multicore, ad COMA Distributed memory multicomputers MPP systems Network topologies
More informationAn upper bound model for TCP and UDP throughput in IPv4 and IPv6
ARTICLE IN PRESS Joural of Network ad Computer Applicatios 31 (2008) 585 602 www.elsevier.com/locate/jca A upper boud model for TCP ad UDP throughput i IPv4 ad IPv6 Eric Gamess, Ria Suro s Cetral Uiversity
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More informationRandomized and Quantum Protocols in Distributed Computation
Radomized ad Quatum Protocols i Distributed Computatio Michael Be-Or The Hebrew Uiversity Michael Rabi s Birthday Celebratio Radomized Protocols Power of Radomizatio Expoetial speedup for kow algorithms
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5.
Morga Kaufma Publishers 26 February, 208 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Virtual Memory Review: The Memory Hierarchy Take advatage of the priciple
More informationCSE 461: Multiple Access Networks. This Lecture
CSE 461: Multiple Access Networks This Lecture Key Focus: How do multiple parties share a wire? This is the Medium Access Control (MAC) portion of the Link Layer Randomized access protocols: 1. Aloha 2.
More informationLecture 9: Bridging. CSE 123: Computer Networks Alex C. Snoeren
Lecture 9: Bridging CSE 123: Computer Networks Alex C. Snoeren Lecture 9 Overview Finishing up media access Ethernet Contention-free methods (rings) Moving beyond one wire Link technologies have limits
More informationComputer Networks. Medium Access Sublayer (Part I)
Computer Networks Medium Access Sublayer (Part I) Topics Introduction Multiple Access Protocols Ethernet Wireless LAN Protocols Bridges Misc (brief) High-Speed LANs Satellite Networks Introduction Remember,
More informationAcknowledgement-Aware MPR MAC Protocol for Distributed WLANs: Design and Analysis
Globecom 2012 - Wireless Commuicatios Symposium Ackowledgemet-Aware MPR MAC Protocol for Distributed WLANs: Desig ad Aalysis Arpa Mukhopadhyay, Neelesh B. Mehta, Seior Member, IEEE, Vikram Sriivasa, Member,
More informationNetworking Technologies and Applications
Networking Technologies and Applications Rolland Vida BME TMIT September 23, 2016 Aloha Advantages: Different size packets No need for synchronization Simple operation If low upstream traffic, the solution
More informationICS Regent. Communications Modules. Module Operation. RS-232, RS-422 and RS-485 (T3150A) PD-6002
ICS Reget Commuicatios Modules RS-232, RS-422 ad RS-485 (T3150A) Issue 1, March, 06 Commuicatios modules provide a serial commuicatios iterface betwee the cotroller ad exteral equipmet. Commuicatios modules
More informationOur second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees.
Comp 135 Machie Learig Computer Sciece Tufts Uiversity Fall 2017 Roi Khardo Some of these slides were adapted from previous slides by Carla Brodley Our secod algorithm Let s look at a simple dataset for
More informationIdentifying and Cabling Circuit Cards. Identifying and Cabling Circuit Cards - 1
Cards Cards - 1 Cards Cards This sectio provides the basic iformatio you eed to coect cables to the faceplates of circuit cards that are istalled i the system. Additioal steps may be required for some
More informationThe Link Layer and LANs. Chapter 6: Link layer and LANs
The Link Layer and LANs EECS3214 2018-03-14 4-1 Chapter 6: Link layer and LANs our goals: understand principles behind link layer services: error detection, correction sharing a broadcast channel: multiple
More informationCS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1
CS200: Hash Tables Prichard Ch. 13.2 CS200 - Hash Tables 1 Table Implemetatios: average cases Search Add Remove Sorted array-based Usorted array-based Balaced Search Trees O(log ) O() O() O() O(1) O()
More informationIEEE 802 LANs SECTION C
IEEE 802 LANs SECTION C Outline of the Lecture Basic characteristics of LAN Topology Transmission Media MAC IEEE 802 LANs 802.3 - CSMA/CD based (Ethernet) 802.4 Token bus-based 802.5 Token ring-based Comparison
More informationEECS 122, Lecture 24 Introduction to the Telephone Network. Kevin Fall Jean Walrand
EECS 122, Lecture 24 Itroductio to the Telephoe Network Kevi Fall kfall@cs.berkeley.edu Jea Walrad wlr@eecs.berkeley.edu Outlie Overview Cocepts Recet History Structure Hierarchical Addressig Ed Systems
More informationAdaptive Graph Partitioning Wireless Protocol S. L. Ng 1, P. M. Geethakumari 1, S. Zhou 2, and W. J. Dewar 1 1
Adaptive Graph Partitioig Wireless Protocol S. L. Ng 1, P. M. Geethakumari 1, S. Zhou 2, ad W. J. Dewar 1 1 School of Electrical Egieerig Uiversity of New South Wales, Australia 2 Divisio of Radiophysics
More informationEE123 Digital Signal Processing
Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationTraditional queuing behaviour in routers. Scheduling and queue management. Questions. Scheduling mechanisms. Scheduling [1] Scheduling [2]
Traditioal queuig behaviour i routers Schedulig ad queue maagemet Data trasfer: datagrams: idividual packets o recogitio of flows coectioless: o sigallig Forwardig: based o per-datagram, forwardig table
More informationData and Computer Communications
Data and Computer Communications Chapter 16 High Speed LANs Eighth Edition by William Stallings Why High Speed LANs? speed and power of PCs has risen graphics-intensive applications and GUIs see LANs as
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationRedes de Computadores. Medium Access Control
Redes de Computadores Medium Access Control Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto 1 » How to control the access of computers to a communication medium?» What is the ideal Medium
More informationEthernet Basics. based on Chapter 4 of CompTIA Network+ Exam Guide, 4 th ed., Mike Meyers
Ethernet Basics based on Chapter 4 of CompTIA Network+ Exam Guide, 4 th ed., Mike Meyers Ethernet Basics History Ethernet Frames CSMA/CD Obsolete versions 10Mbps versions Segments Spanning Tree Protocol
More informationThe Penta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems
The Peta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems Abdulkarim Ayyad Departmet of Computer Egieerig, Al-Quds Uiversity, Jerusalem, P.O. Box 20002 Tel: 02-2797024,
More informationLecture 6. Reminder: Homework 2, Programming Project 2 due on Thursday. Questions? Tuesday, September 13 CS 475 Networks - Lecture 6 1
Lecture 6 Reminder: Homework 2, Programming Project 2 due on Thursday. Questions? Tuesday, September 13 CS 475 Networks - Lecture 6 1 Outline Chapter 2 - Getting Connected 2.1 Perspectives on Connecting
More information27 Refraction, Dispersion, Internal Reflection
Chapter 7 Refractio, Dispersio, Iteral Reflectio 7 Refractio, Dispersio, Iteral Reflectio Whe we talked about thi film iterferece, we said that whe light ecouters a smooth iterface betwee two trasparet
More informationGuaranteeing Hard Real Time End-to-End Communications Deadlines
Guarateeig Hard Real Time Ed-to-Ed Commuicatios Deadlies K. W. Tidell A. Burs A. J. Welligs Real Time Systems Research Group Departmet of Computer Sciece Uiversity of York e-mail: ke@mister.york.ac.uk
More informationECE4050 Data Structures and Algorithms. Lecture 6: Searching
ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated
More informationLinks Reading: Chapter 2. Goals of Todayʼs Lecture. Message, Segment, Packet, and Frame
Links Reading: Chapter 2 CS 375: Computer Networks Thomas Bressoud 1 Goals of Todayʼs Lecture Link-layer services Encoding, framing, and error detection Error correction and flow control Sharing a shared
More informationCS 455/555 Intro to Networks and Communications. Link Layer
CS 455/555 Intro to Networks and Communications Link Layer Dr. Michele Weigle Department of Computer Science Old Dominion University mweigle@cs.odu.edu http://www.cs.odu.edu/~mweigle/cs455-s13 1 Link Layer
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationMAC Throughput Improvement Using Adaptive Contention Window
Joural of Computer ad Commuicatios, 2015, 3, 1 14 Published Olie Jauary 2015 i SciRes. http://www.scirp.org/joural/jcc http://dx.doi.org/10.4236/jcc.2015.31001 MAC Throughput Improvemet Usig Adaptive Cotetio
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More information