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

81. 发明授权

US09847914B2 Method and system for site interconnection over a transport network 有权
公开(公告)号：US09847914B2
公开(公告)日：2017-12-19
申请号：US14943709
申请日：2015-11-17
申请人： Peter Ashwood-Smith
发明人： Peter Ashwood-Smith
IPC分类号： H04L12/24
CPC分类号： H04L41/12 , H04L41/0823 , H04L41/0896
摘要： Methods and systems for managing traffic among a plurality of interconnected sites. The sites are interconnected via ring members and ring segments of a logical ring implemented by a network controller over a physical transport network. When it is determined there is a change in traffic that requires a change in ring topology, topology optimization is performed to accommodate the change in traffic. The topology optimization may include: dynamically increasing capacity of a ring segment, dynamically decreasing capacity of a ring segment, dynamically creating a traffic path, and/or dynamically removing a traffic path.

82. 发明授权

US09781001B2 Transport network tunnel setup based upon control protocol snooping 有权
公开(公告)号：US09781001B2
公开(公告)日：2017-10-03
申请号：US14820000
申请日：2015-08-06
申请人： Peter Ashwood-Smith
发明人： Peter Ashwood-Smith
IPC分类号： H04L12/803 , H04L12/863 , H04L29/08 , H04L12/24 , H04L12/911
CPC分类号： H04L41/0813 , H04L12/4633 , H04L45/245 , H04L47/125 , H04L47/825 , H04L69/324 , H04L69/326
摘要： Rather than there being a requirement that specific instructions be issued to cause a transport network tunnel to be configured, it is proposed herein to have a transport node autonomously determine that a transport network tunnel is to be configured and, responsively, cause the transport network tunnel to be configured. In general, a transport node (an L0/L1 device) adjacent to the packet device at the origin of LACP messages snoops on the LACP messages. The transport node may determine, based on the contents of a control LACP message, that a new packet network link is to be established between the origin packet device and a destination packet device. Responsive to the determining, the transport node adjacent to the origin packet device causes a transport network tunnel to be established between one of its ports and a port at a transport node adjacent the destination packet device.

83. 发明申请

US20170251286A1 NON-SYMMETRIC INTERCONNECTION OVER FIBER 审中-公开
公开(公告)号：US20170251286A1
公开(公告)日：2017-08-31
申请号：US15056335
申请日：2016-02-29
申请人： Peter Ashwood-Smith
发明人： Peter Ashwood-Smith
IPC分类号： H04Q11/00 , H04B10/27 , H04B10/25
CPC分类号： H04Q11/0062 , H04Q2011/0086
摘要： In a configuration wherein N individual fibers interconnect two devices, each fiber can be configured, through configuration of the packet processing devices at each end of the fiber, to carry traffic in a single direction. From the perspective of the first device, an arbitrary subset T of the N fibers can be used for transmitting signals to the second device. The packet processing devices terminating a subset R of the remaining N-T fibers can be configured so that the first device may receive signals from the second device.

84. 发明授权

US08817624B2 Higher layer compression with lower layer signaling 有权
标题翻译：较高层压缩与较低层信令
公开(公告)号：US08817624B2
公开(公告)日：2014-08-26
申请号：US13557932
申请日：2012-07-25
申请人： Aaron Callard , Peiying Zhu , Hang Zhang , Petar Djukic , Vipul Desai , Peter Ashwood-Smith
发明人： Aaron Callard , Peiying Zhu , Hang Zhang , Petar Djukic , Vipul Desai , Peter Ashwood-Smith
IPC分类号： G01R31/08
CPC分类号： H04W28/06 , H04L41/147 , H04L47/14 , H04L47/323 , H04L67/02 , H04L67/2819 , H04L69/04 , H04L69/168 , H04L69/18 , H04L69/321 , H04L69/322 , H04W24/00 , H04W28/0289
摘要： Methods and devices for reducing traffic over a wireless link through the compression or suppression of high layer packets carrying predictable background data prior to transportation over a wireless link. The methods include intercepting application layer protocol packets carrying the predictable background data. In embodiments where the background data is periodic in nature, the high layer packets may be compressed into low-layer signaling indicators for communication over a low-layer control channel (e.g., an on off keying (OOK) channel). Alternatively, the high layer packets may be suppressed entirely (not transported over the wireless link) when a receiver side daemon is configured to autonomously replicate the periodic background nature according to a projected interval. In other embodiments, compression techniques may be used to reduce overhead attributable to non-periodic background data that is predictable in context.
摘要翻译：用于通过在通过无线链路传输之前通过压缩或抑制携带可预测背景数据的高层分组来减少无线链路上的业务的方法和设备。这些方法包括拦截携带可预测背景数据的应用层协议报文。在背景数据本质上是周期性的实施例中，高层分组可以被压缩成低层信令指示符，用于通过低层控制信道（例如，断开键控（OOK）信道）进行通信。或者，当接收器侧守护进程被配置为根据投影的间隔自动复制周期性背景特性时，可以完全抑制高层分组（不通过无线链路传输）。在其他实施例中，可以使用压缩技术来减少归因于上下文中可预测的非周期性背景数据的开销。

