专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20110286336A1 RELAXED CONSTRAINED SHORTEST PATH FIRST (R-CSPF) 有权
标题翻译：放松约束最短路径（R-CSPF）
公开(公告)号：US20110286336A1
公开(公告)日：2011-11-24
申请号：US13197540
申请日：2011-08-03
申请人： Jean-Philippe Vasseur , Stefano Novello , Steve Y. Chiu
发明人： Jean-Philippe Vasseur , Stefano Novello , Steve Y. Chiu
IPC分类号： H04L12/26
CPC分类号： H04L45/00 , H04L45/124 , H04L45/125
摘要： In one embodiment, a target bandwidth, a lower bandwidth boundary constraint, and an upper cost boundary constraint for a constrained path are configured. A set of paths are computed that have bandwidth within the lower bandwidth boundary constraint and cost within the upper cost boundary constraint. A determination is made whether one or more paths of the set of paths has bandwidth that provides at least the target bandwidth and, if so, a path from the one or more paths of the set of paths having bandwidth that provides at least the target bandwidth is selected to use as the constrained path, and, if not, a path from the one or more paths of the set having bandwidth that does not provide at least the target bandwidth that has bandwidth closest to the target bandwidth is selected to use as the constrained path.
摘要翻译：在一个实施例中，配置用于受约束路径的目标带宽，较低带宽边界约束和上限成本边界约束。计算一组路径，其具有在较低带宽边界约束内的带宽和在上限成本边界约束内的成本。确定该组路径中的一个或多个路径是否具有提供至少目标带宽的带宽，如果是，则具有至少提供目标带宽的具有带宽的路径组中的一个或多个路径的路径被选择用作约束路径，并且如果不是，则具有不具有至少提供具有最接近目标带宽的带宽的目标带宽的带宽的集合的一个或多个路径的路径被选择为使用作为约束路径

2. 发明授权

US5884276A System for translating an optimization problem for use in efficient resource allocation 失效
标题翻译：用于翻译优化问题以用于高效资源分配的系统
公开(公告)号：US5884276A
公开(公告)日：1999-03-16
申请号：US801094
申请日：1997-02-14
申请人： Jianhua Zhu , Steve Y. Chiu
发明人： Jianhua Zhu , Steve Y. Chiu
IPC分类号： G06Q10/00 , G06F17/60
CPC分类号： G06Q10/06 , G06Q10/0631
摘要： An improved system for translating an optimization problem for use in efficient resource allocation. The improved system of the present invention includes means for generating an index link record for each of the index variables in the optimization problem so as to eliminate the need for a symbol table and a plurality of temporary data records. The system also includes means for linking the index link records of the index variables requiring expansion in a reverse order of the order listed in the optimization problem so as to reduce the number of traversals performed during expansion processing. The index link records have a pointer for identifying the next index variable requiring expansion.
摘要翻译：一种用于翻译优化问题以用于高效资源分配的改进系统。本发明的改进系统包括用于在优化问题中为每个索引变量生成索引链接记录的装置，以便消除对符号表和多个临时数据记录的需要。该系统还包括用于以优化问题中列出的顺序的相反顺序链接需要扩展的索引变量的索引链接记录的装置，以便减少在扩展处理期间执行的遍历次数。索引链接记录具有用于标识需要扩展的下一个索引变量的指针。

3. 发明授权

US06463058B1 Method for optimally selecting nodes for removal from a hierarchical communication network 有权
标题翻译：用于最佳选择要从分层通信网络中移除的节点的方法
公开(公告)号：US06463058B1
公开(公告)日：2002-10-08
申请号：US09143472
申请日：1998-08-28
申请人： Victoria L. C. Okeson , Pierre L. Bastien , Steve Y. Chiu , Youngho Lee
发明人： Victoria L. C. Okeson , Pierre L. Bastien , Steve Y. Chiu , Youngho Lee
IPC分类号： H04L1228
CPC分类号： H04L41/0823 , H04L41/00
摘要： Local signal transfer points (LSTPs) are optimally selected for removal from a Signaling System Number 7 (SS7) network. At least one network element is connected to each LSTP and each LSTP is connected to a parent node. Each LSTP is determined as a flexible LSTP or a fixed LSTP. A potential network configuration is formed with at least one flexible LSTP excluded. Each network element is reconnected to one LSTP in the potential network configuration and each LSTP in the potential network configuration is reconnected to one parent node. A total cost based on the potential network configuration is determined. The potential network configuration becomes the new best network configuration if the total cost is less than any previous total cost. The process is repeated for each potential network configuration resulting from removing a different combination of flexible LSTPs.
摘要翻译：本地信号传输点（LSTP）被最佳选择以从信令系统7（SS7）网络中移除。至少一个网元连接到每个LSTP，并且每个LSTP连接到父节点。每个LSTP被确定为灵活的LSTP或固定的LSTP。形成潜在的网络配置，其中排除了至少一个灵活的LSTP。每个网络元件在潜在的网络配置中重新连接到一个LSTP，并且潜在网络配置中的每个LSTP重新连接到一个父节点。确定基于潜在网络配置的总成本。如果总成本低于以前的总成本，潜在的网络配置将成为新的最佳网络配置。对于通过去除不同的灵活LSTP组合而导致的每个潜在的网络配置，重复该过程。

