公开(公告)号：US5515367A

公开(公告)日：1996-05-07

申请号：US130350

申请日：1993-10-01

申请人： Louis A. Cox, Jr. ,  Yuping Qiu ,  George E. Tegan ,  Lu Lu

发明人： Louis A. Cox, Jr. ,  Yuping Qiu ,  George E. Tegan ,  Lu Lu

IPC分类号： H04L12/24 ,  H04Q3/00 ,  H04Q11/04 ,  H04L12/43 ,  H04L12/46

CPC分类号： H04Q3/0083 ,  H04L41/145 ,  H04L41/22 ,  H04Q3/002 ,  H04J2203/0057 ,  H04L41/0823 ,  H04L41/0826

摘要： A method is disclosed for use in cooperation with a computer having memory in a Synchronous Optical Network (SONET) for generating an optimized transition plan for the placement of Self-Healing Rings (SHR) and the routing of point-to-point demand in accordance with projected customer demand over a selected multi-period time interval. By determining the number of nodes within a SONET, the demand therebetween over selected time interval as well as the discounted add-drop cost for a plurality of selected Add-Drop Multiplexers (ADMs), a set of logical rings as well as a set of physical rings and detailed routing information may be obtained and graphically illustrated. Logical rings may be determined by optimizing discounted fixed and interconnection costs for the plurality of ADMs in accordance with a selected mixed integer program to generate a corresponding electrical signal for receipt by the computer memory. Thereafter, the placement of physical self-healing rings, the cash flow out and optimal traffic routing may be determined in accordance with a second selected mixed integer program whereupon a second electrical signal may be generated corresponding thereto. Utilizing a heuristic approach, where the number of nodes under study is high, logical rings may be determined through an iterative process of randomly generating new proposed rings or, in the alternative, randomly expanding existing proposed rings until all demand has been satisfied.

摘要翻译： 公开了一种用于与在同步光网络（SONET）中具有存储器的计算机配合使用的方法，用于产生用于放置自愈环（SHR）的优化过渡计划以及根据点对点需求的路由 预计客户需求超过选定的多周期时间间隔。 通过确定SONET内的节点数量，在所选择的时间间隔之间的需求以及多个选择的分插复用器（ADM）的折扣加成成本，一组逻辑环以及一组 物理环和详细路由信息可以获得并以图形方式示出。 可以通过根据所选择的混合整数程序来优化多个ADM的折扣固定和互连成本来确定逻辑环，以产生相应的电信号以供计算机存储器接收。 此后，可以根据第二选择的混合整数程序确定物理自愈环的放置，现金流出和最佳交通路由，从而可以相应地产生第二电信号。 利用启发式方法，其中正在研究的节点数量高，可以通过随机生成新的提议环的迭代过程来确定逻辑环，或者替代地，随机扩展现有的建议环，直到满足所有需求。

公开(公告)号：US5508999A

公开(公告)日：1996-04-16

申请号：US131045

申请日：1993-10-01

申请人： Louis A. Cox, Jr. ,  Yuping Qiu ,  George E. Tegan ,  Xiaorong Sun

发明人： Louis A. Cox, Jr. ,  Yuping Qiu ,  George E. Tegan ,  Xiaorong Sun

IPC分类号： H04L12/24 ,  H04Q3/00 ,  H04Q11/04 ,  H04L12/28

CPC分类号： H04L41/22 ,  H04L41/0826 ,  H04L41/145 ,  H04Q3/002 ,  H04Q3/0083 ,  H04J2203/0057 ,  H04L41/0823

摘要： A method and system is provided for use in cooperation with a computer having a memory for generating an optimized transition plan for the placement and interconnection of carrier hubs in a local access network having a plurality of Central Offices (COs), Serving Wire Centers (SWCs) and Point-of-Presence (POP) exchange carriers such that calls may be routed at least cost. In operation, the total number and location of existing SWCs within the network must be determined along with the total switched and special access demand. Thereafter, known tariff rates for selected channel terminals, transport channels and multiplexers must be determined along with the total number of DS3 lines from each SWC to its corresponding POP. By expressing determined network demand as selected mixed-integer program decision variables and determining a corresponding set of logical constraints consistent with these decision variables, the optimized placement of hubs within the local access network may be determined. In addition, the corresponding location and type of channel terminals, transport channels and multiplexers may be implemented all accordance with the mixed-integer program and an electrical signal corresponding thereto may be generated for receipt by the computer memory. This information may thereafter be retrieved from computer memory and graphically displayed on a user-friendly interface.

摘要翻译： 提供了一种与具有存储器的计算机配合使用的方法和系统，所述存储器用于生成用于在具有多个中心局（CO），服务线中心（SWC）的本地接入网络中的载波集线器的放置和互连的优化转换计划 ）和点对点（POP）交换运营商，使得呼叫可以以至少成本路由。 在运营中，网络中现有的SWC的总数和位置必须与总的交换和特殊访问需求一起确定。 此后，必须确定所选频道终端，运输频道和多路复用器的已知电费率，以及每个SWC到其相应POP的DS3线路总数。 通过将确定的网络需求表示为选定的混合整数程序决策变量并确定与这些决策变量一致的对应的一组逻辑约束，可以确定集线器在本地接入网络内的优化布局。 此外，可以根据混合整数程序来实现信道终端，传输信道和多路复用器的相应位置和类型，并且可以生成与之对应的电信号以供计算机存储器接收。 此后可以从计算机存储器检索该信息，并以图形方式显示在用户友好界面上。