FEC Summary. Ed Boyd, Xingtera. IEEE 802.3bn January

Size: px
Start display at page:

Download "FEC Summary. Ed Boyd, Xingtera. IEEE 802.3bn January"

Transcription

1 FE Summary Ed Boyd, Xingtera IEEE 802.3bn January

2 FE Summary Encoder Delay Decoder Delay Overall omplexity Efficiency* Medium Only 0 Med 80.4% Easy Long Short Long Long 87.4% Medium Long Short 0 Long 87.4% Medium arity at End Long Med Long Long 87.4% Difficult Short L M S 0 Long 87.4% Difficult arity at End L M S+ K/2 Long + Short/2 Long + Short/2 87.4% Most Difficult *128 Users at 1Gbps upstream IEEE 802.3bn January

3 alculating FE Overhead The LT must calculate the burst size from the REORT value. 64/66 Overhead Vectors_Bits = 160*65/64*REORT_Value FE Overhead Medium Only _FE_Bits = Vector_Bits + ROUNDU(Vector_Bits/4940)*(900+40) Simple Single Divider L S _FE_Bits = Vector_Bits + INT(Vector_Bits/14300)*( ) + ROUNDU(REMAINDER(Vector_Bits/14300)/800)*(280+40) Requires 2 Dividers L M S TAIL_BITS = TABLE_LOOKU(REMAINDER(Vector_Bits/14300) _FE_Bits = Vector_Bits + INT(Vector_Bits/14300)*( ) + TAIL_BITS Requires a Divider and a Table Lookup IEEE 802.3bn January

4 FE Summary K/2 IEEE 802.3bn January

5 LT K/2 SNR Advantage? Without K/2 Full Full Full Short NU LT Full SNR Full SNR Full SNR Great SNR With K/2 Full Full Med Med NU Full SNR Full SNR Better SNR Better SNR Without K/2, Final Short codeword has much better SNR than Full blocks. With K/2, last 2 blocks have better SNR. Overall SNR is still limited by Full Block size SNR since improvement only on last block on certain block sizes. K/2 Does not improve overall SNR IEEE 802.3bn January

6 K/2 Decode Delay Start Decode Start Decode Start Decode Start Decode LT Full Full Full Short NU Without K/2 Start Decode Start Decode Start Decode LT Full Full Med Med NU With K/2 Without K/2, decoding starts after full codeword of data or End of burst marker. With K/2, decoding is delayed until half of next codeword or end of burst marker. With K/2, decoding the final 2 blocks starts at last code word. K/2 Increases Decoder Delay IEEE 802.3bn January

7 K/2 Encode Delay Add arity at End Add arity at End Add arity at End Add arity at End ass ass ass ass LT Full Full Full Short Without K/2 NU Delay until mid block To pass data Delay until mid block To pass data Delay until mid block To pass data When End of burst, alculate parity to Mid point and insert In data stream LT Full Full Med Med With K/2 NU Without K/2, transmit data is not delayed and parity is always after data. With K/2, transmitter must delay data until mid point of next block to determine where parity will be inserted. With K/2, parity calculation can t start until end of burst for last 2 blocks and must be inserted in non end location. K/2 Increases Encoder Delay and omplexity IEEE 802.3bn January

8 FE Summary 65 BIT VETOR ALIGNMENT IEEE 802.3bn January

9 ayload Alignment R 40 ARITY In the Eo downstream, the FE payload carries an even multiple of 65 bit vectors. Allows FE alignment to set vector alignment. Should the Eo upstream use payload sizes aligned to the 65 bit vectors? Alignment makes it easier to discard a bad FE block. Alignment Efficiency enalty Short Efficiency: 70.9% vs 71.4% (75% without R 40) Med Efficiency: 84% vs 84.2% (84.8% without R 40) Long Efficiency: 88.6% vs 88.6% (88.9% without R 40) IEEE 802.3bn January

10 Final FE Block of Burst IDLE Filler R 40 ARITY Resource BlkBoundaries Bursts will not naturally end at Resource Block Boundaries (RBB) so idles must added to the end of the burst. Adding data after the parity would not allow end marker to identify the FE size. IDLE characters must be inserted before the R 40 and arity. (The required data may change the type or amount of FE parity). The IDLE filler inserted to reach the RBB may cause the FE parity to increase or an additional FE block added. We should NOT require the final FE block payload to be a multiple of 65 bit vectors so the FE ends at the RBB. (No alignment issue at end of burst) IEEE 802.3bn January

11 Start of Burst Vector Alignment onclusion Full ode Word Full ode Word Full ode Word Short ode Word(s) Even multiples of 65 bits in each payload No Vector Alignment Required Alignment of vectors for full size Long code words has a minor (<.1%) impact on efficiency. It is easier to discard FE code words and realign with the vector of the next FE block if payload is multiples of 65 bits. No added complexity since it is the size definition from downstream. The End of burst FE Block(s) will not require vector alignment so the FE can align with end of the Resource Block. There is no benefit for realignment at the end of the burst and the alignment penalty is higher on short code words. Vector Alignment on Start/Middle ode Words IEEE 802.3bn January

12 FE Summary LONG MEDIUM SHORT IEEE 802.3bn January

13 Multiple ode Word omplexity Medium Only [Transmitter] LT Med Med Med R 40 R 40 R 40 NU ass while alc R 40 & alc FE Long Medium Short Add R 40 And arity Add parity at End of Burst Buffer to Determine FE and insert R40/arity LT Long Med Short Short R 40 R 40 R 40 R 40 NU Example : Insert 3 parities at End of Burst End of FE blocks. Medium only has no transmit buffering delay and parity only inserted at the end. LMS requires that transmitter buffer data so it can insert the parity/r 40 between multiple different size blocks of data. K/2 not considered. IEEE 802.3bn January

14 arity at the End Long Medium Short No Delay Buffer Required LT Long Med Short Short NU Insert 3 parities at End of Burst If parity for 1 or more blocks is always transmitted at the end, transmit data doesn t need to be delayed. Multiple Sized Encoders need to calculate parity on multiple data block sizes at the end of the burst. K/2 not considered in this slide. IEEE 802.3bn January

15 Single R40 at the End Long Medium Short LT Long Med Short Short Long Medium Short R 40 R 40 R 40 R 40 NU LT Long Med Short Short R 40 R 40 NU Single R40 for all parity blocks Inserting R 40 at the end of the code words would require transmit buffering and the shifting of data. The end of burst is less data than a full long code word so a single R 40 would be simpler and more efficient. IEEE 802.3bn January

16 Multiple ode words (L M S) [@End] Assume arity at the end and a single R 40 for a long code word or end of burst blocks The tail of a burst can use 1 or more smaller code words to shorten the parity required. The code word sizes can be determined by the number of bits in the block. ode word alignment is not required on the end of the burst. The Look up table below shows the most efficient code words sizes and required parity for any block size. Min Bits Max Bits BitsLong Long Medium Medium Short Short R40 arity R40 Bits Overhead arity Bits bits bits bits bits bits bits bits bits IEEE 802.3bn January

17 Multiple ode words (L M S) Same sent out regardless of size of block. Single R 40 and block of parity avoids variable delay buffer and complexity. IEEE 802.3bn January

18 Multiple ode words (L M S) The tail of a burst can use 1 or more smaller code words to shorten the parity required. The code word sizes can be determined by the number of bits in the block. ode word alignment is not required on the end of the burst. The Look up table below shows the most efficient code words sizes and required parity for any block size. Min Bits Max Bits Long Medium Short R40 arity Bits R+arity bits bits bits bits bits bits IEEE 802.3bn January

19 Multiple ode words (L M S) LT NU bits: 1 Short bits: 2 Short bits: 1 Medium + 1 Short bits: 1 Medium bits: 1 Medium + 1 Short bits: 1 Medium + 1 Short bits: 1 Long Must stop transmitting and buffer Since I may or may not need to insert R and FE parity. Stop at 800 bits of 14K bit block. After end of burst, parity and R 40 must be alculated and inserted earlier in data stream. Buffering and insertion delay is variable. To avoid delay of recalculating, multiple R 40 calculators and encoders could be used IEEE 802.3bn January

20 FE Summary LONG SHORT IEEE 802.3bn January

21 Long Short (all at end) Long Short N x Short Blocks N x Short arities LT Long Short Short Short Short R 40 R 40 NU Single R40 for all parity blocks Transmitter running 2 encoders (short and long) would have no additional delay or jitter. If R 40 is bad, all end of burst blocks are lost. (Still Less lost than bad Long block) IEEE 802.3bn January

22 Multiple ode words (L S) [All at End] LT NU 1xShort Block 2xShort Block 3xShort Block 4xShort Block 5xShort Block 6xShort Block Must stop transmitting and buffer Since I may or may not need to insert R and FE parity. IEEE 802.3bn January

23 Multiple ode words (L S) LT NU Same sent out regardless of size of block. Single R 40 and block of parity avoids variable delay buffer and complexity. FE size increases simply with block size. IEEE 802.3bn January

24 Multiple ode words (L S) If the Medium code word size is not used, the following look up table could be used to select the parity. ode word alignment is not required at the end of burst. Assumes arity at the End with Single R 40. Min Bits Max Bits Long Short R40 arity Bits IEEE 802.3bn January

25 FE Summary IMAT OF FE/ARITY AT END IEEE 802.3bn January

26 arity/r 40 at End ROs arity/r 40 at End is more efficient. arity/r 40 at End has lower delay on transmitter. arity/r 40 at End simplifies transmitter. (To be explained) oncerns Raised on all arity/r 40 at End lowers the ability to detect errors. Will show that it isn t an issue. arity/r 40 increases delay on receiver. Will show that it isn t an issue. If arity/r 40 at End is less complex, lower delay, and more efficient, we should use it. IEEE 802.3bn January

27 Multiple ode words (L M S) [@End] Assume arity at the end and a single R 40 for a long code word or end of burst blocks The tail of a burst can use 1 or more smaller code words to shorten the parity required. The code word sizes can be determined by the number of bits in the block. ode word alignment is not required on the end of the burst. The Look up table below shows the most efficient code words sizes and required parity for any block size. Min Bits Max Bits Long Medium Short R40 arity Bits Min Bits Max Bits Long Medium Short R40 arity Bits R40 + arity bits bits bits bits bits bits bits bits IEEE 802.3bn January

28 Multiple ode words (L M S) [@End] LT NU bits: 1 Short bits: 2 Short bits: 3 Short bits: 1 Medium bits: 1 Medium, 1 Short bits: 1 Medium, 2 Short bits: 1 Medium, 3 Short 7520 bits: Long IEEE 802.3bn January

29 Multiple ode words (L M S) The tail of a burst can use 1 or more smaller code words to shorten the parity required. The code word sizes can be determined by the number of bits in the block. ode word alignment is not required on the end of the burst. The Look up table below shows the most efficient code words sizes and required parity for any block size. The multiple R 40 s make 2 of the sizes more inefficient than a single block. Min Bits Max Bits Long Medium Short R40 arity Bits R+arity bits bits bits bits bits bits bits bits IEEE 802.3bn January

30 Multiple ode words (L M S) The tail of a burst can use 1 or more smaller code words to shorten the parity required. The code word sizes can be determined by the number of bits in the block. ode word alignment is not required on the end of the burst. The Look up table below shows the most efficient code words sizes and required parity for any block size. Min Bits Max Bits Long Medium Short R40 arity Bits R+arity bits bits bits bits bits bits IEEE 802.3bn January

31 Multiple ode words (L M S) LT NU bits: 1 Short bits: 2 Short bits: 1 Medium bits: 1 Medium + 1 Short bits: 1 Medium + 2 Short bits: 1 Long Must stop transmitting and buffer Since I may or may not need to insert R and FE parity. Stop at 800 bits of 14K bit block. After end of burst, parity and R 40 must be alculated and inserted earlier in data stream. Buffering and insertion delay is variable. To avoid delay of recalculating, multiple R 40 calculators and encoders could be used IEEE 802.3bn January

32 S Transmit Buffer Slots to other NUs Gearbox FE Encoder + R40 Burst 1 Burst 2 Burst n Fixed Delay Buffer Detector acket Buffer IDLE Deletion XGMII (Required if parity isn t at end) If arity/r40 is not at the end, a fixed delay transmit buffer is required in the S. [Shown between Detector and FE Encoder] The buffer allows the FE encoder to know the end of burst tail size and place R 40 and parity. Size of the Buffer The delay will need to be 6,600 bits at the lowest data rate. 6, Mbps = 26.4us (Max Delay at low speed) 1Gbps = 26,400 bits (Max Size at high speed) # of Bursts in the buffer Bursts can be 1 to 1.5 us for polling or single packet. Buffer may contain 1 burst or up to 20+ bursts. Buffer adds complexity and adds delay; we should avoid it. IEEE 802.3bn January

33 R 40 overage A single R 40 does not decrease the R 40 error detectability. SNR is about the same for all code word sizes Short (28.8db), Medium (29.1db), Long (29.7db) From Broadcom Victoria resentation. R 40 overage R 40 covers 14K bits on long code words. R 40 covers 5K bits for LS or 6.6K LMS for the longest multiple FE end of burst. R 40 still covers the age of the universe IEEE 802.3bn January

34 FE Receiver Delay 1) Received 2) Start Decode 1) Received 2) Start Decode? Short End of bursts have extra time to decode. LT Long Long Short Short Long NU Decoder Busy Decoder Busy Decoder Busy FE Decoder Delay 3) Released Delay through FE Decoding (S) must be a constant. FE Decoding Delay must be the same for all data. Longest Delay is Full Size Block Long Block. (Shown above). Required FE Decoder Delay 3) Decoding Finishes early There is no advantage to decoding the end of burst and certain end of burst sizes faster. (data must be buffered to match HY delay anyway). All 3 possible positions for decoding start (Green #2) will have data available early. 4) is buffered to fixed delay. IEEE 802.3bn January

35 FE Receiver Delay (2) LT NU bits: 1 Short Exactly the same for R 40/arity at End bits: 2 Short bits: 1 Medium bits: 1 Medium + 1 Short bits: 1 Medium + 2 Short bits: 1 Long 1 Short, 1 Medium, and 1 Long will start decoding at the end of the burst with or without R 40/arity at the end of burst. Starting a few of the middle burst endings early doesn t provide a fixed delay improvement. Heavy ost: Decoder isn t ready until end of burst anyway. 3 times decoder speed up is required to start decoding early. No Value: A variable delay on the end of burst doesn t change the fixed HY delay. Early Decoding is more complexity for no value IEEE 802.3bn January

36 FE Receiver Throughput arity & R 40 per block arity & R 40 at End The placement of the parity does not change the FE decoding throughput. The amount of time to decode the multiple short and/or medium blocks is the same for both cases. Starting earlier doesn t increase the throughput. IEEE 802.3bn January

37 Back to Back Short Burts 1) Received 2) Start Decode LT Min Gap Long Long Short Short NU Decoder Busy Decoder Busy Decoder Busy Decoder Busy (short End) Decoder Busy (short start) Min Gap between bursts is determined by FE decoding rate. (it is not a function of the last blocks delay). Base Equations LongBlockTime >= LongDecodeTime 2xShortBurstTime + MinGap >= 2xShortDecodeTime LongBlockTime + ShortEndTime + ShortBurstTime >= LongDecodeTime + ShortEndDecodeTime + MinGap + ShortDecodeTime IEEE 802.3bn January

