Solved

credit-based sliding window protocol

Posted on 1997-05-12
4
783 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.
0
Comment
Question by:banana051197
  • 2
4 Comments
 

Expert Comment

by:staggart
ID: 1250349
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
 

Author Comment

by:banana051197
ID: 1250350
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
 
LVL 2

Accepted Solution

by:
tovergaard earned 50 total points
ID: 1250351
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
 

Author Comment

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

0

Featured Post

Does Powershell have you tied up in knots?

Managing Active Directory does not always have to be complicated.  If you are spending more time trying instead of doing, then it's time to look at something else. For nearly 20 years, AD admins around the world have used one tool for day-to-day AD management: Hyena. Discover why

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Suggested Solutions

Title # Comments Views Activity
How to align numbers in C using the %d 2 98
Line meaning 9 86
How do I set up two external hard drives with Acronis True Image? 12 88
Raspberry Pi 3 to send text message 9 115
Preface I don't like visual development tools that are supposed to write a program for me. Even if it is Xcode and I can use Interface Builder. Yes, it is a perfect tool and has helped me a lot, mainly, in the beginning, when my programs were small…
Examines three attack vectors, specifically, the different types of malware used in malicious attacks, web application attacks, and finally, network based attacks.  Concludes by examining the means of securing and protecting critical systems and inf…
Video by: Grant
The goal of this video is to provide viewers with basic examples to understand and use for-loops in the C programming language.
Video by: Grant
The goal of this video is to provide viewers with basic examples to understand and use nested-loops in the C programming language.

778 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question