公开(公告)号：US20090161537A1

公开(公告)日：2009-06-25

申请号：US12341603

申请日：2008-12-22

申请人： Loa Andersson ,  Kent Felske ,  Guo-Qiang Wang

发明人： Loa Andersson ,  Kent Felske ,  Guo-Qiang Wang

IPC分类号： H04L12/56 ,  G06F11/00

CPC分类号： H04L45/28 ,  H04L45/02 ,  H04L45/22 ,  H04L69/40

摘要： A computer network processes data packets in the event of a network link failure. The network includes a plurality of routers that deliver data packets to the network via a plurality of links. At least one router includes a protection cycle manager. The protection cycle manager has a protection cycle packet identifier and a protection cycle packet processor. The protection cycle packet identifier identifies, as protection cycle packets, data packets having a specific protection cycle format. The protection cycle packet processor processes protection cycle packets to determine whether the packet destination corresponds to the routing node, and if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link. Otherwise, if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.

摘要翻译： 在网络链路故障的情况下，计算机网络处理数据包。 网络包括经由多个链路将数据分组传送到网络的多个路由器。 至少一个路由器包括保护周期管理器。 保护周期管理器具有保护周期分组标识符和保护周期分组处理器。 保护周期分组标识符标识具有特定保护周期格式的数据分组作为保护周期分组。 保护周期分组处理器处理保护周期分组以确定分组目的地是否对应于路由节点，并且如果分组目的地对应于路由节点，则保护周期分组被路由节点处理为从分组接收的数据分组 源通过失败的链接。 否则，如果分组目的地不对应于路由节点，则保护周期分组被发送到用于路由节点的保护周期节点。

公开(公告)号：US07486615B2

公开(公告)日：2009-02-03

申请号：US10351780

申请日：2003-01-27

申请人： Loa Andersson ,  Kent Felske ,  Guo-Qiang Wang

发明人： Loa Andersson ,  Kent Felske ,  Guo-Qiang Wang

IPC分类号： G06F11/00 ,  H04L12/54

CPC分类号： H04L45/28 ,  H04L45/02 ,  H04L45/22 ,  H04L69/40

摘要： A computer network processes data packets in the event of a network link failure. The network includes a plurality of routers that deliver data packets to the network via a plurality of links. At least one router includes a protection cycle manager. The protection cycle manager has a protection cycle packet identifier and a protection cycle packet processor. The protection cycle packet identifier identifies, as protection cycle packets, data packets having a specific protection cycle format. The protection cycle packet processor processes protection cycle packets to determine whether the packet destination corresponds to the routing node, and if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link. Otherwise, if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.

摘要翻译： 在网络链路故障的情况下，计算机网络处理数据包。 网络包括经由多个链路将数据分组传送到网络的多个路由器。 至少一个路由器包括保护周期管理器。 保护周期管理器具有保护周期分组标识符和保护周期分组处理器。 保护周期分组标识符将具有特定保护周期格式的数据分组标识为保护周期分组。 保护周期分组处理器处理保护周期分组以确定分组目的地是否对应于路由节点，并且如果分组目的地对应于路由节点，则保护周期分组被路由节点处理为从分组接收的数据分组 源通过失败的链接。 否则，如果分组目的地不对应于路由节点，则保护周期分组被发送到用于路由节点的保护周期节点。

公开(公告)号：US06535481B1

公开(公告)日：2003-03-18

申请号：US09378141

申请日：1999-08-20

申请人： Loa Andersson ,  Kent Felske ,  Guo-Qiang Wang

发明人： Loa Andersson ,  Kent Felske ,  Guo-Qiang Wang

IPC分类号： H04L1226

CPC分类号： H04L45/28 ,  H04L45/02 ,  H04L45/22 ,  H04L69/40

摘要： A computer network processes data packets in the event of a network link failure. The network includes a plurality of routers that deliver data packets to the network via a plurality of links. At least one router includes a protection cycle manager. The protection cycle manager has a protection cycle packet identifier and a protection cycle packet processor. The protection cycle packet identifier identifies, as protection cycle packets, data packets having a specific protection cycle format. The protection cycle packet processor processes protection cycle packets to determine whether the packet destination corresponds to the routing node, and if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link. Otherwise, if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.