38 arity & R 40 per block arity & R 40 at End Summary arity & R40 at End has no decoder disadvantages Decoding starts at the end of the burst for both methods. Too expensive to start early on short blocks. Even if started early, there is no change to HY delay or FE throughput. arity & R40 at End has advantages and no disadvantages It is more efficient. Lower Transmitter Delay Significantly reduces transmitter complexity Single R40 generator. No transmitter delay buffer to find end of bursts. All S blocks [Idle Deletion, Detector, FE Encoding, Gearbox] are working on the same burst in time. IEEE 802.3bn January

39 FE Summary BURST ERFORMANE IEEE 802.3bn January

40 EON 10G vs Eo Medium R 40 and FE arity added for both cases. 0.7 Eo Medium ode Word only is generally more efficient than 10G EON FE FE Efficiency G Full ode Word Eo Medium Shortened Does Eo needs to improve efficiency over 10G EON? How can we compare these graphs and get the overall system efficiency? Burst Size (Bytes) IEEE 802.3bn January

41 Eo Medium vs Eo LS Eo with a mixture of Long and Short code words improves performance on short and long bursts. FE Efficiency Eo Med Eo LS Efficiency = Vector ayload/(vector ayload + R40 + arity) Is it enough to justify complexity? Burst Size (Bytes) IEEE 802.3bn January

