公开(公告)号：US5729692A

公开(公告)日：1998-03-17

申请号：US659172

申请日：1996-06-05

申请人： Yuping Qiu ,  Jennifer Ryan ,  Xiaorong Sun ,  Youngho Lee

发明人： Yuping Qiu ,  Jennifer Ryan ,  Xiaorong Sun ,  Youngho Lee

IPC分类号： G06F17/50 ,  H04J3/08 ,  H04L12/24 ,  H04Q3/00 ,  H04Q11/04 ,  G06F13/368 ,  H04J3/26

CPC分类号： H04Q3/0083 ,  G06F17/509 ,  H04J3/085 ,  H04L41/0826 ,  H04L41/145 ,  H04J2203/0057 ,  H04L41/0803

摘要： A method and system for generating an optimized solution for assigning traffic loads to channels in SONET rings in cooperation with a computer having sufficient memory. The method and system utilize a Mixed Integer Program (MIP) having corresponding variables necessary to model the cost of Terminal Multiplexers, Add/Drop Multiplexers and corresponding interface ports necessary to route the desired traffic loads. By routing traffic loads to reduce computation time and imposing mathematical bounds on the MIP variables, the number of possible MIP solutions is reduced. The Mixed Integer Program is minimized in accordance with the traffic routing and imposed mathematical bounds such that an electrical signal is generated which corresponds to the optimized traffic load assignment information. The signal is converted to digital format whereupon it may be retrieved from computer memory and displayed to the user.

摘要翻译： 与具有足够存储器的计算机协作，生成用于向SONET环中的信道分配业务负载的优化解决方案和系统。 该方法和系统利用具有必要的对应变量的混合整数程序（MIP）来模拟终端多路复用器，分插复用器和路由所需业务负载所需的相应接口端口的成本。 通过路由流量负载来减少计算时间并对MIP变量施加数学界限，减少了可能的MIP解决方案的数量。 混合整数程序根据流量路由和强制的数学界限被最小化，使得产生对应于优化的业务负载分配信息的电信号。 该信号被转换成数字格式，从而可以从计算机存储器检索并显示给用户。

公开(公告)号：US5615254A

公开(公告)日：1997-03-25

申请号：US416255

申请日：1995-04-04

申请人： Yuping Qiu ,  Jennifer Ryan ,  Xiaorong Sun ,  George B. Pillsbury ,  Alex Stevens ,  Rudy Zubiate

发明人： Yuping Qiu ,  Jennifer Ryan ,  Xiaorong Sun ,  George B. Pillsbury ,  Alex Stevens ,  Rudy Zubiate

IPC分类号： H04Q3/66 ,  H04M3/36 ,  H04M7/06

CPC分类号： H04Q3/66

摘要： Methods and systems of traffic routing in a circuit switched communication network having a plurality of switches and a plurality of trunk groups connecting the switches are disclosed. The methods include a step of determining a set of alternate routing paths for each of a plurality of ordered pairs of the switches, wherein the number of alternate routing paths through each of the trunk groups is constrained to be less than a corresponding first predetermined threshold. In one embodiment, the alternate routing paths are determined by computing a solution to a predetermined integer programming problem. In another embodiment, a heuristic technique is used to determine the alternate routing paths.

摘要翻译： 公开了具有多个交换机的电路交换通信网络中的业务路由的方法和系统以及连接交换机的多个中继线群。 所述方法包括为交换机的多个有序对中的每一个确定一组替代路由路径的步骤，其中通过每个中继线群组的备用路由路径的数量被限制为小于对应的第一预定阈值。 在一个实施例中，通过计算预定整数规划问题的解决方案来确定备选路由路径。 在另一个实施例中，使用启发式技术来确定备用路由路径。

公开(公告)号：US5564021A

公开(公告)日：1996-10-08

申请号：US252035

申请日：1994-05-31

申请人： Yuping Qiu ,  Jennifer Ryan ,  Xiaorong Sun ,  Youngho Lee

发明人： Yuping Qiu ,  Jennifer Ryan ,  Xiaorong Sun ,  Youngho Lee

IPC分类号： G06F17/50 ,  H04J3/08 ,  H04L12/24 ,  H04Q3/00 ,  H04Q11/04 ,  G06F15/20 ,  G06F9/312

CPC分类号： H04Q3/0083 ,  G06F17/509 ,  H04J3/085 ,  H04L41/0826 ,  H04L41/145 ,  H04J2203/0057 ,  H04L41/0803

摘要： A method for generating an optimized solution for assigning traffic loads to channels in SONET rings in cooperation with a computer having sufficient memory. The method utilizes a Mixed Integer Program (MIP) having corresponding variables necessary to model the cost of Terminal Multiplexers, Add/Drop Multiplexers and corresponding interface ports necessary to route the desired traffic loads. By routing traffic loads to reduce computation time and imposing mathematical bounds on the MIP variables, the number of possible MIP solutions is reduced. The Mixed integer Program is minimized in accordance with the traffic routing and imposed mathematical bounds such that an electrical signal is generated which corresponds to the optimized traffic load assignment information. The signal is converted to digital format whereupon it may be retrieved from computer memory and displayed to the user.

摘要翻译： 一种用于生成用于与具有足够存储器的计算机协作来向SONET环中的信道分配业务负载的优化解决方案。 该方法利用具有相应变量的混合整数程序（MIP）来模拟终端多路复用器，分插复用器和路由所需业务负载所需的相应接口端口的成本。 通过路由流量负载来减少计算时间并对MIP变量施加数学界限，减少了可能的MIP解决方案的数量。 混合整数程序根据流量路由和施加的数学界限被最小化，使得生成对应于优化的业务负载分配信息的电信号。 该信号被转换成数字格式，从而可以从计算机存储器检索并显示给用户。

公开(公告)号：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线路总数。 通过将确定的网络需求表示为选定的混合整数程序决策变量并确定与这些决策变量一致的对应的一组逻辑约束，可以确定集线器在本地接入网络内的优化布局。 此外，可以根据混合整数程序来实现信道终端，传输信道和多路复用器的相应位置和类型，并且可以生成与之对应的电信号以供计算机存储器接收。 此后可以从计算机存储器检索该信息，并以图形方式显示在用户友好界面上。