Review of Networking Principles #2frost/Access_Technologies_Course/Class_Notes-Sp0… · Jim Kurose, Keith Ross Addison-Wesley, July 2002. #2 11 Layering: logical communication application

#2 1

Victor S. FrostDan F. Servey Distinguished Professor

Electrical Engineering and Computer ScienceUniversity of Kansas2335 Irving Hill Dr.

Lawrence, Kansas 66045Phone: (785) 864-4833 FAX:(785) 864-7789

e-mail: [email protected]://www.ittc.ku.edu/

Review of Networking Principles#2

All material copyright 2006Victor S. Frost, All Rights Reserved

#2 2

Review of Networking Principles

• Who is communicating?• What is being communicated?• How are network functions

structured?• What is the architecture of the

Internet?• What is being shared?

#2 3

Who is Communicating

• Internet

Source: Pew Internet & American Life Project, February 15 – April 6, 2006 Tracking

Survey. N=4,001 adults, 18 and older. Margin of error is ±2% for results based on

the full sample and ±2% for results based on internet users.

Please note that prior to our January 2005 survey, the question used to identify internet users read,

“Do you ever go online to access the Internet or World Wide Web or to send and receive email?” The current

two-part question wordingreads, “Do you use the internet, at least occasionally? and

“Do you send or receive email, at least occasionally?”Last updated April 26, 2006.

#2 4

Who is Communicating

47%20%MP3 Player

32%30%Laptop

45%73%Cell Phone

TeenAdult

From: Lee Rainie Director, Pew Internet & American Life Project 5/9/06 How the Internet is Changing Consumer Behavior and Expectations Speech to SOCAP Symposium (Society of Consumer Affairs Professionals in Business)

#2 5

What is being Communicated• Entertainment

– Music– Video

• Rea-time• Non Real-time

– Games• Speech• Information

– News– Stock quotes– Education/Training– Product information– Job search– Health information– Government information

• Transactions– Customer-to-Business

• On-line banking• Purchase

products/services– Business-to-Business

• Transducer data– Temperature– Motion– Other…..

• Scientific data

#2 6

What is being CommunicatedSource: Pew Internet & American Life Project Tracking surveys

(March 2000 – April 2006). Please note that thewording for some items has been abbreviated. For full question

wording, please refer to the questionnaire.*Prior to January 2005, item wording was slightly different for the

items marked with an asterisk. questionnaires for question wording changes.

**Percentage of internet users who do these activities on a typical day is less than 1%

Last updated: April 26, 2006 – Daily Internet Activities were not asked in the January 2006 or May-June 2005

Tracking Survey.

From: Lee Rainie Director, Pew Internet & American Life Project 5/9/06 How the Internet is Changing Consumer Behavior and

Expectations Speech to SOCAP Symposium (Society of Consumer Affairs Professionals in Business)

#2 7

Where are the communicating end-points

• Homes• Offices• Vehicles

– Cars– Trucks

• Trains• Planes• Laboratories• In the field

From: John B. Horrigan, BROADBAND ADOPTION AT HOME IN THE UNITED STATES:GROWING BUT SLOWING, 33rd Annual TELECOMMUNICATIONS POLICY RESEARCH CONFERENCE September 24, 2005

#2 8

Networking Basics :Information Flow

InternetAccessMedia

Information Flow

#2 9

Network architectures and the Reference Models

• Open systems are build upon a Layered Architecture of the network

• Layered Architecture is the “structuring”of network functions

• Reference models provide:– A conceptual framework to characterize

networks– A mechanism to control/describe the

complexity of networks– Required for open systems

#2 10

Internet protocol stack• application: supporting network

applications– FTP, SMTP, STTP

• transport: host-host data transfer– TCP, UDP

• network: routing of datagrams from source to destination– IP, routing protocols

• link: data transfer between neighboring network elements– PPP, Ethernet

• physical: bits “on the wire”

application

transport

network

link

physical

From: Computer Networking: A Top Down Approach Featuring the Internet, 2nd edition. Jim Kurose, Keith Ross Addison-Wesley, July 2002.

#2 11

Layering: logical communication

applicationtransportnetwork

linkphysical


linkphysical application

transportnetwork

linkphysical


linkphysical

networklink

physical

E.g.: transport• take data from app• add addressing,

reliability check info to form “datagram”

• send datagram to peer

• wait for peer to ack receipt

• analogy: post office

transport

transport


#2 12

Layering: physical communication


linkphysical


linkphysical


linkphysical


linkphysical

networklink

physical

data

data


#2 13

Protocol layering and data

Each layer takes data from above• adds header information to create new data unit• passes new data unit to layer below


linkphysical


linkphysical

source destinationMMMM

Ht

HtHnHtHnHl

MMMM

Ht