42 Eo LS vs Eo LMS Eo with Long, Medium, and Short ode words increases the efficiency of burst sizes in the range of 400 Bytes to780 Bytes. FE Efficiency Eo LMS Eo LS Bursts will normally be smaller than 400 Bytes for AKs, polling, etcs. Bursts on a loaded system will be larger than 780 Bytes Overall, Little or no performance improvement for LMS over LS. Burst Size (Bytes) IEEE 802.3bn January

43 FE Summary SYSTEM EFFIIENY IEEE 802.3bn January

44 Burst vs System Efficiency Burst Efficiency does not give a realistic worst case system efficiency. It is impossible to only have small bursts. If all NUs are transmitting small bursts and aren t getting enough bandwidth, they will start sending large bursts. It is impossible to only have large bursts. Some NUs will only have AKs or polling to send. Worst ase System Efficiency Upstream rate and number of NUs are inputs. Assume that all NUs except 1 are transmitting the smallest least efficient burst. One NU is transmitting a large burst to fill in the rest of the data in a 2ms cycle time. IEEE 802.3bn January

45 System Efficiency 250Mbps 250Mbps 500Mbps 500Mbps 1Gbps 1Gbps Medium 76.6% 68.4% 80.5% 76.5% 82.3% 80.4% LS 86.1% 83.7% 87.4% 86.2% 88% 87.4% LMS 86.1% 83.7% 87.4% 86.2% 88% 87.4% Medium is around 9% less efficient than Long & Short. ~9% 250Mbps, ~9%@500Mbps, ~5 7%@1Gbps Is it worth the additional complexity? LMS has no advantage over LS Small and Long bursts set efficiency Byte burst advantage for LMS doesn t show up. No need for LMS. IEEE 802.3bn January

46 FE Summary ONLUSIONS IEEE 802.3bn January

47 onclusions Medium ode Word only is the simplest solution Efficiency is close to 10G EON FE Long & Short improves efficiency 5% to 15% system efficiency improvement arity should be at end to avoid transmit delay/jitter. Single R40 should be at the end of burst block Is it worth the complexity added? Long & Medium & Short erformance improvement is not worth complexity added over LS. K/2 Adds delay and complexity with no clear benefit for Eo Alignment to 65 bit vectors Start/Middle of burst blocks should have payload aligned to 65 bit vectors. End of burst blocks should not be aligned. FE arities should not be padded to align to 65 bit vectors. IEEE 802.3bn January

48 Straw oll #1 Do you think that we should include K/2 for the last code word block? Yes: No: IEEE 802.3bn January

49 Straw oll #2 Which FE method do you prefer? Medium Only: Long & Short: Long, Medium, & Short: Other: Undecided: IEEE 802.3bn January

50 Straw oll #3 Assuming L S or L M S, how should we handle the R 40 s and arity bits in the end of burst code word blocks? R 40 in every block and parity in each block: R 40 in every block and all parity at end: Single R 40 and all parity at end: Other: Undecided: IEEE 802.3bn January

51 Straw oll #4 What should be kept as multiples of 65 bit vectors? All FE payloads and FE parities: All FE payloads: Full Length Long FE payloads: None: Undecided: IEEE 802.3bn January

52 FE Summary BAK U IEEE 802.3bn January

53 Multiple ode words (L M S) LT NU bits: 1 Short bits: 2 Short 1641 bits: 2 Short Must stop transmitting and buffer Since I may or may not need to insert R and FE parity. Stop at 800 bits of 14K bit block. After end of burst, parity and R 40 must be alculated and inserted earlier in data stream. Buffering and insertion delay is variable. To avoid delay of recalculating, multiple R 40 calculators and encoders could be used. IEEE 802.3bn January

Multiple Profiles for EPoC. Andrea Garavaglia and Nicola Varanese - Qualcomm IEEE 802.3bn Task Force Interim Phoenix, AZ

Multiple Profiles for EPoC. Andrea Garavaglia and Nicola Varanese - Qualcomm IEEE 802.3bn Task Force Interim Phoenix, AZ Multiple Profiles for EPoC Andrea Garavaglia and Nicola Varanese - Qualcomm IEEE 802.3bn Task Force Interim Phoenix, AZ Supported by Jorge Salinger (Comcast) IEEE 802.3bn Phoenix, AZ 2 Multiple Profile

More information

EPOC Upstream PHY Link Channel and Channel Probing

EPOC Upstream PHY Link Channel and Channel Probing EPOC Upstream PHY Link Channel and Channel Probing Ed Boyd, Broadcom Avi Kliger, Broadcom Nicola Varanese, Qualcomm UPSTREAM PLC 2 FREQ CLT CNU OLT ONU Upstream PLC BST 1 BST 2 BST 3 BST 4 5 Discovery

More information

AVB Latency Math. v5 Nov, AVB Face to Face Dallas, TX Don Pannell -

