Scribd
Upload
64 views20 pages

Network Core: Circuit Switching: End - End Resources Reserved For "Call"

The document discusses circuit switching and packet switching in network cores. Circuit switching reserves end-to-end resources like bandwidth for calls and guarantees performance but requires call setup. Packet switching divides data into packets that share network resources, allowing for more network users but with potential congestion issues. It also discusses virtual circuits that establish preplanned routes for packets like circuit switching but within a packet switched network.

Uploaded by

Md Habibur Rahman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
64 views20 pages

Network Core: Circuit Switching: End - End Resources Reserved For "Call"

The document discusses circuit switching and packet switching in network cores. Circuit switching reserves end-to-end resources like bandwidth for calls and guarantees performance but requires call setup. Packet switching divides data into packets that share network resources, allowing for more network users but with potential congestion issues. It also discusses virtual circuits that establish preplanned routes for packets like circuit switching but within a packet switched network.

Uploaded by

Md Habibur Rahman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

Lecture 2

Network Core: Circuit Switching

End end resources reserved for call

04.03.08

Link bandwidth, switch capacity


Dedicated resources: no sharing
Circuit-like (guaranteed) performance
Call setup required

Upama Kabir

Lecture 2
Network Core: Circuit Switching

Network resources (e.g. bandwidth) divided into pieces

Pieces allocated to calls


Resource piece idle if not used by owning call (no sharing)
Dividing link bandwidth into pieces

04.03.08

Frequency division
Time division

Upama Kabir

Lecture 2
Network Core: 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

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

04.03.08

Node receives complete packet before forwarding

Upama Kabir

Lecture 2

Packet Switching

Data are transmitted in short packets

A typical upper bound for packet

04.03.08

If a source has longer message, then broke it up into a series of


packets
Each packet contains data plus control information
At each node en route, packet is received, stored and passed on to
the next nod

Upama Kabir

Lecture 2

Datagram

Each packet is treated independently, with no reference to


packets that have gone before.

Each node chooses the next node on a packet's path

Packets with same destination do not follow the same route.

Packets may arrive out of sequence at receiver.

It is also possible for a packet to be destroyed in the network.

04.03.08

Upama Kabir

Lecture 2

Virtual Circuit

04.03.08

A preplanned route is established before any packets are sent


Once a route is established, all the packets between a pair of
communicating parties follow the same route through the network
Because the route is fixed for the duration of the logical connection,
it is somewhat similar to a circuit in a circuit switched network and is
referred to as a virtual circuit.
Each packet contains a virtual circuit identifier as well as data
Each node on the preestablished route knows where to direct
packets, no routing decisions are required.

Upama Kabir

Lecture 2
Packet-switching:store and forward

Takes L/R seconds to transmit packet of L bits on to link or R


bps

Entire packet must arrive at router before it can be


transmitted on next link: store and forward
Delay=3L/R
Example:
L=7.5 Mbits
R=1.5 Mbps
Delay=15 sec
04.03.08

Upama Kabir

Lecture 2
Packet Switching versus Circuit Switching
Packet switching allows more users to use network

1 Mbps link
Each user:

Circuit-switching

10 users

Packet-switching

04.03.08

100 kbps when active


Active 10% of time

With 35 users, probability > 10 active less than .0004

Upama Kabir

Lecture 2

04.03.08

Upama Kabir

Lecture 2
Packet Switching versus Circuit Switching

Great for bursty data

Excessive congestion: packet delay and loss

Resource sharing
Simpler, no call setup

Protocols needed for reliable data transfer, congestion control

Q: How to provide circuit-like behavior?

04.03.08

Bandwidth guarantees needed for audio/video applications


Still an unsolved problem

Upama Kabir

Lecture 2
Packet Switched network: forwarding

Goal: move packets through routers from source to destination

Datagram network:

We will study several path selection (i.e. routing) algorithms


Destination address in packets determine next hop
Routers may change during session
Analogy: driving, asking direction

Virtual circuit network:

04.03.08

Each packet carries tag (virtual circuit ID), tag determines next hop
Fixed path determined at call setup time, remains fixed thru call
Routers maintain per call state

Upama Kabir

Lecture 2
Reflections

Packet switching requires reserving resources along the end-to-end


path
True or false

In ckt-switched networks, queuing delay is virtually non-existent


True or false

04.03.08

Upama Kabir

Lecture 2

04.03.08

Upama Kabir

Lecture 2

04.03.08

Upama Kabir

Lecture 2

04.03.08

Upama Kabir

Lecture 2

04.03.08

Upama Kabir

Lecture 2

04.03.08

Upama Kabir

Lecture 2

04.03.08

Upama Kabir

Lecture 2

04.03.08

Upama Kabir

Lecture 2

04.03.08

Upama Kabir

You might also like