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

1. 发明授权

US07742433B2 Optimization for network utilization 失效
标题翻译：优化网络利用率
公开(公告)号：US07742433B2
公开(公告)日：2010-06-22
申请号：US11431415
申请日：2006-05-10
申请人： James King Brinkley , Elliott Bryant , Robert Bickerstaff , Paramasiviah Harshavardhana , Song C. Chen
发明人： James King Brinkley , Elliott Bryant , Robert Bickerstaff , Paramasiviah Harshavardhana , Song C. Chen
IPC分类号： H04L12/28
CPC分类号： H04L41/145 , H04L41/0823 , H04L41/12 , H04L41/22
摘要： A network optimization application receives as input information about a telecommunications network and the current use of that network. An optimization is performed in order to generate a preferred network use configuration which minimizes price for one or more customers of the telecommunications network. Information utilized as input into the application includes network nodes (e.g., switches, central offices, customer premises), linkages among nodes, prices associated with the network, and current use of the network. The output network use configuration may be browsed using a configuration interface listing network elements and also a detail interface for viewing details of individual network elements.
摘要翻译：网络优化应用接收有关电信网络的输入信息和该网络的当前使用。执行优化以便产生使电信网络的一个或多个客户的价格最小化的优选网络使用配置。用作应用程序的输入的信息包括网络节点（例如，交换机，中心局，客户驻地），节点之间的链接，与网络相关联的价格以及网络的当前使用。可以使用列出网络元件的配置接口以及用于查看各个网络元件的细节的详细界面来浏览输出网络使用配置。

2. 发明申请

US20050226400A1 System and method for a telecommunications network 审中-公开
标题翻译：电信网络的系统和方法
公开(公告)号：US20050226400A1
公开(公告)日：2005-10-13
申请号：US11054965
申请日：2005-02-10
申请人： Norman Farber , Casem Majd , Paramasiviah Harshavardhana , Weiping Wang
发明人： Norman Farber , Casem Majd , Paramasiviah Harshavardhana , Weiping Wang
IPC分类号： H04M3/42 , H04M15/00 , H04Q3/66
CPC分类号： H04Q3/66 , H04M15/8044 , H04M2215/42 , H04M2215/745 , H04Q2213/13034 , H04Q2213/13098 , H04Q2213/13138 , H04Q2213/13141 , H04Q2213/13164 , H04Q2213/1325 , H04Q2213/13383 , H04Q2213/13389
摘要： A method for improving traffic flow over a first network by adjusting the ratio and identity of traffic offloaded to a second network based on analysis of call detail records (CDRs).
摘要翻译：一种通过基于呼叫详细记录（CDR）的分析来调整被卸载到第二网络的业务的比率和身份来改善第一网络上的业务流量的方法。

3. 发明授权

US06463033B1 Dual hubbed tree architecture for a communication network 失效
标题翻译：用于通信网络的双hubbed树结构
公开(公告)号：US06463033B1
公开(公告)日：2002-10-08
申请号：US09072368
申请日：1998-05-04
申请人： Paramasiviah Harshavardhana
发明人： Paramasiviah Harshavardhana
IPC分类号： H04J116
CPC分类号： H04L45/00 , H04J2203/0053 , H04L12/4637 , H04L45/125 , H04L45/22 , H04L45/28 , H04L45/48 , H04Q11/0062 , H04Q2011/0073 , H04Q2011/0092
摘要： Capacity demands are routed in an network including at least one ring having a pair of hub nodes and a number of additional nodes. A pair of routing trees is generated for the ring, with each of the routing trees specifying paths between nodes of the ring, and having as its root a corresponding one of the hub nodes of the ring. The routing trees are utilized to route capacity demands from nodes of the ring to other portions of the network, such as other rings. The routing trees for a given ring of the network are configured such that the two hub nodes of the ring are adjacent in each of the routing trees of that ring. In addition, the routing trees for the given ring are directed edge disjoint, such that if a link corresponding to one edge of a tree fails, an affected demand is routed to the other hub node of the ring using the other routing tree of the ring. The network may further include of pairs of “super” hub nodes, with pairs of the hub nodes of rings in the network each being assigned to pairs of the super hub nodes. A pair of routing trees generated for a given pair of the super hub nodes is then utilized to route demands for capacity from one of the hub nodes to one of the super hub nodes.
摘要翻译：容量需求在包括至少一个具有一对中枢节点对和多个附加节点的环的网络中路由。为环产生一对路由树，其中每个路由树指定环的节点之间的路径，并且具有作为其环的集线器节点中的相应一个的根。路由树用于将来自环的节点的容量需求路由到网络的其他部分，例如其他环。网络的给定环的路由树被配置为使得环的两个集线器节点在该环的每个路由树中相邻。此外，给定环的路由树是不定向的，使得如果对应于树的一个边缘的链路发生故障，则使用环的另一个路由树将受影响的需求路由到环的另一个集线器节点。网络还可以包括成对的“超级”集线器节点，网络中的环的集线器节点对被分配给超级集线器节点的对。然后，为给定的超级集线器节点对生成的一对路由树用于将集线器节点中的一个的容量需求路由到超级集线器节点之一。