HtHnHtHnHl

messagesegmentdatagramframe


#2 14

3 2 11 22 1

3 2 11 22 1

21

Medium

3 2 11 221 2 1

21

2 134 1 2 3 4

End System1

End System2

Network1

2

Physical layer entity

Data link layer entity 3 Network layer entity

3 Network layer entity

Transport layer entity4

Modified from: Leon-Garcia & Widjaja: Communication Networks

Router

End-to-End System

#2 15

Layering for the Access Network

• Physical Layer– Responsible for the media interface,

e.g., radio interface, powerline or optical– Characterized by – Capacity in b/s

• Quality in bit error rate

#2 16

Layering for the Access Network

• Data Link Layer– Medium Access Control (MAC) sublayer

• Controls transmissions on the physical layer– Link access control (LAC)

• Manages the logical link

#2 17

Segmentation and Reassembly

• Segmentation Often lower layers breakup packets into smaller elements add overhead to the smaller elements for transmission

• Reassembly combines smaller elements to form packet

#2 18

Segmentation and Reassembly• Example:

Hs

MH tH n Higher Layer Packet

MH tH n HL2

Link LayerHL2=Link Layer OverheadHs=Segment OverheadHMac= MAC Overhead

Hs Hs

Hs HMAC Hs HMAC Hs HMAC

Segm

enta

tion

Reas

sem

bly

#2 19

Segmentation and Reassembly• Specific Example:

Hs

MH tH n Higher Layer Packet

MH tH n HL2Radio ControlHRLC=Link Layer OverheadHs=RLC OverheadHMac= MAC OverheadHs Hs

Hs HMAC Hs HMAC Hs HMAC

#2 20

What’s the Internet: “nuts and bolts” view• millions of connected

computing devices: hosts, end-systems– PCs workstations, servers– PDAs phones, toastersrunning network apps

• communication links– fiber, copper, radio,

satellite– transmission rate =

bandwidth• routers: forward packets

(chunks of data)

local ISP

companynetwork

regional ISP

router workstationserver mobile

From: Computer Networking: A Top Down Approach Featuring the Internet, 2nd edition. Jim Kurose, Keith RossAddison-Wesley, July 2002.

#2 21

Architecture of the Internet

From: Computer Networks, A. S. Tannenbaum, 4th Ed, Prentice Hall, 2003

e.g., Sprint or ATT

or cable system

Voice, Image, Data, Video

e.g., Sprint or ATT

#2 22

Tier-1 ISP: e.g., Sprint

Sprint US backbone network


#2 23

Internet structure: network of networks

• “Tier-2” ISPs: smaller (often regional) ISPs– Connect to one or more tier-1 ISPs, possibly other

tier-2 ISPs

Tier 1 ISP

Tier 1 ISP

Tier 1 ISP

NAP

Tier-2 ISPTier-2 ISP

Tier-2 ISP Tier-2 ISP

Tier-2 ISP

Tier-2 ISP pays tier-1 ISP for connectivity to rest of Internet

tier-2 ISP is customer oftier-1 provider

Tier-2 ISPs also peer privately with each other, interconnect at NAP


#2 24


• “Tier-3” ISPs and local ISPs – last hop (“access”) network (closest to end systems)

Tier 1 ISP

Tier 1 ISP

Tier 1 ISP

NAP



Tier-2 ISP

localISPlocal

ISPlocalISP

localISP

localISP Tier 3

ISP

localISP

localISP

localISP

Local and tier-3 ISPs are customers ofhigher tier ISPsconnecting them to rest of Internet


#2 25


• a packet passes through many networks

Tier 1 ISP

Tier 1 ISP

Tier 1 ISP

NAP



Tier-2 ISP

localISPlocal

ISPlocalISP

localISP

localISP Tier 3

ISP

localISP

localISP

localISP


#2 26

What is being shared?

• There are shared resources in access networks

• Sharing implies some form of access coordination

• Coordination must be based on some perception of the state on the “system”– Which nodes have packets to send?– Do nodes have a common clock?– Is a wireless node in a deep fade?

• In general the more state information the nodes have the more efficient the sharing

#2 27

Duplexing

• Transmit and receive information flows also share the physical connection.

• Half Duplex-transmit and then receive

• Full Duplex-transmit and receive at the same time, split physical connection into a– Transmit resources– Receive resources

#2 28

Downstream and Upstream

• Upstream and downstream can use different access technologies

• All information flows from the node go toward the Internet

• All information flows destine for the nodes come from the Internet InternetInternet

#2 29

What is being shared?

• On the physical connection: resources– Time– Frequency– Transmit Power/Code– Space

• System elements resources– Buffer– Processing

#2 30

FDMA and TDMA

FDMA= Frequency Division Multiple Access