85. 发明授权

US08767730B2 Virtual local area network identifier substitution as time to live method 有权
标题翻译：虚拟局域网标识符替换为生活方式的时间
公开(公告)号：US08767730B2
公开(公告)日：2014-07-01
申请号：US13370755
申请日：2012-02-10
申请人： Peter Ashwood-Smith
发明人： Peter Ashwood-Smith
IPC分类号： H04L12/28
CPC分类号： H04L45/20 , H04L45/18 , H04L45/54 , H04L45/66
摘要： An apparatus comprising a node that uses a set of determined virtual local area network (VLAN) identifier (VIDs) to provide a hop limit for a packet forwarded by the node in a network. Also disclosed is a network component comprising a receiver that receives a packet comprising a VID that belongs to a determined set of ordered VIDs, a processor that substitutes the VID in the packet from the set of ordered VIDs and maps the VID to a next hop or instead drops the VID if the VID is a last ordered VID of the ordered VIDs, and a transmitter that forwards the packet comprising the substituted VID to the mapped next hop.
摘要翻译：一种装置，包括使用一组确定的虚拟局域网（VLAN）标识符（VID）来为网络中的节点转发的分组提供跳数限制的节点。还公开了一种网络组件，其包括：接收器，其接收包含属于所确定的有序VID集合的VID的分组;处理器，用于从所述一组有序VID中替换所述分组中的VID，并将所述VID映射到下一跳; 如果VID是有序VID的最后一个有序的VID，则将VID丢弃，以及将包括替换的VID的分组转发到映射的下一跳的发射机。

86. 发明授权

US07774474B2 Communication of control and data path state for networks 有权
标题翻译：网络控制和数据路径状态通信
公开(公告)号：US07774474B2
公开(公告)日：2010-08-10
申请号：US10744838
申请日：2003-12-23
申请人： Peter Ashwood-Smith , Darek Skalecki , James A. Sheilds , Antonela Paraschiv
发明人： Peter Ashwood-Smith , Darek Skalecki , James A. Sheilds , Antonela Paraschiv
IPC分类号： G06F15/16 , H01R31/08
CPC分类号： H04L41/0659 , H04L45/24 , H04L45/28
摘要： A method and system for resynchronizing a control layer and a line layer by tracing the data path through the line layer and, at the control layer, reclaiming ownership of disowned connections corresponding to the traced data path. Beginning at a head-end controller, the data path is traced by identifying the next controller along the data path and sending a set-up message containing the local state information necessary for a second controller to identify the connection within its associated network element that is associated with the data path. The second controller receives the set-up message and claims ownership of its portion of the data path. It then identifies the next leg or hop in the data path, modifies the set-up message to add data regarding the next hop, and sends the modified set-up message to the next controller along the data path. The process is repeated so as to dynamically establish a control connection corresponding to and synchronized with the existing data path.
摘要翻译：通过跟踪通过线路层的数据路径，并且在控制层，回收对跟踪的数据路径的未知连接的所有权，来重新同步控制层和线路层的方法和系统。从头端控制器开始，通过沿着数据路径识别下一个控制器来跟踪数据路径，并发送包含第二控制器所需的本地状态信息的建立消息，以识别其相关网络元件内的连接与数据路径相关联。第二控制器接收建立消息并声明其部分数据路径的所有权。然后，它识别数据路径中的下一个分支或跳跃，修改建立消息以添加关于下一跳的数据，并且将修改的建立消息沿着数据路径发送到下一个控制器。重复该过程，以动态地建立与现有数据路径相对应并与其同步的控制连接。