AVB Latency Math. v5 Nov, AVB Face to Face Dallas, TX Don Pannell - AVB Latency Math v5 Nov, 2010 802.1 AVB Face to Face Dallas, TX Don Pannell - dpannell@marvell.com 1 History V5 This version Changes marked in Red Add Class A Bridge Math - Nov 2010 Dallas, TX V4 1 st

More information

Multiple Profiles for EPoC. Andrea Garavaglia and Nicola Varanese - Qualcomm IEEE 802.3bn Task Force Interim Phoenix, AZ

Multiple Profiles for EPoC. Andrea Garavaglia and Nicola Varanese - Qualcomm IEEE 802.3bn Task Force Interim Phoenix, AZ Multiple Profiles for EPoC Andrea Garavaglia and Nicola Varanese - Qualcomm IEEE 802.3bn Task Force Interim Phoenix, AZ Supported by Jorge Salinger (Comcast) IEEE 802.3bn Phoenix, AZ 2 Multiple Profile

More information

CSCI-1680 Link Layer Reliability John Jannotti

CSCI-1680 Link Layer Reliability John Jannotti CSCI-1680 Link Layer Reliability John Jannotti Based partly on lecture notes by David Mazières, Phil Levis, Rodrigo Fonseca Roadmap Last time Physical layer: encoding, modulation Link layer framing Today

More information

Data Rate Adaptation in EPoC

Data Rate Adaptation in EPoC Data Rate Adaptation in EPoC Marek Hajduczenia, PhD ZTE Corporation marek.hajduczenia@zte.pt Andrea Garavaglia Qualcomm Inc. andreag@qti.qualcomm.com IEEE 802.3bn Orlando, FL 18-21 March 2013 Summary This

More information

EPoC PHY and MAC proposal

EPoC PHY and MAC proposal EPoC PHY and MAC proposal Marek Hajduczenia, PhD ZTE Corporation marek.hajduczenia@zte.pt Supporters Alan Brown, Aurora Ed Mallette, Bright House Networks 2 RF spectrum churn Chunks of RF spectrum may

More information

CSCI-1680 Link Layer I Rodrigo Fonseca

CSCI-1680 Link Layer I Rodrigo Fonseca CSCI-1680 Link Layer I Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti Last time Physical layer: encoding, modulation Today Link layer framing Getting frames

More information

CSCI-1680 Link Layer Reliability Rodrigo Fonseca

CSCI-1680 Link Layer Reliability Rodrigo Fonseca CSCI-1680 Link Layer Reliability Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Janno< Last time Physical layer: encoding, modulation Link layer framing Today Getting

More information

ELEC 691X/498X Broadcast Signal Transmission Winter 2018

ELEC 691X/498X Broadcast Signal Transmission Winter 2018 ELEC 691X/498X Broadcast Signal Transmission Winter 2018 Instructor: DR. Reza Soleymani, Office: EV 5.125, Telephone: 848 2424 ext.: 4103. Office Hours: Wednesday, Thursday, 14:00 15:00 Slide 1 In this

More information

2.1 CHANNEL ALLOCATION 2.2 MULTIPLE ACCESS PROTOCOLS Collision Free Protocols 2.3 FDDI 2.4 DATA LINK LAYER DESIGN ISSUES 2.5 FRAMING & STUFFING

2.1 CHANNEL ALLOCATION 2.2 MULTIPLE ACCESS PROTOCOLS Collision Free Protocols 2.3 FDDI 2.4 DATA LINK LAYER DESIGN ISSUES 2.5 FRAMING & STUFFING UNIT-2 2.1 CHANNEL ALLOCATION 2.2 MULTIPLE ACCESS PROTOCOLS 2.2.1 Pure ALOHA 2.2.2 Slotted ALOHA 2.2.3 Carrier Sense Multiple Access 2.2.4 CSMA with Collision Detection 2.2.5 Collision Free Protocols 2.2.5.1

More information

EPoC PHY Link and Auto Negotiation. Ed Boyd, Broadcom Avi Kliger, Broadcom

EPoC PHY Link and Auto Negotiation. Ed Boyd, Broadcom Avi Kliger, Broadcom EPoC PHY Link and Auto Negotiation Ed Boyd, Broadcom Avi Kliger, Broadcom 1 Overview & Goals This presentation continues the PHY Link & Auto Negotiation topic from the technical feasibility presentation

More information

IT Deployment Guide AT-OMNI-512 AT-OMNI-521 AT-OMNI-111 AT-OMNI-112 AT-OMNI-121 AT-OMNI-122. Atlona Manuals OmniStream AT-OMNI-232

IT Deployment Guide AT-OMNI-512 AT-OMNI-521 AT-OMNI-111 AT-OMNI-112 AT-OMNI-121 AT-OMNI-122. Atlona Manuals OmniStream AT-OMNI-232 IT Deployment Guide AT-OMNI-111 AT-OMNI-121 AT-OMNI-512 AT-OMNI-521 AT-OMNI-232 Atlona Manuals OmniStream Version Information Version Release Date Notes 1 08/17 Initial release 2 11/17 Added language to

More information

802.3bj FEC Overview and Status. 1x400G vs 4x100G FEC Implications DRAFT. IEEE P802.3bs 400 Gb/s Ethernet Task Force. Bill Wilkie Xilinx

802.3bj FEC Overview and Status. 1x400G vs 4x100G FEC Implications DRAFT. IEEE P802.3bs 400 Gb/s Ethernet Task Force. Bill Wilkie Xilinx 802.3bj FEC Overview and Status 1x400G vs 4x100G FEC Implications DRAFT IEEE P802.3bs 400 Gb/s Ethernet Task Force July 2015 Hawaii Bill Wilkie Xilinx Introduction This presentation takes a look at the

More information

Lecture / The Data Link Layer: Framing and Error Detection

Lecture / The Data Link Layer: Framing and Error Detection Lecture 2 6.263/16.37 The Data Link Layer: Framing and Error Detection MIT, LIDS Slide 1 Data Link Layer (DLC) Responsible for reliable transmission of packets over a link Framing: Determine the start

More information

Department of Computer and IT Engineering University of Kurdistan. Data Communication Netwotks (Graduate level) Data Link Layer

Department of Computer and IT Engineering University of Kurdistan. Data Communication Netwotks (Graduate level) Data Link Layer Department of Computer and IT Engineering University of Kurdistan Data Communication Netwotks (Graduate level) Data Link Layer By: Dr. Alireza Abdollahpouri Data Link Layer 2 Data Link Layer Application

More information

Chapter 3 Packet Switching

Chapter 3 Packet Switching Chapter 3 Packet Switching Self-learning bridges: Bridge maintains a forwarding table with each entry contains the destination MAC address and the output port, together with a TTL for this entry Destination

More information

Networking Link Layer

Networking Link Layer Networking Link Layer ECE 650 Systems Programming & Engineering Duke University, Spring 2018 (Link Layer Protocol material based on CS 356 slides) TCP/IP Model 2 Layer 1 & 2 Layer 1: Physical Layer Encoding

More information

Lecture 9: Bridging. CSE 123: Computer Networks Alex C. Snoeren

Lecture 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 information

SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY COMPUTER NETWORKS UNIT - II DATA LINK LAYER

SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY COMPUTER NETWORKS UNIT - II DATA LINK LAYER SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY COMPUTER NETWORKS UNIT - II DATA LINK LAYER 1. What are the responsibilities of data link layer? Specific responsibilities of

