送交者: Newman 于 2005-1-14, 15:49:46:

let's assume it is Ethernet that has broadcast ability, 3 or more entities join at the same time and they want to elect one of them to be the master. Let's say whoever has the smallest MAC address become the master. Any pointers for such an algorithm? I am sure somebody must have studied it thoroughly and I won't need to come up with a messy solution of my own. thanks.

所有跟贴:

- Ethernet uses a backoff algorithm to resolve the issue -
**hah**(125 bytes)*2005-1-17, 16:00:59*- No. :-)) -
**Newman**(364 bytes)*2005-1-17, 22:13:16*

- No. :-)) -
- I mis-defined the problem a little -
**Newman**(291 bytes)*2005-1-15, 11:49:57*- this is a typical leader election algorithm in distributed environment, -
**steven**(217 bytes)*2005-1-15, 15:30:55*- Re -
**Newman**(310 bytes)*2005-1-15, 16:32:24*- the classic book about this topic is distributed algorithms by -
**steven**(145 bytes)*2005-1-15, 20:57:39* - Steven, I found a book from libraray talking about distributed systems -
**Newman**(214 bytes)*2005-1-15, 18:57:31*

- the classic book about this topic is distributed algorithms by -

- Re -

- this is a typical leader election algorithm in distributed environment, -