作者: Ta Yuan Hsu , Ajay D. Kshemkalyani , Min Shen
关键词:
摘要: Social communication networks have been widely investigated in recent years. From fine-grained temporal information's point of view, social vector clock (SVC) is a useful mechanism to track the most with all other local peers network. A modification conventional clocks has proposed deal issue poor scalability without keeping whole views [1]. In this paper, we propose an idea variable (VSVCs) and corresponding incremental algorithm. Not only does it maintain lower bound how out-of-date each peer can be respect others, but also considers shortest friendship separation restrict far information may transmitted along time respecting paths. Unless bounded infinite, some messages could lost implicitly. We focus on studying message inconsistency reachable in-degree distribution several based clocks.