会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Self-fault isolation in transparent P-cycle networks
    • 透明P循环网络中的自我故障隔离
    • US07852750B2
    • 2010-12-14
    • US12204564
    • 2008-09-04
    • Wayne D. GroverAden Grue
    • Wayne D. GroverAden Grue
    • H04L12/26
    • H04L41/0677
    • Span protection has advantages in speed, locality of action and simplicity but requires that the failed span be located in real time. Recent work proposed rapid fault-localization via monitoring cycles (m-cycles). Span-protecting structures (such as p-cycles) operate and are designed separately from the monitoring cycles in this architecture. We have invented a method of designing survivable networks wherein a span protecting p-cycle network inherently includes the properties of a set of fault localizing m-cycles at zero or minimal additional network design cost. Results show that this can be achieved with the same localization effectiveness as separately designed m-cycle solutions, at little or no extra cost.
    • 跨度保护在速度,行动和简单性方面具有优势,但要求失败的跨度实时定位。 最近的工作通过监测周期(m-周期)提出快速故障定位。 跨架保护结构(例如p循环)在该架构中与监控周期分开设计。 我们已经发明了一种设计可生存网络的方法,其中跨度保护p周期网络固有地包括一组故障定位m个周期的属性或零或最小额外的网络设计成本。 结果表明,这可以通过与单独设计的m循环解决方案相同的定位效果来实现,很少或不需要额外的成本。
    • 3. 发明申请
    • SELF-FAULT ISOLATION IN TRANSPARENT p-CYCLE NETWORKS
    • 透明p-CYCLE网络中的自我分离
    • US20090161536A1
    • 2009-06-25
    • US12204564
    • 2008-09-04
    • Wayne D. GroverAden Grue
    • Wayne D. GroverAden Grue
    • H04L12/24
    • H04L41/0677
    • Span protection has advantages in speed, locality of action and simplicity but requires that the failed span be located in real time. Recent work proposed rapid fault-localization via monitoring cycles (m-cycles). Span-protecting structures (such as p-cycles) operate and are designed separately from the monitoring cycles in this architecture. We have invented a means of designing survivable networks wherein a span protecting p-cycle network inherently includes the properties of a set of fault localizing m-cycles at zero or minimal additional network design cost. Results show that this can be achieved with the same localization effectiveness as separately designed m-cycle solutions, at little or no extra cost.
    • 跨度保护在速度,行动和简单性方面具有优势,但要求失败的跨度实时定位。 最近的工作通过监测周期(m-周期)提出快速故障定位。 跨架保护结构(例如p循环)在该架构中与监控周期分开设计。 我们已经发明了一种设计可行网络的方法,其中跨度保护p周期网络固有地包括一组故障定位m个周期的属性,或者最小额外的网络设计成本。 结果表明,这可以通过与单独设计的m循环解决方案相同的定位效果来实现,很少或不需要额外的成本。
    • 4. 发明申请
    • DISTRIBUTED SYNCHRONOUS BATCH RECONFIGURATION OF A NETWORK
    • 网络的分布式同步批量重新配置
    • US20080232274A1
    • 2008-09-25
    • US12054342
    • 2008-03-24
    • Wayne D. Grover
    • Wayne D. Grover
    • H04L12/28
    • H04L29/0836H04L41/024H04L41/12H04L45/02H04L45/50H04L45/62H04L67/1095H04L67/14
    • A novel alternative concept for handling dynamic provisioning changes and ongoing network reconfiguration and incremental reoptimization in general. A prime motivation is concern about the dependency of existing concepts for dynamic provisioning on the real-time coherence of databases of network state at diverse geographic locations. Not only is the continual updating of such global state everywhere in the network an intensive real-time load, but inevitable incoherencies pose hazards in network operation. The alternative proposal is a framework that makes use precise time synchronization and the computational power of network nodes to solve identical local instances of incremental reoptimization problems in situ. The new scheme removes the database coherency hazard, reduces signaling volumes, and increases resource efficiencies in service provisioning. It also provides a framework in general for continually ongoing incremental or (if desired) total reoptimization of network configuration. The proposal also points directions towards some new research questions such as implementation of optimization models for identical solution on disparate platforms and definition of a variety of incremental batch reoptimization problems. It is thought that this may be one of the first practical application concepts for transport network management that would involve on-line embedded use of operations research methods in communication networks.
    • 一种用于处理动态配置更改和正在进行的网络重新配置和增量重新优化的新颖替代概念。 主要的动机是关注现有的动态配置概念对不同地理位置的网络状态数据库的实时一致性的依赖。 这样的全球状态不仅在网络中不断更新密集的实时负载,而且不可避免地会导致网络运营中的危险。 替代方案是使用精确的时间同步和网络节点的计算能力来解决原位增量优化问题的相同局部实例的框架。 新方案消除了数据库的一致性危害,降低了信令量,并提高了服务提供的资源效率。 它还为网络配置的持续增量或(如果需要)的总体重新优化提供了一个框架。 该提案还指出了一些新的研究问题的方向,例如在不同平台上实现相同解决方案的优化模型,以及定义各种增量批量优化问题。 据认为,这可能是运输网络管理的第一个实际应用概念之一,其涉及通信网络中的在线嵌入式操作研究方法的使用。
    • 5. 发明授权
    • Distributed preconfiguration of spare capacity in closed paths for network restoration
    • 分布式预配置封闭路径中的备用容量以进行网络恢复
    • US07230916B2
    • 2007-06-12
    • US10037031
    • 2002-01-02
    • Demetrios StamatelakisWayne D. Grover
    • Demetrios StamatelakisWayne D. Grover
    • G06F11/00
    • H04L41/0668H04J3/14H04L41/0654H04L41/0659H04L41/0816H04L43/0811H04Q3/0079
    • A method for restoring traffic in a network. The network includes plural distinct nodes interconnected by plural distinct spans, each span having working links and spare links. Each node has a digital cross-connect switch for making and breaking connections between adjacent spans forming span pairs at a node. Cross-connections between spare links in adjacent spans are made such that sets of successive nodes through which the adjacent spans form span paths form closed paths. A method of finding and construction closed paths is described in which statelets are broadcast through the network. In a preferred method of implementation of the method, the statelet broadcast occurs not in response to a network failure, but across the entire network before any particular span failure and may be carried out during normal network operations as a continual re-configuration of the network.
    • 一种用于恢复网络中流量的方法。 网络包括通过多个不同跨度互连的多个不同节点,每个跨度具有工作链路和备用链路。 每个节点具有数字交叉连接开关,用于在节点处形成跨距对的相邻跨度之间建立和断开连接。 相邻跨度中的备用链路之间的交叉连接被做成使得相邻跨度形成跨越路径的连续节点组形成封闭路径。 描述了一种查找和构建封闭路径的方法,其中通过网络广播状态。 在实施该方法的优选方法中,状态广播不是响应于网络故障而是在任何特定跨度故障之前的整个网络中发生,并且可以在正常网络操作期间作为网络的连续重新配置 。
    • 7. 发明授权
    • Integrated ring-mesh network
    • 集成环网网络
    • US06654379B1
    • 2003-11-25
    • US09414474
    • 1999-10-07
    • Wayne D. GroverRandy G. Martens
    • Wayne D. GroverRandy G. Martens
    • H04L1228
    • H04J14/0227H04J14/0241H04J14/0284H04J14/0287H04J2203/0042H04J2203/0055H04J2203/006H04Q11/0062H04Q2011/0081H04Q2011/0092H04Q2011/0098
    • Whether in a SONET or a dense-WDM (DWDM) transport environment, we can expect to see a continuance of the two main survivable architectures: ring and mesh. The differing advantages of these technologies has allowed both of them to find applications, although they are usually deployed and operate quite separately. To date, the problem of optimally combining ring and mesh technologies into a single integrated transport design remains largely unstudied. This patent document presents a planning principle and related optimization theory to strategically embed rings into a mesh network, with the purpose of obtaining a lower total design cost than that of either a pure-mesh or pure-ring design. The new design approach is based on a recently developed insight into the nature of spare capacity requirements in a mesh-restorable network. So-called “forcer” analysis identifies the spans that drive the dimensioning of spare quantities in the network. The main hypothesis is that strategic placement of rings onto these spans, can result in mesh sparing relief that more than pays for the cost of the rings. However, the very large number of possible ring placements and sizes, makes this a difficult combinatorial optimization problem. Both heuristic and Integer Programming approaches were used to solve the problem. Results show cases of hybrid designs that are 5 to 25% less costly than that of a pure mesh design, depending on the test network and the relative mesh-ring technology costs. The Integer Programming method worked well for networks with fewer nodes and spans, while the heuristic was needed to obtain good solutions for relatively larger networks.
    • 无论是在SONET还是密集WDM(DWDM)传输环境中,我们都可以看到两个主要可行的体系结构的连续性:环和网格。 这些技术的不同优点使得他们都能够找到应用程序,尽管它们通常部署和运行相当分开。 到目前为止,将环形和网格技术最佳地结合到一个单一的集成运输设计中的问题仍然在很大程度上没有得到解决。 该专利文献提出了一种规划原理和相关的优化理论,用于将环路策略性地嵌入到网状网络中,目的是获得比纯网格或纯环设计更低的总设计成本。 新的设计方法是基于对网状可恢复网络中的备用容量要求的性质的最新研究。 所谓的“forcer”分析标识了驱动网络中备用数量的尺寸的跨度。 主要的假设是,将环设置在这些跨度上的策略性布置可以导致网格节省的费用多于支付环费用。 然而,非常多的可能的环位置和大小,使得这是一个困难的组合优化问题。 使用启发式和整数编程方法来解决问题。 结果显示,混合设计的案例比纯网格设计的成本要低5到25%,具体取决于测试网络和相对网格环技术成本。 整数编程方法对于具有较少节点和跨度的网络运行良好,而需要启发式来获得较大网络的良好解决方案。
    • 8. 发明授权
    • Method and apparatus for self-restoring and self-provisioning
