2016/8/30

原创 2016年08月30日 18:49:12

Before starting to work in the evening, I'll summarize former results.

In the morning, I worked out how to balance the time between adding nodes and sending/resending requests. If I clear all requests after new node joins in, the transmissions will be affected. Thus, I preserve requests that are already dealt or being dealt and only the rest are cleared. In this way, short-cuts could be used by nodes. In order to guarantee the existence of short-cuts, further speaking, every node should find new nodes within L with high probability. Consequently, the factor L should be deliberately considered. The other problem I worked on is that how to decide whether the new node is an eager node. There should be some constraints, to find reliable neighbors to transmit across the network. Perhaps, it's also related to L.

In the afternoon, I consider more details of the scheme and justify whether it's feasible. Work proceeds slowly.

In the evening, I try to make use of the existence of new nodes. Try to design a method such that the dissemination time could be diminished. My intention is to create short-cut to cut off the depth of binary tree each node holds(cut to a constant level is the best). Or, balancing the requests, because, ideally, every node only serves constant number of nodes. Before being devoted to a thought, we should assume it's achievable and verify what it can bring? can it realize the desiring results? Or it's blind to think how to achieve the thought. 

You have to fasten your CPU! Make good use of it.

相关文章推荐

pbfunc外部函数扩展(1.2.2.17) 2016-09-30

  • 2016年09月30日 16:41
  • 1.58MB
  • 下载

python核心编程学习笔记-2016-07-30-01-习题7-5

习题7-5,登陆系统。 代码: #-*-coding: utf-8-*- # 图形界面等到学完Tkinter之后再完善 import time, msvcrt, sys db = {} user...

SolidWork 2016 绿色.part30.rar

  • 2016年12月12日 10:40
  • 69.5MB
  • 下载

CVPR 2016-12-30

[1] arXiv:1612.09161 [pdf, other] Learning Visual N-Grams from Web Data 从Web数据可视化实例学习 Ang Li, Al...

pwwMap2016-1-30

  • 2016年02月02日 14:59
  • 581KB
  • 下载

2016/10/30 宝贝蛋,我好想你。

亲爱的,这一句再见好沉重 宝儿,我现在好想你。 可我今天才跟你聊过天,说过话。 想想现在开始的以后,每一天,不会再有你,不会再有联系, 我的身体忍不住颤抖。 我对你的习惯和依赖,短短...

2016/12/30其实一直想写的一道腾讯面试题

背景:虽然注定是与腾讯没有机会的,但是想想,还是算得上擦身而过,而且,面试官也给我留下了极好的印象,所以一直想着要把那个题目写写。题目要求:现在我有一数组,里面保存着可以区分大小的数据。我想做的事情很...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:2016/8/30
举报原因:
原因补充:

(最多只允许输入30个字)