4. 发明授权

US6151304A Distributed precomputation of network signal paths with improved performance through parallelization 失效
标题翻译：分布式预先计算网络信号路径，通过并行化提高性能
公开(公告)号：US6151304A
公开(公告)日：2000-11-21
申请号：US959809
申请日：1997-10-29
申请人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
发明人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
IPC分类号： G06F17/10 , H04J14/02 , G01R31/08
CPC分类号： H04J14/0227 , G06F17/10 , H04J14/0241 , H04J14/0278 , H04J14/0284
摘要： Distributed precomputation techniques for determining primary and/or restoration paths in an optical or electrical network. The invention provides a number of partially and fully asynchronous distributed precomputation algorithms which may be implemented, for example, by the nodes of an all-optical network, in which network links are constrained in terms of optical signal wavelength and failure isolation. A given distributed precomputation algorithm may include a first phase in which paths are allocated for capacity demands to the extent possible without resolving contentions, and a second phase in which contentions between demands for the same capacity are resolved. The first phase may implement a contention locking mechanism which locks a primary path of a given demand to prevent other demands from contending for the same capacity, and a link capacity control mechanism which involves storing a link status table at one or more nodes, the link status table listing a number of specific failures and demands which are affected by the failures. The second phase of the distributed precomputation algorithm reroutes paths previously allocated to one or more demands in order to free up capacity required for another demand, so as to optimize overall network capacity utilization.
摘要翻译：用于确定光或电网络中的主路径和/或恢复路径的分布式预计算技术。本发明提供了许多部分和完全异步的分布式预计算算法，其可以例如由全光网络的节点来实现，其中网络链路在光信号波长和故障隔离方面受到约束。给定的分布式预计算算法可以包括第一阶段，在第一阶段中，在不解决争用的情况下尽可能地分配用于容量需求的路径，以及解决相同容量的需求之间的争用的第二阶段。第一阶段可以实施争用锁定机制，其锁定给定需求的主要路径以防止其他需求竞争相同的容量;以及链路容量控制机制，其涉及将链路状态表存储在一个或多个节点处，所述链路状态表列出了受到故障影响的一些具体故障和需求。分布式预先计算算法的第二阶段重新路由先前分配给一个或多个需求的路径，以便释放另一个需求所需的容量，从而优化整体网络容量利用率。

5. 发明授权

US06021113A Distributed precomputation of network signal paths with table-based link capacity control 失效
标题翻译：基于表的链路容量控制的网络信号路径的分布式预计算
公开(公告)号：US06021113A
公开(公告)日：2000-02-01
申请号：US960569
申请日：1997-10-29
申请人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
发明人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
IPC分类号： H04J14/02 , H04Q11/00 , G01R31/08
CPC分类号： H04Q11/0005 , H04J14/0227 , H04J14/0241 , H04J14/0284 , H04Q2011/005 , H04Q2011/0081
摘要： Distributed precomputation techniques for determining primary and/or restoration paths in an optical or electrical network. The invention provides a number of partially and fully asynchronous distributed precomputation algorithms which may be implemented, for example, by the nodes of an all-optical network, in which network links are constrained in terms of optical signal wavelength and failure isolation. A given distributed precomputation algorithm may include a first phase in which paths are allocated for capacity demands to the extent possible without resolving contentions, and a second phase in which contentions between demands for the same capacity are resolved. The first phase may implement a contention locking mechanism which locks a primary path of a given demand to prevent other demands from contending for the same capacity, and a link capacity control mechanism which involves storing a link status table at one or more nodes, the link status table listing a number of specific failures and demands which are affected by the failures. The second phase of the distributed precomputation algorithm reroutes paths previously allocated to one or more demands in order to free up capacity required for another demand, so as to optimize overall network capacity utilization.
摘要翻译：用于确定光或电网络中的主路径和/或恢复路径的分布式预计算技术。本发明提供了许多部分和完全异步的分布式预计算算法，其可以例如由全光网络的节点来实现，其中网络链路在光信号波长和故障隔离方面受到约束。给定的分布式预计算算法可以包括第一阶段，在第一阶段中，在不解决争用的情况下尽可能地分配用于容量需求的路径，以及解决相同容量的需求之间的争用的第二阶段。第一阶段可以实施争用锁定机制，其锁定给定需求的主要路径以防止其他需求竞争相同的容量;以及链路容量控制机制，其涉及将链路状态表存储在一个或多个节点处，所述链路状态表列出了受到故障影响的一些具体故障和需求。分布式预计算算法的第二阶段重新路由先前分配给一个或多个需求的路径，以便释放另一个需求所需的容量，从而优化整体网络容量利用率。

