collision backoff algorithm


 
Thread Tools Search this Thread
Special Forums UNIX and Linux Applications Infrastructure Monitoring collision backoff algorithm
# 1  
Old 05-02-2009
collision backoff algorithm

hi there, im new to this forum, so just like to day hello to everyone!!!

i know im not aloud to post homework questions, but is it ok to ask for a formula to use to answer a question?

i looking for a formula for collison backoff algorithm to find the average time to successfully transmit a complete frame.
i have the the sslot time and successive collision.

also is there any type of formual for snmp polling intervals?
i have the number of host and sustained output

i dont no which forumal to use can someone guide me in the right direction; i tried searching the web but cant find anything??


thanks so much and im sorry if im breaking any forum rules!

pure!
# 2  
Old 05-04-2009
Quote:
i looking for a formula for collison backoff algorithm to find the average time to successfully transmit a complete frame. i have the the sslot time and successive collision.
Well, first, the backoff algorithms are usually at the MAC (Medium Access Control) layer, so it depends what medium (thin Ethernet, UTP Ethernet, Fast, GigE, 10Gig, Wireless, etc) you're talking about. When I was taught this subject years ago, the backoff algorithm used by Ethernet was exponential, starting maybe at 2 clock ticks or something. (Then 4, then 8, then 16). But maybe there was a random fuzz factor involved. (If there is, then computing the average would be to compute the mean of the random range, and add that to whatever).
# 3  
Old 05-04-2009
The network is full of papers on this topic.

Google: collision+backoff+algorithm
# 4  
Old 05-05-2009
Quote:
Originally Posted by otheus
But maybe there was a random fuzz factor involved.
Exactly this was the case and it is one of the great ideas of IIRC Bob Metcalfe to have done so. The "fuzz factor" was a random number by which the increasing number was multiplicated. Thus two colliding nodes probably weren't colliding at their next try, because the randon numbers would be most probably different.

"Pure" ALOHA (the first CSMA network) without timeslots operated at a ~18% throughput / raw bandwith ratio, whereas "slotted" ALOHA (with timeticks) roughly doubled that efficiency. Ethernet (the successor of ALOHA) had an even higher efficieny.

bakunin
Login or Register to Ask a Question

Previous Thread | Next Thread

7 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Masking algorithm

I have a requirement of masking few specific fields in the UNIX file. The details are as following- File is fixed length file with each record of 250 charater length. 2 fields needs to be masked – the positions are 21:30 and 110:120 The character by character making needs to be done which... (5 Replies)
Discussion started by: n78298
5 Replies

2. UNIX for Dummies Questions & Answers

Filename collision during backup

Hi, I am trying to backup all *.tar files from a legacy Linux to a portable harddrive. find . -name "*.tar" -exec cp {} /media/mypassport/backup \; I found that there are files with the same filenames and they were overwritten in the destination folder. They are coming from different... (4 Replies)
Discussion started by: cornellhumphrey
4 Replies

3. Homework & Coursework Questions

Banker's algorithm

Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted! 1. The problem statement, all variables and given/known data: shell scripts to simulate Banker’s algorithm on a collection of processes (process details are entered as inputs... (4 Replies)
Discussion started by: syah
4 Replies

4. UNIX and Linux Applications

2D collision simulation-programming

Hello, everybody, I'm thankful for the great helps you gave during the past year. Now I'm facing a serious problem: I was obliged to write a 2D collision simulation applet, and my experience is only in C,C++,Intelx86 assembly. I have no experience in Java and the like, and I don't know... (2 Replies)
Discussion started by: JackCrital2005
2 Replies

5. UNIX for Dummies Questions & Answers

Avoiding "file collision"

I don't know if there's a better name for what I call "file collision"... Basically, I have a script that I'm using for quick and dirty MySQL testing. Here's the idea... #!/usr/local/bin/bash for num in `jot $1` ## Yep, jot... this is FreeBSD do /usr/bin/time mysql --user=root... (2 Replies)
Discussion started by: treesloth
2 Replies

6. UNIX for Dummies Questions & Answers

access collision with shared file system

Hello ALL, In my system, there are 14 machines running the same version of Linux RHEL4. The 14 machines use a NFS file system, i.e., a shared file system. My question is that if the programs in individual machines can access a common file simutaneously. Or, they have to access the file... (1 Reply)
Discussion started by: cy163
1 Replies

7. Shell Programming and Scripting

algorithm

PID USERNAME SIZE RSS STATE PRI NICE TIME CPU PROCESS/NLWP 21444 tomusr 213M 61M sleep 29 10 1:20:46 0.1% java/43 21249 root 93M 44M sleep 29 10 1:07:19 0.2% java/56 is there anyway i can use a command to get the total of the SIZE? 306M (Derive from... (5 Replies)
Discussion started by: filthymonk
5 Replies
Login or Register to Ask a Question