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
Design a 4 to 1 Multiplexer by using the three variable function given by F(A, B, C) = ∑ m(1,3,5,6) Ans. The given function F(A,B,C) = ∑ m(1,3,5,6) can be implemented along wit

Telnet It is a terminal emulation program for TCP/IP networks like as the Internet. The Telnet program runs on your computer and attaches your PC to a server on the network. On

Specifying Constraint Problems: However as with most successful "AI" techniques there constraint solving is all about solving problems as: somehow phrase the intelligent task

voltage,current and power relation in a delta connection

Static modeling is used to state structure of the objects that are in the problem domain. These are expressed using class, object and USECASE diagrams. But Dynamic modeling sig

In 32bit IP Addressing scheme all 1's represent? All 1's represent limited broadcast in 32 bit IP Addressing scheme.

What are set up time and hold time constraints? What do they mean? Which one is crucial for establishing maximum clock frequency of a circuit? Set up time is the amount of time

Likewise to arrays but is preferred over an array due to of the following reasons. 1. A collection objects uses less Memory than an array. 2. It gives methods to add and dele

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

Utilization Summary The Utilization Summary shows the status of each processor i.e. how much time (in the form of percentage) have been spent by every processor in busy mode, o