Sponsored Content
Full Discussion: collision backoff algorithm
Special Forums UNIX and Linux Applications Infrastructure Monitoring collision backoff algorithm Post 302312967 by otheus on Monday 4th of May 2009 09:30:51 AM
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).
 

7 More Discussions You Might Find Interesting

1. 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

2. 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

3. 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

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. 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

6. 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

7. 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
CC_CDG(4)						   BSD Kernel Interfaces Manual 						 CC_CDG(4)

NAME
cc_cdg -- CDG Congestion Control Algorithm DESCRIPTION
CAIA-Delay Gradient (CDG) is a hybrid congestion control algorithm which reacts to both packet loss and inferred queuing delay. It attempts to operate as a delay-based algorithm where possible, but utilises heuristics to detect loss-based TCP cross traffic and will compete effec- tively as required. CDG is therefore incrementally deployable and suitable for use on shared networks. During delay-based operation, CDG uses a delay-gradient based probabilistic backoff mechanism, and will also try to infer non congestion related packet losses and avoid backing off when they occur. During loss-based operation, CDG essentially reverts to cc_newreno(4)-like be- haviour. CDG switches to loss-based operation when it detects that a configurable number of consecutive delay-based backoffs have had no measurable effect. It periodically attempts to return to delay-based operation, but will keep switching back to loss-based operation as required. MIB Variables The algorithm exposes the following variables in the net.inet.tcp.cc.cdg branch of the sysctl(3) MIB: version Current algorithm/implementation version number. beta_delay Delay-based window decrease factor as a percentage (on delay-based backoff, w = w * beta_delay / 100). Default is 70. beta_loss Loss-based window decrease factor as a percentage (on loss-based backoff, w = w * beta_loss / 100). Default is 50. exp_backoff_scale Scaling parameter for the probabilistic exponential backoff. Default is 2. smoothing_factor Number of samples used for moving average smoothing (0 means no smoothing). Default is 8. loss_compete_consec_cong Number of consecutive delay-gradient based congestion episodes which will trigger loss-based CC compatibility. Default is 5. loss_compete_hold_backoff Number of consecutive delay-gradient based congestion episodes to hold the window backoff for loss-based CC compatibility. Default is 5. alpha_inc If non-zero, this enables an experimental mode where CDG's window increase factor (alpha) is increased by 1 MSS every alpha_inc RTTs during congestion avoidance mode. (Setting alpha_inc to 1 results in the most aggressive growth of the window increase factor over time. Use higher alpha_inc values for slower growth.) Default is 0. SEE ALSO
cc_chd(4), cc_cubic(4), cc_hd(4), cc_htcp(4), cc_newreno(4), cc_vegas(4), h_ertt(4), mod_cc(4), tcp(4), khelp(9), mod_cc(9) D. A. Hayes and G. Armitage, "Revisiting TCP Congestion Control using Delay Gradients", Networking 2011 Proceedings, Part II, 328-341, May 2011. N. Khademi and G. Armitage, Minimising RTT across homogeneous 802.11 WLANs with CAIA Delay-Gradient TCP (v0.1), CAIA Technical Report 121113A, http://caia.swin.edu.au/reports/121113A/CAIA-TR-121113A.pdf, November 2012. ACKNOWLEDGEMENTS
Development and testing of this software were made possible in part by grants from the FreeBSD Foundation and The Cisco University Research Program Fund, a corporate advised fund of Silicon Valley Community Foundation. HISTORY
The cc_cdg congestion control module first appeared in FreeBSD 9.2. The module was first released in 2011 by David Hayes whilst working on the NewTCP research project at Swinburne University of Technology's Centre for Advanced Internet Architectures, Melbourne, Australia. More details are available at: http://caia.swin.edu.au/urp/newtcp/ AUTHORS
The cc_cdg congestion control module was written by David Hayes <david.hayes@ieee.org>. This manual page was written by Lawrence Stewart <lstewart@FreeBSD.org> and Grenville Armitage <garmitage@swin.edu.au>. BUGS
The underlying algorithm and parameter values are still a work in progress and may not be optimal for some network scenarios. BSD
July 2, 2013 BSD
All times are GMT -4. The time now is 05:40 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy