Difference between packet switching and circuit switching, Computer Engineering

Assignment Help:

What are the advantages and disadvantages of packet switching over circuit switching?

The comparison of packet switching and circuit switching demonstrating advantages and disadvantages of packet switching over circuit switching is specified below:

 

Circuit Switching

Packet Switching

Dedicated transmission path.

No dedicated transmission path

Transmission of data.

Transmission of packets.

Operate in real time.

Near real time.

Message not stored.

Message held for short time

Path      established for complete message.

Route established for each packet

Call setup delay.

Packet transmission delay.

Busy signal if called party busy.

No busy signal.

Blocking may arise.

Blocking cannot arise

User responsible for message-loss protection.

Network   may   be   responsible   for   each packet but not for entire message.

Code conversion or no speed.

Code and speed conversion.

Fixed bandwidth transmission.

Dynamic utilization of bandwidth.

No overload bits after initial setup delay.

Overload bits in each packet.


Related Discussions:- Difference between packet switching and circuit switching

What is a word line, What is a word line? In a memory cell, all the cel...

What is a word line? In a memory cell, all the cells of a row are linked to a common line called as word line

Why java is called machine independent, Why Java is called Machine Independ...

Why Java is called Machine Independent? While a java program is compiled this is not converted in an executable code. Rather, this is converted in a byte code. Byte code is hig

What is fork, What is Fork Clk gets its value after 1 time unit, rese...

What is Fork Clk gets its value after 1 time unit, reset after 10 time units, enable after 5 time units, data after 3 time units. All the statements are executed in parallel.

Arc consistency, Arc Consistency: There have been many advances in how...

Arc Consistency: There have been many advances in how constraint solvers search for solutions (remember this means an assignment of a value to each variable in such a way that

Define deadlock with resource request and allocation graph, Define Deadlock...

Define Deadlock with Resource request and allocation graph (RRAG) Deadlocks can be described through a directed bipartite graph termed as a RRAG that is Resource Request All

Realize x-nor gate using nand gate, Q. A. Which gates are called Universa...

Q. A. Which gates are called Universal Gates? Why? B. State and prove any one of the DeMorgen's Laws. Show that these theorems can be extended up to any number of variables.

Ds, explain about relations

explain about relations

Define ufd and mfd, Define UFD and MFD.   In the two-level directory st...

Define UFD and MFD.   In the two-level directory structure, every user has own user file directory (UFD). Every UFD has a same structure, but lists only the files of a single u

Describe _blank, Q. Describe _blank, _self, _parent and _top tags? Thes...

Q. Describe _blank, _self, _parent and _top tags? These all are attributes of tag. The below example describes each of these attributes. <

Features of hyper-threading, The salient features of hyper threading are: ...

The salient features of hyper threading are: i)  Improved support for multi-threaded code, permitting multiple threads to run concurrently. ii) Response time and improved rea

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd