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

Qwerty - keyboard layout, Q. QWERTY - Keyboard Layout ? A keyboard layo...

Q. QWERTY - Keyboard Layout ? A keyboard layout is arrangement of keys across the keyboard. There is one keyboard layout which anybody who has worked on a standard keyboard or

Interrupt signal interconnection network (isin), Interrupt Signal Interconn...

Interrupt Signal Interconnection Network (ISIN) When a processor needs to send an interruption to another processor, then this interrupt initial goes to ISIN, through which it

Returns and procedures definitions in 8086, Q. Returns and Procedures defin...

Q. Returns and Procedures definitions in 8086? 8086 microprocessor supports RET and CALL instructions for procedure call. CALL instruction not only branches to indicate address

Fundamental change to the cloud to support mobility, Question: The abun...

Question: The abundance of resources and the ease of access to cloud computing can help to bridge the gap the resource gap for mobile computing. Nevertheless some fundamental c

Define memory cycle time, Define memory cycle time? It is the time dela...

Define memory cycle time? It is the time delay needed between the initiations of two successive memory operations. Eg. The time among two successive read operations.

Explain tabulation method for simplifying k maps, Explain Tabulation Method...

Explain Tabulation Method for simplifying k maps? The Tabulation Method (QUINE-McCLUSKEY MINIMIZATION) An expression is represented in the canonical SOP form if not

Optimality - heuristic search strategies, Optimality - Heuristic search str...

Optimality - Heuristic search strategies: The path cost of a solution is considered as the sum of the costs of the actions that led to which solution is given. This is only on

Loop used to show properties, Normal 0 false false false ...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4  A loop invariant is

Hidden input, Yet another type of input is HIDDEN input. A HIDDEN in...

Yet another type of input is HIDDEN input. A HIDDEN input is a value/name pair which is returned to you but doesn

Multiple stack, how to implement the multiple stack

how to implement the multiple stack

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