公开(公告)号：US20050174934A1

公开(公告)日：2005-08-11

申请号：US10776466

申请日：2004-02-11

Applicant: Muralidharan Kodialam ,  Tirunell Lakshman ,  Sudipta Sengupta

Inventor： Muralidharan Kodialam ,  Tirunell Lakshman ,  Sudipta Sengupta

IPC: H04L12/24 ,  H04L12/56 ,  H04L12/28 ,  H04J3/22

CPC classification number: H04L45/00 ,  H04L41/0654 ,  H04L41/0896 ,  H04L41/5025 ,  H04L45/14 ,  H04L45/50

Abstract: A given network of nodes that are interconnected by links having corresponding capacities has each link's capacity divided into working capacity and restoration capacity without a priori information about network traffic characteristics. Allocation of working capacity and restoration capacity for the network might be optimized by characterization of the network in accordance with a linear programming problem (LPP) subject to network constraints and then generating a solution to the LPP either exactly or with an approximation. Partitioning the capacity of each link in the network into working and restoration capacities minimizes the restoration capacity overhead in the network to allow for higher network utilization.

Abstract translation: 通过具有相应容量的链路相互连接的给定的节点网络将每个链路的容量划分为工作容量和恢复能力，而无需关于网络流量特性的先验信息。 可以根据网络约束的线性规划问题（LPP）对网络的分配进行优化，然后通过精确地或以近似生成LPP的解决方案，来优化网络的工作能力和恢复能力。 将网络中的每个链路的容量划分为工作和恢复能力，可以最大限度地减少网络中的恢复能力开销，从而实现更高的网络利用率。