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
7 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
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
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
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
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
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
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
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
EC(4) Kernel Interfaces Manual EC(4)
NAME
ec - 3Com 10 Mb/s Ethernet interface
SYNOPSIS
/sys/conf/SYSTEM:
NEC ec_controllers # 3Com Ethernet
DESCRIPTION
The ec interface provides access to a 10 Mb/s Ethernet network through a 3com controller.
The hardware has 32 kilobytes of dual-ported memory on the UNIBUS. This memory is used for internal buffering by the board, and the inter-
face code reads the buffer contents directly through the UNIBUS. The address of this memory is given in the flags field in the configura-
tion file. The first interface normally has its memory at Unibus address 0.
Each of the host's network addresses is specified at boot time with an SIOCSIFADDR ioctl. The ec interface employs the address resolution
protocol described in arp(4P) to dynamically map between Internet and Ethernet addresses on the local network.
The interface normally tries to use a ``trailer'' encapsulation to minimize copying data on input and output. The use of trailers is nego-
tiated with ARP. This negotiation may be disabled, on a per-interface basis, by setting the IFF_NOTRAILERS flag with an SIOCSIFFLAGS
ioctl.
The interface software implements an exponential backoff algorithm when notified of a collision on the cable. This algorithm utilizes a
16-bit mask and the VAX-11's interval timer in calculating a series of random backoff values. The algorithm is as follows:
1. Initialize the mask to be all 1's.
2. If the mask is zero, 16 retries have been made and we give up.
3. Shift the mask left one bit and formulate a backoff by masking the interval timer with the smaller of the complement of this mask and
a 5-bit mask, resulting in a pseudo-random number between 0 and 31. This produces the number of slot times to delay, where a slot is
51 microseconds.
4. Use the value calculated in step 3 to delay before retransmitting the packet. The delay is done in a software busy loop.
DIAGNOSTICS
ec%d: send error. After 16 retransmissions using the exponential backoff algorithm described above, the packet was dropped.
ec%d: input error (offset=%d). The hardware indicated an error in reading a packet off the cable or an illegally sized packet. The buffer
offset value is printed for debugging purposes.
ec%d: can't handle af%d. The interface was handed a message with addresses formatted in an unsuitable address family; the packet was
dropped.
SEE ALSO
intro(4N), inet(4F), arp(4P)
BUGS
The hardware is not capable of talking to itself. The software implements local sending and broadcast by sending such packets to the loop
interface. This is a kludge.
Backoff delays are done in a software busy loop. This can degrade the system if the network experiences frequent collisions.
3rd Berkeley Distribution August 20, 1987 EC(4)