公开(公告)号：WO2013170838A3

公开(公告)日：2014-02-06

申请号：PCT/CN2013080339

申请日：2013-07-29

Applicant: ZTE CORP

Inventor： ZHANG LEI ,  GUO RUI

IPC: H04L12/70

CPC classification number: H04L45/02 ,  H04L41/12 ,  H04L45/28

Abstract: Disclosed are a method and an apparatus for determining a network topology structure. The method comprises: classifying all links of a network into link sets L(V1)...L(Vn) according to rate levels V1...Vn, wherein n is a positive integer greater than or equal to 1; classifying a link set L(Vx) into link subsets L(Vx)1...L(Vx)k according to the connectivity, wherein x is greater than or equal to 1 and smaller than or equal to n, and k is a positive integer greater than or equal to 1; and determining a network layer of a link subset L(Vx)y, wherein y is greater than or equal 1 and smaller than or equal to k. The present invention solves a problem in which it is difficult to manually classify all links (further, nodes on the links) to network levels of a layered network in a situation the scale of the network is great, can automatically calculate a network layer of a node, and further automatically calculate a networking structure and the number of the nodes in each layer of the network, thereby providing basic data for the subsequent optimization of a network topology structure.

Abstract translation: 公开了一种用于确定网络拓扑结构的方法和装置。 该方法包括：根据速率水平V1 ... Vn将网络的所有链路分类为链路集L（V1）... L（Vn），其中n是大于或等于1的正整数; 根据连通性将链路集L（Vx）分类为链路子集L（Vx）1 ... L（Vx）k，其中x大于或等于1且小于或等于n，并且k是 正整数大于或等于1; 以及确定链路子集L（Vx）y的网络层，其中y大于或等于1且小于或等于k。 本发明解决了在网络规模大的情况下难以将所有链路（进一步地，链路上的节点）分类到分层网络的网络层次的问题，可以自动计算网络层 节点，并进一步自动计算网络结构和网络每层节点数，从而为网络拓扑结构的后续优化提供基本数据。

公开(公告)号：EP2908481A4

公开(公告)日：2015-10-28

申请号：EP13790731

申请日：2013-07-29

Applicant: ZTE CORP

Inventor： ZHANG LEI ,  GUO RUI

IPC: H04L12/24 ,  H04L12/70

CPC classification number: H04L45/02 ,  H04L41/12 ,  H04L45/28

Abstract: Provided is a method for determining topology of a network, including: all links of the network are divided into link sets L(V1), ..., L(Vn) according to rate levels V1, ..., Vn of links of the network, wherein n is a positive integer equal to or larger than 1; a link set L(Vx) is divided into link subsets L(Vx)1, ..., L(Vx)k according to connectivities of the links, wherein 1‰¤x‰¤n and k is a positive integer equal to or larger than 1; and a network layer to which a link subset L(Vx)y is attributed is determined, wherein 1‰¤y‰¤k. The disclosure solves the problem that it is difficult to divide artificially all links (and then nodes of respective links) to various network layers of respective layered networks when the networks have relatively large scale, it enables automatic calculation of a network layer to which a node is attributed, then enables automatic calculation of a networking structure of each layer of network and a number of nodes therein, thereby providing basic data to subsequent topology optimization of the network.