• C

credit-based sliding window protocol

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.
banana051197Asked:
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

staggartCommented:
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...
0
banana051197Author 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?

0
tovergaardCommented:
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.
0

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
banana051197Author Commented:
Thank you for your advice, but I have try to look for that kinds of books, I will keep trying...Thanks

0
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
C

From novice to tech pro — start learning today.

Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.