More information

802.3bn Link Ad Hoc. Meeting Notes & Baseline

802.3bn Link Ad Hoc. Meeting Notes & Baseline 802.3bn Link Ad Hoc Meeting Notes & Baseline 1 Agenda, Notes 2/14/13 Conference Call at 9am 10am IEEE Patent Policy Reviewed Attendance Taken See slide Downstream Transport discussion If we have an isolated

More information

Media Access Control (MAC) Sub-layer and Ethernet

Media Access Control (MAC) Sub-layer and Ethernet Media Access Control (MAC) Sub-layer and Ethernet Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF MAC Sub-layer The MAC sub-layer is a sub-layer

More information

MCPC IN EPOC. Ryan Hirth, Glen Kramer

MCPC IN EPOC. Ryan Hirth, Glen Kramer MCPC IN EPOC Ryan Hirth, Glen Kramer 1 HOW TO MAP BITS TO TQ? TQ is 16ns The bits per TQ will vary based on FEC and rate. The 10G EPON MAC operates at 10Gbps REPORT frames Report queue lengths are at 20Bytes

More information

Chapter 3. The Data Link Layer. Wesam A. Hatamleh

Chapter 3. The Data Link Layer. Wesam A. Hatamleh Chapter 3 The Data Link Layer The Data Link Layer Data Link Layer Design Issues Error Detection and Correction Elementary Data Link Protocols Sliding Window Protocols Example Data Link Protocols The Data

More information

Links Reading: Chapter 2. Goals of Todayʼs Lecture. Message, Segment, Packet, and Frame

Links 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 information

FEC performance on multi-part links

FEC performance on multi-part links FEC performance on multi-part links Pete Anslow, Ciena IEEE P802.3bs Task Force, San Antonio TX, November 2014 1 Introduction * When analysing the performance of 400GbE FEC encoded links, two of the aspects

More information

Outline Computer Networking. Functionality Split. Transport Protocols

Outline Computer Networking. Functionality Split. Transport Protocols Outline 15-441 15 441 Computer Networking 15-641 Lecture 10: Transport Protocols Justine Sherry Peter Steenkiste Fall 2017 www.cs.cmu.edu/~prs/15 441 F17 Transport introduction TCP connection establishment

More information

Ethernet Hub. Campus Network Design. Hubs. Sending and receiving Ethernet frames via a hub

Ethernet Hub. Campus Network Design. Hubs. Sending and receiving Ethernet frames via a hub Campus Network Design Thana Hongsuwan Ethernet Hub 2003, Cisco Systems, Inc. All rights reserved. 1-1 2003, Cisco Systems, Inc. All rights reserved. BCMSN v2.0 1-2 Sending and receiving Ethernet frames

More information

The Frozen Mountain irtc White Paper Series

The Frozen Mountain irtc White Paper Series The Frozen Mountain irtc White Paper Series This white paper is the fourth in a series on Internet Based Real Time Communications (irtc) written by Frozen Mountain Software s CTO Anton Venema. The complete

More information

Chapter 6 Digital Data Communications Techniques

Chapter 6 Digital Data Communications Techniques Chapter 6 Digital Data Communications Techniques Asynchronous and Synchronous Transmission timing problems require a mechanism to synchronize the transmitter and receiver receiver samples stream at bit

More information

Resource Sharing or Designing Access Network For Low Cost.

Resource Sharing or Designing Access Network For Low Cost. Resource Sharing or Designing Access Network For Low Cost www.broadcom.com Traffic Percentile What Drives Demand for Bandwidth? Usage In North America, the median usage is 4 GB per month, while the mean

More information

Homework 1. Question 1 - Layering. CSCI 1680 Computer Networks Fonseca

Homework 1. Question 1 - Layering. CSCI 1680 Computer Networks Fonseca CSCI 1680 Computer Networks Fonseca Homework 1 Due: 27 September 2012, 4pm Question 1 - Layering a. Why are networked systems layered? What are the advantages of layering? Are there any disadvantages?

More information

CS/ECE 438: Communication Networks for Computers Spring 2018 Midterm Examination Online

CS/ECE 438: Communication Networks for Computers Spring 2018 Midterm Examination Online 1 CS/ECE 438: Communication Networks for Computers Spring 2018 Midterm Examination Online Solutions 1. General Networking a. In traditional client-server communication using TCP, a new socket is created.

More information

A Framework for Memory Hierarchies

A Framework for Memory Hierarchies Associativity schemes Scheme Number of sets Blocks per set Direct mapped Number of blocks in cache 1 Set associative Blocks in cache / Associativity Associativity (2-8) Fully associative 1 Number Blocks

More information

Cell Switching (ATM) Commonly transmitted over SONET other physical layers possible. Variable vs Fixed-Length Packets

Cell Switching (ATM) Commonly transmitted over SONET other physical layers possible. Variable vs Fixed-Length Packets Cell Switching (ATM) Connection-oriented packet-switched network Used in both WAN and LAN settings Signaling (connection setup) Protocol: Q2931 Specified by ATM forum Packets are called cells 5-byte header

More information

ATM Technology in Detail. Objectives. Presentation Outline

ATM Technology in Detail. Objectives. Presentation Outline ATM Technology in Detail Professor Richard Harris Objectives You should be able to: Discuss the ATM protocol stack Identify the different layers and their purpose Explain the ATM Adaptation Layer Discuss

More information

COMPUTER NETWORKS UNIT I. 1. What are the three criteria necessary for an effective and efficient networks?

COMPUTER NETWORKS UNIT I. 1. What are the three criteria necessary for an effective and efficient networks? Question Bank COMPUTER NETWORKS Short answer type questions. UNIT I 1. What are the three criteria necessary for an effective and efficient networks? The most important criteria are performance, reliability

More information

Addresses in the source program are generally symbolic. A compiler will typically bind these symbolic addresses to re-locatable addresses.

Addresses in the source program are generally symbolic. A compiler will typically bind these symbolic addresses to re-locatable addresses. 1 Memory Management Address Binding The normal procedures is to select one of the processes in the input queue and to load that process into memory. As the process executed, it accesses instructions and

More information

Generic Architecture. EECS 122: Introduction to Computer Networks Switch and Router Architectures. Shared Memory (1 st Generation) Today s Lecture

Generic Architecture. EECS 122: Introduction to Computer Networks Switch and Router Architectures. Shared Memory (1 st Generation) Today s Lecture Generic Architecture EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California,

More information

CS455: Introduction to Distributed Systems [Spring 2018] Dept. Of Computer Science, Colorado State University

CS455: Introduction to Distributed Systems [Spring 2018] Dept. Of Computer Science, Colorado State University CS 455: INTRODUCTION TO DISTRIBUTED SYSTEMS [NETWORKING] Shrideep Pallickara Computer Science Colorado State University Frequently asked questions from the previous class survey Why not spawn processes

More information

Wireless Networks (CSC-7602) Lecture 8 (22 Oct. 2007) Seung-Jong Park (Jay) Fair Queueing

Wireless Networks (CSC-7602) Lecture 8 (22 Oct. 2007) Seung-Jong Park (Jay)  Fair Queueing Wireless Networks (CSC-7602) Lecture 8 (22 Oct. 2007) Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark Fair Queueing 2 Today Wireline Queue Drop Wireless Queue Drop 3 Types of Congestion Control Strategies

