Professional Documents
Culture Documents
Communication Network
Communication networks
Switched networks
End nodes send to one (or more) end nodes
Broadcast networks
End nodes share a common channel (TV, radio)
Circuit switching
Dedicated circuit per call (telephone, ISDN) (physical)
Packet switching
Data sent in discrete portions (the Internet)
Switching Networks
Long distance transmission is typically done over a network of switched nodes A collection of nodes and connections is a communications network Nodes not concerned with content of data End devices are stations
Nodes
Nodes may connect to other nodes only, or to stations and other nodes Node to node links usually multiplexed Network is usually partially connected
Some redundant connections are desirable for reliability Two different switching technologies Circuit switching Packet switching
Switching Activities
Some nodes connect only to other nodes (intermediary nodes). Sole purpose is to switch data Some nodes have one or more stations attached. They accept from and deliver data to the attached station. Node-to-node links are usually multiplexed Multiple paths enhance reliability
Note
In circuit switching, the resources need to be reserved during the setup phase; the resources remain dedicated for the entire duration of data transfer until the circuit is terminated.
8.9
Circuit switching
A dedicated communication path (sequence of linkscircuit) is established between the two end nodes through the nodes of the network Bandwidth: A circuit occupies a fixed capacity of each link for the entire lifetime of the connection. Capacity unused by the circuit cannot be used by other circuits. Latency: Data is not delayed at switches
Telecom Components
Subscriber Devices attached to network Subscriber line Link between subscriber and network Also called Local Loop or Subscriber Loop Almost all Local Loops are TPW Range from Few km up to tens of km Exchange Switching center in the network End office specific switching center that supports subscribers Trunks Branches between exchanges Multiplexed
Circuit Establishment
host 1
node 1
node 2
host 2
Delay host 1- node 1
circuit establishment
data transmission
DATA
time
Digital Switch
Provide transparent signal path between devices Typically allows full duplex transmission
Establish connections - Generally on demand, Handle and acknowledge requests, Determine if destination is free,construct path Maintain connection Disconnect
Blocking
A network may not be able to connect stations because all paths are in use (more stations than path) Used on voice systems
Non-blocking
Permits all stations to connect (in pairs) at once (at least as many paths as stations) Used for some data connections
frequency time
Example
Assume that a voice channel occupies a bandwidth of 4 kHz. We need to combine three voice channels into a link with a bandwidth of 12 kHz, from 20 to 32 kHz. Show the configuration, using the frequency domain. Assume there are no guard bands. Solution We shift (modulate) each of the three voice channels to a different bandwidth, as shown in Figure on next Slide. We use the 20- to 24-kHz bandwidth for the first channel, the 24- to 28-kHz bandwidth for the second channel, and the 28- to 32-kHz bandwidth for the third one. Then we combine them.
Example (contd.)
Example
Five channels, each with a 100-kHz bandwidth, are to be multiplexed together. What is the minimum bandwidth of the link if there is a need for a guard band of 10 kHz between the channels to prevent interference? Solution For five channels, we need at least four guard bands. This means that the required bandwidth is at least 5 100 + 4 10 = 540 kHz
Applications
AM Radio
FM Radio
TV
Switching Technique
Station breaks long message into packets Packets sent one at a time to the network Packets handled in two ways
Packet Switching
each end-end data stream divided into packets user A, B packets share network resources each packet uses full link bandwidth resources used as needed Bandwidth division into pieces Dedicated allocation Resource reservation
resource contention: aggregate resource demand can exceed amount available congestion: packets queue, wait for link use store and forward: packets move one hop at a time
Packet switching
- Why not message switching?host 1 node 1 node 2 host 2
message
message
time
message
Store-and-Forward
Use of Packets
Datagram
Each packet treated independently Packets can take any practical route Packets may arrive out of order Packets may go missing Up to receiver to re-order packets and recover from missing packets
Datagram Diagram
Virtual Circuit
Preplanned route established before any packets sent Call request and call accept packets establish connection (handshake) Each packet contains a virtual circuit identifier instead of destination address No routing decisions required for each packet Clear request to drop circuit Not a dedicated path
Virtual circuits
Network can provide sequencing and error control Packets are forwarded more quickly
No routing decisions to make Loss of a node loses all circuits through that node
Less reliable
Datagram
Better if few packets Routing can be used to avoid congested parts of the network
More flexible
Packet Switched
Bandwidth guaranteed Circuit capacity not reduced by other network traffic Circuit costs independent of amount of data transmitted, resulting in wasted bandwidth
Bandwidth dynamically allocated on as-needed basis May have concurrent transmissions over physical channel May have delays and congestion More cost-effective, offer better performance
packet arrival rate to link exceeds output link capacity packets queue, wait for turn
packet being transmitted (delay)
A B
packets queueing (delay) free (available) buffers: arriving packets dropped (loss) if no free buffers
store-and-forward packet switches introduced store and forward delay delay is proportional to the packet's length in bits.
If a packet consists of L bits, and the packet is to be forwarded onto an outbound link of R bps, then the store-andforward delay at the switch is L/R seconds.
2. Queuing Delay
Within each router there are multiple buffers (also called queues), with each link having an input buffer (to store packets that have just arrived to that link) and an output buffer. If packet has to wait in output buffer packets suffer output buffer queuing delays These delays are variable and depend on the level of congestion in the network. Since the amount of buffer space is finite, an arriving packet may find that the buffer is completely filled with other packets waiting for transmission packet loss will occur
Assignment # 01
Q1) Solve the following exercise problems. (Chapter # 2) 15, 17, 20, 24 Q2) Solve the following exercise problems. (Chapter # 8) 13, 17
Readings
37
References
Q&A