frequency

timeTDMA= Time Division Multiple Access

frequency

4 usersExample:


time

Channel

Time SlotFrame

#2 31

FDMA• For N nodes and total Bandwidth = BT

– Bandwidth per user = BT/N• FDM must have guard bands between channels

wastes resources• Frequency Division Duplexing (FDD)

– Downstream on one channel– Upstream on another channel

Frequency

Guard bands

Time

W

12

MM–1

…


#2 32

TDMA• Peak transmission rate = R• Each station transmits at R bps for 1/M of the time• Frames must have bit patterns to indicate “start of frame”

or have a guard time account propagation delayswastes resources

• Time Division Duplexing (TDD)– Downstream on one time slot– Upstream on another time slot

• Stations must be synchronized to common clock

1

Time

Guard time

One cycle

12 3 MW

Frequency

...


#2 33

Sharing Power:Code Division Multiple Access

• Each bit in original signal is represented by multiple symbols in the transmitted signal, these symbols are called “chips”

• Coding gain = # chips/bit• The pattern of chips is called the “spreading code”• Because the chip rate >> bit rate the transmitted

signal uses more bandwidth, i.e., the signal is signal across a wider frequency band

• Spread is in direct proportion to number of chips used

• Spreading codes have special properties.

#2 34

Example

Modified from: W. Stallings, Wireless Communications & Networks, Pearson 2005

• Spreadingcode = 0110…….

• Receiver must– know the

spreading code and

– be in sync

Bit

Chip

#2 35

Channelization: CDMA• Code Division Multiple Access

– Channels determined by a code used in modulation and demodulation

• Stations transmit over entire frequency band all of the time

Time

1

2

3

W

Frequency

From: Leon-Garcia & Widjaja: Communication Networks

UsersEach with Unique code

#2 36

Property of Spreading Codes• Each channel uses a different pseudorandom code• Codes should have low cross-correlation

– If they differ in approximately half the bits the correlation between codes is close to zero and the effect at the output of each other’s receiver is small

• As number of users increases, effect of other users on a given receiver increases as additive noise– this is why this is considered sharing power

• CDMA has gradual increase in BER due to noise as number of users is increased

• Interference between channels can be eliminated is codes are selected so they are orthogonal and if receivers and transmitters are synchronized


#2 37

Example: CDMA with 3 users

• Assume three users share same medium• Users are synchronized & use different 4-bit

orthogonal codes: {-1,-1,-1,-1}, {-1, +1,-1,+1}, {-1,-1,+1,+1}, {-1,+1,+1,-1},

+1 -1 +1

User 1 x

-1 -1 +1

User 2 x

User 3 x

+1 +1 -1 SharedMedium

+

Receiver


#2 38

Channel 1: 110 -> +1+1-1 -> (-1,-1,-1,-1),(-1,-1,-1,-1),(+1,+1,+1,+1)Channel 2: 010 -> -1+1-1 -> (+1,-1,+1,-1),(-1,+1,-1,+1),(+1,-1,+1,-1)Channel 3: 001 -> -1-1+1 -> (+1,+1,-1,-1),(+1,+1,-1,-1),(-1,-1,+1,+1)Sum Signal: (+1,-1,-1,-3),(-1,+1,-3,-1),(+1,-1,+3,+1)

Channel 1

Channel 2

Channel 3

Sum Signal

Sum signal is input to receiver


#2 39

Example: Receiver for Station 2

• Each receiver takes sum signal and integrates by code sequence of desired transmitter

• Integrate over T seconds to smooth out noise

x

SharedMedium

+

Decoding signal from station 2

Integrate over T sec


#2 40

Sum Signal: (+1,-1,-1,-3),(-1,+1,-3,-1),(+1,-1,+3,+1)Channel 2 Sequence: (-1,+1,-1,+1),(-1,+1,-1,+1),(-1,+1,-1,+1)Correlator Output: (-1,-1,+1,-3),(+1,+1,+3,-1),(-1,-1,-3,+1)Integrated Output: -4, +4, -4Binary Output: 0, 1, 0

Decoding at Receiver 2

Sum Signal

Channel 2Sequence

CorrelatorOutput

IntegratorOutput

-4

+4

-4

Sum Signal

Channel 2Sequence

CorrelatorOutput

IntegratorOutput

-4

+4

-4


#2 41

Frequency Hopping Spread Spectrum

• Signal is broadcast over seemingly random series of radio frequencies– A number of channels

allocated for the FH signal– Width of each channel

corresponds to bandwidth of input signal

• Signal hops from frequency to frequency at fixed intervals– Transmitter operates in one

channel at a time– Bits are transmitted using

some encoding scheme– At each successive interval, a

new carrier frequency is selected


#2 42

Practical considerations for Spread Spectrum Systems