公开(公告)号：US07760623B2

公开(公告)日：2010-07-20

申请号：US12341603

申请日：2008-12-22

申请人： Loa Andersson ,  Kent Felske ,  Guo-Qiang Wang

发明人： Loa Andersson ,  Kent Felske ,  Guo-Qiang Wang

IPC分类号： H04L12/54 ,  G06F11/00 ,  H04J3/14

CPC分类号： H04L45/28 ,  H04L45/02 ,  H04L45/22 ,  H04L69/40

摘要： A computer network processes data packets in the event of a network link failure. The network includes a plurality of routers that deliver data packets to the network via a plurality of links. At least one router includes a protection cycle manager. The protection cycle manager has a protection cycle packet identifier and a protection cycle packet processor. The protection cycle packet identifier identifies, as protection cycle packets, data packets having a specific protection cycle format. The protection cycle packet processor processes protection cycle packets to determine whether the packet destination corresponds to the routing node, and if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link. Otherwise, if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.

摘要翻译： 在网络链路故障的情况下，计算机网络处理数据包。 网络包括经由多个链路将数据分组传送到网络的多个路由器。 至少一个路由器包括保护周期管理器。 保护周期管理器具有保护周期分组标识符和保护周期分组处理器。 保护周期分组标识符标识具有特定保护周期格式的数据分组作为保护周期分组。 保护周期分组处理器处理保护周期分组以确定分组目的地是否对应于路由节点，并且如果分组目的地对应于路由节点，则保护周期分组被路由节点处理为从分组接收的数据分组 源通过失败的链接。 否则，如果分组目的地不对应于路由节点，则保护周期分组被发送到用于路由节点的保护周期节点。

公开(公告)号：US20130266317A1

公开(公告)日：2013-10-10

申请号：US13797226

申请日：2013-03-12

申请人： Guo-Qiang Wang

发明人： Guo-Qiang Wang

IPC分类号： H04Q11/00

CPC分类号： H04Q11/0005 ,  H04B10/27 ,  H04J14/02 ,  H04Q11/0001 ,  H04Q11/0003 ,  H04Q11/0062 ,  H04Q2011/0011 ,  H04Q2011/0016 ,  H04Q2011/0039 ,  H04Q2011/0069 ,  H04Q2011/0073 ,  H04Q2011/0086 ,  H04Q2011/009

摘要： A method of establishing a data connection between terminal switching nodes in a network involves switching nodes participating in a network layer wavelength routing (WR) protocol to determine the next hop switching node for every possible combination of terminal nodes based on the network topology. Switching nodes participate in a network layer wavelength distribution (WD) once the data connection is to be established. The WR protocol determines the path used through the network, while the WD protocol assigns wavelengths on each link between switching nodes. The wavelengths may be different on different optical links. The switching nodes include wavelength converters with an optical switch or optoelectronic converters with a digital electronic switch. Advantages of using potentially different wavelengths along various segments of a single end-to-end connection yields increased wavelength efficiency.

摘要翻译： 一种在网络中的终端交换节点之间建立数据连接的方法涉及参与网络层波长路由（WR）协议的交换节点，以基于网络拓扑来确定终端节点的每个可能组合的下一跳交换节点。 一旦建立数据连接，交换节点就参与网络层波长分布（WD）。 WR协议确定通过网络使用的路径，而WD协议在交换节点之间的每个链路上分配波长。 波长在不同的光链路上可能不同。 开关节点包括具有光开关的波长转换器或具有数字电子开关的光电转换器。 沿着单个端对端连接的各个部分使用潜在的不同波长的优点产生增加的波长效率。

公开(公告)号：US07499404B2

公开(公告)日：2009-03-03

申请号：US10232063

申请日：2002-08-30

申请人： Ravi S. Ravindran ,  Guo-Qiang Wang ,  Krishnaiyan Thulasiraman