communication networks
    • 用于自恢复和自配置通信网络的方法和装置
    • US4956835A
    • 1990-09-11
    • US255748
    • 1988-10-19
    • Wayne D. Grover
    • Wayne D. Grover
    • H04J3/08H04Q3/00H04Q11/04
    • H04Q3/0016H04J3/085H04Q3/0079H04J2203/0042H04J2203/006H04Q2213/13141H04Q2213/13167
    • A method and apparatus of restoring communications between a pair of nodes in a network having an arbitrary number of nodes and an arbitrary number of spans interconnecting the nodes, each span having working circuits between nodes designated for transmitting actual communications traffic and spare circuits capable of, but not designated for, transmitting actual communications traffic, the method comprising the steps of (a) establishing one or more independent communication paths between the pair of nodes through a series of spare circuits of spans interconnecting the pair of nodes and other interconnected nodes in the network; and (b) redirecting communications traffic intended for one or more failed spans interconnecting the pair of nodes through one or more of the paths.
    • 一种在网络中具有任意数量的节点和互连节点的任意数目的跨度的网络中的一对节点之间的通信的方法和装置,每个跨度在指定用于发送实际通信业务的节点和能够发送实际通信业务的备用电路之间具有工作电路, 但不指定用于发送实际通信业务,所述方法包括以下步骤:(a)通过将所述一对节点和所述一对节点中的其他互连节点互连的一系列备用电路在所述一对节点之间建立一个或多个独立通信路径 网络; 和(b)重定向用于通过一个或多个路径互连该对节点的一个或多个故障跨越的通信流量。
    • 9. 发明授权
    • Method and apparatus for detecting frame synchronization
    • 用于检测帧同步的方法和装置
    • US4674088A
    • 1987-06-16
    • US709636
    • 1985-03-07
    • Wayne D. Grover
    • Wayne D. Grover
    • H04J3/06H04J3/07H04L7/00
    • H04J3/0608H04J3/073
    • Frame synchronization to the frame pattern of a DS3 bit stream is achieved by detecting the framing pattern and producing a synchronizing slip in the absence of such detection. In order to avoid long frame times as a result of unconfigured adjacent DS1 transmission links producing data which mimic the DS3 framing pattern, redundantly transmitted stuff information (tributary justification control) bits are also checked to ensure that appropriate bits, relative to the position of the framing pattern bits, have expected properties (e.g. triplicated values), and a synchronizing slip is also produced if this is not the case. Short framing times are also achieved by storing in each of the framing pattern and stuff information bit detectors not only the particular bits which are currently to be checked, but also consecutive bits which are selected in dependence upon the occurrence of previous synchronizing slips.
    • 通过在没有这种检测的情况下检测成帧模式并产生同步滑移来实现与DS3比特流的帧模式的帧同步。 为了避免由于未配置的相邻DS1传输链路产生模拟DS3成帧模式的数据而导致的长帧时间,还检查冗余传输的填充信息(支路对齐控制)位,以确保相对于 成帧格式位具有期望的属性(例如三重值),并且如果不是这种情况,则也产生同步滑移。 也可以通过将每个成帧模式和填充信息比特检测器存储在当前要检查的特定比特中,而且还根据先前的同步滑移的发生而选择的连续比特来实现短成帧时间。