L17 - INTERLACED MEMORY TECHNIQUE Interlace J independent...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
INTERLACED MEMORY TECHNIQUE Interlace J independent stop and wait processes in J slots- continuous if acknowledgment always returns within J slots. Each slot ideally could operate with a one 2 alternating bit sequence number, with S log J Y additional bits to identify the slot. Interlacing is ideal for J separate message streams. This is like having J TDM channels .
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
A method used in the ARPANET, prior to Internet, uses an idea similar to the interlacing method: idea called :concurrent logical channels . Allows for 8 logical ground channels or 16 logical satellite channels. Ground case - 3 bit channel no., 1 bit sequence no. per channel. 2 = 8, consistent with the 2 selective repeat 4-1 b-1 window constraint. An acknowledgment gives state of all 8 channels: Ex. 10110101 gives the expected alternating bit for each channel.
Background image of page 2
High level data link control (HDLC) Important link error control standard. Uses the 01111110 start and end flag with data field bit stuffing.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/23/2009 for the course CMPEN 362 taught by Professor Johnmetzner during the Spring '09 term at Penn State.

Page1 / 13

L17 - INTERLACED MEMORY TECHNIQUE Interlace J independent...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online