• Problems with orthogonal codes– There are a limited number of orthogonal codes– Obtaining synchronization for all users is complex.

• CDMA systems require synchronization– Code sync– Bit sync– Often carrier sync

• Example assumed that all signals arrive with the same power thus CDMA systems require power control– Base station monitors power from each node and send

explicit commands to increase/decrease the transmit power

#2 43

Comparison FDMA, TDMA, CDMA

Need common codeNeed common time slot

Need common frequency band

Broadcast capability

InherentNoNoResistance to multipath

Average PowerPeak PowerAverage PowerTransmit Power

EasyGraceful

Degradation

ComplexComplexEase of adding new users

CodeTime slotFrequency BandResource assigned

ContinuousNeed to wait for time slot (buffer)

ContinuousTransmission

PN codesGuard timesGuard bandsPractical consideration

Orthogonal codesNo timing errors(complex for

distributed users)

No guard bandsFor maximum resource utilization

CDMATDMAFDMACharacteristic

Modified from: B. Bing, “Broadband Wireless Access”, Kluwer Academic Press, 2000

#2 44

Other Spread Spectrum Facts

• Hybrids: Direct Sequence/Frequency hop systems

• Spread Spectrum systems were originally developed for:– Anti-jamming (AJ)– Low probability of intercept (LPI)

#2 45

Sharing Space

• Radiated power drops off as a function of distance – 1/D2 for free space– 1/Dn for other environments, e.g., k=4

for the common two-ray model• Inter-channel interference will result

if users are assigned the same frequency and are “too close”

#2 46

Sharing Space• Defining “too close” for a one dimensional case*

Following: M. Schwartz, “Mobile Wireless Communications” Cambridge Press, 2005

Desired signalMSC transmitting PT watts

on channel i

R1 Meters R2 Meters

Interfering signalMSC transmitting PT watts

on channel i

n-2

n-1

n-2T

n-1T

-n2T

-n1T

RR (SIR) Ratio ceinterferen-to-Signal

RP phone cell at received power signal gInterferinRP phone cell at received power signal Desired

RPRP phone cell at received Power Total

=

=

=

+=

SIR>Minimum threshold for proper operation

SIR>7-12 dB for GSM

power ginterferin normalizedP where

P

RSIR general In

int

int

-n

=

=∑

#2 47

Sharing Space• Example 1-d model 4-cell reuse• Total number of Channels = N• Each cell uses N/4 different channels• So three cells separating the same set of interfering

channels• Consider first tier interferes

Worst case location for cell phone using a channel from group 1

D Meters

1 2 3 4 1 2 3 41 2 3 4R Meters

dB 23SIR 3n assuming

8RD HereR)(DR)(D

R P

RSIR nn

-n

int

-n

=

==

++−== −−∑

Analysis assumes power control

#2 48

Sharing Space


Cellular systems most oftenanalyzed with an Hexagonal

pattern

#2 49

Sharing Space

• Reducing interference and increasing capacity with sectoring using directional antennas

From: T.S. Rappaport Wireless Communications Principles and Practice, 2nd Edition

#2 50

Sharing Space

• Sharing in the spatial domain– Distance– Angle

#2 51

System element resources

Packet Buffershared by all

downstream nodes

InternetInternet

Processor

Power limiteddevices

#2 52

Sharing Buffers: Statistical Multiplexing

• No Dedicated path• Address information is added to the Packet• Store if output port is busy• Trade off delay for blocking• If message is corrupted then retransmit entire

Packet

Store&

Forward

Store&

Forward

Store&

Forward

#2 53


• If packet arrives to empty system then it is transmitted at the FULL LINE RATE

• Transmission at the FULL LINE RATE is shared among the all the users

• If a packet arrives to a busy system it waits

Buffer Server

Message

)/(/)( sbrateLinkbitslengthPackettimeclockingAverageTC ==

#2 54


• Time measured from entering the queue to completion of clocking on to the link is the delay

• Load = ρ = ΤCλλ = arrival rate in packets/sec

and ΤC = L/R=time to clock packetL= Ave packet length in bits,R=line rate in b/s

• Under common assumptions:– Message lengths have a

exponential probability density function

– Interarrival times have a exponential probability density function

ρ−=

1CTDelayAverage

M/M/1 Delay

05

101520253035

0 0.2 0.4 0.6 0.8 1

Load

Del

ay

#2 55

InternetInternetPower limited

devices


One Queue perNode

Server

Algorithm Selects Node

Contention AlgorithmUsed in upstream to allocate resources

Documents

Review of Networking Principles #2frost/Access_Technologies_Course/Class_Notes-Sp0… · Jim Kurose, Keith Ross Addison-Wesley, July 2002. #2 11 Layering: logical communication application