Which osi reference layer is concerned with logical address, Computer Networking

Assignment Help:

There are two logical addressing :-

a) Datalink is physical (hardware) addressing.

b) Network is logical (software) addressing.

 


Related Discussions:- Which osi reference layer is concerned with logical address

Was the entire transaction completed, The following information was obtaine...

The following information was obtained from a host computer: 00:05:17.176507 74.125.228.54.1270 > 64.254.128.66.25: S 2688560409:2688560409(0) win 16384 (DF) (ttl 46, id 2096

What are the advantages of star topology, What are the advantages of Star T...

What are the advantages of Star Topology? The advantages of star topology are: a. Relatively easy to configure. b. Simple to troubleshoot c. Media faults are automatic

Ipx traffic on a network, To monitor ipx traffic on a network, what command...

To monitor ipx traffic on a network, what command would we use? Ans) show ipx traffic

Mobile interent technology, Question 3:4 By experimentation, work out the l...

Question 3:4 By experimentation, work out the lowest SNR, under which 4 users can si- multaneously communicate, without error, via this system. For SNR, simply report the largest v

Layer on which layer does l2f, Write the layer on which layer does L2F, PPT...

Write the layer on which layer does L2F, PPTP and L2TP operate?

Determine the definition of hdlc, Determine the definition of HDLC HDLC...

Determine the definition of HDLC HDLC has only one address field. In a LAN, any station may transmit to any other station. The receiving station needs to see its own address in

Operating system for server, Operating system for Server Since 1994, w...

Operating system for Server Since 1994, when the original pair of web servers - NCSA HTTPd and CERN HTTPd , were proposed, dozens of commercial and shareware programs have

Computing shortest path in a graph, While calculating shortest path, first ...

While calculating shortest path, first we assume graph presentation of network at every node then we use Djikstra's algorithm to calculate shortest path from every node to other on

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