发明人： Ravi S. Ravindran ,  Guo-Qiang Wang ,  Krishnaiyan Thulasiraman

IPC分类号： G08C15/00 ,  H04J3/14 ,  H04L12/28

CPC分类号： H04L45/00 ,  H04L45/26

摘要： The present invention relates to distributed systems and methods for finding a path from a source node to a destination node where the path chosen satisfies a path constraint for a first additive path parameter and concurrently optimizes a second additive path parameter. One embodiment of the invention provides a routing method. The method includes receiving at a current node a construct path message from a neighboring previous node. The construct path message includes first and second values for first and second additive parameters. The method includes checking whether the first value satisfies an optimality condition and whether the second value indicates a feasible path given a path constraint. If the first value satisfies an optimality condition and the second value indicates a feasible path given a path constraint, then the method (i) sends out a construct path message to a next neighboring node, (ii) increments a number-of-acknowledgement-messages variable by the number of construct path messages sent, and (iii) adds an entry to a predecessor array stored at the current node. The entry includes an identifier for the predecessor neighboring node, the first path value, and the second path value. If not, the method sends an acknowledgement message to the neighboring previous node.

摘要翻译： 本发明涉及用于找到从源节点到目的地节点的路径的分布式系统和方法，其中选择的路径满足第一附加路径参数的路径约束并同时优化第二加法路径参数。 本发明的一个实施例提供一种路由方法。 该方法包括在当前节点处从相邻的先前节点接收构造路径消息。 构造路径消息包括用于第一和第二加法参数的第一和第二值。 该方法包括检查第一值是否满足最优条件，以及第二值是否指示给定路径约束的可行路径。 如果第一个值满足最优条件，并且第二个值指示给定路径约束的可行路径，那么方法（i）向下一个相邻节点发出构造路径消息，（ii）增加一个确认次数 - 消息根据发送的构造路径消息的数量而变化，并且（iii）将条目添加到存储在当前节点处的前导序列。 该条目包括前导邻近节点的标识符，第一路径值和第二路径值。 如果没有，则该方法向邻近的先前节点发送确认消息。

公开(公告)号：US07385998B2

公开(公告)日：2008-06-10

申请号：US10657654

申请日：2003-09-08

申请人： Guo-Qiang Wang

发明人： Guo-Qiang Wang

IPC分类号： H04L12/56

CPC分类号： H04L47/10

摘要： A network element employing a universal mapper enables multiple services to be mapped onto a physical medium (metallic link with a particular physical layer protocol) so that the number of service mappers, and hence the complexity of the network element, may be reduced, the cost of provisioning the device may be reduced, and new services may be deployed, such as Ethernet over T1. The universal mapper may be configured to generate frames for transmission over multiple physical mediums utilizing a protocol known as Generic Framing Procedure (GFP). Using this embodiment, services such as ATM, Frame Relay, Ethernet, IP/PPP, Voice, and Infiniband may be transported in GFP frames over metallic links operating using xDSL, T1/E1, T3/E3, or cable access technologies by utilizing a single GFP framer and a single set of service mappers.

摘要翻译： 使用通用映射器的网络元件使得多个服务能够映射到物理介质（具有特定物理层协议的金属链路）上，使得可以减少服务映射器的数量，从而降低网络元件的复杂性，成本 可以减少设备的配置，并且可以部署新的服务，例如T1上的以太网。 通用映射器可以被配置为利用被称为通用成帧过程（GFP）的协议来生成用于在多个物理介质上传输的帧。 使用本实施例，可以通过使用xDSL，T1 / E1，T3 / E3或有线接入技术操作的金属链路在GFP帧中传输诸如ATM，帧中继，以太网，IP / PPP，语音和无限远的服务， 单个GFP成帧器和一组服务映射器。

公开(公告)号：US06999682B2

公开(公告)日：2006-02-14

申请号：US09750304

申请日：2000-12-29

申请人： Abel C. Dasylva ,  Delfin Y. Montuno ,  Guo-Qiang Wang

发明人： Abel C. Dasylva ,  Delfin Y. Montuno ,  Guo-Qiang Wang

