Network message transfer, Computer Engineering

Assignment Help:

Consider a network message transfer among a source S and a destination D by 3 routers R1, R2 and R3 as given below:-

 

            S -------- R1 --------- R2 --------- R3 --------- D

 

 A message M requires to be transferred from S to D.  M will be divided into packets; thus M/Packet Size is the number of packets. For example, if M is 100 MB, and packet size is 10MB then there will be10 Packets. Write a simple program to simulate the arrival of a packet at R1, then R2, then R3, and then D, and at last the program should indicate how long it would take for the entire message M to arrive at D.In the program the user should be able to choose different packet sizes, bandwidths of the links, link speeds and lengths of the links. Ignore the queuing and processing delays.

 


Related Discussions:- Network message transfer

One node at the highest level in the structure, There can be more than one ...

There can be more than one node at the highest level in the structure. False.  One can describe only single node at the highest level in the structure on LDB

Unix , how to write algorithum for unix progam

how to write algorithum for unix progam

Visual basic application, Name the platforms by which visual basic applicat...

Name the platforms by which visual basic applications are available? Ans) Most of the visual basic applications are available on 32 bit Intel platforms. These applications also

Digital electronics, what is Asynchronous Finite State Machines?

what is Asynchronous Finite State Machines?

Explain about the passive graphics device, Explain about the passive graphi...

Explain about the passive graphics device A passive graphics device simply draws pictures under computer control; i.e. it allows the computer to communicate graphically with th

What is rom, What is ROM? Read only memory [ROM] is used for storing pr...

What is ROM? Read only memory [ROM] is used for storing programs that are permanently resident in the computer and for tables of constants that do not change in value as the pr

Explain programmer visible registers, Q. Explain Programmer Visible Registe...

Q. Explain Programmer Visible Registers? These registers can be accessed employing machine language. In general we encounter four kinds of programmer visible registers.

Name the four steps in pipelining, Name the four steps in pipelining. F...

Name the four steps in pipelining. Fetch  : Read the instruction from the memory. Decode : Decode the instruction and get the source operand. Execute : Perform the operat

Resolution method, Resolution Method: For a minor miracle occurred in ...

Resolution Method: For a minor miracle occurred in 1965 where Alan Robinson published his resolution method as uses a method to generalised version of the resolution rule of i

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