Social interaction with peer pressure is widely studied in social network analysis.Game theory can be utilized to model dynamic social interaction,and one class of game network models assumes that people’s decision p...Social interaction with peer pressure is widely studied in social network analysis.Game theory can be utilized to model dynamic social interaction,and one class of game network models assumes that people’s decision payoff functions hinge on individual covariates and the choices of their friends.However,peer pressure would be misidentified and induce a non-negligible bias when incomplete covariates are involved in the game model.For this reason,we develop a generalized constant peer effects model based on homogeneity structure in dynamic social networks.The new model can effectively avoid bias through homogeneity pursuit and can be applied to a wider range of scenarios.To estimate peer pressure in the model,we first present two algorithms based on the initialize expand merge method and the polynomial-time twostage method to estimate homogeneity parameters.Then we apply the nested pseudo-likelihood method and obtain consistent estimators of peer pressure.Simulation evaluations show that our proposed methodology can achieve desirable and effective results in terms of the community misclassification rate and parameter estimation error.We also illustrate the advantages of our model in the empirical analysis when compared with a benchmark model.展开更多
提出了一种基于 peer to peer技术的分布式Web缓存共享系统:BuddyWeb.该系统的核心理念是让企业网络中的所有PC能够相互共享浏览器中的本地缓存,从而形成一个高效的、大规模的分布式缓存共享系统,并使系统具备易管理、易实现、低成本等...提出了一种基于 peer to peer技术的分布式Web缓存共享系统:BuddyWeb.该系统的核心理念是让企业网络中的所有PC能够相互共享浏览器中的本地缓存,从而形成一个高效的、大规模的分布式缓存共享系统,并使系统具备易管理、易实现、低成本等优点;接着详细阐述了 BuddyWeb的工作原理和算法策略;然后,针对 Buddy Web系统的特性提出了仿真实验模型和评估方法.实验结果证明了BuddyWeb在命中率、网络通信流量负荷、系统响应延迟等诸方面均能取得令人满意的效果.展开更多
With the rapid development of computer networks there are more and more resources involoved in it,such as CPU cycles, PC's disk space and network bandwidth. Many people beheve that peer to peer computing can harne...With the rapid development of computer networks there are more and more resources involoved in it,such as CPU cycles, PC's disk space and network bandwidth. Many people beheve that peer to peer computing can harness these disruptive powers. In this paper we describe the applied fields,research issues and typical problems in peer to peer computing.展开更多
Peer to Peer网络(简称p2p)作为一种新型的覆盖网络引起了越来越多研究者的兴趣。本文介绍了在我国进行的骨干互联网上p2p网络流量测量。与现有国外研究不同,本文的数据来源于核心路由器,因此克服了它们的缺陷。其研究集中在汇聚流中的...Peer to Peer网络(简称p2p)作为一种新型的覆盖网络引起了越来越多研究者的兴趣。本文介绍了在我国进行的骨干互联网上p2p网络流量测量。与现有国外研究不同,本文的数据来源于核心路由器,因此克服了它们的缺陷。其研究集中在汇聚流中的3个周期性尖峰群、不同主机发送或接收流量的重尾分布、p2p流量的长相关特性以及提出了ADTE的估计方法来区分信令和数据流量。本文的研究也显示出Napster在p2p流中占大部分,这暗示着超级节点和阶层式拓扑较纯p2p结构潜在的优势。同时,观察到在我国p2p的流量仅占Internet总流量的1%弱,这个值跟国外的数据有很大区别。我们分析了其中的原因并希望该结论为我国p2p软件的发展提供参考。展开更多
基金supported by the National Nature Science Foundation of China(71771201,72531009,71973001)the USTC Research Funds of the Double First-Class Initiative(FSSF-A-240202).
文摘Social interaction with peer pressure is widely studied in social network analysis.Game theory can be utilized to model dynamic social interaction,and one class of game network models assumes that people’s decision payoff functions hinge on individual covariates and the choices of their friends.However,peer pressure would be misidentified and induce a non-negligible bias when incomplete covariates are involved in the game model.For this reason,we develop a generalized constant peer effects model based on homogeneity structure in dynamic social networks.The new model can effectively avoid bias through homogeneity pursuit and can be applied to a wider range of scenarios.To estimate peer pressure in the model,we first present two algorithms based on the initialize expand merge method and the polynomial-time twostage method to estimate homogeneity parameters.Then we apply the nested pseudo-likelihood method and obtain consistent estimators of peer pressure.Simulation evaluations show that our proposed methodology can achieve desirable and effective results in terms of the community misclassification rate and parameter estimation error.We also illustrate the advantages of our model in the empirical analysis when compared with a benchmark model.
文摘在分布式Peer-to-Peer (P2P)系统中,每个节点都具有相同的能力,负有相同的责任.它们将自己的资源提供给系统,同时可以共享系统中的信息和服务.但是,大多数P2P系统都具有局限性,比如说Napster,Gnutella,它们提供资源共享的粒度很粗糙,进一步地,它们忽略了文件在内容粒度上的共享.并且,大多数系统中节点的Peer是静态指定的,系统中不支持只具有临时IP的节点加入.提出了一个BestPeer的P2P系统,它具有以下几个特性:首先,它将移动Agent技术与P2P技术相结合,从而可以在数据提供者本地进行数据处理.其次,这个系统具有自配置的特性.一个节点可以动态地决定与哪个节点直接相连(决定哪个节点成为该节点的Peer),从而使网络结构的配置达到最优.另外,BestPeer系统提出了一个位置独立的全局名查找服务器(LIGLO).这个服务器可以惟一地识别具有动态IP地址的节点,从而使节点能够在它的Peer的IP地址发生改变后仍然能够找到它.BestPeer系统建立后,提出了一套评估系统的方法.采用32台Pentium II PC机进行实验,每台机器上都运行基于Java的存储管理程序.实验结果表明,BestPeer系统具有比传统的无自调整能力的P2P系统更好的性能.更进一步的实验还显示了BestPeer系统优于Gnutella 协议下的系统.
文摘With the rapid development of computer networks there are more and more resources involoved in it,such as CPU cycles, PC's disk space and network bandwidth. Many people beheve that peer to peer computing can harness these disruptive powers. In this paper we describe the applied fields,research issues and typical problems in peer to peer computing.
文摘Peer to Peer网络(简称p2p)作为一种新型的覆盖网络引起了越来越多研究者的兴趣。本文介绍了在我国进行的骨干互联网上p2p网络流量测量。与现有国外研究不同,本文的数据来源于核心路由器,因此克服了它们的缺陷。其研究集中在汇聚流中的3个周期性尖峰群、不同主机发送或接收流量的重尾分布、p2p流量的长相关特性以及提出了ADTE的估计方法来区分信令和数据流量。本文的研究也显示出Napster在p2p流中占大部分,这暗示着超级节点和阶层式拓扑较纯p2p结构潜在的优势。同时,观察到在我国p2p的流量仅占Internet总流量的1%弱,这个值跟国外的数据有很大区别。我们分析了其中的原因并希望该结论为我国p2p软件的发展提供参考。
