I need a simple program that creates multiple clients and servers to simulate routing using flooding.
Each packet should contain a counter that is decremented on each hop. When the counter gets to zero, the packet is discarded. Time is discrete, with each line handling one packet per time interval.
Make three states in the program:
1-all lines are flooded
2-all lines except the input line are flooded
3-only the (statically chosen) best k lines are flooded.
For the GUI I want a button for every state and a text field for the input and a (real-time) table for each node in the network and a simple graph is preffered.
Display both delay and the bandwidth to compare flooding with deterministic routing (k = 1)
And another simple program that simulates a computer network using discrete time.
The first packet on each router queue makes one hop per time interval. Each router has only a finite number of buffers. If a packet arrives and there is no room for it, it is discarded and not re-transmitted.
Also, do the opposite with an end-to-end protocol, complete with timeouts and acknowledgement packets, that eventually regenerates the packet from the source router.
Plot the throughput of the network as a function of the end-to-end timeout interval, parameterized by error rate
16 pekerja bebas membida secara purata $76 untuk pekerjaan ini
Hi, I have more then 10 years of experienced in java, i did lots of work on Swing,AWT, JDBC, servlet, JSP, Spring.i give you quality work. Kindly initiate the discussion
Hey,I am expert on Java I work as a post doc researcher at robotics lab in paris. I have great experiences on software developing. I can solve your problems immediately.