We help IT Professionals succeed at work.

credit-based sliding window protocol

banana051197
banana051197 asked
on
Medium Priority
855 Views
Last Modified: 2008-02-26
Can someone show me the two algorithms which allow two different nodes to communication without flooding a receiver. These nodes should use a credit-based sliding window protocol.
Comment
Watch Question

Commented:
Sounds like a problem you got for a class exam?  You might try a couple of general O/S or communications books at a university bookstore...

If you are trying to be practical (as opposed to finding a specific algorithm like you requested), an algorithm to not flood the receiver is not all that hard.  Just allow the transmitter to send up to N un-Acked messages and then stop when N is reached.  Start a timer for each un-acked message.  If the timer expires or NAK received, re-send. If an ACK is received, clear timer. The trivial way to handle lost messages is to send all un-ACKed from the one requested.  For example, if a NAK is received for msg 7 , and msgs 4-7 are pending ACKS, just send them all.  This of course meaans the reciever must be able to re-assemble out-of-order messages and handle duplicates.  

TCP uses a sliding-window protocol, but I am not sure if it is a credit-based one or not.  There are plenty of books that desribe TCP in detail (Comer, et. al.).  Of course understanding TCP will only give you one algorithm, not the two you requested...

Author

Commented:
You did not answer my question!!!
Could I have the code about the two algorithm which is using C to write it?!
Do you need me to state the question clearer?

Your question is clear and Stuggards answer is clear too.

The answer is, read a book about communications, there are pleanty of them in university bookstores.

--

I am sure you would get an answer if you made your question more specific, e.g. can you recommend a book about.....

People don't like to make your job, but would gladly help you.

Not the solution you were looking for? Getting a personalized solution is easy.

Ask the Experts

Author

Commented:
Thank you for your advice, but I have try to look for that kinds of books, I will keep trying...Thanks

Access more of Experts Exchange with a free account
Thanks for using Experts Exchange.

Create a free account to continue.

Limited access with a free account allows you to:

  • View three pieces of content (articles, solutions, posts, and videos)
  • Ask the experts questions (counted toward content limit)
  • Customize your dashboard and profile

*This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

OR

Please enter a first name

Please enter a last name

8+ characters (letters, numbers, and a symbol)

By clicking, you agree to the Terms of Use and Privacy Policy.