-
公开(公告)号:US07574506B1
公开(公告)日:2009-08-11
申请号:US11904086
申请日:2007-09-26
申请人: Nicholas G. Duffield , Albert Gordon Greenberg , John G. Klincewicz , Matthew Roughan , Yin Zhang
发明人: Nicholas G. Duffield , Albert Gordon Greenberg , John G. Klincewicz , Matthew Roughan , Yin Zhang
IPC分类号: G06F15/173
CPC分类号: H04L43/00 , H04L41/0213 , H04L43/0882
摘要: A method and apparatus for the estimation of traffic matrices in a network are disclosed.
摘要翻译: 公开了一种用于估计网络中的业务矩阵的方法和装置。
-
公开(公告)号:US07293086B1
公开(公告)日:2007-11-06
申请号:US10627767
申请日:2003-07-25
申请人: Nicholas G. Duffield , Albert Gordon Greenberg , John G. Klincewicz , Matthew Roughan , Yin Zhang
发明人: Nicholas G. Duffield , Albert Gordon Greenberg , John G. Klincewicz , Matthew Roughan , Yin Zhang
IPC分类号: G06F15/173
CPC分类号: H04L43/00 , H04L41/0213 , H04L43/0882
摘要: A method and apparatus for the estimation of traffic matrices in a network are disclosed. Mechanisms are disclosed for measuring traffic volume from a plurality of ingress points to a plurality of egress points in a large scanl network, such as an IP backbone network. The traffic matrix is advantageously inferred from widely available link load measurements such as SNMP data.
摘要翻译: 公开了一种用于估计网络中的业务矩阵的方法和装置。 公开了用于测量从诸如IP骨干网络的大型扫描网络中的多个入口点到多个出口点的交通量的机制。 有利地从广泛可用的链路负载测量(例如SNMP数据)推断业务矩阵。
-
3.
公开(公告)号:US6061335A
公开(公告)日:2000-05-09
申请号:US899103
申请日:1997-07-24
申请人: Nicholas Paul De Vito , Mohan Gawande , John G. Klincewicz , Hanan Luss , Moshe B. Rosenwein , Romanath Roy
发明人: Nicholas Paul De Vito , Mohan Gawande , John G. Klincewicz , Hanan Luss , Moshe B. Rosenwein , Romanath Roy
CPC分类号: H04L12/4637 , H04J3/085 , H04Q11/0478 , H04J2203/0039 , H04J2203/0042 , H04J2203/0051
摘要: A method is provided for designing a hierarchical architecture for a synchronous optical network (SONET) given a plurality of demand nodes at which communications traffic originates and at least one destination node at which the communications traffic is collected for transmission to a switch. The method includes the steps of: (a) dividing the plurality of demand nodes into distinct groups of demand nodes; (b) selecting at least one node for each group to serve as a ring hub for connection to a backbone ring; (c) designing a backbone ring topology that includes at least the ring hubs and the destination node; (d) designing an access ring topology for each of the demand node groups so that the backbone ring and access ring topologies constitute a preliminary network topology; (e) evaluating a cost associated with the preliminary network topology; (f) selecting at least one alternative ring hub to provide a new set of ring hubs; (g) repeating steps (c)-(e) for the new set of ring hubs to determine if a resulting network cost estimate is reduced; (h) repeating steps (f)-(g) until a minimum cost network topology is produced. Other aspects of the invention are directed to hub and spoke topology design and SONET transport design.
摘要翻译: 提供了一种用于设计用于给定通信业务发起的多个需求节点的同步光网络(SONET)的层次结构的方法,以及收集通信业务以传送到交换机的至少一个目的地节点。 该方法包括以下步骤:(a)将多个需求节点分成不同的需求节点组; (b)为每个组选择至少一个节点以用作连接到骨干环的环集线器; (c)设计至少包括环集线器和目的节点的骨干环拓扑; (d)为每个需求节点组设计接入环拓扑,使得骨干环和接入环拓扑构成初步网络拓扑; (e)评估与初步网络拓扑相关的成本; (f)选择至少一个替代的环形集线器以提供一组新的环形集线器; (g)对新集合的环集线器重复步骤(c) - (e)以确定所得到的网络成本估计是否减少; (h)重复步骤(f) - (g),直到产生最小成本网络拓扑。 本发明的其它方面涉及集线器和辐射拓扑设计和SONET传输设计。
-
-