公开(公告)号：US20130129352A1

公开(公告)日：2013-05-23

申请号：US13744615

申请日：2013-01-18

Applicant: AT & T Intellectual Property I, L.P.

Inventor： Ali Zolfaghari ,  Andre Fuetsch ,  Christine Bouamalay ,  Miguel Tomas Molina

IPC: H04L12/24 ,  H04J14/00

CPC classification number: H04L41/0826 ,  H04J3/1611 ,  H04J14/00 ,  H04L41/0896 ,  H04L41/145

Abstract: A method includes forming a set of direct connections (including a high-speed connection and a low-speed connection) between an origination central office (OCO) and a destination central office (DCO). The method includes forming a spoke connection between the OCO and a hub node and forming a connection between the hub node and the DCO. The spoke connection is formed to carry first residual demand traffic from the OCO to the hub node. The connection is formed to carry the first residual demand traffic and second residual demand traffic (received at the hub node from other OCOs) from the hub node to the DCO. The method includes determining a first estimated cost (of forming the set of direct connections) and a second estimated cost (of forming the spoke connection and the connection). The method includes determining whether the first estimated cost exceeds the second estimated cost.

Abstract translation: 一种方法包括在起始中心局（OCO）和目的地中心局（DCO）之间形成一组直接连接（包括高速连接和低速连接）。 该方法包括在OCO和集线器节点之间形成辐条连接并形成集线器节点和DCO之间的连接。 辐条连接形成为承载从OCO到集线器节点的第一残余需求业务。 连接被形成为携带从集线器节点到DCO的第一剩余需求业务和第二剩余需求业务（在中枢节点处从其他OCO接收）。 该方法包括确定第一估计成本（形成直接连接集合）和第二估计成本（形成辐条连接和连接）。 该方法包括确定第一估计成本是否超过第二估计成本。

公开(公告)号：US09237104B2

公开(公告)日：2016-01-12

申请号：US13870352

申请日：2013-04-25

Applicant: AT&T INTELLECTUAL PROPERTY I, L.P.

Inventor： Ali Zolfaghari ,  Christine E. Bouamalay ,  Miguel T. Molina ,  Raghvendra G. Savoor ,  Stephen S. Sowell ,  Ronald D. Crawford

IPC: H04J3/14 ,  H04L12/801 ,  H04L12/24

CPC classification number: H04L47/127 ,  H04L41/0823 ,  H04L41/145 ,  H04L41/147 ,  H04L41/22 ,  H04L41/5009 ,  H04L41/5077

Abstract: A method for relieving network node congestion includes determining an average of an aggregated load on a network node that routes network traffic, projecting a demand on the network node based on extrapolating the average of the aggregated load to a future period, determining a current level of congestion on the network node, and projecting a future level of congestion on the network node based on the projected demand and the current level of congestion. An available capacity of other network nodes in a portion of the communication network that includes the network node is determined, as well as whether the projected future level of congestion on the network node can be relieved using the determined available capacity of the other network nodes.

Abstract translation: 一种减轻网络节点拥塞的方法包括：确定网络节点上的路由网络流量的聚合负载的平均值;基于将所述聚合负载的平均值外推到未来时段，将所述网络节点的需求投射到所述网络节点上; 网络节点上的拥塞，并且基于预计的需求和当前的拥塞水平，在网络节点上预测未来的拥塞水平。 确定包括网络节点的通信网络的一部分中的其他网络节点的可用容量，以及是否可以使用所确定的其他网络节点的可用容量来释放网络节点上预计的拥塞级别。

公开(公告)号：US20130246649A1

公开(公告)日：2013-09-19

申请号：US13870352

申请日：2013-04-25

Applicant: AT&T INTELLECTUAL PROPERTY I, L.P.

Inventor： Ali Zolfaghari ,  Christine E. Bouamalay ,  Miguel T. Molina ,  Raghvendra G. Savoor ,  Stephen S. Sowell ,  Ronald D. Crawford

IPC: H04L12/70

CPC classification number: H04L47/127 ,  H04L41/0823 ,  H04L41/145 ,  H04L41/147 ,  H04L41/22 ,  H04L41/5009 ,  H04L41/5077

Abstract: A method for relieving network node congestion includes determining an average of an aggregated load on a network node that routes network traffic, projecting a demand on the network node based on extrapolating the average of the aggregated load to a future period, determining a current level of congestion on the network node, and projecting a future level of congestion on the network node based on the projected demand and the current level of congestion. An available capacity of other network nodes in a portion of the communication network that includes the network node is determined, as well as whether the projected future level of congestion on the network node can be relieved using the determined available capacity of the other network nodes.

Abstract translation: 一种减轻网络节点拥塞的方法包括：确定网络节点上的路由网络流量的聚合负载的平均值;基于将所述聚合负载的平均值外推到未来时段，将所述网络节点的需求投射到所述网络节点上; 网络节点上的拥塞，并且基于预计的需求和当前的拥塞水平，在网络节点上预测未来的拥塞水平。 确定包括网络节点的通信网络的一部分中的其他网络节点的可用容量，以及是否可以使用所确定的其他网络节点的可用容量来释放网络节点上预计的拥塞级别。

公开(公告)号：US08660010B2

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

申请号：US13744615

申请日：2013-01-18

Applicant: AT&T Intellectual Property I, L.P.

Inventor： Ali Zolfaghari ,  Andre Fuetsch ,  Christine Bouamalay ,  Miguel Tomas Molina

IPC: H04J1/16

CPC classification number: H04L41/0826 ,  H04J3/1611 ,  H04J14/00 ,  H04L41/0896 ,  H04L41/145

Abstract: A method includes forming a set of direct connections (including a high-speed connection and a low-speed connection) between an origination central office (OCO) and a destination central office (DCO). The method includes forming a spoke connection between the OCO and a hub node and forming a connection between the hub node and the DCO. The spoke connection is formed to carry first residual demand traffic from the OCO to the hub node. The connection is formed to carry the first residual demand traffic and second residual demand traffic (received at the hub node from other OCOs) from the hub node to the DCO. The method includes determining a first estimated cost (of forming the set of direct connections) and a second estimated cost (of forming the spoke connection and the connection). The method includes determining whether the first estimated cost exceeds the second estimated cost.

Abstract translation: 一种方法包括在起始中心局（OCO）和目的地中心局（DCO）之间形成一组直接连接（包括高速连接和低速连接）。 该方法包括在OCO和集线器节点之间形成辐条连接并形成集线器节点和DCO之间的连接。 辐条连接形成为承载从OCO到集线器节点的第一残余需求业务。 连接被形成为携带从集线器节点到DCO的第一剩余需求业务和第二剩余需求业务（在中枢节点处从其他OCO接收）。 该方法包括确定第一估计成本（形成直接连接集合）和第二估计成本（形成辐条连接和连接）。 该方法包括确定第一估计成本是否超过第二估计成本。