IPC分类号： H04B10/00

CPC分类号： H04J14/02

摘要： A technique for optically converting wavelengths in a multi-wavelength system is disclosed. In one embodiment, wherein the multi-wavelength system has W wavelength channels, wherein W=2N, the technique is realized by selectively directing a received frequency channel corresponding to a respective wavelength channel based upon a predetermined frequency mapping. Then, the frequency of the selectively directed frequency channel is shifted at least once by an amount defined by ±2iΔf, wherein Δf is the frequency spacing between adjacent frequency channels, and i=0, 1, . . . N−1.

摘要翻译： 公开了一种用于光学转换多波长系统中的波长的技术。 在一个实施例中，其中多波长系统具有W波长信道，其中W = 2 N，该技术通过基于预定频率选择性地指向对应于相应波长信道的接收频率信道来实现 映射。 然后，选择性定向的频道的频率至少移动一次由±2ΔDttaf定义的量，其中Deltaf是相邻频道之间的频率间隔，i = 0,1， 。 。 。 N-1。

公开(公告)号：US20120159176A1

公开(公告)日：2012-06-21

申请号：US13237119

申请日：2011-09-20

申请人： Ravishankar Ravindran ,  Guo-Qiang Wang ,  Gangyu Shi

发明人： Ravishankar Ravindran ,  Guo-Qiang Wang ,  Gangyu Shi

IPC分类号： H04L9/32

CPC分类号： H04L63/104 ,  H04L63/0428 ,  H04L63/105 ,  H04L63/12 ,  H04L67/327

摘要： A content router for managing content for virtual private groups in a content oriented network, the content router comprising storage configured to cache a content from a customer in a content oriented network (CON), and a transmitter coupled to the storage and configured to forward the content upon request, wherein the content is signed by the user, wherein the CON provides different security levels for different users in a plurality of users, and wherein the plurality of users correspond to a plurality of user classes.

摘要翻译： 一种内容路由器，用于管理面向内容的网络中的虚拟专用组的内容，所述内容路由器包括被配置为缓存来自面向内容的网络（CON）中的客户的内容的存储器，以及耦合到所述存储器并被配置为转发 内容，其中所述内容由用户签名，其中所述CON为多个用户中的不同用户提供不同的安全级别，并且其中所述多个用户对应于多个用户类别。

公开(公告)号：US07969862B1

公开(公告)日：2011-06-28

申请号：US10434868

申请日：2003-05-09

申请人： Guo-Qiang Wang ,  Attahiru Sule Alfa

发明人： Guo-Qiang Wang ,  Attahiru Sule Alfa

IPC分类号： H04L1/00 ,  H04L12/26 ,  H04L12/28

CPC分类号： H04L45/22 ,  H04L45/125 ,  H04L45/28

摘要： A two step method for determining restoration cycles for a mesh network includes generating a set of possible restoration cycles, and selecting a subset of low-cost restoration cycles on the network. The cost of a restoration cycle may be based, in part, on the availability of capacity on the link to restore traffic with and/or without interference, and network policy. Enabling the restoration cycles to be determined based on the bandwidth capacity of the restoring link, the flows carried by the other link, and other network policy considerations enables embodiments of the invention to account for traffic class, priority, and other traffic considerations when selecting restoration cycles on the network. Identifying arcs on the network with relatively high cost restoration cycles allows portions of the network to be targeted for increased capacity.

摘要翻译： 用于确定网状网络的恢复周期的两步法包括生成一组可能的恢复周期，以及在网络上选择低成本恢复周期的子集。 恢复周期的成本可以部分地基于在具有和/或没有干扰的情况下恢复业务的链路上的容量的可用性以及网络策略。 基于恢复链路的带宽容量，其他链路承载的流以及其他网络策略考虑使得能够确定恢复周期，使得本发明的实施例能够在选择恢复时考虑业务类别，优先级和其他流量注意事项 在网络上循环。 在具有相对较高成本的恢复周期的网络上识别电弧允许网络的一部分被增加容量。