6. 发明授权

US06662308B1 Dual-homing select architecture 有权
标题翻译：双归选择架构
公开(公告)号：US06662308B1
公开(公告)日：2003-12-09
申请号：US09468714
申请日：1999-12-21
申请人： Stefano Baroni , Bharat Tarachand Doshi , Paramasiviah Harshavardhana , Muhammed Akber Qureshi , Antonio Rodriguez-Moral , David Sugarmen
发明人： Stefano Baroni , Bharat Tarachand Doshi , Paramasiviah Harshavardhana , Muhammed Akber Qureshi , Antonio Rodriguez-Moral , David Sugarmen
IPC分类号： G06F1100
CPC分类号： H04L45/02 , H04L45/22 , H04L69/40
摘要： A network architecture comprised of nodes and a transport network capable of recovering from failures within the network. The network architecture incorporates select functions into the nodes for managing the data flow between individual edge routers and their connection through core routers to the transport network. The select function allows an individual node to recover independently without signaling other nodes over the transport network. Utilizing the select function, the failure of a single core router can be recovered locally without recovery signaling over the transport network.
摘要翻译：由节点和能够从网络内的故障中恢复的传输网络组成的网络架构。网络架构将选择功能集成到节点中，用于管理各个边缘路由器之间的数据流以及通过核心路由器到传输网络的连接。选择功能允许单个节点独立地恢复，而不需要通过传输网络发送其他节点。利用选择功能，可以在本地恢复单核心路由器的故障，而无需通过传输网络进行恢复信令。

7. 发明授权

US6073248A Distributed precomputation of signal paths in an optical network 失效
标题翻译：光网络中信号路径的分布预计算
公开(公告)号：US6073248A
公开(公告)日：2000-06-06
申请号：US960462
申请日：1997-10-29
申请人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
发明人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
IPC分类号： H04J14/02 , H04Q11/00 , G06F11/00 , H04B10/20
CPC分类号： H04Q11/0062 , H04J14/0227 , H04J14/0241 , H04J14/0278 , H04J14/0284 , H04Q2011/0086
摘要： Distributed precomputation techniques for determining primary and/or restoration paths in an optical network. The invention provides a number of partially and fully asynchronous distributed precomputation algorithms which may be implemented, for example, by the nodes of an all-optical network, in which network links are constrained in terms of optical signal wavelength and failure isolation. A given distributed precomputation algorithm may include a first phase in which paths are allocated for capacity demands to the extent possible without resolving contentions, and a second phase in which contentions between demands for the same capacity are resolved. The first phase may implement a contention locking mechanism which locks a primary path of a given demand to prevent other demands from contending for the same capacity, and a link capacity control mechanism which involves storing a link status table at one or more nodes, the link status table listing a number of specific failures and demands which are affected by the failures. The second phase of the distributed precomputation algorithm reroutes paths previously allocated to one or more demands in order to free up capacity required for another demand, so as to optimize overall network capacity utilization.
摘要翻译：用于确定光网络中的主路径和/或恢复路径的分布式预计算技术。本发明提供了许多部分和完全异步的分布式预计算算法，其可以例如由全光网络的节点来实现，其中网络链路在光信号波长和故障隔离方面受到约束。给定的分布式预计算算法可以包括第一阶段，在第一阶段中，在不解决争用的情况下尽可能地分配用于容量需求的路径，以及解决相同容量的需求之间的争用的第二阶段。第一阶段可以实施争用锁定机制，其锁定给定需求的主要路径以防止其他需求竞争相同的容量;以及链路容量控制机制，其涉及将链路状态表存储在一个或多个节点处，所述链路状态表列出了受到故障影响的一些具体故障和需求。分布式预先计算算法的第二阶段重新路由先前分配给一个或多个需求的路径，以便释放另一个需求所需的容量，从而优化整体网络容量利用率。

