SESSION LAYER IN COMPUTER NETWORK

-

  SESSION LAYER IN OSI MODEL :





The session layer (layer 5) is responsible for establishing, managing, synchronizing and terminating sessions between end-user application processes.

The main functions of the session layer are as follows −

  • It works as a dialog controller. It allows the systems to communicate in either half-duplex or full-duplex mode of communication.
  • It is responsible for token management. Through this, it prevents the two users to simultaneously attempt the same critical operation.
  • It synchronizes communication. It adds synchronization points or checkpoints in data streams for long communications. This ensures that data streams up to the checkpoints are successfully received and acknowledged. In case of any failures, only the streams after the checkpoints have to be re-transmitted.

Comments

Post a Comment

Popular posts from this blog

HANDWRITTEN NOTES (COMPUTER NETWORK ) USEFULL IN EXAMS (IMP TOPICS)

-
Image
COMPUTER NETWORK  HANDWRITTEN NOTES:                              👉  (IMP TOPICS )👈 WHAT IS COMPUTER NETWORK ? CHARACTICS OF COMPUTER NETWORK ? WHAT IS USE OF COMPUTER NETWORK? COMPUTER NETWORK ARCHITECTURE  PEER-PEER NETWORK CLIENT NETWORKS OSI MODEL(ALL LAYER) APPLICATION LAYER TCP/IP PROTOCOL DOWNLOAD HANDWRITTEN NOTES : 👇👇👇👇👇 SHARE THIS BLOG 😊
Read more

DATA STRUCTURE (IMP QUESTIONS )FOR (BE STUDENTS ,DIPLOMA STUNDENTS,UNIVERSITY) (CHEPTAR WISE )

-
Image
DATA STRUCTURE IMPORTANT QUESTIONS :  👇👇👇👇👇👇👇 QUESTIONS : 1 . WHAT IS DATA STRUCTURE AND TYPES OF DATA STRUCTURE ? 2.DIFFERENCE BETWEEN LINIEAR DATA AND NON LINEAR DATA STRUCTURE. 3 DIFFERNECE BETWEEN PRIMITIVE AND NON-PRIMITIVE DATA STRUCTURE . 4. WRITE ALGORITHM FOR PUSH AND POP STACK OPERATION 5.APPLICATION OF STACK AND QUEUE . 6. WRITE A C FUNCATION FOR INSERATION AND DELETION OPERATION IS SIMPLE QUEUE. 7.WRITE AN ALGORITHM TO DELETE AN ELEMENT FROM CIRCULAR QUEUE SHOWS THE STEPS OF INSERATION AND DELETION OPERATION IS SAMPLE CIRCULAR QUEUE. 8.DESCRIBE THE ADVANTAGE OF LINKED LIST OVER ARRY. 9.WRITE AN ALGORITHM TO INSERT A NODE ATLAST POSTION IN DOUBLY LINKED LIST. 10.EXPLAIN ARRAY IN DATA STRUCTURE .  11.WORKING OF PRIORITY QUEUE WITH SDING ORDER BY APPLYING QUUITABLE EXAMPLE . 12.WIRTE RECURSIVE ALGORITHMS TO COMPLETE FACTORIAL OF A GIVEN NUMVBERS WHICH DATA STRUCTURE CAN BE USED TO IMPLEMENT THIS ALGORITHMS. 13. SORT THE FOLLOWING NUMBER IN ASCENDING ORDER BY AP...
Read more