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

State about the international standardization, State about the internationa...

State about the international standardization There are many examples, certainly. Some systems for which there is international standardization include compressed disc players

What is a lan, What is a LAN? LAN stands for Local Area Network. It ref...

What is a LAN? LAN stands for Local Area Network. It refers to the connection among computers and other network devices that are located within a small physical location.

State ethernet frame format, Ethernet Frame Format Consists of sev...

Ethernet Frame Format Consists of seven fields There is No mechanism for acknowledging received frames considered an unreliable medium

Example of parallel sections construct, This example demonstrates the use o...

This example demonstrates the use of parallel sections construct. The three functions, fun1, fun2, and fun3, all can be executed concurrently.  Note that all the section directives

Dynamic process groups in parallel virtual machine , Dynamic Process Groups...

Dynamic Process Groups To generate and manage dynamic groups, a separate library libgpvm3.a must be connected with the user programs that make use of any of the set functions.

Configuration and cable termination, how can I establish a home net work by...

how can I establish a home net work by using cables and wieless

Shortest path - network layer and routing , Shortest path  The  dijkst...

Shortest path  The  dijkstra algorithms  four steps to discover what it called  the shortest path  tree . a.The algorithm  beings  to build  the tree identifying  its root.

Briefly describe nat and rip, Briefly describe NAT and RIP NAT is Netwo...

Briefly describe NAT and RIP NAT is Network Address Translation. This is a protocol that gives a way for multiple computers on a common network to share one connection to the I

Distributed Algorithms, can we solve the problem using bounded buffer space...

can we solve the problem using bounded buffer space if the propagation delay is arbitrarily large ?

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