8. 发明授权

US07933222B2 Information entry for network optimization 有权
标题翻译：网络优化的信息输入
公开(公告)号：US07933222B2
公开(公告)日：2011-04-26
申请号：US11431933
申请日：2006-05-10
申请人： James King Brinkley , Elliott Bryant , Robert Bickerstaff , Paramasiviah Harshavardhana , Song C. Chen
发明人： James King Brinkley , Elliott Bryant , Robert Bickerstaff , Paramasiviah Harshavardhana , Song C. Chen
IPC分类号： H04L12/28
CPC分类号： H04L41/0853 , H04L41/22
摘要： A telecommunications network model receives data regarding a telecommunications network and a customer's use of that network. The data includes information about nodes, link between nodes, tariffs, and customer usage. The received data is utilized to create a model of the telecommunications network. The model may then be utilized to optimize a customer's use of the network, optimizing for a lowest cost solution.
摘要翻译：电信网络模型接收关于电信网络和客户对该网络的使用的数据。数据包括关于节点，节点之间的链接，资费和客户使用的信息。所接收的数据被用于创建电信网络的模型。然后，该模型可用于优化客户对网络的使用，优化最低成本解决方案。

9. 发明授权

US06909700B1 Network topology optimization methods and apparatus for designing IP networks with performance guarantees 失效
标题翻译：网络拓扑优化方法和设备，用于设计具有性能保证的IP网络
公开(公告)号：US06909700B1
公开(公告)日：2005-06-21
申请号：US09198728
申请日：1998-11-24
申请人： Lotfi Benmohamed , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Wing Cheong Lau , Ajay Kumar Mittal
发明人： Lotfi Benmohamed , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Wing Cheong Lau , Ajay Kumar Mittal
IPC分类号： G06F17/50 , H04L12/24 , H04L12/28 , H04J3/14
CPC分类号： H04L41/145
摘要： Methods and apparatus are provided for designing IP networks with substantially improved performance as compared to existing IP networks such as, for example, those networks designed under best-effort criteria. Particularly, the invention includes methods and apparatus for: computing worst-case and optimistic link capacity requirements; optimizing network topology; and determining router placement within a network.
摘要翻译：提供了与现有IP网络（例如，以尽力而为标准设计的那些网络）相比，用于设计具有显着改善的性能的IP网络的方法和装置。特别地，本发明包括用于：计算最坏情况和乐观链路能力要求的方法和装置; 优化网络拓扑; 并确定网络中的路由器布局。

10. 发明授权

US06795399B1 Link capacity computation methods and apparatus for designing IP networks with performance guarantees 失效
标题翻译：链路容量计算方法和设备，用于设计具有性能保证的IP网络
公开(公告)号：US06795399B1
公开(公告)日：2004-09-21
申请号：US09198727
申请日：1998-11-24
申请人： Lotfi Benmohamed , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Wing Cheong Lau , Ajay Kumar Mittal
发明人： Lotfi Benmohamed , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Wing Cheong Lau , Ajay Kumar Mittal
IPC分类号： H04L500
CPC分类号： H04L47/10
摘要： Methods and apparatus are provided for designing IP networks with substantially improved performance as compared to existing IP networks such as, for example, those networks designed under best-effort criteria. Particularly, the invention includes methods and apparatus for: computing worst-case and optimistic link capacity requirements; optimizing network topology; and determining router placement within a network.
摘要翻译：提供了与现有IP网络（例如，以尽力而为标准设计的那些网络）相比，用于设计具有显着改善的性能的IP网络的方法和装置。特别地，本发明包括用于：计算最坏情况和乐观链路能力要求的方法和装置; 优化网络拓扑; 并确定网络中的路由器布局。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式