Connection-oriented service, Computer Networking

Assignment Help:

Sender requests connection from network. Other receiver agrees to connection. Computers interchange data through connection. One-endpoint requests network to split connection when transmission is done.

CONTINUOUS AND BURST TRAFFIC:

Networks handling video or voice are engineered to access and deliver continuous data at limited rate. Others are prepared to handle burst traffic typical of computer networks. Connection does not disconnected when no data is transmit.

SIMPLEX & FULL DUPLEX CONNECTION:

Some connection-oriented methods give full duplex while other allow on simplex connection. To interact using a simplex design a pair of devices must create two connections one from device A to device B and another from device B to A.

CONNECTION DURATION AND PERSISTANCE:

Connection can be created on demand set up permanently. There are two kinds:

  • Switched Virtual Circuit or Switched Connection.
  • Permanent Virtual Circuit or Permanent Connection.

Permanent connections are naturally hardwired and now managed at system unit time. In switched connections, device maintains permanent connection to network and networks create connections on demand.

Internal elements are switched networks is a switched data network.

SERVICE GUARANTEES:

Some connection-oriented networks give guarantees about the application that computer will receive. They may guarantee a throughput rate larger packet loss rate. For example, ATM gives statistical guarantee about performance.


Related Discussions:- Connection-oriented service

Programming with pvm, The Common method for writing a program with PVM is a...

The Common method for writing a program with PVM is as follows: A user writes one or more sequential programs in C, C++, or Fortran 77 having embedded PVM function (or subroutin

Computer nework critira, what is compurter network and types, topology, com...

what is compurter network and types, topology, communication media

Comparison of distance-vector and link-state algorithm, DISTANCE-VECTOR ROU...

DISTANCE-VECTOR ROUTING: It is easy to implement. Packet switch modifies its own routing table first. It is used in RIP. LINK-STATE ALGORITHM: It is ve

Merit and drawback of mpi, Merits of MPI Runs on any shared or dist...

Merits of MPI Runs on any shared or distributed memory architectures; Can be used on a wider range of troubles than OpenMP; Every process has its own local variabl

Division of the address space, The IP class procedure does not split the 32...

The IP class procedure does not split the 32-bit address space into same size class and the classes do not have the same value of networks. A prefix of n bits gives 2n unique ne

Explain fully connected interconnection networks, Fully connected : It is t...

Fully connected : It is the most powerful interconnection topology.  In this every node is directly associated to all other nodes. The limitation of this network is that it needs t

Independent loops statement, INDEPENDENT Loops HPF gives additional opp...

INDEPENDENT Loops HPF gives additional opportunities for parallel implementation by using the INDEPENDENT directive to assert that the iterations of a do-loop can be done indep

Ports, It is an additional 16-bit number which uniquely identifies the spec...

It is an additional 16-bit number which uniquely identifies the specific service on any given machine on the Internet. Port numbers are 16 bit wide, so each of the computers on the

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