More information

Lecture 2: Links and Signaling

Lecture 2: Links and Signaling Lecture 2: Links and Signaling CSE 123: Computer Networks Alex C. Snoeren DISCUSSION @7pm Tomorrow Our Problem Communications is complicated Modulation and encoding bits Splitting sequences of bits into

More information

Adaptors Communicating. Link Layer: Introduction. Parity Checking. Error Detection. Multiple Access Links and Protocols

Adaptors Communicating. Link Layer: Introduction. Parity Checking. Error Detection. Multiple Access Links and Protocols Link Layer: Introduction daptors ommunicating hosts and routers are nodes links connect nodes wired links wireless links layer-2 packet is a frame, encapsulates datagram datagram controller sending host

More information

Viterbi Decoder Block Decoding - Trellis Termination and Tail Biting Authors: Bill Wilkie and Beth Cowie

Viterbi Decoder Block Decoding - Trellis Termination and Tail Biting Authors: Bill Wilkie and Beth Cowie Application Note: All Virtex and Spartan FPGA Families XAPP551 (1.0) February 14, 2005 R Viterbi Decoder Block Decoding - Trellis Termination and Tail Biting Authors: Bill Wilkie and Beth Cowie Summary

More information

Fault Tolerance & Reliability CDA Chapter 2 Additional Interesting Codes

Fault Tolerance & Reliability CDA Chapter 2 Additional Interesting Codes Fault Tolerance & Reliability CDA 5140 Chapter 2 Additional Interesting Codes m-out-of-n codes - each binary code word has m ones in a length n non-systematic codeword - used for unidirectional errors

More information

2 Network Basics. types of communication service. how communication services are implemented. network performance measures. switching.

2 Network Basics. types of communication service. how communication services are implemented. network performance measures. switching. 2 Network Basics types of communication service how communication services are implemented switching multiplexing network performance measures 1 2.1 Types of service in a layered network architecture connection-oriented:

More information

Investigating the Use of Synchronized Clocks in TCP Congestion Control

Investigating the Use of Synchronized Clocks in TCP Congestion Control Investigating the Use of Synchronized Clocks in TCP Congestion Control Michele Weigle (UNC-CH) November 16-17, 2001 Univ. of Maryland Symposium The Problem TCP Reno congestion control reacts only to packet

More information

Overview. TCP & router queuing Computer Networking. TCP details. Workloads. TCP Performance. TCP Performance. Lecture 10 TCP & Routers

Overview. TCP & router queuing Computer Networking. TCP details. Workloads. TCP Performance. TCP Performance. Lecture 10 TCP & Routers Overview 15-441 Computer Networking TCP & router queuing Lecture 10 TCP & Routers TCP details Workloads Lecture 10: 09-30-2002 2 TCP Performance TCP Performance Can TCP saturate a link? Congestion control

More information

Adaptive Modulation and Coding

Adaptive Modulation and Coding Adaptive Modulation and Coding Andrea Garavaglia and Juan Montojo (Qualcomm) PAGE 1 IEEE 802.3bn San Antonio, TX 12-15 November 2012 Supported by Nicola Varanese (Qualcomm) Charaf Hanna (ST Micro) Duane

More information

CS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP

CS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP CS 5520/ECE 5590NA: Network Architecture I Spring 2008 Lecture 13: UDP and TCP Most recent lectures discussed mechanisms to make better use of the IP address space, Internet control messages, and layering

More information

CSE 461: Multiple Access Networks. This Lecture

CSE 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 information

Reminder: Datalink Functions Computer Networking. Datalink Architectures

Reminder: Datalink Functions Computer Networking. Datalink Architectures Reminder: Datalink Functions 15-441 15 441 15-641 Computer Networking Lecture 5 Media Access Control Peter Steenkiste Fall 2015 www.cs.cmu.edu/~prs/15-441-f15 Framing: encapsulating a network layer datagram

More information

Contention Protocols and Networks

Contention 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 information

Wireless USB Periodic Transfer Models. Dan Froelich Intel

Wireless USB Periodic Transfer Models. Dan Froelich Intel Wireless USB Periodic Transfer Models Dan Froelich Intel Agenda Wired Isochronous Model Overview Key Features Wireless Media Reliability Coexistence (Shared With Other Hosts And UWB Devices) Wireless USB

More information

EECS 122: Introduction to Computer Networks Switch and Router Architectures. Today s Lecture

EECS 122: Introduction to Computer Networks Switch and Router Architectures. Today s Lecture EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley,

More information

Episode 5. Scheduling and Traffic Management

Episode 5. Scheduling and Traffic Management Episode 5. Scheduling and Traffic Management Part 3 Baochun Li Department of Electrical and Computer Engineering University of Toronto Outline What is scheduling? Why do we need it? Requirements of a scheduling

More information

Packet Switching - Asynchronous Transfer Mode. Introduction. Areas for Discussion. 3.3 Cell Switching (ATM) ATM - Introduction

Packet Switching - Asynchronous Transfer Mode. Introduction. Areas for Discussion. 3.3 Cell Switching (ATM) ATM - Introduction Areas for Discussion Packet Switching - Asynchronous Transfer Mode 3.3 Cell Switching (ATM) Introduction Cells Joseph Spring School of Computer Science BSc - Computer Network Protocols & Arch s Based on

More information

Fair Queueing. Presented by Brighten Godfrey. Slides thanks to Ion Stoica (UC Berkeley) with slight adaptation by Brighten Godfrey

Fair Queueing. Presented by Brighten Godfrey. Slides thanks to Ion Stoica (UC Berkeley) with slight adaptation by Brighten Godfrey Fair Queueing Presented by Brighten Godfrey Slides thanks to Ion Stoica (UC Berkeley) with slight adaptation by Brighten Godfrey Traditional queueing Traditional Internet - Congestion control mechanisms

More information

ET3110 Networking and Communications UNIT 2: Communication Techniques and Data Link Control Protocol skong@itt-tech.edutech.edu Learning Objectives Identify methods of detecting errors. Use Hamming code

More information

SYSTEM UPGRADE, INC Making Good Computers Better. System Upgrade Teaches RAID

SYSTEM UPGRADE, INC Making Good Computers Better. System Upgrade Teaches RAID System Upgrade Teaches RAID In the growing computer industry we often find it difficult to keep track of the everyday changes in technology. At System Upgrade, Inc it is our goal and mission to provide

More information

Introduction to Data Communications & Networking

Introduction to Data Communications & Networking Introduction to Data Communications & Networking Data Link Layer (Set 5) Chapter 10 and Chapter 11 Dr. Ali Maqousi, Dr. Tatiana Balikhina amaqousi@uop.edu.jo, tbalikhina@uop.edu.jo Department of Computer

More information

4.3 IEEE Physical Layer IEEE IEEE b IEEE a IEEE g IEEE n IEEE 802.

4.3 IEEE Physical Layer IEEE IEEE b IEEE a IEEE g IEEE n IEEE 802. 4.3 IEEE 802.11 Physical Layer 4.3.1 IEEE 802.11 4.3.2 IEEE 802.11b 4.3.3 IEEE 802.11a 4.3.4 IEEE 802.11g 4.3.5 IEEE 802.11n 4.3.6 IEEE 802.11ac,ad Andreas Könsgen Summer Term 2012 4.3.3 IEEE 802.11a Data

More information

Forward Error Correction Using Reed-Solomon Codes

Forward Error Correction Using Reed-Solomon Codes Exercise 5 Forward Error Correction Using Reed-Solomon Codes EXERCISE OBJECTIVE When you have completed this exercise, you will be familiar with the concept of forward error correction (FEC). You will

More information

Advanced Computer Networks. Rab Nawaz Jadoon DCS. Assistant Professor COMSATS University, Lahore Pakistan. Department of Computer Science

Advanced Computer Networks. Rab Nawaz Jadoon DCS. Assistant Professor COMSATS University, Lahore Pakistan. Department of Computer Science Advanced Computer Networks Department of Computer Science DCS COMSATS Institute of Information Technology Rab Nawaz Jadoon Assistant Professor COMSATS University, Lahore Pakistan Advanced Computer Networks

More information

JPEG decoding using end of block markers to concurrently partition channels on a GPU. Patrick Chieppe (u ) Supervisor: Dr.

JPEG decoding using end of block markers to concurrently partition channels on a GPU. Patrick Chieppe (u ) Supervisor: Dr. JPEG decoding using end of block markers to concurrently partition channels on a GPU Patrick Chieppe (u5333226) Supervisor: Dr. Eric McCreath JPEG Lossy compression Widespread image format Introduction

More information

CS 640 Lecture 4: 09/11/2014

CS 640 Lecture 4: 09/11/2014 CS 640 Lecture 4: 09/11/2014 A) Bandwidth-delay product B) Link layer intro C) Encoding, Framing, Error Detection D) Multiple access Ethernet A. Bandwidth-delay product This in the above example is C *

More information

The Controlled Delay (CoDel) AQM Approach to fighting bufferbloat

The Controlled Delay (CoDel) AQM Approach to fighting bufferbloat The Controlled Delay (CoDel) AQM Approach to fighting bufferbloat BITAG TWG Boulder, CO February 27, 2013 Kathleen Nichols Van Jacobson Background The persistently full buffer problem, now called bufferbloat,

More information

BROADBAND AND HIGH SPEED NETWORKS

BROADBAND AND HIGH SPEED NETWORKS BROADBAND AND HIGH SEED NETWORKS LAYERS The function and associated information of the planes is as follows: The reference model is composed of the following planes: Control lane manages the call and connection.

More information