4. 发明授权

US6128500A Method and system to optimize capacity of a CDMA cellular communication system 失效
标题翻译：用于优化CDMA蜂窝通信系统容量的方法和系统
公开(公告)号：US6128500A
公开(公告)日：2000-10-03
申请号：US994060
申请日：1997-12-19
申请人： Subramanian Raghavan , Subramanian Vasudevan , Jennifer Sanchez , Steve Y. Chiu , Victoria L. C. Okeson
发明人： Subramanian Raghavan , Subramanian Vasudevan , Jennifer Sanchez , Steve Y. Chiu , Victoria L. C. Okeson
IPC分类号： H04W16/06 , H04Q7/20
CPC分类号： H04W16/06
摘要： A method and system for optimizing system capacity and allocation in a CDMA cellular communication system obtains a current call volume and associated call characteristics for each of a plurality of cell sites in the system, and estimates effective boundaries for each of the plurality of cell sites to minimize the weighted sum of powers received at selected base stations. Selection of base stations can include highly loaded sites and adjoining cell sites. System parameters are then controlled to effect the estimated cell site boundaries. Thus, the present invention allows for dynamic shrinking and enlarging of cell boundaries to enhance the system capacity advantages of CDMA while maintaining contiguous coverage and avoiding coverage holes.
摘要翻译：用于优化CDMA蜂窝通信系统中的系统容量和分配的方法和系统为系统中的多个小区站点中的每一个获取当前呼叫量和相关联的呼叫特性，并且估计多个小区站点中的每个小区站点的有效边界，最小化选定基站接收的功率的加权和。基站的选择可以包括高负载的站点和相邻的小区站点。然后控制系统参数以实现估计的细胞位点边界。因此，本发明允许小区边界的动态缩小和扩大，以增强CDMA的系统容量优势，同时保持连续覆盖并避免覆盖孔。

5. 发明申请

US20080123533A1 Relaxed constrained shortest path first (R-CSPF) 有权
标题翻译：轻松约束最短路径（R-CSPF）
公开(公告)号：US20080123533A1
公开(公告)日：2008-05-29
申请号：US11605013
申请日：2006-11-28
申请人： Jean-Philippe Vasseur , Stefano Novello , Steve Y. Chiu
发明人： Jean-Philippe Vasseur , Stefano Novello , Steve Y. Chiu
IPC分类号： G01R31/08
CPC分类号： H04L45/00 , H04L45/124 , H04L45/125
摘要： In one embodiment, a target bandwidth, a lower boundary constraint on bandwidth, and an upper boundary constraint on cost are configured on a path computation device. The device may then compute a set of paths that is within the lower bandwidth boundary and upper cost boundary constraints. If the set of paths contains one or more paths, the device may select a path having a bandwidth value that is closest to the target bandwidth. However if the set of paths contains no paths, the device may search amongst paths that violate either the maximum cost or minimum bandwidth limits, selecting the path closest to the violated constraint (e.g., whose combined violation is minimized). Also, a weighting factor may be configured to establish the relative importance for a cost violation in comparison to a bandwidth violation.
摘要翻译：在一个实施例中，在路径计算设备上配置目标带宽，带宽下边界约束和成本上限约束。然后，设备可以计算处于较低带宽边界内的一组路径和上限成本边界约束。如果路径集合包含一个或多个路径，则设备可以选择具有最接近目标带宽的带宽值的路径。然而，如果路径集合不包含路径，则设备可以在违反最大成本或最小带宽限制的路径中搜索，选择最接近违反约束的路径（例如，其组合违例被最小化）。此外，加权因子可以被配置为与带宽违规相比建立成本违规的相对重要性。

6. 发明授权