87. 发明申请

US20090168768A1 Tie-Breaking in Shortest Path Determination 有权
标题翻译：在最短路径确定中的打破
公开(公告)号：US20090168768A1
公开(公告)日：2009-07-02
申请号：US11964478
申请日：2007-12-26
申请人： Jerome Chiabaut , David Allan , Nigel Bragg , Peter Ashwood-Smith
发明人： Jerome Chiabaut , David Allan , Nigel Bragg , Peter Ashwood-Smith
IPC分类号： H04L12/56
CPC分类号： H04L45/12 , H04L45/00 , H04L45/22 , H04L45/24
摘要： A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.
摘要翻译：通过比较多个端到端路径中的每一个的有序节点标识符集来实现等成本最短（最低成本）路径之间的一致的打破决定。或者，通过使用树的分支分支的节点标识符选择等价路径，可以实时地实现与最短路径树相同的结果。这两种变体允许对等成本路径进行一致的选择，而不管网络中哪些地方计算最短路径。这确保任何两个节点之间在正向和反向方向上的业务流量将始终遵循通过网络的相同路径。

88. 发明申请

US20070076629A1 Parallel constraint based path computation using path vector 失效
标题翻译：使用路径向量的基于并行约束的路径计算
公开(公告)号：US20070076629A1
公开(公告)日：2007-04-05
申请号：US11239111
申请日：2005-09-30
申请人： Peter Ashwood-Smith , Darek Skalecki , Gary McKenna
发明人： Peter Ashwood-Smith , Darek Skalecki , Gary McKenna
IPC分类号： H04L12/28
CPC分类号： H04L45/12 , H04L45/02 , H04L45/18 , H04L45/26
摘要： Methods of computing a path through a network between a source node and a destination node. At the source node, an explore message is launched into at least one link hosted by the source node. The explore message includes a path vector containing a node identifier of the source node. At a node intermediate the source node and the destination node, the explore message is received, and each link hosted by the node that can be operably added to the path is identified. A respective node identifier of the node is added to the path vector of the explore message, which is then forwarded through each identified link. At the destination node, the respective path vector is extracted from at least one received explore message.
摘要翻译：计算通过源节点和目标节点之间的网络的路径的方法。在源节点上，将至少一个由源节点托管的链接启动探索消息。探索消息包括包含源节点的节点标识符的路径向量。在源节点和目的地节点之间的节点处，接收到探索消息，并且识别由可被可操作地添加到路径的节点托管的每个链路。节点的相应节点标识符被添加到探索消息的路径向量中，然后通过每个识别的链路进行转发。在目的地节点处，从至少一个接收到的探测消息中提取相应的路径向量。

89. 发明申请

US20050008020A1 ATM transport over multi-protocol label switching 审中-公开
标题翻译： ATM传输通过多协议标签交换
公开(公告)号：US20050008020A1
公开(公告)日：2005-01-13
申请号：US10916493
申请日：2004-08-12
申请人： Peter Ashwood-Smith , Bernard St-Denis
发明人： Peter Ashwood-Smith , Bernard St-Denis
IPC分类号： H04L12/46 , H04L12/56
CPC分类号： H04L12/4608 , H04L45/505
摘要： User traffic of one type must traverse many diverse networks, each operating by different paradigms and requiring different protocol stacks, before it reaches the destination. MPLS (Multiprotocol Label Switching) is being developed to solve some of the problems which involve the existence of different protocols along the traffic path. There is currently no accepted way of transporting ATM cells over an MPLS domain. New ways of packetizing ATM cells into labeled MPLS packets for transporting over an MPLS domain are described.
摘要翻译：一种类型的用户流量必须遍历许多不同的网络，每个网络在到达目的地之前都由不同的范例操作，并且需要不同的协议栈。正在开发MPLS（Multiprotocol Label Switching，多协议标签交换）来解决沿着交通路径存在不同协议的一些问题。目前还没有可接受的方式通过MPLS域传输ATM信元。描述了将ATM信元打包成用于通过MPLS域传输的标记的MPLS分组的新方式。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式