Your favorite blog :www.vijay-jotani.weebly.com (popularly known as VIJAY JOTANI S BLOG..now in facebook.join ON FB VIJAY

Your favorite blog :www.vijay-jotani.weebly.com (popularly known as VIJAY JOTANI S BLOG..now in facebook.join ON FB VIJAY VISIT: Course Code : MCS-042 Course Title : Data Communication and Computer Network Assignment Number : MCA (4)/042/Assign/2014-15 Maximum Marks : 100 Weightage : 25% Last Dates for Submission : 15 th

More information

Ultra-Low Latency Shaper

Ultra-Low Latency Shaper Ultra-Low Latency Shaper Christian Boiger christian.boiger@fh-deggendorf.de IEEE 802 Plenary July 2011 San Francisco, CA 1 Why Is a Ultra-Low Latency Class Necessary? Current priority of traffic classes

More information

Cache Memory COE 403. Computer Architecture Prof. Muhamed Mudawar. Computer Engineering Department King Fahd University of Petroleum and Minerals

Cache Memory COE 403. Computer Architecture Prof. Muhamed Mudawar. Computer Engineering Department King Fahd University of Petroleum and Minerals Cache Memory COE 403 Computer Architecture Prof. Muhamed Mudawar Computer Engineering Department King Fahd University of Petroleum and Minerals Presentation Outline The Need for Cache Memory The Basics

More information

CS3350B Computer Architecture

CS3350B Computer Architecture CS335B Computer Architecture Winter 25 Lecture 32: Exploiting Memory Hierarchy: How? Marc Moreno Maza wwwcsduwoca/courses/cs335b [Adapted from lectures on Computer Organization and Design, Patterson &

More information

Module 6 STILL IMAGE COMPRESSION STANDARDS

Module 6 STILL IMAGE COMPRESSION STANDARDS Module 6 STILL IMAGE COMPRESSION STANDARDS Lesson 19 JPEG-2000 Error Resiliency Instructional Objectives At the end of this lesson, the students should be able to: 1. Name two different types of lossy

More information

Priority Traffic CSCD 433/533. Advanced Networks Spring Lecture 21 Congestion Control and Queuing Strategies

Priority Traffic CSCD 433/533. Advanced Networks Spring Lecture 21 Congestion Control and Queuing Strategies CSCD 433/533 Priority Traffic Advanced Networks Spring 2016 Lecture 21 Congestion Control and Queuing Strategies 1 Topics Congestion Control and Resource Allocation Flows Types of Mechanisms Evaluation

More information

CMSC 417. Computer Networks Prof. Ashok K Agrawala Ashok Agrawala. October 11, 2018

CMSC 417. Computer Networks Prof. Ashok K Agrawala Ashok Agrawala. October 11, 2018 CMSC 417 Computer Networks Prof. Ashok K Agrawala 2018 Ashok Agrawala Message, Segment, Packet, and Frame host host HTTP HTTP message HTTP TCP TCP segment TCP router router IP IP packet IP IP packet IP

More information

Outline Computer Networking. TCP slow start. TCP modeling. TCP details AIMD. Congestion Avoidance. Lecture 18 TCP Performance Peter Steenkiste

Outline Computer Networking. TCP slow start. TCP modeling. TCP details AIMD. Congestion Avoidance. Lecture 18 TCP Performance Peter Steenkiste Outline 15-441 Computer Networking Lecture 18 TCP Performance Peter Steenkiste Fall 2010 www.cs.cmu.edu/~prs/15-441-f10 TCP congestion avoidance TCP slow start TCP modeling TCP details 2 AIMD Distributed,

More information

Interlaken Look-Aside Protocol Definition

Interlaken Look-Aside Protocol Definition Interlaken Look-Aside Protocol Definition Contents Terms and Conditions This document has been developed with input from a variety of companies, including members of the Interlaken Alliance, all of which

More information

Computer Networks. Sándor Laki ELTE-Ericsson Communication Networks Laboratory

Computer Networks. Sándor Laki ELTE-Ericsson Communication Networks Laboratory Computer Networks Sándor Laki ELTE-Ericsson Communication Networks Laboratory ELTE FI Department Of Information Systems lakis@elte.hu http://lakis.web.elte.hu Based on the slides of Laurent Vanbever. Further

More information

Course 10: Interfaces Agenda

Course 10: Interfaces Agenda Course 10: Interfaces 1 Agenda Introduction V.24 interface (RS232) USB 2 Introduction 3 Definition(s) (from the web) A boundary across which two independent systems meet and act on or communicate with

More information

Reliable Transport I: Concepts and TCP Protocol

Reliable Transport I: Concepts and TCP Protocol Reliable Transport I: Concepts and TCP Protocol Brad Karp UCL Computer Science CS 3035/GZ01 29 th October 2013 Part I: Transport Concepts Layering context Transport goals Transport mechanisms 2 Context:

More information

You submitted this homework on Sat 22 Mar :51 AM PDT. You got a score of 5.00 out of 5.00.

You submitted this homework on Sat 22 Mar :51 AM PDT. You got a score of 5.00 out of 5.00. Feedback Homework 9 Help You submitted this homework on Sat 22 Mar 2014 5:51 AM PDT. You got a score of 5.00 out of 5.00. Question 1 Lecture 9-1 discussed the quality of service requirements for different

More information

FAIRNESS CONSIDERATIONS FOR PLCA EXAMPLE MICROPHONE USE CASE. Dr. Kirsten Matheus

FAIRNESS CONSIDERATIONS FOR PLCA EXAMPLE MICROPHONE USE CASE. Dr. Kirsten Matheus FAIRNESS CONSIDERATIONS FOR PLCA EXAMPLE MICROPHONE USE CASE Dr. Kirsten Matheus CONTENT Problem description Data rates Worst case delay Solution space Summary Fairness in PLCA, Kirsten Matheus, BMW Page

More information

EECS 122: Introduction to Communication Networks Final Exam Solutions

EECS 122: Introduction to Communication Networks Final Exam Solutions EECS 22: Introduction to Communication Networks Final Exam Solutions Problem. (6 points) How long does it take for a 3000-byte IP packet to go from host A to host B in the figure below. Assume the overhead

More information

UNIT-II 1. Discuss the issues in the data link layer. Answer:

UNIT-II 1. Discuss the issues in the data link layer. Answer: UNIT-II 1. Discuss the issues in the data link layer. Answer: Data Link Layer Design Issues: The data link layer has a number of specific functions it can carry out. These functions include 1. Providing

More information

ECE 598HH: Special Topics in Wireless Networks and Mobile Systems

ECE 598HH: Special Topics in Wireless Networks and Mobile Systems ECE 598HH: Special Topics in Wireless Networks and Mobile Systems Lecture 21: Opportunistic Routing Haitham Hassanieh *These slides are courtesy of Dina Katabi 1 Lecture Outline Single Path Routing Opportunistic

More information

Adaptors Communicating. Link Layer: Introduction. Parity Checking. Error Detection. Multiple Access Links and Protocols

Adaptors Communicating. Link Layer: Introduction. Parity Checking. Error Detection. Multiple Access Links and Protocols Link Layer: Introduction daptors ommunicating Terminology: hosts and routers are nodes communication channels that connect adjacent nodes along communication path are links wired links wireless links LNs

More information

Chapter 4: Memory Management. Part 1: Mechanisms for Managing Memory

Chapter 4: Memory Management. Part 1: Mechanisms for Managing Memory Chapter 4: Memory Management Part 1: Mechanisms for Managing Memory Memory management Basic memory management Swapping Virtual memory Page replacement algorithms Modeling page replacement algorithms Design

More information

Lecture 10: Link layer multicast. Mythili Vutukuru CS 653 Spring 2014 Feb 6, Thursday

Lecture 10: Link layer multicast. Mythili Vutukuru CS 653 Spring 2014 Feb 6, Thursday Lecture 10: Link layer multicast Mythili Vutukuru CS 653 Spring 2014 Feb 6, Thursday Unicast and broadcast Usually, link layer is used to send data over a single hop between source and destination. This

More information

CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca

CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti Administrivia Homework I out later today, due next Thursday Today: Link Layer (cont.)

More information

Memory Allocation. Copyright : University of Illinois CS 241 Staff 1

Memory Allocation. Copyright : University of Illinois CS 241 Staff 1 Memory Allocation Copyright : University of Illinois CS 241 Staff 1 Memory allocation within a process What happens when you declare a variable? Allocating a page for every variable wouldn t be efficient

More information

1/29/2008. From Signals to Packets. Lecture 6 Datalink Framing, Switching. Datalink Functions. Datalink Lectures. Character and Bit Stuffing.

1/29/2008. From Signals to Packets. Lecture 6 Datalink Framing, Switching. Datalink Functions. Datalink Lectures. Character and Bit Stuffing. /9/008 From Signals to Packets Lecture Datalink Framing, Switching Peter Steenkiste Departments of Computer Science and Electrical and Computer Engineering Carnegie Mellon University Analog Signal Digital

More information

CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca

CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Janno< Administrivia Homework I out later today, due next Thursday, Sep 25th Today: Link Layer

More information

Memory Management Virtual Memory

Memory Management Virtual Memory Memory Management Virtual Memory Part of A3 course (by Theo Schouten) Biniam Gebremichael http://www.cs.ru.nl/~biniam/ Office: A6004 April 4 2005 Content Virtual memory Definition Advantage and challenges

More information

Computer Network. Direct Link Networks Reliable Transmission. rev /2/2004 1

Computer Network. Direct Link Networks Reliable Transmission. rev /2/2004 1 Computer Network Direct Link Networks Reliable Transmission rev 1.01 24/2/2004 1 Outline Direct link networks (Ch. 2) Encoding Framing Error detection Reliable delivery Media access control Network Adapter

More information

Lecture 4: CRC & Reliable Transmission. Lecture 4 Overview. Checksum review. CRC toward a better EDC. Reliable Transmission

Lecture 4: CRC & Reliable Transmission. Lecture 4 Overview. Checksum review. CRC toward a better EDC. Reliable Transmission 1 Lecture 4: CRC & Reliable Transmission CSE 123: Computer Networks Chris Kanich Quiz 1: Tuesday July 5th Lecture 4: CRC & Reliable Transmission Lecture 4 Overview CRC toward a better EDC Reliable Transmission

More information

Slide Set 9. for ENCM 369 Winter 2018 Section 01. Steve Norman, PhD, PEng

Slide Set 9. for ENCM 369 Winter 2018 Section 01. Steve Norman, PhD, PEng Slide Set 9 for ENCM 369 Winter 2018 Section 01 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary March 2018 ENCM 369 Winter 2018 Section 01

More information

Memory. Objectives. Introduction. 6.2 Types of Memory

Memory. Objectives. Introduction. 6.2 Types of Memory Memory Objectives Master the concepts of hierarchical memory organization. Understand how each level of memory contributes to system performance, and how the performance is measured. Master the concepts

More information

Header Compression for TLV-based Packets

Header Compression for TLV-based Packets Header Compression for TLV-based Packets Marc Mosko Nov 5, 2015 Copyright Palo Alto Research Center, 2015 1 Header Compression in TLV World Compress all the signaling Fixed Header T and L fields V fields

More information

fleximac A MICROSEQUENCER FOR FLEXIBLE PROTOCOL PROCESSING

fleximac A MICROSEQUENCER FOR FLEXIBLE PROTOCOL PROCESSING fleximac A MICROSEQUENCER FOR FLEXIBLE PROTOCOL PROCESSING A Lattice Semiconductor White Paper February 2006 Lattice Semiconductor 5555 Northeast Moore Ct. Hillsboro, Oregon 97124 USA Telephone: (503)

More information

CS 123: Lecture 12, LANs, and Ethernet. George Varghese. October 24, 2006

CS 123: Lecture 12, LANs, and Ethernet. George Varghese. October 24, 2006 CS 123: Lecture 12, LANs, and Ethernet George Varghese October 24, 2006 Selective Reject Modulus failure Example w = 2, Max = 3 0 0 1 3 0 A(1) A(2) 1 0 retransmit A(1) A(2) buffer Case 1 Case 2 reject

More information