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

1. 发明申请

WO02075483A3 CHECK POINTING OF PROCESSING CONTEXT OF NETWORK ACCOUNTING COMPONENTS 审中-公开
标题翻译：检查网络会计组件的处理情况
公开(公告)号：WO02075483A3
公开(公告)日：2003-05-01
申请号：PCT/US0200695
申请日：2002-01-11
申请人： NORTEL NETWORKS LIMTIED , DATTA UTPAL , FARRELL KEVIN , LANDON TIMOTHY , ROGERS JEFFREY , GHERSIN NORBERT
发明人： DATTA UTPAL , FARRELL KEVIN , LANDON TIMOTHY , ROGERS JEFFREY , GHERSIN NORBERT
IPC分类号： H04L12/56 , H04L1/22 , H04L12/24 , G06F11/14
CPC分类号： H04L41/0604 , H04L41/042 , H04L43/026
摘要： Fault management and recovery in a distributed network accounting system includes classifying nodes in the system according to complexity of processing in the node. For nodes of relatively low processing complexity, context check-pointing a state of processing in the nodes to permit automatic recovery of the node to the node's most recent processing context checkpoint (170).
摘要翻译：分布式网络计费系统中的故障管理和恢复包括根据节点处理复杂度对系统中的节点进行分类。对于相对较低处理复杂度的节点，上下文检查指示节点中的处理状态以允许节点自动恢复到节点的最新处理上下文检查点（170）。

2. 发明申请

WO2002075483A2 CHECK POINTING OF PROCESSING CONTEXT OF NETWORK ACCOUNTING COMPONENTS 审中-公开
标题翻译：检查网络会计组件的处理情况
公开(公告)号：WO2002075483A2
公开(公告)日：2002-09-26
申请号：PCT/US2002/000695
申请日：2002-01-11
申请人： NORTEL NETWORKS LIMTIED , DATTA, Utpal , FARRELL, Kevin , LANDON, Timothy , ROGERS, Jeffrey , GHERSIN, Norbert
发明人： DATTA, Utpal , FARRELL, Kevin , LANDON, Timothy , ROGERS, Jeffrey , GHERSIN, Norbert
IPC分类号： G06F
CPC分类号： H04L41/0604 , H04L41/042 , H04L43/026
摘要： Fault management and recovery in a distributed network accounting system includes classifying nodes in the system according to complexity of processing in the node. For nodes of relatively low processing complexity, context check-pointing a state of processing in the nodes to permit automatic recovery of the node to the nodes' most recent processing context checkpoint; and for nodes of relatively high complexity, producing a directed graph of the programmable nodes that controls a flow of data and control of processing through the system, and producing a dynamic modification of the directed graph to automatically fail-over to redundant back-up nodes based on thresholds established for the component hosts.
摘要翻译：分布式网络计费系统中的故障管理和恢复包括根据节点处理复杂度对系统中的节点进行分类。对于相对较低处理复杂度的节点，上下文检查节点中的处理状态，以允许节点自动恢复到节点的最新处理上下文检查点; 并且对于相对高复杂度的节点，产生可控节点的有向图，其控制数据流和通过系统的处理控制，并且产生有向图的动态修改以自动故障切换到冗余备份节点基于为组件主机建立的阈值。

3. 发明申请

WO2005027535A2 BAND REJECT FILTERS 审中-公开
标题翻译：带拒绝滤波器
公开(公告)号：WO2005027535A2
公开(公告)日：2005-03-24
申请号：PCT/IB2004/002785
申请日：2004-08-27
申请人： NORTEL NETWORKS LIMTIED , BEAUDIN, Steve , SYCHALEUN, Somsack , JIAN, Chun-Yun , ZHANG, Yuxing
发明人： BEAUDIN, Steve , SYCHALEUN, Somsack , JIAN, Chun-Yun , ZHANG, Yuxing
IPC分类号： H04Q
CPC分类号： H03H9/6409 , H03H9/14547 , H03H9/14558 , H03H9/14567 , H03H9/547 , H03H9/605 , H03H9/6433 , H03H9/6463 , H03H9/6476 , H03H9/6483 , H03H9/6493
摘要： Acoustic resonators such as surface acoustic wave (SAW) devices and thin film bulk acoustic resonators (FBAR) can be configured to produce a band reject filter. Such a filter overcomes the insertion loss and power handling limitations of conventional band pass configurations and as such can be used in power amplifier and duplexer applications. Using a SAW filter having a concatenated structure, filter losses and layout comprises are further improved.
摘要翻译：诸如表面声波（SAW）器件和薄膜体声波谐振器（FBAR）之类的声谐振器可被配置成产生带阻滤波器。这种滤波器克服了传统带通配置的插入损耗和功率处理限制，并且因此可以用于功率放大器和双工器应用中。使用具有级联结构的SAW滤波器，滤波器损耗和布局包括进一步改进。

4. 发明专利

AU2002309479A1 Check pointing of processing context of network accounting components 未知
公开(公告)号：AU2002309479A1
公开(公告)日：2002-10-03
申请号：AU2002309479
申请日：2002-01-11
申请人： NORTEL NETWORKS LIMTIED
发明人： DATTA UTPAL , ROGERS JEFFREY , FARRELL KEVIN , LANDON TIMOTHY , GHERSIN NORBERT
IPC分类号： H04L12/56 , H04L1/22 , H04L12/24 , G06F11/14

5. 发明授权

US07590067B2 Method and apparatus for deriving allowable paths through a network with intransitivity constraints 失效
标题翻译：通过具有不确定性限制的网络导出允许路径的方法和装置
公开(公告)号：US07590067B2
公开(公告)日：2009-09-15
申请号：US10691517
申请日：2003-10-24
申请人： Hong Zhang , Peter Ashwood Smith , Guo Qiang Wang
发明人： Hong Zhang , Peter Ashwood Smith , Guo Qiang Wang
IPC分类号： G01R31/08
CPC分类号： H04L45/48 , H04L45/02 , H04L45/12
摘要： A method of computing allowable routes through a data network that includes a subnetwork that introduces a subnet intransitivity constraint on allowable paths through the network involves using an abstracted network map to construct a directed graph that compensates for the subset intransitivity constraint by removing all unallowable paths. The abstracted network map may be used to compute least cost allowable paths through the network. The directed graph represents the same network, and is constructed by representing bi-directional links between the subnetwork elements with two directed edges, and representing the subnetwork elements as paired ingress and egress nodes. A method for constructing the directed graph representing an abstracted map of a network that exhibits subset intransitivity is also described.
摘要翻译：通过数据网络计算允许路由的方法，该数据网络包括通过网络在允许的路径上引入子网不可约束约束的子网络涉及使用抽象的网络映射来构造有向图，该有向图通过去除所有不允许的路径来补偿子集的传输约束。抽象网络图可以用于计算通过网络的最小成本允许路径。有向图表示相同的网络，并且通过在具有两个有向边缘的子网络元件之间表示双向链路并且将子网络元素表示为配对的入口和出口节点来构造。还描述了一种用于构建表示呈现子集不透明性的网络的抽象地图的有向图的方法。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式