Difficulties in internetwork communication, Computer Networking

Assignment Help:

Q. Difficulties in Internetwork Communication?

- Data arrive at interface f1 of s1

- How does s1 know that they must be sent out from interface f3?

- There is no provision in the data link or else Physical layer to help s1 to select correct decision.

- Because the frame contains the MAC Address of A (Source) and

- The MAC Address of S1 (destination)

For LAN (or) WAN

- Delivery means carrying the frame through one link, not beyond


Related Discussions:- Difficulties in internetwork communication

Difference between interior and exterior neighbour gateways, What is the di...

What is the difference between interior and exterior neighbor gateways? Interior gateways connect LANs of one organization, while exterior gateways connect the organization to

Explain the concept of token passing, Token Passing S...

Token Passing Station is able to send only when it receives a special frame called a token Token circulates around the ring If station wishes to sen

What are the key benefits of layered network, What are the key benefits of ...

What are the key benefits of layered network? Main advantages of layered network are given below: a) Complex systems can be split into understandable subsystems. b) Any f

Ipv6 - network layer and routing , IPv6 The  internet  engineering task...

IPv6 The  internet  engineering task force begin  the effort to develop a successor  protocols  to IPv4 in the early  1990 is an internet  layer protocols  for packet  switched

Networking assignment, Suppose a small company wants to develop a computer ...

Suppose a small company wants to develop a computer network of 18 computers in its main office. Due to limited resources the company wants a network architecture where a single com

Explain about flow control, Q. Explain about Flow Control? - Signifies...

Q. Explain about Flow Control? - Signifies to ask the transmitter to stop/resume sending in data - Required when DTE to DCE speed > DCE to DCE speed - (Exampl

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

Explain multipoint connection, Explain multipoint connection. A multipo...

Explain multipoint connection. A multipoint connection is a link among three or more devices. Historically, multipoint connections were used to attach central CPs to distribute

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