US08477629B2 Relaxed constrained shortest path first (R-CSPF) 有权
标题翻译：轻松约束最短路径（R-CSPF）
公开(公告)号：US08477629B2
公开(公告)日：2013-07-02
申请号：US13197540
申请日：2011-08-03
申请人： Jean-Philippe Vasseur , Stefano Novello , Steve Y. Chiu
发明人： Jean-Philippe Vasseur , Stefano Novello , Steve Y. Chiu
IPC分类号： H04J1/16
CPC分类号： H04L45/00 , H04L45/124 , H04L45/125
摘要： In one embodiment, a target bandwidth, a lower bandwidth boundary constraint, and an upper cost boundary constraint for a constrained path are configured. A set of paths are computed that have bandwidth within the lower bandwidth boundary constraint and cost within the upper cost boundary constraint. A determination is made whether one or more paths of the set of paths has bandwidth that provides at least the target bandwidth and, if so, a path from the one or more paths of the set of paths having bandwidth that provides at least the target bandwidth is selected to use as the constrained path, and, if not, a path from the one or more paths of the set having bandwidth that does not provide at least the target bandwidth that has bandwidth closest to the target bandwidth is selected to use as the constrained path.
摘要翻译：在一个实施例中，配置用于受约束路径的目标带宽，较低带宽边界约束和上限成本边界约束。计算一组路径，其具有在较低带宽边界约束内的带宽和在上限成本边界约束内的成本。确定该组路径中的一个或多个路径是否具有提供至少目标带宽的带宽，如果是，则具有至少提供目标带宽的具有带宽的路径组中的一个或多个路径的路径被选择用作约束路径，并且如果不是，则具有不具有至少提供具有最接近目标带宽的带宽的目标带宽的带宽的集合的一个或多个路径的路径被选择为使用作为约束路径

7. 发明授权

US08014291B2 Relaxed constrained shortest path first (R-CSPF) 有权
标题翻译：轻松约束最短路径（R-CSPF）
公开(公告)号：US08014291B2
公开(公告)日：2011-09-06
申请号：US11605013
申请日：2006-11-28
申请人： Jean-Philippe Vasseur , Stefano Novello , Steve Y. Chiu
发明人： Jean-Philippe Vasseur , Stefano Novello , Steve Y. Chiu
IPC分类号： H04J1/16
CPC分类号： H04L45/00 , H04L45/124 , H04L45/125
摘要： In one embodiment, a target bandwidth, a lower boundary constraint on bandwidth, and an upper boundary constraint on cost are configured on a path computation device. The device may then compute a set of paths that is within the lower bandwidth boundary and upper cost boundary constraints. If the set of paths contains one or more paths, the device may select a path having a bandwidth value that is closest to the target bandwidth. However if the set of paths contains no paths, the device may search amongst paths that violate either the maximum cost or minimum bandwidth limits, selecting the path closest to the violated constraint (e.g., whose combined violation is minimized). Also, a weighting factor may be configured to establish the relative importance for a cost violation in comparison to a bandwidth violation.
摘要翻译：在一个实施例中，在路径计算设备上配置目标带宽，带宽下边界约束和成本上限约束。然后，设备可以计算处于较低带宽边界内的一组路径和上限成本边界约束。如果路径集合包含一个或多个路径，则设备可以选择具有最接近目标带宽的带宽值的路径。然而，如果路径集合不包含路径，则设备可以在违反最大成本或最小带宽限制的路径中搜索，选择最接近违反约束的路径（例如，其组合违例被最小化）。此外，加权因子可以被配置为与带宽违规相比建立成本违规的相对重要性。

8. 发明授权

US5940373A Frame relay network planning tool 失效
标题翻译：帧中继网络规划工具
公开(公告)号：US5940373A
公开(公告)日：1999-08-17
申请号：US785805
申请日：1997-01-14
申请人： Steve Y. Chiu , Subramanian Raghavan , Ronald L. Hansen , Jiyang Xu
发明人： Steve Y. Chiu , Subramanian Raghavan , Ronald L. Hansen , Jiyang Xu
IPC分类号： H04L12/24 , H04L12/28 , H04J11/00
CPC分类号： H04L41/145 , H04L12/2854 , H04L41/082 , H04L41/0826 , H04L41/16
摘要： A frame relay network planning tool is provided for analyzing the status of an existing network, for evaluating the condition of any user defined configuration, and for optimizing the expansion of the network based on demand and costs. The tool recommends the optimal locations of new switches, the configurations of existing switches and the placement of new trunks, and backhaul locations where desirable. The tool attempts to optimize the network configuration for the given demand by a sequence of network configuration changes. After each change, an attempt is made to route the demand, with minimal cost, until all demand is routed. The network changes made by the program include in order of priority, upgrading a link, adding a link, upgrading a switch, and adding a switch. When this process is completed a survivability test is run to insure that the network configured by the tool is survivable.
摘要翻译：提供了帧中继网络规划工具，用于分析现有网络的状态，用于评估任何用户定义配置的状况，并根据需求和成本优化网络的扩展。该工具建议新开关的最佳位置，现有开关的配置和新干线的位置以及需要的回程位置。该工具尝试通过一系列网络配置更改来优化给定需求的网络配置。每次更改后，尝试以最小的成本路由需求，直到所有需求都被路由。该程序进行的网络更改包括按照优先级顺序，升级链路，添加链路，升级交换机，以及添加交换机。当此过程完成时，运行生存性测试以确保由工具配置的网络可以生存。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式