graph problem
- From: logiclips@xxxxxxxxx
- Date: Tue, 27 Nov 2007 09:33:43 -0800 (PST)
Hi,
I have the following problem and maybe someone can help me:
I have three devices (e.g. Laptops) that are connected wirelessly.
These devices can send and receive data. The data transferred to one
PC is added to the exisiting data of the receiving PC. For simplicity
this data is just one value (real number).
The network or graph looks e.g. like this:
B
/ \
2 / \ 1
_/ \_
A <-------- C
3
First, B sends data to C. This data is added to the exisiting data of
C. Then B sends data to A and the data is again updated. Finally, C
sends its data (still one value) to A and the data is again updated.
The problem is now that A receives the data of B twice: first,
directly from B and then through C again. This, I want to prevent!
Of course, in this setup one could first check if A already received
the values of B and then only send the original data of C (without
update of B). Or one could substract the received data of B from the
data received by C. However, both approaches doesn't work, because of
the following constraints:
- The network (graph) is dynamic. There are more than 3 PCs in
practice. For instance B could receive data from PC D, so substracting
data doesn't work any more.
- The value is updated on each PC, so the original data can not be
reconstructed.
- The PCs don't know how the structure of the network look like.
Are there any (graph theorie) approaches that deal with such problems?
Thanks in advance,
Peter Vermeer
.
- Follow-Ups:
- Re: graph problem
- From: Chris Jacobs
- Re: graph problem
- From: Robert Israel
- Re: graph problem
- From: mensanator@xxxxxxxxxxx
- Re: graph problem
- From: Joe Blow
- Re: graph problem
- From: J . M . Viani
- Re: graph problem
- Prev by Date: Re: The infintely small number b
- Next by Date: Re: graph problem
- Previous by thread: Disorder!
- Next by thread: Re: graph problem
- Index(es):
Relevant Pages
|
