Skip to main content

OSI Reference Model


1.Physical Layer

Physical layer coordinates the require electronic components or functions to Transmit data between computer systems.
             1.Physical character sticks
              2.Bit Rate

2.Data Link Layer

Data Link Layer Convert the Physical Binary Data Form Into Frames. A Combination of Bit Rate is Called Frame.

3.Network Layer

It is Responsible For Source To Designation Delivery Of Pockets. Which Contains Logical Address To Identify The sender and Receiver.

4.Transport Layer

Its Transport The Data Into Network.

5.Session Layer
Its establish,maintain and synchronous between communicate systems.
Its Manage The Transmission Data Time Between Two or More Systems.

6.Presentation Layer

It is Convert Transport Data Into Application Data. Interface Between Transport Layer And Application Layer.

VigLink badge
7.Application Layer

7 Th Layer Of OSI(Open System InterFace) model. Which Provide The Data To User Interface.
Labels:

Comments

Post a Comment

Popular posts from this blog

Class is a collection of similar objects. Which have common properties

Class is a collection of similar objects. Which have common properties. Syntax class class_name {        //member functions and variables. } How to create a objects for class class_name c=new class_name; We can access the member variable and member methods using dot operator. c.member_function(); Eg : class bike { void fun() { System.out.println("member method"); } public static void main(String[] args) { bike B=new bike(); B.fun(); } } output member method
Post a Comment
Read more

Linked List - Data Structure Basic With Example Java

//linked list /*     Linked List is a Linear Data Structure.      Drawback of Array Is continues Block Of Memory. Linked Is Used To Allocate the Different Memory Location. Each node Contains Data And Pointer. Header Is Used To Denote The First Node Of Linked List. Tail Is Used To Denote the Last Node of The Linked List. 1.Singly Linked List Each Node as Data And pointer To The Next Node. [ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]; 2.doubly Linked List Each Node as Data And pointer To The Next Node and prev Node. [ data(header) | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | null]; 3.Circle Linked List [ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]-->header */ class...
Post a Comment
Read more