e*****e
发帖数: 1275 | 1 Given a kernal code in "0"th machine. How soon you can replicate the kernal
across N machines. Now if the machines has upload and download bandwidth
constraints, how can you impove the copy time. |
d********t
发帖数: 9628 | 2 请问面的啥位子？
kernal
【在 e*****e 的大作中提到】
: Given a kernal code in "0"th machine. How soon you can replicate the kernal
: across N machines. Now if the machines has upload and download bandwidth
: constraints, how can you impove the copy time.
|
e*****e
发帖数: 1275 | |
k*******r
发帖数: 355 | |
A*****i
发帖数: 3587 | |
w********s
发帖数: 1570 | 6 路由算法，最简单朴实的是epidemic，和传染病传播类似
http://en.wikipedia.org/wiki/Routing_in_delay-tolerant_networki
Epidemic routing
Epidemic routing[6] is flooding-based in nature, as nodes continuously
replicate and transmit messages to newly discovered contacts that do not
already possess a copy of the message. In the most simple case, epidemic
routing is flooding; however, more sophisticated techniques can be used to
limit the number of message transfers. Epidemic routing has its roots in
ensuring distributed databases remain synchronized, and many of these
techniques, such as rumor mongering, can be directly applied to routing.
kernal
【在 e*****e 的大作中提到】
: Given a kernal code in "0"th machine. How soon you can replicate the kernal
: across N machines. Now if the machines has upload and download bandwidth
: constraints, how can you impove the copy time.
|
w********s
发帖数: 1570 | 7 udp广播速度更快，但受限于硬件支持。
kernal
【在 e*****e 的大作中提到】
: Given a kernal code in "0"th machine. How soon you can replicate the kernal
: across N machines. Now if the machines has upload and download bandwidth
: constraints, how can you impove the copy time.
|
s**x
发帖数: 7506 | 8 You can google BitTorrent at facebook. |
