Milestones, Computer Engineering

Here are some common development milestones that  you should aim for:

1. Send a packet over. Send an acknowledgement back.

2. Have checksum algorithm executed

3. Ability to begin situational errors. Test for:

(a) Lost packet (for now, you will not know of  this fact since no timeout is executed yet.)

(b) lost ack

(c)  damaged (corrupted) packet (don't send any acks back)

4. Timeouts (send packet(s),  timeout, resend)

5. Final Stop and wait correctness

 

Posted Date: 3/21/2013 1:48:17 AM | Location : United States







Related Discussions:- Milestones, Assignment Help, Ask Question on Milestones, Get Answer, Expert's Help, Milestones Discussions

Write discussion on Milestones
Your posts are moderated
Related Questions
There are no needs.. If you need to use a Viewport you can! If you want to render components into divs... you can do that aswell.


What is an Interface? An interface is not a class. It is an entity that is explained by the word Interface. An interface has no implementation; it only has the signature or in

APIs are proprietary programming interfaces supported by certain platforms. By using an API, you lose all portability. If you know your application will only ever run on single pla

Capacity and access speed: PC hard disk drive capacity (measured in GB). The vertical axis is logarithmic, so the accurate line corresponds to exponential growth.  By using

There are couple of benefit of LINQ over stored procedures.   1. Debugging - It is really very difficult to debug the Stored procedure but as LINQ is part of .NET, you can us

How many bits are required at the input of a ladder D/A converter, if it is required to give a resolution of 5mV and if the full scale output is +5V. Find the %age resolution.

Explain the Sum of Product Form? In The Boolean Algebra a product is produced by "ANDing" two or more variable inputs. Product of the two variables is expressed as AB and three


What is Hamiltonian path?  A Hamiltonian path in a directed graph G is a directed path that goes by each node exactly once. We consider a special case of this difficulty where