The k-core decomposition can be used to reveal structure in a graph. It is straight-forward to
implement using a centralised algorithm with complete knowledge of the graph, but no …

通过地标节点选取机制, TZ 紧凑路由算法很好地保证了路由系统的扩展性. 但TZ
紧凑路由算法并没有限制地标节点的覆盖面, 也没分析覆盖面过小的地标节点是否利于信息的 …

摘要紧凑路由是一类可扩展路由方法, 能够在使用较短路径路由的同时, 大幅降低节点路由表的
空间开销. 为解决Internet 的路由扩展问题, 无标度网络上的紧凑路由最近引起了关注. 然而 …

The Internet has grown in size at rapid rates since BGP records began, and continues to do
so. This has raised concerns about the scalability of the current BGP routing system, as the …

Existing simulators designed for the evaluation of distributed graph algorithms tend to be
based on a threaded model of concurrency. This leads to scaling issues when simulating …